Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/26946
Title: K-directory community : reliable service discovery in MANET
Authors: Raychoudhury, V
Cao, J 
Wu, W
Lai, Y
Chen, C
Ma, J
Keywords: Directory election
Fault-tolerance
MANET
Quorum
Service discovery protocol
Issue Date: 2011
Publisher: Elsevier
Source: Pervasive and mobile computing, 2011, v. 7, no. 1, p. 140-158 How to cite?
Journal: Pervasive and mobile computing 
Abstract: 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.
URI: http://hdl.handle.net/10397/26946
ISSN: 1574-1192
EISSN: 1873-1589
DOI: 10.1016/j.pmcj.2010.10.004
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

14
Last Week
0
Last month
0
Citations as of Sep 15, 2017

WEB OF SCIENCETM
Citations

8
Last Week
0
Last month
0
Citations as of Sep 16, 2017

Page view(s)

45
Last Week
0
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.