Journal of KIISE:Computing Practices and Letters (한국정보과학회논문지:컴퓨팅의 실제 및 레터)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Potential-Field-Based Anycast Routing in Large-Scale Wireless Mesh Networks : A Distributed Algorithm based on Finite Difference Method

광역 무선 메쉬 네트워크에서 포텐셜 필드 기반 애니캐스트 라우팅 : 유한 차분법 응용 분산 알고리즘

  • Received : 2009.12.24
  • Accepted : 2010.03.02
  • Published : 2010.06.15
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose an anycast routing scheme for large-scale wireless mesh networks, which requires only one-hop local information with no flooding overhead. We develop an analytical model for anycast mesh networks based on an electrostatic theory. A finite difference method contributes to achieving gateway load balancing with constant control overheads. We verify the performance of the proposed scheme by simulations.

본 논문은 광역 무선 메쉬 네트워크에서 1홉 이웃 노드들의 정보만을 이용하는 애니캐스트 라우팅 기법을 제안한다. 제안 프로토콜은 물리계 장 이론에 기반하여 설계되었으며 일정량의 제어 패킷만으로 메쉬 게이트웨이의 부하를 분산한다. 분산 알고리즘 구현을 위하여 유한 차분법을 응용한다. 그리고 시뮬레이션을 통해 제안 프로토콜의 특성을 검증한다.

Keywords

References

  1. C. Mets, "IP Anycast Point-to-(Any) Point Communication," IEEE Internet Computing, vol.6, no.2, pp.94-98, 2002. https://doi.org/10.1109/4236.991450
  2. J. Wang, Y. Zheng, and W. Jia, "An AODV-Based Anycast Protocol in Mobile Ad hoc Network," in Proceedings of IEEE International Symposium on Personal, Indoor and Mobile Radio Communication (PIMRC), pp.221-225, 2003.
  3. U. C. Kozat and L. Tassiulas, "Network Layer Support for Service Discovery in Mobile Ad hoc Networks," in Proceedings of IEEE Conference on Computer Communications (INFOCOM), pp.1965-1975, 2003.
  4. D. J. Griffiths, Introduction to Electrodynamics, 3rd edition, Prentice Hall, 1998.
  5. V. Lenders and R. Baumann, "Link-Divesity Routing: a Robust Routing Paradigm for Mobile Ad hoc Networks," in Proceedings of IEEE Wireless Communications and Networking Conference (WCNC), pp.2585-2590, 2008.
  6. A. Basu, A. Lin, and S. Ramanathan, "Routing Using Potentials: a Dynamic Traffic-Aware Routing Algorithm," in Proceedings of the ACM annual conference of the Special Interest Group on Data Communication (SIGCOMM), pp.37-48, 2003.
  7. V. Lenders, M. May, and B. Plattner, "Density- Based Anycast: a Robust Routing Strategy for Wireless Ad hoc Networks," IEEE/ACM Trans. on Networking, vol.16, no.4, pp.852-863, 2008. https://doi.org/10.1109/TNET.2007.902726
  8. R. Baumann, S. Heimlicher, and B. Plattner, "Routing in Large-Scale Wireless Mesh Networks Using Temperature Fields," IEEE Network, vol.22, no.1, pp.25-31, 2008. https://doi.org/10.1109/MNET.2008.4435899
  9. NS-2, http://www.isi.edu/nsnam/ns/.
  10. C. E. Perkins et al., "Performance Comparison of Two on-Demand Routing Protocols for Ad hoc Networks," IEEE Personal Communications, vol.8, no.1, pp.16-28, 2001. https://doi.org/10.1109/98.904895