Title
Author
Year
Volume
:
2024
Vol. 1
no. 1
Vol. 2
2023
Vol. 1
no. 1
no. 2
2022
Vol. 1
no. 1
2021
Vol. 1
no. 1
2019
Vol. 1
no. 1
no. 2
2013
Vol. 1
no. 1
Vol. 2
no. 1
2011
Vol. 1
no. 1
Vol. 2
no. 1
2010
Vol. 1
no. 1
no. 2
Vol. 2
Vol. 0
Vol. 1
Collision Resistant Temporally Ordered Routing Algorithm
Pages
:
1-8
Vinay Thotakura, Mahalingam Ramkumar
A broad class of mobile ad hoc network (MANET) applications will require every mobile node in a connected subnet to establish persistent paths with a single sink or gateway or command-post. Temporally ordered routing algorithm (TORA) is the only MANET routing protocol which has been explicitly designed to facilitate such a requirement. However, TORA has several shortcomings like i) the need for an expensive lower layer, the Internet MANET Encapsulation protocol (IMEP); and ii) substantial overhead in scenarios involving subnet partitions. We propose a novel protocol, collision-resistant TORA (CR-TORA), which is also designed to meet the same goal as TORA, viz., to lower overhead for establishing persistent paths from all nodes to a destination. However, CR-TORA overcomes the shortcomings of TORA. Simulations show that for the intended application scenario CR-TORA demands lower number of total packets to be transmitted to realize higher data packet throughput, with lower latency.
Home
|
Aims and scopes
|
Editorial board
|
Published issues
|
Instruction for authors
