Title :
Query range problem in wireless sensor networks
Author :
Han, Bing ; Leblet, Jimmy ; Simon, Gwendal
Author_Institution :
TELECOM Bretagne & TELECOM ParisTech, Inst. TELECOM, Cesson-Sevigne
fDate :
1/1/2009 12:00:00 AM
Abstract :
Wireless sensor networks with multiple users extracting data directly from nearby sensors have many potential applications. An important problem in such a network is how to allocate the multi-hop query range for each user such that a certain global optimality is achieved. We introduce this problem and show it is NP-complete in its generic form. Distributed heuristic is proposed and evaluated with simulations. Interesting behaviors of the network when optimized with different global objectives are observed from the simulation results.
Keywords :
query processing; wireless sensor networks; NP-complete problem; distributed heuristic simulation; multihop query range problem; wireless sensor network; Bandwidth; Data mining; Explosives; Fires; Routing; Spread spectrum communication; Telecommunication traffic; Wireless communication; Wireless sensor networks; ZigBee; Wireless sensor networks, optimization, NP complete.;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2009.081546
