Abstract

A considerable amount of research within the field of Quality of Service (QoS) support for distributed environment. In this study, we propose Improved LDSRDV-localized Dynamic Source Routing with aim to improve the Distance Vector Performance in MANET. One of the key issues in providing end-to-end QoS guarantees in packet networks is determining a feasible path that satisfies a number of QoS constraints. Nodes mobility brings flinty challenges to multicast in Mobile Ad hoc Networks (MANETs). To track nodes mobility, flooding messages are widely used for data delivery structure construction and maintenance in many multicast protocols. These periodic flooding messages significantly consume network resources, such as energy and bandwidth and result in network. To release data delivery structure maintenance onus, profited from location based service, a number of stateless location based multicast protocol were proposed, where a destination list is encapsulated into each data packet for data packet orientation. However, due to data packet capability limitation, the way of encapsulating a destination list in each data packet header restricts the protocol scalability. Simulation is performed using network simulator to demonstrate the efficiency of Improved LDSRDV.

Keywords:

Bandwidth, energy, flooding messages, mobile ad hoc networks, multicast protocol, quality of service,

References

1. Gharavi, H. and B. Hu, 2009. Directional antenna for multipath ad hoc routing. Proceeding of 6th IEEE Consumer Communications and Networking Conference (CCNC, 2009), pp: 1-5.
   CrossRef    
2. Gracia-Luna-Aceves, J.J. and M. Spohn, 1999. Source-tree routing in wireless networks. Proceeding of 7th International Conference on Network Protocols (ICNP '99), pp: 273-282.
   CrossRef    
3. Hauser, R., T. Przygienda and G. Tsudik, 1999. Lowering security overhead in link state routing. Comput. Netw., 31(8): 885-894.
   CrossRef    
4. Hu, Y.C. and A. Perrig, 2004. A survey of secure wireless ad hoc routing. IEEE Secur. Priv., 2(03): 28-39.
   CrossRef    
5. Hu, Y.C. and D.B. Johonson, 2004. Securing quality-of-service route discovery in on-demand routing for ad hoc networks. Proceeding of the 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN '04), pp: 106-117.
   CrossRef    
6. Hu, Y.C., D.B. Johnson and A. Perrig, 2002. SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks. Proceeding of the 4th IEEE Workshop on Mobile Computing Systems and Applications, pp: 3.
   PMid:11790957    
7. Johnson, D.B. and D.A. Maltz, 2001. Dynamic source routing in ad hoc wireless networks. Ad hoc Networking, pp: 139-172.
   
8. Le, A.N., D.W. Kum, S.H. Lee, Y.Z. Cho and I.S. Lee, 2007. Directional AODV routing protocol for wireless mesh networks. Proceeding of IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC, 2007), pp: 1-5.
   CrossRef    
9. Liu, G. and K.G. Ramakrishnan, 2001. A*Prune: An algorithm for finding k shortest paths subject to multiple constraints. Proceeding of 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM, 2001), pp: 743-749.
   
10. Mieghem, P.V., H. De Neve and F.A. Kuipers, 2001. Hop-by-hop quality of service routing. Comput. Netw., 37(3-4): 407-423.
    CrossRef    
11. Nicholson, T.A.J., 1966. Finding the shortest route between two points in a network. Comput. J., 9: 275-280.
    CrossRef    
12. Perkins, C.E. and P. Bhagwat 1994. Highly dynamic destination sequenced distance-vector routing (DSDV) for mobile computers. Proceeding of the ACM Special Interest Group on Data Communication. London, UK, pp: 234-244.
    CrossRef    
13. Perkins, C.E. and E. Royer, 1999. Ad-hoc on-demand distance vector routing. Proceeding of the 2nd IEEE Workshop on Mobile Computing Systems and Applications. New Orleans, LA, USA, pp: 90-100.
    CrossRef    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.