GeoCast—geographic addressing and routing
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Hierarchically-organized, multihop mobile wireless networks for quality-of-service support
Mobile Networks and Applications - Special issue: mobile multimedia communications
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
The broadcast storm problem in a mobile ad hoc network
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
Computer Networks: The International Journal of Computer and Telecommunications Networking
Making link-state routing scale for ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
GeoTORA: a protocol for geocasting in mobile ad hoc networks
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Weak state routing for large scale dynamic networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Random walk based routing protocol for wireless sensor networks
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Hi-index | 0.01 |
The majority of the routing protocols designed and implemented to date for mobile ad hoc networks (MANET) rely on flooding of route requests for the establishment of routes on demand, flooding of topology information, or the hop-by-hop dissemination of distances or paths for each destination. The signaling overhead incurred with these strategies consumes excessive amounts of the scarce bandwidth available in a MANET as the number of nodes and the number of information flows increase. We introduce Dircast as an alternative for routing in MANETs. Dircast assumes that each node knows its own geographical coordinates and the geometry of the terrain in which the network is deployed. To find the route to a destination, a node selects a limited number of relays to forward a route request mesage based on their coordinates and the boundary vertices of the terrain if the prior location of the destinartion is unknown, or based on the prior location of the destination if it is known. If the destination is reached, a route reply is sent back to the source containing its coordinates. We compare Dircast with OLSR and AODV, which are representatives of traditional proactive and on-demand routing approaches in MANETs, and show that Dircast attains much lower routing overhead, which also leads to better delivery rates and shorter end-to-end delays.