TY - GEN
T1 - Connecting network partitions with location-assisted forwarding nodes in mobile ad hoc environments
AU - Ou, Chia Ho
AU - Ssu, Kuo Feng
AU - Jiau, Hewijin Christine
PY - 2004
Y1 - 2004
N2 - A mobile ad hoc network consisting of a set of mobile nodes does not have any infrastructure support or central management. Data packets are routed by the mobile nodes in the network instead of base stations. Due to node mobility or geographical limitations, the ad hoc network topology may be partitioned. Data communication and information availability are thus affected. The disconnection problem makes a critical strike on ad hoc routing protocols because most protocols typically assume that the ad hoc network is always connected. This paper describes an approach to recovering the disconnected mobile ad hoc networks by deploying forwarding nodes. The forwarding nodes can automatically move to appropriate locations for interconnecting network partitions. The mechanism is distributed and self-organized and can be integrated with other routing protocols. The mechanism has been implemented in the network simulator ns-2. The simulation results show that the algorithm can efficiently improve information availability and recover network partitions.
AB - A mobile ad hoc network consisting of a set of mobile nodes does not have any infrastructure support or central management. Data packets are routed by the mobile nodes in the network instead of base stations. Due to node mobility or geographical limitations, the ad hoc network topology may be partitioned. Data communication and information availability are thus affected. The disconnection problem makes a critical strike on ad hoc routing protocols because most protocols typically assume that the ad hoc network is always connected. This paper describes an approach to recovering the disconnected mobile ad hoc networks by deploying forwarding nodes. The forwarding nodes can automatically move to appropriate locations for interconnecting network partitions. The mechanism is distributed and self-organized and can be integrated with other routing protocols. The mechanism has been implemented in the network simulator ns-2. The simulation results show that the algorithm can efficiently improve information availability and recover network partitions.
UR - http://www.scopus.com/inward/record.url?scp=2642529379&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=2642529379&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:2642529379
SN - 0769520766
T3 - Proceedings - IEEE Pacific Rim International Symposium on Dependable Computing
SP - 239
EP - 247
BT - Proceedings - 10th IEEE Pacific Rim International Symposium on Dependable Computing
T2 - Proceedings - 10th IEEE Pacific Rim International Symposium on Dependable Computing
Y2 - 3 March 2004 through 5 March 2004
ER -