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
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
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Ad hoc multicast routing algorithm with swarm intelligence
Mobile Networks and Applications
Geographic routing with limited information in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Lattice green functions and diffusion for modeling traffic routing in ad hoc networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Analysis of latency of stateless opportunistic forwarding in intermittently connected networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
In this paper, we study the problem of searching for a node or a piece of data in an ad hoc network using random packet forwarding. In particular, we examine three different methods. The first is a random direction forwarding scheme where the query packet is forwarded along a randomly chosen direction (following an approximate straight line) till it either hits the destination node (the target) or the boundary. It bounces off the boundary in the latter case and the process continues till the target is found. In the second approach, in addition to query packet traversing the network, the target releases an advertisement packet that propagates along a randomly chosen direction so that all nodes visited by the advertisement packet obtain and store the target location information. In the third method the query packet is assumed to follow a random walk type of forwarding. Our primary interest is in comparing the average hitting time under these methods and the memory required to store location information. In particular, we show that under the random direction forwarding the target hitting time is @Qa^2b, where a and b denote the size/radii of the network and the target area, assumed to be circular in shape, respectively. The hitting time is @Q(a) with target advertisement, and @Qa^2logab under the random walk type of forwarding. We further show that the target advertisement method achieves mean hitting time on the same order as greedy forwarding schemes with less memory requirement. We compare this class of schemes with the family of Levy walks and provide simulation results on their performance under more realistic settings.