Optimizing Multi-hop Queries in ZigBee Based Multi-sink Sensor Networks

Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query range to achieve certain global optimality while avoid congesting the sensors in the meanwhile. We study this problem for a ZigBee cluster tree by formulating it into a multi-dimensional multi-choice knapsack problem. Maximum overall query range and max-min fair query range objectives are investigated. Distributed algorithms are proposed which exploit the ZigBee cluster tree structure to keep the computation local. Extensive simulations show that the proposed methods achieve good approximation to the optimal solution with little overhead and improve the network performance.

[1]  Kin F. Li,et al.  Solving the Knapsack Problem for Adaptive Multimedia Systems , 2002, Stud. Inform. Univ..

[2]  Mhand Hifi,et al.  A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem , 2006, Comput. Optim. Appl..

[3]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[4]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[5]  Yu-Chee Tseng,et al.  Quick convergecast in ZigBee beacon-enabled tree-based wireless sensor networks , 2008, Comput. Commun..

[6]  Bo Li,et al.  A survey of transport protocols for wireless sensor networks , 2006, IEEE Network.

[7]  Leandros Tassiulas,et al.  Fair allocation of discrete bandwidth layers in multicast networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Gwendal Simon,et al.  Fair Capacity Sharing Among Multiple Sinks in Wireless Sensor Networks , 2007, 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems.

[9]  Mhand Hifi,et al.  Heuristic algorithms for the multiple-choice multidimensional knapsack problem , 2004, J. Oper. Res. Soc..

[10]  Yu-Chee Tseng,et al.  Two-Way Beacon Scheduling in ZigBee Tree-Based Wireless Sensor Networks , 2008, 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008).

[11]  Jean-Yves Le Boudec,et al.  A Unified Framework for Max-Min and Min-Max Fairness With Applications , 2007, IEEE/ACM Transactions on Networking.

[12]  Michal Pioro,et al.  Telecommunications network design and max-min optimization problem , 2004 .

[13]  Timo Hämäläinen,et al.  Performance analysis of IEEE 802.15.4 and ZigBee for large-scale wireless sensor network applications , 2006, PE-WASUN '06.