Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2007.14-C.4.365

TECDS Protocol for Wireless Ad Hoc Networks  

Kim, Bo-Nam (충북대학교 BK 사업단)
Yang, Jun-Mo (삼성전자 통신연구소)
Abstract
Connected Dominating Set(CDS) has been used as a virtual backbone in wireless ad hoc networks by numerous routing and broadcast protocols. Although computing minimum CDS is known to be NP-hard, many protocols have been proposed to construct a sub-optimal CDS. However, these protocols are either too complicated, needing non- local information, not adaptive to topology changes, or fail to consider the difference of energy consumption for nodes in and outside of the CDS. In this paper, we present two Timer-based Energy-aware Connected Dominating Set Protocols(TECDS). The energy level at each node is taken into consideration when constructing the CDS. Our protocols are able to maintain and adjust the CDS when network topology is changed. The simulation results have shown that our protocols effectively construct energy-aware CDS with very competitive size and prolong the network operation under different level of nodal mobility.
Keywords
CDS; Wireless Ad Hoc Networks; Protocol; Energy; Timer;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Butenko, X. Cheng, D.Z. Du, and P. Pardalos, 'On the construction of virtual backbone for ad hoc wireless networks,' In Proc. 2nd Conference on Cooperative Control and Optimization
2 M. Sun, W. Feng and T.H. Lai, 'Location Aided Broadcast in Wireless Ad Hoc Networks,' Proc. IEEE GLOBECOM 2001, pp.2842-2846, San Antonio, TX, November 2001   DOI
3 Y. Wang J. J. Garcia-Luna-Aceves, 'Collision avoidance in multi-hop ad hoc networks,' IEEE MASCOTS 2002, pp.145-154   DOI
4 Hui Liu, Yi Pan, Ivan Stojmenovic: A Pure Localized Algorithm for Finding Connected Dominating Set in MANETs by Classification of Neighbors. WASA 2006: 371-381   DOI   ScienceOn
5 Jie Wu, Fei Dai, Ming Gao, and Ivan Stojmenovic, 'On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks,' Journal of Communications and Networks, Vol 4, No 1, March 2002
6 J. Wu and H. Li, 'A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks,' special issue on Wireless Networks in the Telecommunication Systems Journal, Vol. 3, 2001, 63-84. 7   DOI
7 J. Wu, 'Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links,' IEEE Transactiosn on Parallel and Distributed Computing, 22, 14, 2002, 327-340   DOI   ScienceOn
8 Julien Cartigny, David Simplot, and Ivan Stojemenovic, 'Localized minimum-energy Broadcasting in ad-hoc networks,' IEEE INFOCOM 2003
9 P.J. Wan, K.M.Alzoubi and O.Frieder, 'Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks,' IEEE INFOCOM 2002, pp.1597 -1604   DOI
10 J. Wu, Fei Dai, Ming Gao, and Ivan Stojmenovic, 'On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks,' Journal of Communications and Networks, Vol. 4, No. 1, March 2002
11 N. Bambos, 'Toward power-sensitive network architectures in wireless communications: Concepts, issues, and design aspects,' IEEE Personal Commun., pp.50.59, June 2000   DOI   ScienceOn
12 C.-K. Toh, 'Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks,' IEEE Commun. Maga., pp.138-147, June 2001   DOI   ScienceOn
13 M. R. Garey and D. S. Johnson, 'Computers and Intractability - A Guide to the Theory of NP-Completeness,' San Francisco, CA: Freeman, 1979
14 Dorit S. Hochbaum, 'Approximation Algorithms for NP-Hard Problems,' PWA Publishing Company, Boston, MA, 1995
15 Mario Cagalj, Jean-Pierre Hubaux, and Christian Enz, 'Minimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issuses,' Mobicom 2002, September, Atlanat, GA, USA   DOI