Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Sending messages to mobile users in disconnected ad-hoc wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Scalable routing protocol for ad hoc networks
Wireless Networks
A Secure Routing Protocol for Ad Hoc Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Message Ferrying: Proactive Routing in Highly-Partitioned Wireless Ad Hoc Networks
FTDCS '03 Proceedings of the The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems
Message Relay in Disconnected Ad-Hoc Networks
MobiWac '02 Proceedings of the International Workshop on Mobility and Wireless Access
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Partitioning Avoidance in Mobile Ad Hoc Networks Using Network Survivability Concepts
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Wearable Computers as Packet Transport Mechanisms in Highly-Partitioned Ad-Hoc Networks
ISWC '01 Proceedings of the 5th IEEE International Symposium on Wearable Computers
Connecting Network Partitions with Location-Assisted Forwarding Nodes in Mobile Ad Hoc Environments
PRDC '04 Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC'04)
Voilà: Delivering Messages Across Partitioned Ad-Hoc Networks
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
A Distributed Protocol for Dynamic Address Assignment in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Improving routing distance for geographic multicast with Fermat points in mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Many routing protocols for mobile ad hoc networks assume that the node density of the network is sufficiently high that network partitions do not occur. However, in practice, this assumption is invalid since the mobility and random deployment of the nodes can easily cause partitions to take place. Therefore, this paper develops an approach for identifying suitable helping nodes to carry data packets from one partition to another during geographic routing. Unlike the assisting nodes proposed in previous schemes, the helping nodes are chosen from a group of regular mobile nodes that can move freely throughout the network. In addition, handoff procedures which may be required during the routing trip are implemented. Two mechanisms based on the approach were evaluated using network simulator 2. The evaluation results demonstrate that the algorithm successfully improves successful delivery ratio without needing special assisting nodes and only induces a little more routing overhead and energy consumption to the system.