The KIPS Transactions:PartC (정보처리학회논문지C)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

TECDS Protocol for Wireless Ad Hoc Networks

무선 에드혹 네트워크를 위한 타이머를 이용한 CDS 구축

  • Published : 2007.08.31
Download PDF
⟨ Previous Next ⟩

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.

CDS는 다양한 라우팅과 브로드캐스팅 프로토콜을 통하여 무선 에트혹 네트워크에서 가상 백본으로 널리 사용되고 있다. 최소 CDS(minimum CDS)를 계산하는 것이 여전히 NP-hard로 알려져 있지만 sub-optimal을 구하기 위한 여러가지 방법들이 제안되고 있다. 그렇지만 대부분의 제안된 프로토콜들은 너무 복잡하거나 non-local 정보를 필요로 하고, 네트워크의 위상이 변할 때 적응하지 못한다. 뿐만 아니라 CDS로 선택된 노드와 선택되지 않은 노드들이 서로 다른양의 에너지를 소비한다는 것을 고려하지 않았다. 본 논문에서는 타이머를 이용하여 에너지를 효율적으로 사용하며 네크워크 전체의 성능을 향상시키는 Timer Based Energy Aware connected Dominating Set(TECDS) 프로토콜을 제안하였다. TECDS 프로토콜은 네트워크 위상이 변할 때 필요에 따라 CDS를 보존 또는 재구성할 수 있다. 시뮬레이션을 통한 성능 평가 결과는 제안된 TECDS 프로토콜이 다른 프로토콜보다 최적에 가까운 CDS를 구성하여 서로 다른 수준의 노드의 이동성 사이에서도 네트워크 운영이 효율적으로 연장 됨을 보여주고 있다.

Keywords

References

  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. 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
  3. 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 https://doi.org/10.1002/0471224561.ch20
  4. 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 https://doi.org/10.1109/TPDS.2002.1036062
  5. Julien Cartigny, David Simplot, and Ivan Stojemenovic, 'Localized minimum-energy Broadcasting in ad-hoc networks,' IEEE INFOCOM 2003
  6. 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 https://doi.org/10.1109/GLOCOM.2001.965948
  7. 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 https://doi.org/10.1145/570645.570667
  8. Y. Wang J. J. Garcia-Luna-Aceves, 'Collision avoidance in multi-hop ad hoc networks,' IEEE MASCOTS 2002, pp.145-154 https://doi.org/10.1109/MASCOT.2002.1167071
  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 https://doi.org/10.1109/INFCOM.2002.1019411
  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. 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 https://doi.org/10.1007/11814856_36
  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 https://doi.org/10.1109/35.925682
  13. N. Bambos, 'Toward power-sensitive network architectures in wireless communications: Concepts, issues, and design aspects,' IEEE Personal Commun., pp.50.59, June 2000 https://doi.org/10.1109/98.683739
  14. M. R. Garey and D. S. Johnson, 'Computers and Intractability - A Guide to the Theory of NP-Completeness,' San Francisco, CA: Freeman, 1979
  15. Dorit S. Hochbaum, 'Approximation Algorithms for NP-Hard Problems,' PWA Publishing Company, Boston, MA, 1995