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

Author

Bu, Shengrong ; Liu, Peter

Author_Institution

Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, ON, Canada

Volume

2

fYear

2009

fDate

29-31 Aug. 2009

Firstpage

476

Lastpage

480

Abstract

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.

Keywords

ad hoc networks; mobile radio; distributed service directory-based model; mobile ad-hoc network; random node; service discovery architecture; Ad hoc networks; Broadcasting; Computer networks; Mobile ad hoc networks; Mobile computing; Peer to peer computing; Protocols; Scalability; Service oriented architecture; Spread spectrum communication; Mobile ad-hoc Networks; Service Discovery;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Science and Engineering, 2009. CSE '09. International Conference on

Conference_Location

Vancouver, BC

Print_ISBN

978-1-4244-5334-4

Electronic_ISBN

978-0-7695-3823-5

Type

conf

DOI

10.1109/CSE.2009.436

Filename

5284148