K-directory community: Reliable service discovery in MANET

Ensuring service availability is a key fault tolerance issue in service discovery for mobile ad hoc networks (MANET). Availability can be affected by sudden failure of service providers or directory nodes or even by network disconnection due to node mobility. So, to ensure network-wide service availability, services must be replicated cautiously, so that, the storage, update and discovery costs can be minimized. Achieving service availability in a resource efficient manner is both desirable and challenging in MANET. Existing works have not addressed these issues adequately. In this paper, we propose a distributed directory-based service discovery protocol (SDP) for MANET which works by electing the top K directory nodes considering rich resources. Resource-based election ensures high reliability for the directory nodes. The community of directory nodes then divides itself into multiple quorums. Services registered with a directory are replicated among its quorum members. This approach, while controlling replication and update costs, can guarantee network-wide service availability by the quorum intersection property. To further reduce the service discovery cost, we divide the entire network into one or more tree-structured domains. Since, the K-directory community is the heart of our approach, to keep the directory community intact, we consider substituting failed directories using an incremental election policy. Our protocol can also cope with dynamic and frequent topological changes caused by network partitioning as well as partition merges. To evaluate the performance of our proposed protocol, we have conducted extensive simulations and developed a prototype system. The results show that, compared with similar works, our protocol significantly reduces message cost and discovery delay, while improving system robustness.

[1]  Antony Rowstron,et al.  Virtual ring routing: network routing inspired by DHTs , 2006, SIGCOMM 2006.

[2]  Ge-Ming Chiu,et al.  A New Quorum-Based Scheme for Managing Replicated Data in Distributed Systems , 2002, IEEE Trans. Computers.

[3]  Himabindu Pucha,et al.  Ekta: an efficient DHT substrate for distributed applications in mobile ad hoc networks , 2004, Sixth IEEE Workshop on Mobile Computing Systems and Applications.

[4]  Tomasz Imielinski,et al.  Designing distributed algorithms for mobile computing networks , 1996, Comput. Commun..

[5]  Franca Delmastro From Pastry to CrossROAD: CROSS-layer ring overlay for ad hoc networks , 2005, Third IEEE International Conference on Pervasive Computing and Communications Workshops.

[6]  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..

[7]  David E. Culler,et al.  The Emergence of Networking Abstractions and Techniques in TinyOS , 2004, NSDI.

[8]  John Zahorjan,et al.  The challenges of mobile computing , 1994, Computer.

[9]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[10]  David A. Maltz,et al.  DSR: the dynamic source routing protocol for multihop wireless ad hoc networks , 2001 .

[11]  Jin-Soo Kim,et al.  Proximity-Based Overlay Routing for Service Discovery in Mobile Ad Hoc Networks , 2004, ISCIS.

[12]  MADPastry : A DHT Substrate for Practicably Sized MANETs , 2010 .

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

[14]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[15]  Qusay H. Mahmoud,et al.  A Comprehensive Service Discovery Solution for Mobile Ad Hoc Networks , 2005, Mob. Networks Appl..

[16]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[17]  Anupam Joshi,et al.  Towards Distributed Service Discovery in Pervasive Computing Environments , 2003 .

[18]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[19]  Leandros Tassiulas,et al.  Service discovery in mobile ad hoc networks: an overall perspective on architectural choices and network layer support issues , 2004, Ad Hoc Networks.

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

[21]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[22]  Chien-Chung Shen,et al.  Quorum-based match-making services for wireless mesh networks , 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..

[23]  Jiannong Cao,et al.  Top K-Leader Election in Wireless Ad Hoc Networks , 2008, 2008 Proceedings of 17th International Conference on Computer Communications and Networks.

[24]  Frank Dürr,et al.  Pervasive and Mobile Computing , 2012 .

[25]  Mohan Kumar,et al.  Service discovery using volunteer nodes in heterogeneous pervasive computing environments , 2006, Pervasive Mob. Comput..