TY - GEN
T1 - K-directory community: Reliable service discovery in MANET
AU - Raychoudhury, Vaskar
AU - Cao, Jiannong
AU - Wu, Weigang
AU - Lai, Yi
AU - Chen, Canfeng
AU - Ma, Jian
PY - 2010/3/25
Y1 - 2010/3/25
N2 - Service discovery in MANET suffers from frequent service unavailability due to failures of service providers or directory nodes. Ensuring network-wide service availability by replication requires minimizing costs associated with storage, update and discovery. Existing works in MANET have not addressed these challenging issues adequately. In this paper, we propose a distributed directory-based service discovery protocol (SDP) for MANET. Our protocol works by electing top K nodes with rich resources as directories, which are then divided into multiple quorums. Services registered with a directory are replicated among its quorum members. This approach reduces replication and update costs, and guarantees network-wide service availability using the quorum intersection property. An incremental election policy is adopted to cope with directory failures. We have carried out extensive simulations and also developed a prototype system. Our performance evaluation results show that, compared with similar work, our protocol significantly reduces message cost and improves system robustness.
AB - Service discovery in MANET suffers from frequent service unavailability due to failures of service providers or directory nodes. Ensuring network-wide service availability by replication requires minimizing costs associated with storage, update and discovery. Existing works in MANET have not addressed these challenging issues adequately. In this paper, we propose a distributed directory-based service discovery protocol (SDP) for MANET. Our protocol works by electing top K nodes with rich resources as directories, which are then divided into multiple quorums. Services registered with a directory are replicated among its quorum members. This approach reduces replication and update costs, and guarantees network-wide service availability using the quorum intersection property. An incremental election policy is adopted to cope with directory failures. We have carried out extensive simulations and also developed a prototype system. Our performance evaluation results show that, compared with similar work, our protocol significantly reduces message cost and improves system robustness.
UR - http://www.scopus.com/inward/record.url?scp=77949611089&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-11322-2_40
DO - 10.1007/978-3-642-11322-2_40
M3 - Conference article published in proceeding or book
SN - 3642113214
SN - 9783642113215
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 420
EP - 433
BT - Distributed Computing and Networking - 11th International Conference, ICDCN 2010, Proceedings
T2 - 11th International Conference on Distributed Computing and Networking, ICDCN 2010
Y2 - 3 January 2010 through 6 January 2010
ER -