DOI QR코드

DOI QR Code

무선 메쉬 네트워크에서 최소 간섭과 최적의 주파수 대역폭을 이용한 CDS 구성

A Distributed Bandwidth-Interference aware CDS (BI CDS) Construction Scheme in Wireless Mesh Network

  • 양준모 (삼성전자 통신연구소) ;
  • 김보남 (충북대학교 전기전자컴퓨터공학부) ;
  • 김흥준 (진주산업대학교 컴퓨터공학부)
  • 발행 : 2009.01.30

초록

무선 애드록 네트워크의 특수한 형태인 무선 메쉬 네트워크는 최근 새로운 연구과제의 초석으로 주목받고 있다. WMN의 제한적인 동작 환경으로 인하여 효과적인 연결 Dominating set 구성은 브로드캐스팅, 라우팅, 혹은 가상 백본을 구성을 위한 방법 중 하나로 중요한 관심 대상이다. 본 논문에서 분산적인 방법을 토대로 네트워크에서 최소지연과 효율적인 대역폭 사용을 통하여 성능 향상을 시키기 위하여 Interference와 Bandwidth을 Dominating set 구성 파라미터로 사용한 연결 Dominating set 구성 알고리즘을 제안한다. 시뮬레이션을 통하여 제안된 알고리즘은 최대의 주파수 대역폭을 가진 링크와 연결된 최소의 연결 Dominating set이 구성됨으로써 네트워크 전체 성능이 향상됨을 보여준다.

As a special type of Wireless Ad Hoc Networks, Wireless Mesh Networks (WMNs) have become the comer stone of research issues. Due to the limited operational environment of WMNs, an efficient connected dominating set (CDS) construction scheme is an important concern since it has been found extremely useful in broadcasting, routing and virtual backbone construction. In this paper, we propose a distributed Bandwidth-Interference aware CDS construction scheme to improve the network performance via two parameters such as node's number of neighbor and link bandwidth. Our CDS construction scheme selects the node that has more neighbors and enough bandwidth to support more end-devices in order to enhance overall network throughput and reliability. We confirm through simulations and show that our scheme constructs the CDS with the small subset of DS and the link that has better bandwidth.

키워드

참고문헌

  1. http://www.ieee802.org/15/, IEEE 802.15 Working Group for WPAN
  2. Khaled M. Alzoubi, Peng-Jun Wan, and Ophir Frieder, "Distributed Heuristics for Connected Dominating Sets in Wireless Ad hoc Networks", Journal on Communication Networks, 2002
  3. J. Wu, F. Dai, M. Gao, and I.Stojmenovic, "On Calculating Power-Aware Connected Dominating Sets for Efficient Routingin Ad Hoc Wireless Networks,"Journal of Communications and Networks, Vol.4, No.1, March 2002
  4. M. Sun, S. Wang, C.K. Chang, T.H. Lai, S. Hiroyuki, and H. Okada, "Interference-Aware MAC Scheduling and SAR Policies for Bluetooth Scatternets," Proc. IEEE GLOBECOM 2002, pp. 11-15, Taipei, Taiwan, Nov.2002
  5. D. Johnson and D. Maltz, "Dynamic Source Routing in Ad Hoc Wireless Networks," T. Lmielinski and H. Korth, Eds. Mobile Computing, Ch.5, Kluwer, 1996
  6. Kwang Koog Lee, Seong Hoon Kim, Young Hoon Kim, Young Soon Choi, and Hong Seong Park, "A Mesh Routing Protocol using Cluster Label in the ZigBee Network"
  7. Nikaein Navid, Wu Shiyi, and Christian Bonnet. “HARP: Hybrid Ad hoc Routing Protocol,” International Symposium on Telecommunications, IST 2001, 2001
  8. S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, "The Broadcasting Storm Problem in Mobile Ad Hoc Network," In Int'l Conf. on Mobile Computing Network (MOBICOM), pp.151-162, Aug. 1999
  9. Y.-C. Tseng, S.-Y. Ni, and E.-Y. Shih, "Adaptive Approaches to Relieving Broadcasting Storms in a Wireless Multiple Ad Hoc Network," In 21st Int'l Conf. on Dist. Computing Systems, pp.481-488, Apr.2001
  10. Ding, G., Sahinoglu, Z., Orlik, P.,Zhang, J., and Bhargava, B., "Tree-Based Data Broadcast in IEEE 802.15.4 and ZigBee Networks", IEEE Transactions on MobileComputing, ISSN: 1536-1233, Vol. 5, Issue 11, pp. 1561-1574, November 2006
  11. Fletcher, J. G. and Watson, R. W. "Mechanisms for a reliable timer-based protocol,"Computer Networks 2, pp.271-290, 1978