TY - GEN
T1 - Neighbor stability routing in MANETs
AU - Chen, Lei
AU - Lee, Chung-wei
PY - 2005
Y1 - 2005
N2 - Mobile ad hoc networks (MANETs) are characterized by wireless connectivity through multi-hops, frequently changing network topology among wireless mobile devices. These characteristics require routing algorithms to be dynamic and adaptive to constantly changing environments. In this paper, we describe a new routing algorithm which is based on the cumulative relative stability among neighbor mobile nodes. This NSR (neighbor stability routing) algorithm selects the most historically and accumulatively stable mobile nodes to form a path between the source node and destination node. The relative stability is then propagated from the collective data by all the nodes along a path. The cumulative collective data, or stability factor, reflects the historical neighborhood stability among neighbors. When a node or segment on the path is down, NSR will dynamically find an alternative most stable path. In simulation, our NSR algorithm outperforms some major ad hoc routing protocols such as AODV and DSR in packet delivery ratio and number of paths rerouted. NSR also handles some issues such as group node mobility and temporary node unavailability well.
AB - Mobile ad hoc networks (MANETs) are characterized by wireless connectivity through multi-hops, frequently changing network topology among wireless mobile devices. These characteristics require routing algorithms to be dynamic and adaptive to constantly changing environments. In this paper, we describe a new routing algorithm which is based on the cumulative relative stability among neighbor mobile nodes. This NSR (neighbor stability routing) algorithm selects the most historically and accumulatively stable mobile nodes to form a path between the source node and destination node. The relative stability is then propagated from the collective data by all the nodes along a path. The cumulative collective data, or stability factor, reflects the historical neighborhood stability among neighbors. When a node or segment on the path is down, NSR will dynamically find an alternative most stable path. In simulation, our NSR algorithm outperforms some major ad hoc routing protocols such as AODV and DSR in packet delivery ratio and number of paths rerouted. NSR also handles some issues such as group node mobility and temporary node unavailability well.
UR - https://www.scopus.com/pages/publications/24944520460
U2 - 10.1109/WCNC.2005.1424820
DO - 10.1109/WCNC.2005.1424820
M3 - Conference article
SN - 0780389662
T3 - IEEE Wireless Communications and Networking Conference, WCNC
SP - 1964
EP - 1969
BT - 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005
T2 - 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off
Y2 - 13 March 2005 through 17 March 2005
ER -