Service discovery in mobile ad hoc networks (MANETs) is a challenging issue. The nodes in a MANETs offer spontaneous and variable connectivity. Also the proximity of a given service as well as the kind and the number of services vary unpredictably with time. Traditional directory based architectural solutions can hardly cope with such a dynamic environment while a directory-less approach has to resort to network-wide searches. Some solutions integrate a Service Discovery Protocol (SDP) with the routing protocol. These can improve performance but still there is need for network wide searches which is a source of inefficiency. There has been lot of work on the problem of service discovery by leveraging on the random walk based search in wired peer-to-peer networks. These works present interesting results that can be useful for MANETs and can be good candidates for SDP, as these methods require fewer resources as compared to SDPs using some sort of flooding. In this paper we have tried to identify some of the open problems in service discovery in MANETs that use random walk

Identifying Open Problems in Random Walk based Service Discovery in Mobile Ad hoc Networks / A., Mian; Beraldi, Roberto; Baldoni, Roberto. - P-165:(2010), pp. 91-102. (Intervento presentato al convegno 10th International Conference on Innovative Internet Community Services tenutosi a Bangkok, Thailand nel 03-05 June 2010).

Identifying Open Problems in Random Walk based Service Discovery in Mobile Ad hoc Networks

BERALDI, ROBERTO;BALDONI, Roberto
2010

Abstract

Service discovery in mobile ad hoc networks (MANETs) is a challenging issue. The nodes in a MANETs offer spontaneous and variable connectivity. Also the proximity of a given service as well as the kind and the number of services vary unpredictably with time. Traditional directory based architectural solutions can hardly cope with such a dynamic environment while a directory-less approach has to resort to network-wide searches. Some solutions integrate a Service Discovery Protocol (SDP) with the routing protocol. These can improve performance but still there is need for network wide searches which is a source of inefficiency. There has been lot of work on the problem of service discovery by leveraging on the random walk based search in wired peer-to-peer networks. These works present interesting results that can be useful for MANETs and can be good candidates for SDP, as these methods require fewer resources as compared to SDPs using some sort of flooding. In this paper we have tried to identify some of the open problems in service discovery in MANETs that use random walk
2010
10th International Conference on Innovative Internet Community Services
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Identifying Open Problems in Random Walk based Service Discovery in Mobile Ad hoc Networks / A., Mian; Beraldi, Roberto; Baldoni, Roberto. - P-165:(2010), pp. 91-102. (Intervento presentato al convegno 10th International Conference on Innovative Internet Community Services tenutosi a Bangkok, Thailand nel 03-05 June 2010).
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/212477
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact