Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

An Efficient and Scalable Routing for MANETs

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Recently, Distributed-Hash-Table (DHT)-based routing protocols have been proposed for large scale mobile ad hoc networks (MANETs). The motive behind using DHT is to avoid/reduce network wide flooding in MANETs in route discovery phase leading to achieve more scalable network. The challenge of deploying DHT at network layer for routing purpose in MANETs is to achieve more matching between logical and physical networks. The paper describes that existing DHT-based routing protocols for MANETs lack this feature. The paper presents a new DHT based scheme [called an efficient and scalable routing for MANETs (ESR)] which reduces the ill-matching between logical and physical networks. This is achieved be distributing the logical identifier (LID) space of DHT structure among the nodes such that the physical neighbors have consecutive LID space portions, i.e. all physical neighbors of a node are also the logical neighbors of the node. Therefore the logical ID space portion of a node may be non-contiguous. Based on this logical structure, a node builds up binary-search-tree (BST) using both logical ID space portion of itself and its neighbors. This BST at the node is traversed to find the next hop for a query/message. Through simulation, the paper shows the proposed approach (ESR) performs better than the existing one in term of routing overhead, average end-to-end delay, path-stretch values and false-negative ratio.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. http://thelifenetwork.org/about.html.

  2. Kiess, W., & Mauve, M. (2007). A survey on real-world implementations of mobile ad-hoc networks. Ad Hoc Networks, 5(3), 324–339.

    Article  Google Scholar 

  3. Kulla, E., et al. (2012). A survey on MANET testbeds and mobility models. Computer Science and Convergence, Lecture Notes in Electrical Engineering, 114(4), 651–657.

    Article  Google Scholar 

  4. Caesar, M., et al. (2006). Virtual ring routing: Network routing inspired by DHTs. In Proc. ACM. Conf. SIGCOMM, NY, USA (pp. 351–362).

  5. Eriksson, J., Faloutsos, M., & Krishnamurthy, S. V. (2007). DART: Dynamic address routing for scalable ad hoc and mesh networks. IEEE/ACM Transactions Networking, 15(1), 119–132.

    Article  Google Scholar 

  6. Awad, A., German, R., & Dressler, F. (2011). Exploiting virtual coordinates for improved routing performance in sensor networks. IEEE Transactions on Mobile Computing, 10(9), 1214–1226.

    Article  Google Scholar 

  7. Viana, A. C., et al. (2003). Indirect routing using distributed location information. In Proc. 1st IEEE. Conf. Pervasive Computing and Communications. PerCom, March. 2003 (pp. 224–231).

  8. Sampath, D., & Garcia-Luna-Aceves, J. J. (2009). PROSE: Scalable routing in MANETs using prefix labels and distributed hashing. In Proc. 6th IEEE Int. Conf. Sensor, Mesh and Ad Hoc Communications and Networks, SECON, CA, USA, June 2009 (pp. 1–9).

  9. Lu, G.-H., et al. (2008). Virtual id routing: A scalable routing framework with support for mobility and routing efficiency. In Proc. 3rd ACM Int. Wksp. Mobility in the evolving internet architecture, MobiArch, New York, USA (pp. 79–84).

  10. Jha, S. C., Jouaber, B., & Ahmed, K. M. (2008). Dynamic-address allocation based scalable routing protocol in context of node mobility. In Proc. IEEE. Conf. Wireless Hive Networks Conference. WHNC, Aug. 2008 (pp. 1–6).

  11. Shah, N., Qian, D., & Rui, W. (2012). MANET adaptive structured P2P overlay. Springer. Peer-to-peer Networking and Applications, 5(2), 143–160.

    Article  Google Scholar 

  12. www.isi.edu/nsnam. 20 June 2013.

  13. http://net.cs.uni-bonn.de/wg/cs/applications/bonnmotion/. 20 June 2013.

  14. Clausen, T. & Jacquet, P. (2003). Optimized link state routing protocol. IETF RFC3626. Available at http://www.ietf.org/rfc/rfc3626.txt.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, COMSATS Institute of Information Technology, Wah Cantt, Pakistan

    Nadir Shah & Waqar Mehmood

  2. Department of Electrical Engineering, COMSATS Institute of Information Technology, Wah Cantt, Pakistan

    Ayaz Ahmad

  3. Sino-German Joint Software Institute, Beihang University, Beijing, China

    Depei Qian & Rui Wang

Authors
  1. Nadir Shah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ayaz Ahmad
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Waqar Mehmood
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Depei Qian
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Rui Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nadir Shah.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shah, N., Ahmad, A., Mehmood, W. et al. An Efficient and Scalable Routing for MANETs. Wireless Pers Commun 75, 987–1004 (2014). https://doi.org/10.1007/s11277-013-1403-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-013-1403-6

Keywords

Search

Navigation