Wireless Networks

, Volume 9, Issue 6, pp 623–636 | Cite as

A Query Scope Agent for Flood Search Routing Protocols

Abstract

Flood-search on-demand routing has received considerable interest for its application to mobile ad hoc networks. To alleviate the effects of flooding the network with control packets to discover a route, the concept of an expanding ring search (ERS) has been proposed elsewhere for reducing the packet transmission overhead of the route discovery process. Essentially, ERS consists of incrementally increasing the allowable hop radius of the flood search until a route to the target node is returned. However, ERS incurs additional latency to successfully complete the route discovery procedure. This paper presents a query scope agent (QSA) that assists in the selection of an appropriate ERS. The QSA accepts as input, from the user or network application, a maximum allowable value for route discovery delay. The QSA then estimates network parameter values to determine an ERS approach that satisfies the delay requirement while reducing expected packet transmission overhead. Simulation results show that it successfully achieves this objective. Further, the QSA incurs little communication and computation overhead, and operates in a distributed and asynchronous fashion.

mobile ad hoc network on-demand routing flood search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. Broch, D.A. Maltz, D.A. Johnson, Y.-C. Hu and J. Jetcheva, A performance comparison of multi-hop wireless ad hoc network routing protocols, in: Proc. of ACM/IEEE MobiCom (October 1998) pp. 85–97.Google Scholar
  2. [2]
    R. Castaneda and S.R. Das, Query localization techniques for on-demand routing protocols in ad hoc networks, in: Proc. Of ACM/IEEE MobiCom (August 1999) pp. 186–194.Google Scholar
  3. [3]
    S.R. Das, C.E. Perkins and E.M. Royer, Performance comparison of two on-demand routing protocols for ad hoc networks, in: Proc. Of IEEE Infocom (April 2000) pp. 3–12.Google Scholar
  4. [4]
    Y.-C. Hu and D.B. Johnson, Caching strategies in on-demand routing protocols for wireless networks, in: Proc. of ACM/IEEEMobiCom (August 2000) pp. 231–242.Google Scholar
  5. [5]
    A. Iwata, C.-C. Chiang, G. Pei, M. Gerla and T.-W. Chen, Scalable routing strategies for ad hoc wireless networks, IEEE J. Select. Areas Commun. 17(8) (1999) 1369–1379.Google Scholar
  6. [6]
    P. Johansson, T. Larsson, N. Hedman, B. Mielczarek and M. Degermark, Scenario-based performance analysis of routing protocols for mobile ad-hoc networks, in: Proc. of ACM/IEEE MobiCom (August 1999) pp. 195–206.Google Scholar
  7. [7]
    D.B. Johnson and D.A. Maltz, Dynamic source routing in ad hoc wireless networks, in: Mobile Computing, eds. T. Imielinski and H. Korth (Kluwer Academic, 1996) ch. 5, pp. 153–181.Google Scholar
  8. [8]
    D.B. Johnson, D.A. Maltz, Y.-C. Hu and J.G. Jetcheva, The dynamic source routing protocol for mobile ad hoc networks, IETF Internet Draft, draft-ietf-manet-dsr-07.txt (21 February 2002).Google Scholar
  9. [9]
    B. Karp and H.T. Kung, GPSR: Greedy perimeter stateless routing for wireless networks, in: Proc. of ACM/IEEE MobiCom (August 2000) pp. 243–254.Google Scholar
  10. [10]
    Y.-B. Ko and N. Vaidya, Location-aided routing (LAR) in mobile ad hoc networks, in: Proc. of ACM/IEEE MobiCom (October 1998) pp. 66–75.Google Scholar
  11. [11]
    J. Li, J. Janotti, D. De Couto, D. Karger and R. Morris, A scalable location service for geographic ad-hoc routing, in: Proc. of ACM/IEEE MobiCom (August 2000) pp. 120–130.Google Scholar
  12. [12]
    D.A. Maltz, J. Broch, J. Jetcheva and D.B. Johnson, The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks, IEEE J. Select. Areas Commun. 17(8) (1999) 1439–1453.Google Scholar
  13. [13]
    S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen and J.-P. Sheu, The broadcast storm problem in a mobile ad hoc network, in: Proc. of ACM/IEEE MobiCom (August 1999) pp. 151–162.Google Scholar
  14. [14]
    W. Peng and X.-C. Lu, On the reduction of broadcast redundancy in mobile ad hoc networks, in: Proc. of MobiHoc Workshop (August 2000) pp. 129–130.Google Scholar
  15. [15]
    C.E. Perkins and E. M. Royer, Ad-hoc on-demand distance vector routing, in: Proc. of IEEE WMCSA '99 (February 1999).Google Scholar
  16. [16]
    C.E. Perkins, E.M. Royer and S.R. Das, Ad hoc on-demand distance vector (AODV) routing, IETF Internet Draft, draft-ietf-manet-aodv-11.txt (19 June 2002).Google Scholar
  17. [17]
    J. Sucec and I. Marsic, An application of parameter estimation to route discovery by on-demand routing protocols, in: Proc. of IEEE ICDCS '01 (April 2001) pp. 207–216.Google Scholar
  18. [18]
    Y.-C. Tseng, S.-Y. Ni and E.-Y. Shih, Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network, in: Proc. of IEEE ICDCS '01 (16–19 April 2001) pp. 481–488.Google Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  1. 1.Department of Electrical and Computer EngineeringRutgers UniversityPiscatawayUSA

Personalised recommendations