A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Link Stability and Route Lifetime in Ad-hoc Wireless Networks
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
A Pseudo-Distance Routing (PDR) Algorithm for Mobile Ad-hoc Networks
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A QoS routing protocol for mobile ad hoc networks based on a reservation pool
SEUS'07 Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems
Route Stability Based QoS Routing in Mobile Ad Hoc Networks
Wireless Personal Communications: An International Journal
A cross-layer stability-based routing mechanism for ultra wideband networks
Computer Communications
Hi-index | 0.00 |
When using shortest-distance routing for mobile ad-hoc networks (MANETs), the physical distances of links that constitute such paths tend to be very long since this leads to fewer hops between source and destination nodes. However, if the physical distance of a wireless link becomes so long that it approaches its transmission range, packet transmission error rates can increase drastically, resulting in an unstable link. Furthermore, packets are more likely to be lost due to external environment factors such as white noise and wireless interference if the signal strength is not strong enough. Therefore, it would be desirable for routing algorithms for MANETs to be able to select paths that are more likely to be stable. With this objective in mind, we propose an enhanced stability model (ESM) to estimate link stability based on signal strength. A routing algorithm based on this new model is also proposed. Simulations of the proposed ESM and previous link estimation models validate the superiority of the proposed approach. Simulations also show that the proposed routing algorithm performs particularly well when there are unreliable links