Home > Research > Publications & Outputs > A New Link Lifetime Prediction Method for Greed...

Research

Associated organisational units

Links

Text available via DOI:

View graph of relations

A New Link Lifetime Prediction Method for Greedy and Contention-based Routing in Mobile Ad Hoc Networks

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

A New Link Lifetime Prediction Method for Greedy and Contention-based Routing in Mobile Ad Hoc Networks. / Noureddine, H.; Ni, Q.; Min, G. et al.
Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on. IEEE, 2010. p. 2662-2667.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Noureddine, H, Ni, Q, Min, G & Al-Raweshidy, H 2010, A New Link Lifetime Prediction Method for Greedy and Contention-based Routing in Mobile Ad Hoc Networks. in Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on. IEEE, pp. 2662-2667. https://doi.org/10.1109/CIT.2010.448

APA

Noureddine, H., Ni, Q., Min, G., & Al-Raweshidy, H. (2010). A New Link Lifetime Prediction Method for Greedy and Contention-based Routing in Mobile Ad Hoc Networks. In Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on (pp. 2662-2667). IEEE. https://doi.org/10.1109/CIT.2010.448

Vancouver

Noureddine H, Ni Q, Min G, Al-Raweshidy H. A New Link Lifetime Prediction Method for Greedy and Contention-based Routing in Mobile Ad Hoc Networks. In Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on. IEEE. 2010. p. 2662-2667 doi: 10.1109/CIT.2010.448

Author

Noureddine, H. ; Ni, Q. ; Min, G. et al. / A New Link Lifetime Prediction Method for Greedy and Contention-based Routing in Mobile Ad Hoc Networks. Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on. IEEE, 2010. pp. 2662-2667

Bibtex

@inproceedings{0b0ca244d6a34f149a4f6ea1e5b0828a,
title = "A New Link Lifetime Prediction Method for Greedy and Contention-based Routing in Mobile Ad Hoc Networks",
abstract = "Greedy and Contention-based forwarding schemes perform data routing hop-by-hop, without discovering 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, the neighboring node and the destination. In this paper, we propose a new link lifetime prediction method for greedy and contention-based routing. 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 lifetime.",
author = "H. Noureddine and Q. Ni and G. Min and H. Al-Raweshidy",
year = "2010",
doi = "10.1109/CIT.2010.448",
language = "English",
isbn = "978-1-4244-7547-6",
pages = "2662--2667",
booktitle = "Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - A New Link Lifetime Prediction Method for Greedy and Contention-based Routing in Mobile Ad Hoc Networks

AU - Noureddine, H.

AU - Ni, Q.

AU - Min, G.

AU - Al-Raweshidy, H.

PY - 2010

Y1 - 2010

N2 - Greedy and Contention-based forwarding schemes perform data routing hop-by-hop, without discovering 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, the neighboring node and the destination. In this paper, we propose a new link lifetime prediction method for greedy and contention-based routing. 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 lifetime.

AB - Greedy and Contention-based forwarding schemes perform data routing hop-by-hop, without discovering 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, the neighboring node and the destination. In this paper, we propose a new link lifetime prediction method for greedy and contention-based routing. 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 lifetime.

U2 - 10.1109/CIT.2010.448

DO - 10.1109/CIT.2010.448

M3 - Conference contribution/Paper

SN - 978-1-4244-7547-6

SP - 2662

EP - 2667

BT - Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on

PB - IEEE

ER -