Randomized algorithms
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual 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
SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Gossip versus Deterministic Flooding: Low Message Overhead and High Reliability for Broadcasting on Small Networks
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Data-centric storage in sensornets with GHT, a geographic hash table
Mobile Networks and Applications
On the effect of localization errors on geographic face routing in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Localization and routing in sensor networks by local angle information
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Locating and bypassing holes in sensor networks
Mobile Networks and Applications
Delay and capacity trade-offs in mobile ad hoc networks: a global perspective
IEEE/ACM Transactions on Networking (TON)
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Communications Magazine
| Hi-index | 754.84 |
Geographic routing with greedy relaying strategies are important routing schemes in sensor networks. These schemes assume that the nodes have perfect information about the location of the destination. When the destination is unit distance away, the asymptotic routing delays are Θ(1/M(n)), where M(n) is the maximum distance traveled in one hop (transmission range). We consider three scenarios where: i) nodes have location errors (imprecise GPS); ii) only coarse geographic information about the destination is available, e.g., the quadrant in which the destination is located; and iii) only a small fraction of the nodes have routing information. In this paper, we show that even with such limited destination-location information, the routing delays are Θ(1/M(n)), and validate our analysis with simulations. Finally, we consider the throughput-capacity of networks with progressive routing strategies that take packets closer to the destination in every step, but not necessarily along a straight-line. While such a routing strategy could lead to spatial "hotspots" due to the suboptimal flows nonuniformly loading the network, we show that the effect of hot spots due to progressive routing does not reduce the network throughput-capacity in an order sense, i.e., is order-wise the same as the maximum achievable throughput-capacity.