The Community for Technology Leaders
RSS Icon
Issue No.11 - November (2011 vol.60)
pp: 1610-1621
Chih-Hsun Anthony Chou , Institute for Information Inductry, Taipei
Kuo-Feng Ssu , National Cheng Kung University, Tainan
Hewijin Christine Jiau , National Cheng Kung University, Tainan
Wei-Tong Wang , National Cheng Kung University, Tainan
Chao Wang , National Cheng Kung University, Tainan
Minimizing energy consumption is a fundamental requirement when deploying wireless sensor networks. Accordingly, various topology control protocols have been proposed, which aim to conserve energy by turning off unnecessary sensors while simultaneously preserving a constant level of routing fidelity. However, although these protocols can generally be integrated with any routing scheme, few of them take specific account of the issues which arise when they are integrated with geographic routing mechanisms. Of these issues, the dead-end situation is a particular concern. The dead-end phenomenon (also known as the "local maximum” problem) poses major difficulties when performing geographic forwarding in wireless sensor networks since whenever a packet encounters a dead end, additional overheads must be paid to forward the packet to the destination via an alternative route. This paper presents a distributed dead-end free topology maintenance protocol, designated as DFTM, for the construction of dead-end free networks using a minimum number of active nodes. The performance of DFTM is compared with that of the conventional topology maintenance schemes GAF and Span, in a series of numerical simulations conducted using the ns2 simulator. The evaluation results reveal that DFTM significantly reduced the number of active nodes required in the network and thus prolonged the overall network lifetime. DFTM also successfully constructed a dead-end free topology in most of the simulated scenarios. Additionally, even when the locations of the sensors were not precisely known, DFTM still ensured that no more than a very few dead-end events occurred during packet forwarding.
Energy conservation, topology maintenance, geographic forwarding, dead-end, wireless sensor networks.
Chih-Hsun Anthony Chou, Kuo-Feng Ssu, Hewijin Christine Jiau, Wei-Tong Wang, Chao Wang, "A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks", IEEE Transactions on Computers, vol.60, no. 11, pp. 1610-1621, November 2011, doi:10.1109/TC.2010.208
[1] Y. Xu, J. Heidemann, and D. Estrin, “Geography-Informed Energy Conservation for Ad Hoc Routing,” Proc. ACM MobiCom, pp. 70-84, July 2001.
[2] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” Proc. ACM MobiCom, pp. 85-96, July 2001.
[3] G. Zhong, J. Cheng, S. Lu, and L. Zhang, “PEAS: A Robust Energy Conserving Protocol for Long-Lived Sensor Networks,” Proc. IEEE Int'l Conf. Distributed Computing Systems, pp. 28-37, May 2003.
[4] H. Zhang and J.C. Hou, “Maintaining Sensing Coverage and Connectivity in Large Sensor Networks,” Ad Hoc and Sensor Wireless Networks, vol. 1, nos. 1/2, pp. 89-124, Mar. 2005.
[5] J. Wu and F. Dai, “Virtual Backbone Construction in MANETs Using Adjustable Transmission Ranges,” IEEE Trans. Mobile Computing, vol. 5, no. 9, pp. 1188-1200, Sept. 2006.
[6] C. Srisathapornphat and C.-C. Shen, “Ant-Based Energy Conservation for Ad Hoc Networks,” Proc. Int'l Conf. Computer Comm. and Networks, pp. 32-37, Oct. 2003.
[7] X. Bai, S. Kumar, D. Xuan, Z. Yun, and T.H. Lai, “Deploying Wireless Sensors to Achieve Both Coverage and Connectivity,” Proc. ACM MobiHoc, pp. 131-142, May 2006.
[8] A. Srinivas, G. Zussman, and E. Modiano, “Mobile Backbone Networks—Construction and Maintenance,” Proc. ACM MobiHoc, pp. 166-177, May 2006.
[9] Y. Wang, W. Wang, and X.-Y. Li, “Distributed Low-Cost Backbone Formation for Wireless Ad Hoc Networks,” Proc. ACM MobiHoc, pp. 2-13, May 2005.
[10] K.M. Alzoubi, P.J. Wan, and O. Frieder, “Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks,” Proc. ACM MobiHoc, pp. 157-164, June 2002.
[11] K.M. Alzoubi, P.J. Wan, and O. Frieder, “New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks,” Proc. Hawaii Int'l Conf. System Sciences, pp. 3881-3887, Jan. 2002.
[12] D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, and A. Srinivasan, “Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons,” ACM J. Computer and System Sciences, vol. 71, no. 4, pp. 467-479, Nov. 2005.
[13] C.R. Lin and M. Gerla, “Adaptive Clustering for Mobile Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 15, no. 6, pp. 1265-1275, Sept. 1997.
[14] M. Zorzi and R.R. Rao, “Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance,” IEEE Trans. Mobile Computing, vol. 2, no. 4, pp. 337-347, Oct.-Dec. 2003.
[15] M. Zorzi and R.R. Rao, “Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance,” IEEE Trans. Mobile Computing, vol. 2, no. 4, pp. 349-365, Oct.-Dec. 2003.
[16] H. Füßler, J. Widmer, M. Käsemann, M. Mauve, and H. Hartenstein, “Contention-Based Forwarding for Mobile Ad Hoc Networks,” Ad Hoc Networks, vol. 1, no. 4, pp. 351-369, Nov. 2003.
[17] H. Füßler, J. Widmer, M. Mauve, and H. Hartenstein, “A Novel Forwarding Paradigm for Position-Based Routing (with Implicit Addressing),” Proc. IEEE 18th Ann. Workshop Computer Comm., pp. 194-200, Oct. 2003.
[18] S. Basagni, I. Chlamtac, V.R. Syrotiuk, and B.A. Woodward, “A Distance Routing Effect Algorithm for Mobility (DREAM),” Proc. ACM MobiCom, pp. 76-84, Oct. 1998.
[19] G. Dommety and R. Jain, “Potential Networking Applications of Global Positioning Systems (GPS),” Technical Report TR-24, Dept. of Computer Science, The Ohio State Univ., Apr. 1996.
[20] E.D. Kaplan, Understanding GPS: Principles and Applications. Artech House, 1996.
[21] T. He, C. Huang, B. Blum, J. Stankovic, and T. Abdelzaher, “Range-Free Localization Schemes in Large Scale Sensor Networks,” Proc. ACM MobiCom, pp. 81-95, Sept. 2003.
[22] L. Hu and D. Evans, “Localization for Mobile Sensor Networks,” Proc. ACM MobiCom, pp. 45-57, Sept. 2004.
[23] K.F. Ssu, C.H. Ou, and H.C. Jiau, “Localization with Mobile Anchor Points in Wireless Sensor Networks,” IEEE Trans. Vehicular Technology, vol. 54, no. 3, pp. 1187-1197, May 2005.
[24] C.E. Perkins and E.M. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proc. Second IEEE Workshop Mobile Computing Systems and Applications, pp. 90-100, Feb. 1999.
[25] J. Broch, D.B. Johnson, and D.A. Maltz, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,” The Internet Eng. Task Force (IETF) Internet Draft, Dec. 1998.
[26] V.D. Park and M.S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proc. IEEE INFOCOM, pp. 1405-1413, Apr. 1997.
[27] E.M. Royer and C.K. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks,” IEEE Personal Comm., vol. 6, no. 2, pp. 46-55, Apr. 1999.
[28] B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. ACM MobiCom, pp. 120-130, Aug. 2000.
[29] T.C. Hou and V. Li, “Transmission Range Control in Multihop Packet Radio Networks,” IEEE Trans. Comm., vol. COM-34, no. 1, pp. 38-44, Jan. 1986.
[30] G. Finn, “Routing and Addressing Problems in Large Metropolitan-Scale Internetworks,” Technical Report ISI/RR-87-180, Univ. of Southern California/Information Sciences Inst., Mar. 1987.
[31] S.C. Woo and S. Singh, “Scalable Routing Protocol for Ad Hoc Networks,” ACM Wireless Networks, vol. 7, no. 5, pp. 513-529, Sept. 2001.
[32] G. Toussaint, “The Relative Neighborhood Graph of a Finite Planar Set,” Pattern Recognition, vol. 12, no. 4, pp. 261-268, 1980.
[33] L. Blazevic, J.-Y.L. Boudec, and S. Giordano, “A Location-Based Routing Method for Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 4, no. 2, pp. 97-110, Mar./Apr. 2005.
[34] D.D. Couto and R. Morris, “Location Proxies and Intermediate Node Forwarding for Practical Geographic Forwarding,” Technical Report MIT-LCS-TR-824, Massachusetts Inst. of Technology, Laboratory for Computer Science, June 2001.
[35] H. Frey and I. Stojmenovic, “On Delivery Guarantees of Face and Combined Greedy-Face Routing in Ad Hoc and Sensor Networks,” Proc. ACM MobiCom, pp. 85-96, Sept. 2006.
[36] The ns Manual (ns Notes and Documentation), K. Fall and K. Varadhan, eds., The Virtual InterNetwork Testbed (VINT) Project, , Nov. 2005.
4 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool