한국통신학회논문지 (The Journal of Korean Institute of Communications and Information Sciences)

한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지

부분 토폴로지 재구성 기법을 적용한 부하 균형 토폴로지 유지

Load-balanced Topology Maintenance with Partial Topology Reconstruction

  • 홍윤식 (E0 technics, 기술연구소 S/W그룹) ;
  • 임화석 (인천대학교 컴퓨터공학과 모바일컴퓨팅 연구실)
  • 투고 : 2010.07.20
  • 심사 : 2010.11.30
  • 발행 : 2010.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

무선 애드혹 망에서 connected dominating set(CDS)를 활용한 라우팅 방식의 핵심은 dominating 노드로 동작할 최소 개수의 노드들을 선택하고, 이 노드들로 이루어진 백본 망을 구성하는 것이다. CDS 에서 장애 노드가 발생할 확률은 무시할 수 있는 수준은 아니다. 고장 감내가 중요한 비중을 차지하는 응용에서는 기존 CDS 기반 라우팅이 바람직하지 않을 수 있다. 따라서 메시지 플러딩에 따른 오버헤드로 인해 CDS 전체 재구성 시도를 최소화하는 것이 필요하다. 이를 위해 CDS 전체 재구성을 시도하는 대신, 장애가 발생한 노드를 중심으로 제한된 범위에 놓인 노드들에 대해서만 CDS를 부분 재구성할 수 있도록 대체 노드를 찾는 방안을 제안한다. 이러한 방식을 적용할 경우., CDS 부분 재구성시에도 dominating 노드 수가 전체 재구성을 시도했을 때와 같게 유지될 뿐만 아니라 전체 재구성 때보다 20~40% CDS 구성 시간을 단축시킬 수 있다. 고 이동성을 갖는 상황에서 기존 전체 재구성 알고리즘에 비해 패킷 수신율 및 에너지 소비 측면에서 유리한 결과를 얻었다.

A most important thing in a connected dominating set(CDS)-based routing in a wireless ad-hoc network is to select a minimum number of dominating nodes and then build a backbone network which is made of them. Node failure in a CDS is an event of non-negligible probability. For applications where fault tolerance is critical, a traditional dominating-set based routing may not be a desirable form of clustering. It is necessary to minimize the frequency of reconstruction of a CDS to reduce message overhead due to message flooding. The idea is that by finding alternative nodes within a restricted range and locally reconstructing a CDS to include them, instead of totally reconstructing a new CDS. With the proposed algorithm, the resulting number of dominating nodes after partial reconstruction of CDS is not changed and also its execution time is faster than well-known algorithm of construction of CDS by 20~40%. In the case of high mobility situation, the proposed algorithm gives better results for the performance metrics, packet receive ratio and energy consumption.

키워드

참고문헌

  1. C. E. Jones, K. M. Sivalingam, P. Agrawal, and J. C. Chen, "A survey of energy efficient network protocols for wireless networks," Wireless Networks, Vol.7, No.4, pp.343-358, Asug., 2001. https://doi.org/10.1023/A:1016627727877
  2. Ning Li, Jennifer C. Hou and Lui Sha, "Design and Analysis of an MST-Based Topology Control Algorithm," IEEE INFOCOM, pp.1702 -1712, 2003.
  3. L. Li, J. Halpern, P. Bahl, Y. M. Yang, and R. Wattenhofer, "Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks," Proc., ACM Symp., Principles of Distributed Computing (PODC), Aug., 2001.
  4. J. Wu, F. Dai, M. Gao, and I. Stojmenovic, "On Calculating Power-Aware Connected Domination Sets for Efficient Routing in Ad Hoc Wireless Networks", Journal of communications and networks Vol.4, No.1, March, 2002.
  5. H-S. Cho and S-J. Yoo, "Power, mobility and wireless channel condition aware connected dominationg set construction algorithm in the wireless ad-hoc network", 통신학회 논문지 Vol.30 No.5B, May, 2005.
  6. J. Blum, M. Ding, A. Thaeler, and X. Cheng, "Connected Dominating Set in Sensor Networks and MANETs," Handbook of Combinatorial Optimization, Kluwer Academic Publishers, pp.329-369, 2004.
  7. Guoliang Xing, Chenyang Lu, Ying Zhang, Qingfeng Huang, and Robert Pless, "Minimum power configuration in wireless sensor networks," MobiHoc'05, 2005.
  8. W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-efficient communication protocols for wireless microsensor networks," in Proc. Hawaiian Int. Conf. Systems Science, Jan., 2000.
  9. Y. Xu, J. Heidemann, and D. Estrin, "Geography-informed energy conservation for ad hoc routing," Proc. 7th ACM Int. Conf. Mobile Computing and Networking, pp.70-84, July, 2001.
  10. Douglas M. Blough, Mauro Leoncini, and Paolo Santi, "The k-Neighbors Approach to Interference Bounded and Symmetry Topology Control in Ad Hoc Networks", IEEE Trans. on Mobile Computing, pp.1267-1282, Vol.5, No.9, Sept., 2006. https://doi.org/10.1109/TMC.2006.139
  11. Jie Gao and Li Zhang, "Load-balanced short-path routing in wireless networks", IEEE Trans. on Parallel and Distributed Systems, Vol.17, No.4, pp.377-388, 2006. https://doi.org/10.1109/TPDS.2006.49
  12. S. Narayanaswamy, V. Kawadia, R. S. Sreenivas, and P. R. Kumar "Power control in ad-hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol," Proc. Euro Wireless, pp.156-162, Feb., 2002.
  13. S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica, 20(4), pp.374-387, Apr., 1998. https://doi.org/10.1007/PL00009201
  14. D. Sivakumar, B. Das, and V. Bharghavan, "An improved Spine-based Infrastructure for Routing in Ad-hoc Networks", IEEE Symposium on Computers and Communications, June, 1998.
  15. http://www.scalable-networks.com