Journal of Communications and Networks

  • 제5권3호
  • /
  • Pages.266-274
  • /
  • 2003
  • /
  • 1229-2370(pISSN)
  • /
  • 1976-5541(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지

On Optimizing Route Discovery of Topology-based On-demand Routing Protocols for Ad Hoc Networks

  • Seet, Boon-Chong (Network Technology Research Center, Nanyang Technological University) ;
  • Lee, Bu-Sung (School of Computer Engineering, Nanyang Technological University) ;
  • Lau, Chiew-Tong (School of Computer Engineering, Nanyang Technological University)
  • 발행 : 2003.09.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

One of the major issues in current on-demand routing protocols for ad hoc networks is the high resource consumed by route discovery traffic. In these protocols, flooding is typically used by the source to broadcast a route request (RREQ) packet in search of a route to the destination. Such network-wide flooding potentially disturbs many nodes unnecessarily by querying more nodes than is actually necessary, leading to rapid exhaustion of valuable network resources such as wireless bandwidth and battery power. In this paper, a simple optimization technique for efficient route discovery is proposed. The technique proposed herein is location-based and can be used in conjunction with the existing Location-Aided Routing (LAR) scheme to further reduce the route discovery overhead. A unique feature of our technique not found in LAR and most other protocols is the selective use of unicast instead of broadcast for route request/query transmission made possible by a novel reuse of routing and location information. We refer to this new optimization as the UNIQUE (UNIcast QUEry) technique. This paper studies the efficacy of UNIQUE by applying it to the route discovery of the Dynamic Source Routing (DSR) protocol. In addition, a comparative study is made with a DSR protocol optimized with only LAR. The results show that UNIQUE could further reduce the overall routing overhead by as much as 58% under highly mobile conditions. With less congestion caused by routing traffic, the data packet delivery performance also improves in terms of end-to-end delay and the number of data packets successfully delivered to their destinations.

키워드

참고문헌

  1. IETF MANET Working Group, http://www.ietf.org/html.charters/manet-charter.html
  2. T. Clausen and P. Jacquet, 'Optimized link state routing protocol,' InternetDraft, draft-ietf-manet-olsr-lO.txt, May 2003
  3. R. Ogier, M. Lewis, and F. Templin, 'Topology dissemination based on reverse path forwarding,' tnternet Draft, draft-ietf-manet-tbrpf-O8.txt, Apr.2003
  4. B. Johnson, D. A. Maltz, and Y.-C. Hu, 'The dynamic source routing protocol for mobile ad hoc networks,' Internet Draft, draft-ietf-manet-dsr-09-txt, Apr. 2003
  5. E Perkins, E. M Royer, and S. R Das, 'Ad hoc on-demand distance vectorrouting,' Internet Draft, draft-ietf-manet-aodv-13.txt, Feb. 2003
  6. Z. Haas, M. Pearlman, and P. Samar, 'The zone routing protocol,' InternetDraft, draft-ietf-manet-zrp-04.txt, Jul. 2002
  7. B. Karp and H. T, Kung, 'Greedy perimeter stateless routing for wirelessnetworks,' in Proc. ACM/IEEE Mobicom'OO, Boston, MA, Aug. 2000, pp. 243-254
  8. S. Basagni et al., in Proc. ACM/IEEE Mobicom'98, Dallas, TX, USA, 1998, pp.76-84
  9. G. Dommety and R. Jain, 'Potential networking applications of globalpositioning systems (GPS),' Technical Report TR-24, Computer ScienceDepartment, The Ohio State University, Apr. 1996
  10. S. Capkun, M. Hamdi, and J. P. Hubaux, 'GPS-free positioning in mobilead-hoc networks,' J. Cluster Computing, vol. 5, no. 2, Apr. 2002
  11. J. Li et al., 'A scalable location service for geographic ad hoc routing,' inProc. ACM/IEEE Mobicom'OO, Boston, MA, 2000, PP. 120-130
  12. Mauve, J. Widmer, and H. Hartenstein, 'A survey on position-based routing in mobile ad hoc networks,' IEEE Network Magazine, pp. 30-39, Nov. 2001
  13. Stojemnovic, 'Location updates for efficient routing in ad hoc wirelessnetworks,' Handbook of Wireless Networks and Mobile Computing, JohnWiley and Sons, pp. 451-471, Jan. 2002
  14. C. Perkins and P. Bhagwat, 'Highly dynamic destination sequenceddistance-vector routing for mobile computers,' Computer Communications Review, pp. 234-244, Oct. 1994
  15. R. Castaneda and S. R. Das, 'Query localization techniques for on-demandrouting protocols in ad hoc networks,' ACM/Ktuwer J. of Wireless Networks, vol. 8, no. 2, pp. 137-151, 2002 https://doi.org/10.1023/A:1013711808509
  16. Y. Ko and N. Vaidya, 'Location-aided routing (LAR) in mobile ad hocnetworks,' ACM/Ktuwer J. ofWiretess Networks, vol. 6, no. 4, pp. 307-321, 2000 https://doi.org/10.1023/A:1019106118419
  17. J. Sucec and I. Marsic, 'An application of parameter estimation to routediscovery by on-demand routing protocol,' in Proc. Distributed Computing Systems, Mesa, AZ, Apr. 2001
  18. J. Li and P. Mohapatra, 'PANDA: An approach to improve flooding basedroute discovery in mobile ad hoc networks,' TechnicaI Report CS5-2002-29, Computer Science Department, UC Davis
  19. Network Simulator (ns-2), http://www.isi.edu/nsnam/ns/
  20. Network Simulator (ns-2), http://www.isi.edu/nsnam/ns/
  21. B. Johnson and D. A. Maltz, 'Dynamic source routing in ad hoc wirelessnetworks,' Mobile Computing, Chapter 5, PP. 153-191, Kluwer AcademicPublishers, 1996
  22. B.-C. Seet, B.-S. Lee, and C.-T. Lau, 'Route discovery optimisation fordynamic source routing in mobile ad hoc networks,' IEE Etec. Lett., vol.36, no. 23, pp. 1963-1964, 2000 https://doi.org/10.1049/el:20001384
  23. B.-C. Seet, B.-S. Lee, and C.-T. Lau, 'Study of a unicast query mechanismfor dynamic source routing in mobile ad hoc networks,' Lecture Notes onComputer Science (LNCS), Springer-Verlag, Berlin, vol. 2094, pp. 168-176, 2001 https://doi.org/10.1007/3-540-47734-9_17
  24. B.-C. Seet, B.-S. Lee, and C.-T. Lau, 'Route discovery optimization techniques in ad hoc networks,' Handbook of Ad Hoc Wiretess Nelworks, ed. by M. Ilyas, Chapter 17, CRC Press, Dec. 2002