Challenges for Routing and Search in Dynamic and Self-organizing Networks

Authors:
Gerhard Hasslinger;Thomas Kunz
Affiliations:
T-Systems, Darmstadt, Germany D-64295;Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada
Venue:
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Year:
2009

Citing 13
Cited 2

Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
Rumor routing algorthim for sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Mapping the Gnutella Network

IEEE Internet Computing
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
Efficiency of random walks for search in different network structures

Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Service discovery in MANET via biased random walks

Proceedings of the 1st international conference on Autonomic computing and communication systems
A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Cross-Layer Aspects of Peer-to-Peer Overlays on IP Platforms of Network Providers

P2P '08 Proceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing
Efficiency of Search Methods in Dynamic Wireless Networks

Wireless Systems and Mobility in Next Generation Internet

Traffic engineering supported by inherent network management: analysis of resource efficiency and cost saving potential

International Journal of Network Management
Flexible traffic engineering in full mesh networks: analysis of the gain in throughput and cost savings

ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Search methods in self-organizing networks usually cannot rely on stable topology from which shortest or otherwise optimized paths through the network are derived. When no reliable search indices or routing tables are available, other methods like flooding or random walks have to be considered to explore the network. These approaches can exploit partial knowledge in the network to reach a destination, but the search effort naturally increases with the lack of precise paths due to network dynamics. This problem is especially relevant for wireless technology with strict limitation on power consumption/ We address the efficiency of random walks and flooding for exploring networks based on case studies evaluated by simulation and transient analysis. In this way, performance tradeoffs are demonstrated when combining shortest path routing with randomized techniques.