The Community for Technology Leaders
RSS Icon
Issue No.11 - November (2009 vol.8)
pp: 1573-1584
Meng-Shiuan Pan , National Chiao-Tung University, Hsin-Chu
Chia-Hung Tsai , National Chiao-Tung University, Hsin-Chu
Yu-Chee Tseng , National Chiao-Tung University, Hsin-Chu
ZigBee is a communication standard which is considered to be suitable for wireless sensor networks. In ZigBee, a device (with a permanent 64-bit MAC address) is said to join a network if it can successfully obtain a 16-bit network address from a parent device. Parent devices calculate addresses for their child devices by a distributed address assignment scheme. This assignment is easy to implement, but it restricts the number of children of a device and the depth of the network. We observe that the ZigBee address assignment policy is too conservative, thus usually making the utilization of the address pool poor. Those devices that cannot receive network addresses will be isolated from the network and become orphan nodes. In this paper, we show that the orphan problem can be divided into two subproblems: the bounded-degree-and-depth tree formation (BDDTF) problem and the end-device maximum matching (EDMM) problem. We then propose algorithms to relieve the orphan problem. Our simulation results show that the proposed schemes can effectively reduce the number of orphan devices compared to the ZigBee strategy.
Graph theory, IEEE 802.15.4, network formation, orphan problem, wireless sensor network, ZigBee.
Meng-Shiuan Pan, Chia-Hung Tsai, Yu-Chee Tseng, "The Orphan Problem in ZigBee Wireless Networks", IEEE Transactions on Mobile Computing, vol.8, no. 11, pp. 1573-1584, November 2009, doi:10.1109/TMC.2009.60
[1] Design and Construction of a Wildfire Instrumentation System Using Networked Sensors, http:/, 2009.
[2] Habitat Monitoring on Great Duck Island, http://www. greatduckisland.nettechnology.php , 2009.
[3] Jennic JN5121, http:/, 2009.
[4] Motes, Smart Dust Sensors, Wireless Sensor Networks, http:/, 2009.
[5] Texas Instruments CC2431, http:/, 2009.
[6] J. Bachrach, R. Nagpal, M. Salib, and H. Shrobe, “Experimental Results and Theoretical Analysis of a Self-Organizing Global Coordinate System for Ad Hoc Sensor Networks,” Telecomm. Systems J., vol. 26, nos. 2-4, pp. 213-234, 2004.
[7] G. Bhatti and G. Yue, “Structured Addressing Scheme for Wireless Networks,” US Patent 20,070,060,134 (pending), 2007.
[8] D. Braginsky and D. Estrin, “Rumor Routing Algorithm for Sensor Networks,” Proc. ACM Int'l Workshop Wireless Sensor Networks and Applications (WSNA '02), 2002.
[9] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press, 2001.
[10] A. Czumaj and W.-B. Strothmann, “Bounded Degree Spanning Trees,” Proc. European Symp. Algorithms (ESA '97), 1997.
[11] T. Dam and K. Langendoen, “An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Networks,” Proc. ACM Int'l Conf. Embedded Networked Sensor Systems (SenSys '03), 2003.
[12] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[13] W.R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-Efficient Communication Protocols for Wireless Microsensor Networks,” Proc. Hawaii Int'l Conf. Systems Science (HICSS '00), 2000.
[14] C.-F. Huang, Y.-C. Tseng, and L.-C. Lo, “The Coverage Problem in Three-Dimensional Wireless Sensor Networks,” J. Interconnection Networks, vol. 8, no. 3, pp. 209-227, 2007.
[15] IEEE Standard for Information Technology—Telecommunications and Information Exchange between Systems—Local and Metropolitan Area Networks Specific Requirements Part 15.4: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Low-Rate Wireless Personal Area Networks (LR-WPANs), IEEE, 2003.
[16] M. Kochhal, L. Schwiebert, and S. Gupta, “Role-Based Hierarchical Self Organization for Wireless Ad Hoc Sensor Networks,” Proc. ACM Int'l Workshop Wireless Sensor Networks and Applications (WSNA '03), 2003.
[17] J. Konemann, A. Levin, and A. Sinha, “Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem,” Algorithmica, vol. 41, no. 2, pp. 117-129, 2004.
[18] J. Konemann and R. Ravi, “A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees,” Proc. ACM Symp. Theory of Computing (STOC '00), 2000.
[19] S. Kulkarni, A. Iyer, and C. Rosenberg, “An Address-Light, Integrated MAC and Routing Protocol for Wireless Sensor Networks,” IEEE/ACM Trans. Networking, vol. 14, no. 4, pp. 793-806, Aug. 2006.
[20] Q. Li, M. DeRosa, and D. Rus, “Distributed Algorithm for Guiding Navigation Across a Sensor Network,” Proc. ACM MobiHoc, 2003.
[21] C.-Y. Lin, W.-C. Peng, and Y.-C. Tseng, “Efficient In-Network Moving Object Tracking in Wireless Sensor Networks,” IEEE Trans. Mobile Computing, vol. 5, no. 8, pp. 1044-1056, Aug. 2006.
[22] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M.B. Srivastava, “Coverage Problems in Wireless Ad-Hoc Sensor Networks,” Proc. IEEE INFOCOM, 2001.
[23] D. Niculescu and B. Nath, “DV Based Positioning in Ad Hoc Networks,” Telecomm. Systems J., vol. 22, nos. 1-4, pp. 267-280, 2003.
[24] K. Sohrabi, J. Gao, V. Ailawadhi, and G.J. Pottie, “Protocols for Self-Organization of a Wireless Sensor Network,” IEEE Personal Comm., vol. 7, no. 5, pp. 16-27, Oct. 2000.
[25] Y.-C. Tseng, S.-P. Kuo, H.-W. Lee, and C.-F. Huang, “Location Tracking in a Wireless Sensor Network by Mobile Agents and its Data Fusion Strategies,” Computer J., vol. 47, no. 4, pp. 448-460, 2004.
[26] Y.-C. Tseng, M.-S. Pan, and Y.-Y. Tsai, “Wireless Sensor Networks for Emergency Navigation,” Computer, vol. 39, no. 7, pp. 55-62, July 2006.
[27] W. Ye, J. Heidemann, and D. Estrin, “An Energy-Efficient MAC Protocol for Wireless Sensor Networks,” Proc. IEEE INFOCOM, 2002.
[28] J. Zheng and M.J. Lee, “A Resource-Efficient and Scalable Wireless Mesh Routing Protocol,” Ad Hoc Networks, vol. 5, pp. 704-718, 2007.
[29] ZigBee Specification Version 2006, ZigBee Document 064112, 2006.
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool