DEAPspace: transient ad hoc networking of prevasive devices
Computer Networks: The International Journal of Computer and Telecommunications Networking - pervasive computing
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
Service Rings - A Semantic Overlay for Service Discovery in Ad hoc Networks
DEXA '03 Proceedings of the 14th International Workshop on Database and Expert Systems Applications
Toward Distributed Service Discovery in Pervasive Computing Environments
IEEE Transactions on Mobile Computing
UIC '09 Proceedings of the 6th International Conference on Ubiquitous Intelligence and Computing
A collaborative service discovery and service sharing framework for mobile ad hoc networks
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
FNMGSDP: An Optimized Group-Based Service Discovery Protocol for MANETs
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
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.