A new link lifetime estimation method for greedy and contention-based routing in mobile ad hoc networks

Noureddine, Hadi; Ni, Qiang; Min, Geyong; Al-Raweshidy, Hamed S.

doi:10.1007/s11235-013-9796-9

Cited by 12 publications

(8 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [15] authors have proposed stability aware greedy (SAG) routing that calculates link lifetime metric using node position, speed and direction for each node and finally selects highest link lifetime stable node as next forwarder node. When sending node detects link failure using beacon message then source node searches for new node to designate it as the next forwarder.…”

Section: Related Workmentioning

confidence: 99%

Stable geographic forwarding with link lifetime prediction in mobile adhoc networks for battlefield environment

Jaiswal

Sinha

2016

Hum. Cent. Comput. Inf. Sci.

View full text Add to dashboard Cite

Mobile adhoc network (MANET) is one of the most relevant areas of research in wireless communication that has gained prevalence due to its diversity over large-scale highly mobile networks to small-scale networks having low mobility and power constraints. Adhoc networks are inherently envisioned to be highly vulnerable to dynamic changes because of mobile sensor nodes. Node mobility often results in breakage of communication links, thereby introducing additional overhead for establishing new routes and transmitting table updates, further causing rapid exhaustion of energy reserve. Especially in military applications, preventing communication disruptions is an important security concern for defence applications engaged in safeguarding national boundaries. This necessitates the need for efficient routing strategy for battlefield environments susceptible to frequent link failures due to random mobility of groups/individuals. In this regard, we have proposed an efficient stable geographic forwarding with link-lifetime prediction (SGFL) that utilizes the broadcast nature of wireless channel and multicasts with node mobility. During the next hop selection process, a node preferably selects the neighbours which are at the least distance from the destination with low mobility. Unlike position based opportunistic routing, our scheme allows selection of backup node that lies within the transmission range of selected neighbours. Link lifetime prediction with backup nodes enhances efficiency and reliability of routing in highly mobile and congested adhoc networks. Simulation results show that our proposed SGFL achieves better performance than existing counterparts in terms of packet delivery ratio, packet loss and end-to-end delay under high node density as well as increased traffic flow.

show abstract

Section: Related Workmentioning

confidence: 99%

Stable geographic forwarding with link lifetime prediction in mobile adhoc networks for battlefield environment

Jaiswal

Sinha

2016

Hum. Cent. Comput. Inf. Sci.

View full text Add to dashboard Cite

show abstract

“…Various approaches were proposed for link stability in MANETs. Most of these use either node's mobility [7,8,9] or its residual energy to find stable links [10,11].In some cases a combination of parameters was also used [4,12]. Node Stability-based Routing used mobility degree of a node relative to its neighbours, to establish stable and sustainable paths [7,8].…”

Section: Introductionmentioning

confidence: 99%

“…Node Stability-based Routing used mobility degree of a node relative to its neighbours, to establish stable and sustainable paths [7,8]. Another approach used link lifetime prediction method using transmission range and location parameters (position, speed and direction) of the sending node and neighbouring node [9]. A recent approach using both energy and relative velocity of nodes, for computing acceptability of a path from a multicast sender to a multicast receiver was given in [25].…”

Section: Introductionmentioning

confidence: 99%

Efficient routing in multicast mesh by using forwarding nodes and weighted cost function

Vyas¹,

Khuteta²,

Chaturvedi³

2019

KSII TIIS

View full text Add to dashboard Cite

Multicast Mesh based Mobile Ad-hoc NETworks (MANETs) provide efficient data transmission in energy restraint areas without a fixed infrastructure. In this paper, the authors present an improved version of protocol SLIMMER developed by them earlier, and name it SLIMMER-SN. Most mesh-based protocols suffer from redundancy; however, the proposed protocol controls redundancy through the concept of forwarding nodes. The proposed protocol uses remaining energy of a node to decide its energy efficiency. For measuring stability, a new metric called Stability of Node (SN) has been introduced which depends on transmission range, node density and node velocity. For data transfer, a weighted cost function selects the most energy efficient nodes / most stable nodes or a weighted combination of both. This makes the node selection criteria more dynamic. The protocol works in two steps: (1) calculating SN and (2) using SN value in the weighted cost function for selection of nodes. The study compared the proposed protocol, with other mesh-based protocols PUMA and SLIMMER, based on packet delivery ratio (PDR), throughput, end-to-end delay and average energy consumption under different simulation conditions. Results clearly demonstrate that SLIMMER-SN outperformed both PUMA and SLIMMER.

show abstract

“…Route maintenance process is initiated during link failures or disconnections. MANETs' routing protocols may be categorized on the base of topology-based [1,13,18] and position-based [11,10,6,2]. Information transmits in different ways between these protocols over the network depend on many factors.To shrink the consequence of link breakage on the network service leads to enhance the routingperformance.…”

Section: Introductionmentioning

confidence: 99%

LETSRP: A Secure Routing Protocol for Manets

Singh¹,

Rohil²,

Rishi³

et al. 2019

IJEAT

View full text Add to dashboard Cite

Reliable link between the nodes playsvital role during the transmission of data in the routing protocols of Mobile Adhoc Networks (MANETs). In this research paper, a routing protocol Link named Expiration Time based Routing Protocol (LETSRP)is proposed which uses Winternitz One-time Signature Scheme to checkthe authentication of transmitted data in the network. The packet sending node calculates maximum LET (MaxLET), minimum LET (MinLET) and average LET (AvgLET) using greedy algorithm in our proposed solution. The number of sent packets dependson the available bandwidth. Various steps in implementation are repeated until all the packets reach the destination node. Simulations are done with variable number of nodes between10-20 nodes with mobility setting from 10 m/s to 20 m/s.

show abstract

A new link lifetime estimation method for greedy and contention-based routing in mobile ad hoc networks

Cited by 12 publications

References 19 publications

Stable geographic forwarding with link lifetime prediction in mobile adhoc networks for battlefield environment

Stable geographic forwarding with link lifetime prediction in mobile adhoc networks for battlefield environment

Efficient routing in multicast mesh by using forwarding nodes and weighted cost function

LETSRP: A Secure Routing Protocol for Manets

Contact Info

Product

Resources

About