Service discovery in MANET via biased random walks

Roberto Berald

1st International ICST Conference on Autonomic Computing and Communication Systems

Research Article

Service discovery in MANET via biased random walks

Download664 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.4108/ICST.AUTONOMICS2007.2208,
    author={Roberto Berald},
    title={Service discovery in MANET via biased random walks},
    proceedings={1st International ICST Conference on Autonomic Computing and Communication Systems},
    publisher={ICST},
    proceedings_a={AUTONOMICS},
    year={2007},
    month={10},
    keywords={},
    doi={10.4108/ICST.AUTONOMICS2007.2208}
}

Roberto Berald
Year: 2007
Service discovery in MANET via biased random walks
AUTONOMICS
ICST
DOI: 10.4108/ICST.AUTONOMICS2007.2208

Roberto Berald¹^,*

1: Dipartimento di Informatica e Sistemistica (DIS) - Via Ariosto, 25, Roma (Italy) University of Rome, “La Sapienza”

*Contact email: beraldi@dis.uniroma1.it

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.

Published: 2007-10-27
Publisher: ICST
Modified: 2011-08-22

: http://dx.doi.org/10.4108/ICST.AUTONOMICS2007.2208