ERPM: 모바일 Ad-hoc 무선 네트워크에서 이동성을 이용한 엔트로피 기반 라우팅 프로토콜

ERPM: An Entropy-based Routing Protocol using Mobility in Mobile Ad-hoc Wireless Networks

  • 안병구 (홍익대학교 컴퓨터정보통신공학) ;
  • 이주상 (홍익대학교 대학원 전자전산공학과)
  • An, Beong-Ku (Dept. of Computer & Infor. Comm, Eng., Hongik University) ;
  • Lee, Joo-Sang (Dept. of Electronics & Computer Eng., Graduate School, Hongik University)
  • 투고 : 2011.09.28
  • 발행 : 2011.11.25

초록

본 논문에서는 모바일 Ad-hoc 무선 네트워크에서 유비쿼터스 융합 서비스를 효과적으로 지원하기 위한 이동성을 이용한 엔트로피 기반 라우팅 프로토콜(ERPM)을 제안한다. 제안된 ERPM의 주요한 특징은 다음과 같다. 첫째, ERPM은 노드들의 이동성을 이용한 엔트로피 개념을 기반으로 하여 안정된 라우팅 경로들을 설정할 수 있다. 둘째, ERPM은 노드들의 이동성을 이용한 엔트로피 개념에 의해서 경로들의 안정성을 평가 할 수 있다. 셋째, ERPM은 소스노드와 목적지 노드 사이에 다중 경로가 존재할 때 경로들의 이동성 측면에서 가장 안정된 경로를 선택할 수 있다. 제안된 ERPM의 성능평가는 OPNET을 사용한 시뮬레이션과 이론적 분석을 통하여 이루어진다. 성능평가를 통하여 제안된 ERPM은 안정된 경로 설정 및 데이터 전송효율을 효과적으로 증가 시킬 수 있음을 알 수 있다.

In this paper, we propose an Entropy-based Routing Protocol using Mobility (ERPM) for supporting ubiquitous convergence services efficiently in mobile ad-hoc wireless networks. The main features that the ERPM introduces to obtain the goals can be summarized as follows. First, ERPM can construct stable routing routes based on the entropy concepts using mobility of nodes. Second, ERPM can quantitatively evaluate the stability of route by entropy concepts using mobility of nodes. Third, ERPM can select the most stable route in the view points of mobility of routes between a source node and a destination node, where multiple paths are available. The performance evaluation of the proposed ERPM performed via simulation using OPNET and analysis shows that the ERPM can support the construction of stable routing routes and increase the transmission ratio of data efficiently.

키워드

참고문헌

  1. R. Ramanathan and M. Steenstrup, "Hierarchically -Organized, Multihop Mobile Wireless Networks for Quality-of Services Support," ACM/Baltzer Mobile Networks and Applications, vol.3, no.1, pp.101-119, 1998. https://doi.org/10.1023/A:1019148009641
  2. Beongku An, Symeon Papavassiliou, "Supporting Multicasting in Mobile Ad-hoc Wireless Networks: Issues, Challenges and Current Protocols," Wireless Communications and Mobile Computing (WCMC), vol. 2, issue 2, pp.115-130, March 2002. https://doi.org/10.1002/wcm.26
  3. Sachin Abhyankar and Dharma P. Agrawal, "Distributed Mobility-Aware Route Selection for Wireless Ad-hoc Networks," Proc. of Performance, Computing and Communications Conferecne, pp.241-247, April 2002.
  4. Beongku An, Joo Sang Lee, Nam-Soo Kim, "An Entropy-based Routing Protocol using Mobility in Mobile Ad-hoc Wireless Sensor Networks," Proc. of IEEE ICACT 2009, vol. 2, pp. 949-952, February 2009.
  5. Elizabeth M. Royer, Chai-Keong Toh, "A Review of Current Routing Protocols for Ad-hoc Mobile Wireless Networks," IEEE Personal Communications, pp. 46- 55, August 1999.
  6. Beongku An, Symeon Pappavassiliou, "An Entropy-Based Model for Supporting and Evaluating Stability in Mobile Ad-hoc Wireless Networks," IEEE Communications Letters, vol. 6, issue 8, pp.328-330, August 2002.
  7. Akira Shiozaki, "Edge Extraction Using Entropy Operator," Computer Vision, Graphics, and Image Processing 36, 1-9, 1986. https://doi.org/10.1016/S0734-189X(86)80025-1
  8. Xiaoyan Hong, Mario Gerla, Guangyu Pei and Ching-Chuan Chiang, "A Group Mobility Model for Ad-Hoc Wireless networks," Proc. of ACM/IEEE MSWiM'99, August 1999.
  9. C.E Perkins and E.M. Royer, "Ad-Hoc ondemand distance Vector Routing," Proc. of WMCSA '99, pp 90-100, February 1999.