Random Walks on Regular and Irregular Graphs
SIAM Journal on Discrete Mathematics
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
Simulation-based performance evaluation of routing protocols for mobile ad hoc networks
Mobile Networks and Applications
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
IEEE Internet Computing
Manycast: exploring the space between anycast and multicast in ad hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
Extending network knowledge: making OLSR a quality of service conducive protocol
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Load-Balanced Routing in Wireless Networks: State Information Accuracy Using OLSR
WIMOB '07 Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
The power of choice in random walks: An empirical study
Computer Networks: The International Journal of Computer and Telecommunications Networking
Service discovery in MANET via biased random walks
Proceedings of the 1st international conference on Autonomic computing and communication systems
Diffusion Approximation Model for the Distribution of Packet Travel Time at Sensor Networks
Wireless Systems and Mobility in Next Generation Internet
Location Management Based on the Mobility Patterns of Mobile Users
Wireless Systems and Mobility in Next Generation Internet
Challenges for Routing and Search in Dynamic and Self-organizing Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
| Hi-index | 0.00 |
Search methods in dynamic networks usually cannot rely on a stable topology from which shortest or otherwise optimized paths through the network are derived. When no reliable search indices or routing tables are provided, other methods like flooding or random walks have to be considered to explore the network. These approaches can exploit partially available information on network paths, but the search effort naturally increases with the lack of precise paths due to network dynamics. The problem is especially relevant for wireless technology with strict limitation on power consumption. We compare the efficiency of random walks and flooding for exploring networks of small to medium size. Several scenarios are considered including partial path information support for search. Transient analysis and a bound are applied in order to evaluate the messaging overhead.