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

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

Message Complexity Analysis of MANET Address Autoconfiguration-Single Node Joining Case

단일 노드 결합시 MANET 자동 네트워킹 프로토콜의 메시지 복잡도 분석

  • 김상철 (국민대학교 컴퓨터공학과)
  • Published : 2007.05.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper proposes a novel method to perform a quantitative analysis of message complexity and applies this method in comparing the message complexity among the mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs). To obtain the upper bound of the message complexity of the protocols, the O-notation of a MANET group of N nodes has been applied. The message complexity of the single node joining case in Strong DAD, Weak DAD with proactive routing protocols (WDP), Weak DAD with on-demand routing protocols (WDO), and MANETconf has been derived as n(mO(N)+O(t)), n(O(N)+O(t)), n(O(N)+2O(t)), and nO((t+1)N)+O(N)+O(2) respectively. In order to verify the bounds, analytical simulations that quantify the message complexity of the address autoconfiguration process based on the different coflict probabilities are conducted.

네트워크 계층의 MANET 라우팅 프로토콜이 개발될 때 가장 주요한 관심사는 라우팅 오버헤드 (Overhead)의 축소이다. 본 논문에서는 MANET 에서 단일 노드가 자동 네크워킹 프로토콜에 의해 IP 주소를 획득할 때의 라우팅 오버헤드 (메시지 복잡도)를 정량적으로 분석하는 수학적 방법을 제안한다. MANET에서 자동 네크워킹 프로토콜은 IP 주소 할당시 IP 주소 충돌회피에 사용된다. 메시지 복잡도는 Upper Bound에 의해 수학적으로 정량화 되고, 실제 주소 할당을 컴퓨터 시뮬레이터로 구현하여, 제안된 Upper Bound와 시뮬레이션 결과를 비교, 분석한다. 메시지 복잡도의 Upper Bound는 Worst Case 시나리오 분석에 의해 유도된다.

Keywords

References

  1. C. E. Perkins, J. T. Malinen, R. Wakikawa, E. M. Royer, and Y. Sun, 'IP address autoconfiguration for ad hoc networks,' IETF draft, 2001, http://www.cs.ucsb.edu/-ebelding/txt/autoconf.txt
  2. K. Weniger, 'PACMAN: passive autoconfiguration for mobile ad hoc networks,' IEEE J. Select. Areas Commun., vol. 23, no.3, pp.507-519, Mar. 2005 https://doi.org/10.1109/JSAC.2004.842539
  3. S. Thomson, and T. Narten, 'IPv6 Stateless Address Autoconfiguration,' RFC 2462, Dec. 1998
  4. K. Weniger, and M. Zitterbart, 'Address autoconfiguration in mobile ad hoc networks: Current Approaches and Future Directions,' IEEE Network, pp. 6-11, Jul./Aug. 2004
  5. J-. P. Jeong, J. Park, H. Kim, and D. Kim, 'Ad hoc IP address autoconfiguration,' IETF draft, July 2004
  6. N. H. Vaidya, 'Weak duplicate address detection in mobile ad hoc networks,' Proc. ACM MobiHoc 2002, pp. 206-216, June 2002, Lausanne, Switzerland
  7. M. Gerla, X. Hong, and G. Pei, 'Fisheye State Routing Protocol (FSR) for Ad Hoc Networks,' Internet Draft, June, 2002, http://www.ietf.org/proceedings/02jul/I-D/draft-ietf-MANET-fsr-03.txt
  8. R. Ogier, M. Lewis, and F. Templin, 'Topology Broadcast Based on Reverse Path Forwarding (TBRPF),' Internet Draft, April. 2003, http://www.potaroo.net/ietf/ old-ids/draft-ietf-MANETtbrpf-08.txt
  9. C. A. Santiváñez, R. Ramanathan, and I. Stavrakakis, 'Making link-state routing scale for ad hoc networks,' Proc. of the 2nd ACM international symposium on Mobile ad hoc networking & computing, Long Beach, CA, USA, 2001
  10. T. Clausen, Ed., and P. Jacquet, Ed., 'Optimized Link State Routing Protocol (OLSR),' RFC 3626, The Internet Society, Oct., 2003
  11. M. Gerla, X. Hong, L. Ma, and G. Pei, 'Landmark Routing Protocol (LANMAR) for Large Scale Ad Hoc Networks,' Internet Draft, Nov. 2002, http://www.ietf.org/proceedings/01dec/I-D/draft-ietf-MANET-lanmar-02.txt
  12. D. Johnson, D. A. Maltz, and Y.-C. Hu, 'The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR),' Internet Draft, April, 2003, http://www.potaroo.net/ietf/all-ids/draft-ietf-MANET-dsr-09.txt
  13. C. Perkins and E. Royer, 'Ad hoc On Demand Distance Vector (AODV) Routing,' RFC 3561, The Internet Society, July, 2003
  14. S. Nesargi and R. Prakash, 'MANETconf: Configuration of hosts in a mobile ad hoc network,' Proc. IEEE Infocom 2002, June 2002, New York, USA
  15. S. Cheshire and B. Aboba, 'Dynamic Configuration of IPv4 Link-Local Address,' RFC 3927, The Internet Society, Mar. 2005
  16. M. Moshin and R. Prakash, 'IPaddress assignment in a mobile ad hoc network,' Proc. IEEE Milcom 2002, pp. 856-861, Oct. 2002
  17. H. Zhou, L. M. Ni, and M. W. Mutka, 'Prophet Address Allocation for Large Scale MANETs,' Ad Hoc Networks Journal, vol. 1, issue 4, pp. 423-434, Nov. 2003 https://doi.org/10.1016/S1570-8705(03)00042-8
  18. G. Cao and M. Singhai, 'A delay-optimal quorum-based mutual execution algorithm for distributed systems,' IEEE Trans. Parell and Distributed Systems, vol. 12, no.12, pp. 1256-1268, Dec. 2001 https://doi.org/10.1109/71.970560
  19. C-. C. Shen, and C. Srisathapornphat, and R. L. Z. Huang, and C. Jaikaeo, and E. L. Lloyd, 'CLTC: A cluster-based topology control framework for ad hoc networks,' IEEE Trans. Mobile Computing, vol. 3, no.1, pp. 18-32, Jan.-Mar. 2004 https://doi.org/10.1109/TMC.2004.1261814
  20. X. Hong, K. Xu, and M. Gerla, 'Scalable Routing Protocol for Mobile Ad Hoc Networks,' IEEE Network, pp.11-21, Jul./Aug. 2002
  21. S. H. Kwok and A. G. Constantinides, 'A fast recursive shortest spanning tree for image segmentation and edge detection,' IEEE Trans. Image Processing, vol. 6, no.2, pp. 328-332, Feb. 1997 https://doi.org/10.1109/83.551705
  22. A. Boukerche, S. Hong, and T. Jacob, 'An efficient synchronization scheme of multimedia streams in wireless and mobile systems,' IEEE Trans. Parell and Distributed Systems, vol. 13, no.9, pp. 911-923, Sep. 2002 https://doi.org/10.1109/TPDS.2002.1036065
  23. J. Gross and J. Yellen, Graph Theory and Its Applications, CRC Press, 1998
  24. M. Sheng, J. Li, and Y. Shi, 'Relative Degree Adaptive Flooding Broadcast Algorithm for Ad Hoc Networks,' IEEE Trans. on Broadcasting, vol. 51, no. 2, pp. 216-222, June 2005 https://doi.org/10.1109/TBC.2005.847624