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
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
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
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
Mobile ad hoc networking and the IETF
ACM SIGMOBILE Mobile Computing and Communications Review
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
A Novel Routing Algorithm for Ad Hoc Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Power-Aware Localized Routing in Wireless Networks
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
IEEE Transactions on Parallel and Distributed Systems
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Geographical Region Summary Service for geographical routing
ACM SIGMOBILE Mobile Computing and Communications Review
Location updates for efficient routing in ad hoc networks
Handbook of wireless networks and mobile computing
Location-based localized alternate, disjoint and multi-path routing algorithms for wireless networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
LABAR: Location Area Based Ad Hoc Routing for GPS-Scarce Wide-Area Ad Hoc Networks
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Position-based ad hoc routes in ad hoc networks
The handbook of ad hoc wireless networks
A Novel QoS Multicast Model in Mobile Ad Hoc Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09
AO2P: Ad Hoc On-Demand Position-Based Private Routing Protocol
IEEE Transactions on Mobile Computing
A new distributed QoS routing algorithm based on Fano's method
Computer Networks and ISDN Systems
Boundary Mapping and Boundary-State Routing (BSR) in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Efficient and robust query processing for mobile wireless sensor networks
International Journal of Sensor Networks
A scalable quorum-based location service in ad hoc and sensor networks
International Journal of Communication Networks and Distributed Systems
Poster abstract: force-based geometric routing
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Depth First Search-based and power-aware geo-routing in ad hoc and sensor wireless networks
International Journal of Autonomous and Adaptive Communications Systems
A new distributed QoS routing algorithm based on Fano's method
Computer Networks: The International Journal of Computer and Telecommunications Networking
Battery-aware depth-first search routing for streaming data transmissions in WSNs
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Efficient implementations of all-to-all broadcasting in mobile ad hoc networks
Pervasive and Mobile Computing
Minimizing recovery overhead in geographic ad hoc routing
Computer Communications
Adaptive geographic routing in wireless sensor networks
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
A distributed routing algorithm for sensor networks derived from macroscopic models
Computer Networks: The International Journal of Computer and Telecommunications Networking
A geographic routing hybrid approach for void resolution in wireless sensor networks
Journal of Systems and Software
MANET location prediction using machine learning algorithms
WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
Low resolution grid mapping approach for geographic routing
International Journal of Mobile Communications
Hi-index | 0.00 |
In a localized routing algorithm, node A currently holding the message forwards it based on the location of itself, its neighboring nodes and destination. We propose to use depth first search (DFS) method for routing decisions. Each node A, upon receiving the message for the first time, sorts all its neighbors according to a criteria, such as their distance to destination, and uses that order in DFS algorithm. It is the first localized algorithm that guarantees delivery for (connected) wireless networks modeled by arbitrary graphs, including inaccurate location information. We then propose the first localized QoS routing algorithm for wireless networks. It performs DFS routing algorithm after edges with insufficient bandwidth or insufficient connection time are deleted from the graph, and attempts to minimize hop count. This is also the first paper to apply GPS in QoS routing decisions, and to consider the connection time (estimated lifetime of a link) as a QoS criterion. The average length of measured QoS path in our experiments, obtained by DFS method, was between 1 and 1.34 times longer than the length of QoS path obtained by shortest path algorithm. Applying the concept of internal nodes considerably reduces the overhead.