Service discovery in MANET via biased random walks

Authors:
Roberto Beraldi
Affiliations:
University of Rome, "La Sapienza"
Venue:
Proceedings of the 1st international conference on Autonomic computing and communication systems
Year:
2007

Citing 5
Cited 2

Evaluation of Service Discovery Architectures for Mobile Ad Hoc Networks

WONS '05 Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services
Scalable Service Discovery for MANET

PERCOM '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications
Perfect Simulations for Random Trip Mobility Models

ANSS '05 Proceedings of the 38th annual Symposium on Simulation
Distributed Systems: Concepts and Design (4th Edition) (International Computer Science)

Distributed Systems: Concepts and Design (4th Edition) (International Computer Science)
Service discovery in mobile ad hoc networks: A field theoretic approach

Pervasive and Mobile Computing

Efficiency of Search Methods in Dynamic Wireless Networks

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we tackle the problem of service discovery in mobile wireless networks by exploiting an informed random walk based search, which is implemented directly atop the data link layer. The algorithm can be used both to discover a service and route data packets back to the requesting node, without any routing layer support. The information driving a search consists of the estimated distance of nodes from a service and the previously visited nodes. The suitability of the approach is shown through simulations and supported by an analytical model.