Query range problem in wireless sensor networks

Authors:
Bing Han;Jimmy Leblet;Gwendal Simon
Affiliations:
Institut TELECOM, TELECOM Bretagne and TELECOM ParisTech, France and State Key Laboratory of Networking & Switching Technology, Beijing University of Posts and Telecommunications, China;Institut TELECOM, TELECOM Bretagne, France;Institut TELECOM, TELECOM Bretagne, France
Venue:
IEEE Communications Letters
Year:
2009

Citing 5
Cited 1

Some simplified NP-complete problems

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Sensor Networks for Emergency Response: Challenges and Opportunities

IEEE Pervasive Computing
Interference-aware fair rate control in wireless sensor networks

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed dynamic shared tree for minimum energy data aggregation of multiple mobile sinks in wireless sensor networks

EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
A survey of transport protocols for wireless sensor networks

IEEE Network: The Magazine of Global Internetworking

Hard multidimensional multiple choice knapsack problems, an empirical study

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.