한국멀티미디어학회논문지 (Journal of Korea Multimedia Society)

  • 제16권9호
  • /
  • Pages.1077-1088
  • /
  • 2013
  • /
  • 1229-7771(pISSN)
  • /
  • 2384-0102(eISSN)
한국멀티미디어학회 (Korea Multimedia Society)
권호 표지
DOI QR코드

DOI QR Code

MANET에서 이격 비율과 노드 밀집도에 기반한 동적 확률을 적용한 브로드캐스팅 기법

Dynamically Adjusted Probabilistic Broadcasting Mechanism based on Distance Ratio and Node Density for MANETs

  • 김재수 (경북대학교 과학기술대학 컴퓨터정보학부)
  • 투고 : 2013.07.18
  • 심사 : 2013.08.29
  • 발행 : 2013.09.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

브로드캐스팅은 한 노드가 모든 노드들에게 패킷을 전달하는 과정으로, 모바일 애드 혹 네트워크(MANET)에서 경로 탐색과 제어 정보 메시지 전송과 같은 서비스를 위하여 많이 사용되는 기본 작업이다. 본 논문에서는 MANET에서 송수신 노드 사이의 이격 비율과 노드 밀집도에 따라 동적으로 재전송 확률 값을 구하는 브로드캐스팅 기법을 제안한다. 이격 비율은 송수신 노드사이의 거리와 무선 전파의 전달 거리에 대한 비율을 계산하며, 노드 밀집도는 1-홉 단위의 이웃 노드의 수를 계산한다. 패킷을 수신한 노드는 송신노드로부터의 이격 비율과 자신의 노드 밀집도을 고려하여 재전송 확률을 결정하는데, 송신자에 가까운 노드와 노드 밀집도가 높은 노드는 낮은 재전송 확률 값을 부여하여 패킷의 조기 소멸을 통해 재전송 패킷의 수를 줄이도록 한다. 플러딩 기법과 고정된 확률 값 기법과의 성능 비교를 통하여 제안 기법이 다른 방법보다 우수한 성능을 보여주었는데, 제안 기법은 플러딩에 비하여 30% 이상의 패킷 전송을 감소시킬 수 있었으며, 96%에 가까운 패킷의 도착율을 보여주었다.

As broadcasting is the process that a node sends a packet to all nodes in the network. it is basic process used for discovering of a routes to a node and disseminating of control information message in Mobile Ad hoc NETwork (MANET). In this paper, we propose dynamically adjusted probabilistic mechanism based on distance ratio and node density for broadcasting in MANETs. The distance ratio can be calculated as the ratio of the radio strength length to the distance from sender of a node, and node density can be get from 1-hop nodes of neighbours. A mobile node receiving broadcast packets determines the probability of rebroadcasting considering distance ratio and node density of itself. Rebroadcast probability will be set as low value to a node which is located in nearby area of sender and has high 1-hop node density, So it reduces packets transmission caused by the early die-out of rebroadcast packets. Compared with the simple flooding and fixed probabilistic flooding by simulation, our approach shows better performances results. Proposed algorithm can reduce the rebroadcast packet delivery more than 30% without scanting reachability, where as it shows up to 96% reachability compared with flooding.

키워드

참고문헌

  1. Jae-Soo Kim, and Jeong-Hong Kim, "Distance Based Dynamic Probabilistic Broadcasting in Ad Hoc Wireless Networks," Journal of Korea Multimedia Society, Vol. 8, No. 12, pp. 1613- 1622, 2005.
  2. J.S. Kim, Q. Zhang, and D.P. Agrawal, "Probabilistic Broadcasting Based on Coverage Area and Neighbour Confirmation in Mobile Ad Hoc Networks," Proc. IEEE Global Telecommunications Conference Workshops, pp. 96-101, 2004.
  3. N. Karthikeyan, V. Palanisamy, and K. Duraiswamy, "Performance Comparison of Broadcasting Methods in Mobile Ad Hoc Network," International Journal of Future Generation Communication and Networking, Vol. 2, No. 2, pp. 47-58, 2009.
  4. B. Williams and T. Camp, "Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks," Proc. of the 3rd ACM international Symposium on Mobile Ad Hoc Networking & Computing, pp. 194-205, 2002.
  5. Zygmunt J. Haas, Joseph Y. Halpern, and Li Li, "Gossip-based Ad Hoc Routing," Journal of IEEE/ACM Transactions on Networking, Vol. 14, No. 3, pp. 479-491, 2006. https://doi.org/10.1109/TNET.2006.876186
  6. Sze-Yao Ni, Yu-Vhee Tseng, Yuh-Shyan Chen, and Jang-Ping Sheu, "Broadcast Storm Problem in a Mobile Ad Hoc Network," Wireless Networks, Vol. 8, pp. 153-167, 2002. https://doi.org/10.1023/A:1013763825347
  7. J. Cartigny and D. Simplot, "Border Node Retransmission based Probabilistic Broadcast Protocols in Ad-Hoc Networks," Telecommunication Systems, Vol. 22, No. 1-4, pp. 189-204, 2003. https://doi.org/10.1023/A:1023495021643
  8. Q. Zhang and D.P. Agrawal, "Dynamic Probabilistic Broadcasting in Mobile Ad Hoc Networks", Journal of Parallel and Distributed Computing, Vol. 65, Issue 2, pp. 220-233, 2005. https://doi.org/10.1016/j.jpdc.2004.09.006
  9. M. Bani-Yassein, M. Ould-Khaoua, L.M. Mackenzie, and S. Papanastasiou, "Performance Analysis of Adjusted Probabilistic Broadcasting in Mobile Ad Hoc Networks," International Journal of Wireless Information Networks, Vol. 13, No. 2, pp. 127-140, 2006. https://doi.org/10.1007/s10776-006-0027-0
  10. Jamal-Deen Abdulai, Mohamed Ould-Khaoua, and Lewis M. Mackenzie, "Adjusted Probabilistic Route Discovery in Mobile Ad Hoc Networks", Journal of Computers and Electrical Engineering, Vol. 35 No, 1, pp. 168-182, 2009. https://doi.org/10.1016/j.compeleceng.2008.07.002
  11. Jae-Soo Kim and Jeong-Hong Kim, "Probabilistic Broadcasting Based on Selfishness and Additional Coverage in MANETs," Journal of Information and Communication Convergence Engineering, Vol. 10, No. 4, pp. 329-336, 2012. https://doi.org/10.6109/jicce.2012.10.4.329
  12. 신재욱, 권혜연, 김응배, "이동 Ad Hoc 네트워크에서의 Flooding 기술," 전자통신동향분석, 제18권, 제6호, pp. 8-18, 2003.
  13. Jie Wu and Fei Dai, "A Generic Broadcast Protocol in Ad Hoc Networks Based on Self Pruning," Parallel and Distributed Processing Symposium, Proc. International, 2003.
  14. Xin Ming Zhang, En Bo Wang, Jing Jing Xia, and Dan Keun Sung, "A Neighbor Coverage- Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks," IEEE Transactions on Mobile Computing, Vol. 12, No. 3, pp. 424-433, 2013. https://doi.org/10.1109/TMC.2011.277
  15. 김정홍, 김재수, "모바일 애드 혹 네트워크에서 이격 비율에 근거한 확률적 브로드캐스트 기법," 한국컴퓨터정보학회논문지, 제15권, 제12 호, pp. 75-84, 2010.
  16. 김정삼, 류정필, 한기준, "애드혹 네트워크에서 지역 밀집도에 적응적인 확률적 플러딩 기법," 전자공학회 논문지, 제42권, 제9호, pp. 581-588, 2005년.
  17. Hussein Al-Bahadili, "Enhancing the Performance of Adjusted Probabilistic Broadcast in MANETs," The Mediterranean Journal of Computers and Networks, Vol. 6, No. 4. pp. 138-144, 2010.

피인용 문헌

  1. A performance Enhancement of VANET Warning Message Propagation on Electric Wave Blind Area Problem in the Urban Environment vol.17, pp.10, 2014, https://doi.org/10.9717/kmms.2014.17.10.1220
  2. A Probabilistic Broadcasting Mechanism based on Cross Layer Model Deliberating Received Signal Strength Ratio in Mobile Ad Hoc Networks vol.21, pp.3, 2016, https://doi.org/10.9708/jksci.2016.21.3.025