Search

In MANETs, real-time multimedia applications make Quality of Service ( QoS ) support, a crucial issue regarding terms of increased throughput, reduced jitter, and available bandwidth. Most of the existing routing protocols focus on straight forward hop-count metric and are less adaptable to densely distributed and highly mobile networks. Therefore, Multicast communication with QoS in densely populated highly dynamic network an exciting research challenges. The objective of the present paper is to introduce a QoS aware routing metric that determines a reliable forwarding node based on Link Stability cost Function ( LSF ). A mesh of Multicast routes between Multicast source and destinations has been established using nodes with a maximum LSF . The principle theme underlying our protocol is optimum contention count that can be estimated with the help of received signal strength. The proposed protocol comprises the following stages:(1) Calculation of Link Stability Factor (2) Determination of maximum LSF value (3) Pruning adjacent nodes (4) Creation of a mesh consisting of more stable forwarding nodes (5) Creation of a mobile network in which no node remains isolated, as well as nodes, face lesser contention. Our proposed protocol has been demonstrated on an existing mesh-based Multicast routing protocols, ODMRP. Simulations are carried out on Exata/Cyber simulator, and obtained results are compared with that of ODMRP. The comparative analysis reveals that our protocol is more efficient in contrast to ODMRP, LSMRP, and MMRNS, regarding performance parameters like Packet Delivery Ratio ( PDR ), Average End-to-End Latency and Average Route Lifetime. Also, we have analyzed the impact of minimum and maximum contention count on PDR and delay. [ABSTRACT FROM AUTHOR]

The growing popularity of multimedia applications and services needs to support several quality of service metrics such as high throughput, low energy, and jitter, which is a challenging task in mobile ad hoc networks. Because of limited bandwidth, energy constraints, dynamic topology, transmission errors, and fluctuating link stability, the links between adjacent nodes are often not reliable and may break because of node mobility. Link breakage initiates the process of rerouting either at the sender node (the node at which the link breaks) or at the source node. In either case, it leads to packet loss, delivery delays, and increased control overheads. Hence, to attain a minimum quality of service, routing protocols must address the dynamic network topology. Uncertain and varying movement of nodes necessitates stability of the links between such nodes. The objective of this paper is to propose 2 protocols, the first based on link stability and the other based on route stability. Link stability identifies a stable link from the available links to the next hop and determines a stable end-to-end route. The probability of successful transmission of periodic packets is used as a link stability metric to assess the stable path. Acknowledgment -free packets are used to check connectivity in the network. Increased probability of successful transmission implies that the selected link is sustained for longer duration and can deliver packets more reliably or, as a consequence, results in a stable link to deliver a better data rate. With a stable link, there is a reduced possibility of retransmissions, reduced end-to-end delay, reduced control overheads, and enhanced data delivery ratio. Selection of the most stable route for data transmission improves the performance. Experimental results from simulations performed on EXata/Cyber v2.0 simulator reveal that our proposed protocols are an improvement over the existing protocols in terms of packet delivery ratio, average end-to-end delay, and average route lifetime, even without route optimization with the minor increase in control packets. A case study of the application of proposed protocols is also presented. [ABSTRACT FROM AUTHOR]