Home > Research > Publications & Outputs > A new link lifetime estimation method for greed...

Research

Associated organisational units

Links

Text available via DOI:

Keywords

View graph of relations

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

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

A new link lifetime estimation method for greedy and contention-based routing in mobile ad hoc networks. / Noureddine, Hadi; Ni, Qiang; Min, Geyong et al.
In: Telecommunication Systems, Vol. 55, No. 3, 03.2014, p. 421-433.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Noureddine, H, Ni, Q, Min, G & Al-raweshidy, H 2014, 'A new link lifetime estimation method for greedy and contention-based routing in mobile ad hoc networks', Telecommunication Systems, vol. 55, no. 3, pp. 421-433. https://doi.org/10.1007/s11235-013-9796-9

APA

Noureddine, H., Ni, Q., Min, G., & Al-raweshidy, H. (2014). A new link lifetime estimation method for greedy and contention-based routing in mobile ad hoc networks. Telecommunication Systems, 55(3), 421-433. https://doi.org/10.1007/s11235-013-9796-9

Vancouver

Noureddine H, Ni Q, Min G, Al-raweshidy H. A new link lifetime estimation method for greedy and contention-based routing in mobile ad hoc networks. Telecommunication Systems. 2014 Mar;55(3):421-433. Epub 2013 Aug 1. doi: 10.1007/s11235-013-9796-9

Author

Noureddine, Hadi ; Ni, Qiang ; Min, Geyong et al. / A new link lifetime estimation method for greedy and contention-based routing in mobile ad hoc networks. In: Telecommunication Systems. 2014 ; Vol. 55, No. 3. pp. 421-433.

Bibtex

@article{0cf813baed25437cbd3b11ba6a21063d,
title = "A new link lifetime estimation method for greedy and contention-based routing in mobile ad hoc networks",
abstract = "Greedy and contention-based forwarding schemes were proposed for mobile ad hoc networks (MANETs) to perform data routing hop-by-hop, without prior discovery of the end-to-end route to the destination. Accordingly, the neighboring node that satisfies specific criteria is selected as the next forwarder of the packet. Both schemes require the nodes participating in the selection process to be within the area that confronts the location of the destination. Therefore, the lifetime of links for such schemes is not only dependent on the transmission range, but also on the location parameters (position, speed and direction) of the sending node and the neighboring node as well as the destination. In this paper, we propose a new link lifetime prediction method for greedy and contention-based routing which can also be utilized as a new stability metric. The evaluation of the proposed method is conducted by the use of stability-based greedy routing algorithm, which selects the next hop node having the highest link stability.",
keywords = "MANET, Link lifetime estimation, Greedy forwarding, Contention-based routing, Link stability, Stability based routing",
author = "Hadi Noureddine and Qiang Ni and Geyong Min and Hamed Al-raweshidy",
year = "2014",
month = mar,
doi = "10.1007/s11235-013-9796-9",
language = "English",
volume = "55",
pages = "421--433",
journal = "Telecommunication Systems",
issn = "1018-4864",
publisher = "Springer Netherlands",
number = "3",

}

RIS

TY - JOUR

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

AU - Noureddine, Hadi

AU - Ni, Qiang

AU - Min, Geyong

AU - Al-raweshidy, Hamed

PY - 2014/3

Y1 - 2014/3

N2 - Greedy and contention-based forwarding schemes were proposed for mobile ad hoc networks (MANETs) to perform data routing hop-by-hop, without prior discovery of the end-to-end route to the destination. Accordingly, the neighboring node that satisfies specific criteria is selected as the next forwarder of the packet. Both schemes require the nodes participating in the selection process to be within the area that confronts the location of the destination. Therefore, the lifetime of links for such schemes is not only dependent on the transmission range, but also on the location parameters (position, speed and direction) of the sending node and the neighboring node as well as the destination. In this paper, we propose a new link lifetime prediction method for greedy and contention-based routing which can also be utilized as a new stability metric. The evaluation of the proposed method is conducted by the use of stability-based greedy routing algorithm, which selects the next hop node having the highest link stability.

AB - Greedy and contention-based forwarding schemes were proposed for mobile ad hoc networks (MANETs) to perform data routing hop-by-hop, without prior discovery of the end-to-end route to the destination. Accordingly, the neighboring node that satisfies specific criteria is selected as the next forwarder of the packet. Both schemes require the nodes participating in the selection process to be within the area that confronts the location of the destination. Therefore, the lifetime of links for such schemes is not only dependent on the transmission range, but also on the location parameters (position, speed and direction) of the sending node and the neighboring node as well as the destination. In this paper, we propose a new link lifetime prediction method for greedy and contention-based routing which can also be utilized as a new stability metric. The evaluation of the proposed method is conducted by the use of stability-based greedy routing algorithm, which selects the next hop node having the highest link stability.

KW - MANET

KW - Link lifetime estimation

KW - Greedy forwarding

KW - Contention-based routing

KW - Link stability

KW - Stability based routing

U2 - 10.1007/s11235-013-9796-9

DO - 10.1007/s11235-013-9796-9

M3 - Journal article

VL - 55

SP - 421

EP - 433

JO - Telecommunication Systems

JF - Telecommunication Systems

SN - 1018-4864

IS - 3

ER -