By Topic

Choosing Service Directory Nodes in Proposed Service Discovery Model for Mobile Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shengrong Bu ; Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, ON, Canada ; Liu, P.

Mobile ad-hoc networks are used in a wide array of applications. Service discovery architecture has become one of the most important research areas in mobile ad-hoc networks. In our paper, a totally distributed service directory-based model is introduced. We consider the number of service directory nodes to be one of the most important system parameters, and we mathematically analyze how the number of service directory nodes affects path availability time between a random node and its nearest service directory node, a relationship that has been overlooked by other proposed service discovery models.

Published in:

Computational Science and Engineering, 2009. CSE '09. International Conference on  (Volume:2 )

Date of Conference:

29-31 Aug. 2009