Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
IEEE Transactions on Parallel and Distributed Systems
Power optimization in routing protocols for wireless and mobile networks
Handbook of wireless networks and mobile computing
Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Electric-field-based routing: a reliable framework for routing in MANETs
ACM SIGMOBILE Mobile Computing and Communications Review
Integrating heterogeneous wireless technologies: a cellular aided mobile Ad Hoc network (CAMA)
Mobile Networks and Applications
Low latency wireless ad hoc networking: power and bandwidth challenges and a solution
IEEE/ACM Transactions on Networking (TON)
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Spectrum-aware routing protocol for cognitive ad-hoc networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Distributed resource sharing in low-latency wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In this paper we propose four schemes that improve the performance of greedy routing method. In the alternate method, the i-th received copy of message m is forwarded to i-th best neighbor, according to the selected criterion (it fails if number of copies exceeds number of neighbors). In the disjoint method, each intermediate node, upon receiving m, will forward it to its best neighbor among those who never received the message (it fails if no such neighbor exists). In the multi-path method, the source node S forwards m to c best neighbors according to distance from D. Each of c created copies afterwards follows the original, alternate, or disjoint method (these copies may interact since copy numbers are not communicated). Component routing method follows original greedy method until a failure node F. Such node F forwards the message to one node (using distance criteria) in each connected component of its neighbors, and then withdraws from the network for that message m (that is, neighboring nodes will ignore F when forwarding further copies of m). Thus F creates c copies of the message, where c is the number of connected components in the subgraph of its neighbors. All proposed methods are loop-free, have improved delivery rate over greedy method and reduced flooding rates compared to other existing methods. Component routing method guarantees delivery of m in connected graphs (even if the location of D is inaccurate).