A Novel Distributed Index Approach for Service Discovery in MANETs

Efficiently discovering services in terms of diversified service constraints in a dense MANET is a challenging issue. This paper proposes to build a distributed suffix tree on backbone nodes as XML-based services¿ index to provide a concise profile for service descriptions. Moreover, a content-addressable P2P overlay and corresponding fault-tolerance mechanisms are introduced to support the distributed suffix tree and deal with the changes in network topology. In such a way, the precision and recall for service discovery are guaranteed and can also be degraded gracefully in the face of node failures. Experimental results show that our approach can increase at least 30% precision in comparison with existing distributed index solutions, and our newly-added messages for every 100 queries are only 22% as many as the ones of the compared solutions.

[1]  Michael Nidd,et al.  Service discovery in DEAPspace , 2001, IEEE Wirel. Commun..

[2]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[3]  Hai Zhuge,et al.  Distributed Suffix Tree Overlay for Peer-to-Peer Search , 2008, IEEE Transactions on Knowledge and Data Engineering.

[4]  David A. Maltz,et al.  The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4 , 2007, RFC.

[5]  Abdelsalam Helal,et al.  Konark - a service discovery and delivery protocol for ad-hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[6]  Françoise Sailhan,et al.  Scalable Service Discovery for MANET , 2005, Third IEEE International Conference on Pervasive Computing and Communications.

[7]  Peter Sanders,et al.  Linear work suffix array construction , 2006, JACM.

[8]  Lionel M. Ni,et al.  Service discovery in pervasive computing environments , 2005, IEEE Pervasive Computing.

[9]  Timothy W. Finin,et al.  Toward Distributed service discovery in pervasive computing environments , 2006, IEEE Transactions on Mobile Computing.

[10]  Heonshik Shin,et al.  SPIZ: An Effective Service Discovery Protocol for Mobile Ad Hoc Networks , 2007, EURASIP J. Wirel. Commun. Netw..

[11]  Leandros Tassiulas,et al.  Network layer support for service discovery in mobile ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[12]  ChangErnest,et al.  An improved algorithm for decentralized extrema-finding in circular configurations of processes , 1979 .

[13]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[14]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[15]  W. Randolph Franklin.  On an improved algorithm for decentralized extrema finding in circular configurations of processors , 1982, CACM.

[16]  Ernest J. H. Chang,et al.  An improved algorithm for decentralized extrema-finding in circular configurations of processes , 1979, CACM.