TY - GEN
T1 - M-TORA
T2 - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
AU - Liu, Qiang
AU - Wang, Hua
AU - Kuang, Jingming
AU - Wang, Zheng
AU - Bi, Zhiming
PY - 2006
Y1 - 2006
N2 - In this paper we present M-TORA, a new multi-path routing protocol based on Temporally-Ordered Routing Algorithm (TORA) for mobile ad hoc networks (MANETs). Although TORA is a highly adaptive distributed routing algorithm, it can not make the most use of multiple paths which are already built and maintained in the process of route creation. We designed M-TORA for unleashing the potential power of multiple paths and optimizing performance of classical TORA. According to the modification of Internet MANET Encapsulation Protocol (IMEP), a node can spread its MAC layer information to its neighbors. The MAC information and the route hop count will be used in the calculation of route selection probability when a node has multiple paths to the destination. By using the probability routing algorithm, M-TORA can spread the network overload to multiple routing paths, which will lead to automatic load balancing. In simulation based on OPNET we show that M-TORA can outperform classical TORA in decreasing packet end-to-end delay, improving network packet delivery ratio and achieving fair node's local energy consumption.
AB - In this paper we present M-TORA, a new multi-path routing protocol based on Temporally-Ordered Routing Algorithm (TORA) for mobile ad hoc networks (MANETs). Although TORA is a highly adaptive distributed routing algorithm, it can not make the most use of multiple paths which are already built and maintained in the process of route creation. We designed M-TORA for unleashing the potential power of multiple paths and optimizing performance of classical TORA. According to the modification of Internet MANET Encapsulation Protocol (IMEP), a node can spread its MAC layer information to its neighbors. The MAC information and the route hop count will be used in the calculation of route selection probability when a node has multiple paths to the destination. By using the probability routing algorithm, M-TORA can spread the network overload to multiple routing paths, which will lead to automatic load balancing. In simulation based on OPNET we show that M-TORA can outperform classical TORA in decreasing packet end-to-end delay, improving network packet delivery ratio and achieving fair node's local energy consumption.
UR - http://www.scopus.com/inward/record.url?scp=50949121706&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2006.1006
DO - 10.1109/GLOCOM.2006.1006
M3 - Conference contribution
AN - SCOPUS:50949121706
SN - 142440357X
SN - 9781424403578
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
Y2 - 27 November 2006 through 1 December 2006
ER -
