Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
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
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Graph Algorithms
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Introduction to Algorithms
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & 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
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Virtual ring routing: network routing inspired by DHTs
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 12th annual international conference on Mobile computing and networking
Geographic routing made practical
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Geographic routing without planarization
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Routing in Ad Hoc Networks of Mobile Hosts
WMCSA '94 Proceedings of the 1994 First Workshop on Mobile Computing Systems and Applications
Centroid virtual coordinates - A novel near-shortest path routing paradigm
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computer Networking: A Top-Down Approach
Computer Networking: A Top-Down Approach
DBR: depth-based routing for underwater sensor networks
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Localized Delaunay triangulation with application in ad hoc wireless networks
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
3-D aerial and underwater sensor networks have found various applications in natural habitat monitoring, weather/earthquake forecast, terrorist intrusion detection, and homeland security. The resource-constrained and dynamic nature of such networks has made the stateless routing protocol with only local information a preferable choice. However, most of the existing routing protocols require sensor nodes to either proactively maintain the state information or flood the network from time to time. The existing stateless geometric routing protocols either fail to work in 3-D environments or have tendency to produce lengthy paths. In this paper, we propose a novel routing protocol, namely Geometric STAteless Routing (G-STAR) for 3-D networks. The main idea of G-STAR is to distributively build a location-based tree and find a path dynamically. G-STAR not only generalizes the notion of geographic routing from two modes to one mode, but also guarantees packet delivery even when the location information of some nodes is either inaccurate or simply unavailable regardless of the uses of virtual coordinates. In addition, we develop a light-weight path pruning algorithm, namely Branch Pruning (BP), that can be combined with G-STAR to enhance the routing performance with very little overhead. The extensive simulation results by ns-2 have shown that the proposed routing protocols perform significantly better than the existing 3-D geometric routing protocols in terms of delivery rate with competitive hop stretch. We conclude that the proposed protocols serve as a strong candidate for future high-dimensional sensor networks.