12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > A New Link Lifetime Prediction Method for Greed...
View graph of relations

« Back

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

Research output: Contribution in Book/Report/ProceedingsPaper

Published

  • H. Noureddine
  • Q. Ni
  • G. Min
  • H. Al-Raweshidy
Publication date2010
Host publicationComputer and Information Technology (CIT), 2010 IEEE 10th International Conference on
PublisherIEEE
Pages2662-2667
Number of pages6
ISBN (Print)978-1-4244-7547-6
Original languageEnglish

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.