CNPGSDP: An efficient group-based service discovery protocol for MANETs

Zhenguo Gao; Ling Wang; Mei Yang; Xiaozong Yang

doi:10.1016/j.comnet.2005.12.004

CNPGSDP: An efficient group-based service discovery protocol for MANETs

Zhenguo Gao^*
, Ling Wang
, Mei Yang
, Xiaozong Yang

^*Corresponding author for this work

Faculty of Computing

Harbin Institute of Technology
University of Nevada, Las Vegas

Research output: Contribution to journal › Article › peer-review

25 Scopus citations

Abstract

The ability to discover services is the major prerequisite for effective usability of MANETs. Group-based Service Discovery (GSD) protocol is a typical service discovery protocol for MANETs. However, because of large redundant packet transmissions, its packet overhead is high. In this paper, in light of GSD, we propose a new service discovery protocol for Mobile Ad-Hoc Networks (MANETs): Candidate Node Pruning enhanced Group-based Service Discovery Protocol (CNPGSDP). In CNPGSDP, two schemes are introduced to enhance GSD: Broadcast Simulated Unicast (BSU) and Candidate Node Pruning (CNP). In BSU, several unicast request packets are replaced with one request packet transmitted in broadcast mode with all unicast receivers enclosed. CNP further reduces the number of request packets by reducing the number of candidate nodes. Mathematical analysis and simulation tests both show that CNPGSDP is a very effective, efficient, and prompt service discovery protocol for MANETs.

Original language	English
Pages (from-to)	3165-3182
Number of pages	18
Journal	Computer Networks
Volume	50
Issue number	16
DOIs	https://doi.org/10.1016/j.comnet.2005.12.004
State	Published - 14 Nov 2006

Keywords

GSD
Mobile Ad-Hoc Networks
Service discovery protocol

Access to Document

10.1016/j.comnet.2005.12.004

Cite this

@article{e19ad64386914167befef16c22bf9985,

title = "CNPGSDP: An efficient group-based service discovery protocol for MANETs",

abstract = "The ability to discover services is the major prerequisite for effective usability of MANETs. Group-based Service Discovery (GSD) protocol is a typical service discovery protocol for MANETs. However, because of large redundant packet transmissions, its packet overhead is high. In this paper, in light of GSD, we propose a new service discovery protocol for Mobile Ad-Hoc Networks (MANETs): Candidate Node Pruning enhanced Group-based Service Discovery Protocol (CNPGSDP). In CNPGSDP, two schemes are introduced to enhance GSD: Broadcast Simulated Unicast (BSU) and Candidate Node Pruning (CNP). In BSU, several unicast request packets are replaced with one request packet transmitted in broadcast mode with all unicast receivers enclosed. CNP further reduces the number of request packets by reducing the number of candidate nodes. Mathematical analysis and simulation tests both show that CNPGSDP is a very effective, efficient, and prompt service discovery protocol for MANETs.",

keywords = "GSD, Mobile Ad-Hoc Networks, Service discovery protocol",

author = "Zhenguo Gao and Ling Wang and Mei Yang and Xiaozong Yang",

year = "2006",

month = nov,

day = "14",

doi = "10.1016/j.comnet.2005.12.004",

language = "英语",

volume = "50",

pages = "3165--3182",

journal = "Computer Networks",

issn = "1389-1286",

publisher = "Elsevier B.V.",

number = "16",

}

TY - JOUR

T1 - CNPGSDP

T2 - An efficient group-based service discovery protocol for MANETs

AU - Gao, Zhenguo

AU - Wang, Ling

AU - Yang, Mei

AU - Yang, Xiaozong

PY - 2006/11/14

Y1 - 2006/11/14

N2 - The ability to discover services is the major prerequisite for effective usability of MANETs. Group-based Service Discovery (GSD) protocol is a typical service discovery protocol for MANETs. However, because of large redundant packet transmissions, its packet overhead is high. In this paper, in light of GSD, we propose a new service discovery protocol for Mobile Ad-Hoc Networks (MANETs): Candidate Node Pruning enhanced Group-based Service Discovery Protocol (CNPGSDP). In CNPGSDP, two schemes are introduced to enhance GSD: Broadcast Simulated Unicast (BSU) and Candidate Node Pruning (CNP). In BSU, several unicast request packets are replaced with one request packet transmitted in broadcast mode with all unicast receivers enclosed. CNP further reduces the number of request packets by reducing the number of candidate nodes. Mathematical analysis and simulation tests both show that CNPGSDP is a very effective, efficient, and prompt service discovery protocol for MANETs.

AB - The ability to discover services is the major prerequisite for effective usability of MANETs. Group-based Service Discovery (GSD) protocol is a typical service discovery protocol for MANETs. However, because of large redundant packet transmissions, its packet overhead is high. In this paper, in light of GSD, we propose a new service discovery protocol for Mobile Ad-Hoc Networks (MANETs): Candidate Node Pruning enhanced Group-based Service Discovery Protocol (CNPGSDP). In CNPGSDP, two schemes are introduced to enhance GSD: Broadcast Simulated Unicast (BSU) and Candidate Node Pruning (CNP). In BSU, several unicast request packets are replaced with one request packet transmitted in broadcast mode with all unicast receivers enclosed. CNP further reduces the number of request packets by reducing the number of candidate nodes. Mathematical analysis and simulation tests both show that CNPGSDP is a very effective, efficient, and prompt service discovery protocol for MANETs.

KW - GSD

KW - Mobile Ad-Hoc Networks

KW - Service discovery protocol

UR - https://www.scopus.com/pages/publications/33747880803

U2 - 10.1016/j.comnet.2005.12.004

DO - 10.1016/j.comnet.2005.12.004

M3 - 文章

AN - SCOPUS:33747880803

SN - 1389-1286

VL - 50

SP - 3165

EP - 3182

JO - Computer Networks

JF - Computer Networks

IS - 16

ER -

CNPGSDP: An efficient group-based service discovery protocol for MANETs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this