A channel access scheme for large dense packet radio networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
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
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
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
Message traffic control capabilities of the R-DSDV protocol in mobile ad hoc networks
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Handbook of wireless networks and mobile computing
Broadcast scheduling for TDMA in wireless multihop networks
Handbook of wireless networks and mobile computing
Routing with guaranteed delivery in geometric and wireless networks
Handbook of wireless networks and mobile computing
Location updates for efficient routing in ad hoc networks
Handbook of wireless networks and mobile computing
Analysis of a randomized congestion control scheme with DSDV routing in ad Hoc wireless networks
Journal of Parallel and Distributed Computing - Special issue on wireless networks
Mobile ad hoc networking and the IETF
ACM SIGMOBILE Mobile Computing and Communications Review
RNG and internal node based broadcasting algorithms for wireless one-to-one networks
ACM SIGMOBILE Mobile Computing and Communications Review
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
An Extended Dynamic Source Routing Scheme in Ad Hoc Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Power and Cost Aware Localized Routing with Guaranteed Delivery in Wireless Networks
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
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
Routing and multicasting strategies in wireless mobile ad hoc networks
Routing and multicasting strategies in wireless mobile ad hoc networks
Voronoi diagram and convex hull based geocasting and routing in wireless networks: Research Articles
Wireless Communications & Mobile Computing - Special Issue on Ad Hoc Wireless Networks
MuSeQoR: multi-path failure-tolerant security-aware QoS routing in ad hoc wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Location verification and trust management for resilient geographic routing
Journal of Parallel and Distributed Computing
Local solutions for global problems in wireless networks
Journal of Discrete Algorithms
Performance evaluation and comparison of different ad hoc routing protocols
Computer Communications
MuSeQoR: Multi-path failure-tolerant security-aware QoS routing in Ad hoc wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy efficient collision aware multipath routing for wireless sensor networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Some problems in distributed computational geometry
Theoretical Computer Science
Enhancing TCP congestion control for improved performance in wireless networks
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Hi-index | 0.00 |
Recently, several fully distributed (localized) location-based routing protocols for a mobile ad hoc network were reported in literature. They are variations of directional (DIR), geographic distance (GEDIR) or progress-based (MFR) routing methods. In DIR methods, each node A (the source or intermediate node) transmits a message m to several neighbors whose direction is closest to the direction of D. In MFR (most forward progress within radius), and GEDIR (GEographic Distance Routing) methods, when node A wants to send m to node D, it forwards m to its neighbor C whose projection or distance (respectively) is closest to D among all neighbors of A. The same procedure is repeated until D, if possible, is eventually reached. In this paper, we introduce three variants of multiple path c-GEDIR, c-DIR and c-MFR methods, in which m is initially sent to c best neighbors according to corresponding criterion, and afterwards, on intermediate nodes, it is forwarded to only the best neighbor. In the original c-path method, only the first received copy at intermediate nodes is forwarded to the best neighbor. In the alternate c-path method, the i th received copy is forwarded to i the best neighbor, according to the selected criterion. In the disjoint c-path method, each intermediate node, upon receiving the message, will forward it to its best neighbor among those who never received the message (thus, in effect, the methods attempts to create c disjoint paths). The simulation experiments with random graphs show that disjoint multiple path methods provide high success rates, and small hop counts for small values of c. They also have reduced flooding rates compared to the best existing multiple-path methods and/or methods that require memorizing past traffic, such as recently proposed LAR2, f-GEDIR, and DFS based routing, and can serve as a basis for scalable QoS routing in wireless networks.