Moralism: mobility prediction with link stability based multicast routing protocol in MANETs

Singal, Gaurav; Laxmi, Vijay; Gaur, Manoj Singh; Rao, Vijay

doi:10.1007/s11276-015-1186-7

Cited by 29 publications

(23 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This resulting network is referred to as a hybrid wireless network. Due to the dynamic nature of such network, quite often computational intelligence approaches such as fuzzy logic systems [5][6][7] and evolutionary computing could be applied to optimization in hybrid wireless networks. In this paper, we are interested in applying evolutionary computing (artificial bee colony) to Vehicular ad Hoc Network (VANET).…”

Section: Introductionmentioning

confidence: 99%

A micro-artificial bee colony based multicast routing in vehicular ad hoc networks

Zhang

2017

Ad Hoc Networks

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

A micro-artificial bee colony based multicast routing in vehicular ad hoc networks

Zhang

2017

Ad Hoc Networks

View full text Add to dashboard Cite

“…In recent years, some methods are proposed to design the routing algorithms considering the high mobility of FANETs. In order to adapt the routing algorithms to dynamic topologies in FANETs, some researches focus on the prediction technique [12] and the idea of distance vector routing protocols [13] to design the routing algorithms for FANETs. Sugranes and Razi [14] proposed an optimal routing method based on Dijkstra's shortest path algorithm (OR-DSP) and prediction technique for UAV networks with queued communication systems by incorporating predicted network topology.…”

Section: Related Workmentioning

confidence: 99%

“…We define the end if (8) end for (9) for each node j ∈ A(S t i ) do (10) Uses (5) and (11) to compute q ij and r ij ; (11) end for (12) Uses (7) 6 Mobile Information Systems termination time υ k T to be the stopping time when packet k is terminated within delay constraint and υ k s to be the stopping timeout of delay threshold. e notation μ k,n denotes the transmission gain when the packet k is transmitted at slot n, and μ k,n < ∞.…”

Section: Algorithm Analysismentioning

confidence: 99%

Delay-Constrained Routing Based on Stochastic Model for Flying Ad Hoc Networks

Wen

Huang

2018

Mobile Information Systems

View full text Add to dashboard Cite

is paper aims at solving the end-to-end delay-constrained routing problem in a local way for flying ad hoc networks (FANETs). Due to the high mobility, it is difficult for each node in FANETs to obtain the global information. To solve this issue, we propose an adaptive delay-constrained routing with the aid of a stochastic model, which allows the senders to deliver the packets with only local information. We represent the problem in a mathematical form, where the effective transmission rate is viewed as the optimization objective and the link quality and end-to-end delay as the constraints. And, some mathematical tools are used to obtain the approximate solutions for the optimization problem. Before designing the routing scheme, the senders calculate the transition probability for its relay node by jointly considering local delay estimation and expected one-hop delay. en, the sender transmits the packets to their relay node with transition probability. Finally, we prove the convergence of the proposed routing algorithm and analyse its performances. e simulation results show that the proposed routing policy can improve the network performance effectively in terms of throughput, loss rate, and end-to-end delay.

show abstract

“…The fundamental idea behind considering link stability is to facilitate a protocol to select those channels that persist for longer periods. Link stability can be evaluated using parameters like the relative mobility of the nodes sharing the link, received power, the energy of nodes, signal to interference and noise ratio (SINR), congestion on the link, and bandwidth of the link. Authors in present a stable path metric called expected transmission count (ETX), which searches high‐throughput routes for data transmission.…”

Section: Related Work/backgroundmentioning

confidence: 99%

Improved multicast routing in MANETs using link stability and route stability

Singal

Laxmi

Rao

et al. 2016

Int J Communication

Self Cite

View full text Add to dashboard Cite

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. KEYWORDS link stability, MANETs, periodic packets, QoS, route stability 1 Int J Commun Syst. 2016;30:e3243.wileyonlinelibrary.com/journal/dac

show abstract

Moralism: mobility prediction with link stability based multicast routing protocol in MANETs

Cited by 29 publications

References 24 publications

A micro-artificial bee colony based multicast routing in vehicular ad hoc networks

A micro-artificial bee colony based multicast routing in vehicular ad hoc networks

Delay-Constrained Routing Based on Stochastic Model for Flying Ad Hoc Networks

Improved multicast routing in MANETs using link stability and route stability

Contact Info

Product

Resources

About