.png){kind=icon}
.png){kind=icon}
Return
Query Range Problem in Wireless Sensor Networks
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2009.081546.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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:
Wireless sensor networks
optimization
NP-complete
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W