An Efficient Service Discovery for Mobile Ad Hoc Networks 


Vol. 34,  No. 9, pp. 947-954, Sep.  2009


PDF
  Abstract

In mobile ad hoc networks, service discovery to search for an available service is an important issue. In this paper, we propose an efficient service discovery protocol that is combined a dht-based service discovery scheme and a P2P caching-based information spreading scheme. Proposed scheme store key information in hashed zone and search services using it's information. To search quickly a service, it use its physical neighbors information which collected by 1-hop hello message between a node and its physical neighbors. We do not use a central look up server and do not rely on flooding. Hence, it uniquely balanced all node's load in mobile ad hoc networks and reduced the number of messages exchanged, network load and response time. The simulation results show that our protocol outperforms DHT-based and flooding protocols.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

E. Kang, "An Efficient Service Discovery for Mobile Ad Hoc Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 9, pp. 947-954, 2009. DOI: .

[ACM Style]

Eunyoung Kang. 2009. An Efficient Service Discovery for Mobile Ad Hoc Networks. The Journal of Korean Institute of Communications and Information Sciences, 34, 9, (2009), 947-954. DOI: .

[KICS Style]

Eunyoung Kang, "An Efficient Service Discovery for Mobile Ad Hoc Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 9, pp. 947-954, 9. 2009.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880