A generic minimum dominating forward node set based service discovery protocol for MANETs

Authors:
Zhenguo Gao;Sheng Liu;Mei Yang;Jinhua Zhao;Jiguang Song
Affiliations:
College of Automation, Harbin Engineering University, Harbin, China;College of Automation, Harbin Engineering University, Harbin, China;Department of Electrical and Computer Engineering University of Nevada, Las Vegas, NV;School of Astronautics, Harbin Institute of Technology, Harbin, China;College of Automation, Harbin Engineering University, Harbin, China
Venue:
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Year:
2007

Citing 6
Cited 1

The broadcast storm problem in a mobile ad hoc network

Wireless Networks - Selected Papers from Mobicom'99
Comparison of broadcasting techniques for mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Allia: alliance-based service discovery for ad-hoc environments

WMC '02 Proceedings of the 2nd international workshop on Mobile commerce
Multi-layer Clusters in Ad-hoc Networks - An Approach to Service Discovery

Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
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
Methods for service discovery in Bluetooth scatternets

Computer Communications

FTSCP: an efficient distributed fault-tolerant service composition protocol for MANETs

HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Service discovery is a crucial feature for the usability of mobile ad-hoc networks (MANETs). In this paper, Minimum Dominating Forward Node Set based Service Discovery Protocol (MDFNSSDP) is proposed. MDFNSSDP has the following characteristics: 1) It minimizes the number of coverage demanding nodes in the current node's 2-hop neighbor set. 2) It minimizes the size of dominating forward node set used to cover all coverage demanding nodes. Forward nodes are selected based on local topology information and history information piggybacked in service request packets. Only these forward nodes are responsible for forwarding service request packets. 3) The coverage of service request packets is guaranteed. 4) Multiple service requests can be fulfilled in just one service discovery session. Simulations show that MDFNSSDP is an effective, efficient, and prompt service discovery protocol for MANETs.