An efficient anycast scheme for discovering K services in mobile ad-hoc networks

Authors:
Pei-Jung Lin;Chyi-Ren Dow;Sheng-Chang Chen;Chia-Jung Li;Shiow-Fen Hwang
Affiliations:
Feng Chia University, Taichung, Taiwan and Hungkung University, Taichung, Taiwan Roc;Feng Chia University, Taichung, Taiwan Roc;Feng Chia University, Taichung, Taiwan Roc;Feng Chia University, Taichung, Taiwan Roc;Feng Chia University, Taichung, Taiwan Roc
Venue:
Proceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Year:
2008

Citing 8
Cited 2

GloMoSim: a library for parallel simulation of large-scale wireless networks

PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
COCA: A secure distributed online certification authority

ACM Transactions on Computer Systems (TOCS)
Manycast: exploring the space between anycast and multicast in ad hoc networks

Proceedings of the 9th annual international conference on Mobile computing and networking
A Distributed Virtual Backbone Development Scheme for Ad-Hoc Wireless Networks

Wireless Personal Communications: An International Journal
Distributed Admission Control for Anycast Flows

IEEE Transactions on Parallel and Distributed Systems
Building intrusion tolerant applications

SSYM'99 Proceedings of the 8th conference on USENIX Security Symposium - Volume 8
Layer 7 Multimedia Proxy Handoff Using Anycast/Multicast in Mobile Networks

IEEE Transactions on Mobile Computing
k-anycast routing schemes for mobile ad hoc networks

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

An efficient geo-aware peer-to-peer resource discovery and sharing scheme in vehicular ad-hoc networks

International Journal of Ad Hoc and Ubiquitous Computing
ANFIS and agent based bandwidth and delay aware anycast routing in mobile ad hoc networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work proposes an efficient anycast scheme, called AnyKast, for discovering k services in cluster-based mobile ad-hoc networks. In the AnyKast scheme, an anycast tree based on the clustering and virtual backbone is established to reduce unnecessary message transmission. In the anycast tree, anycast clusterheads disseminate their information to certain specific nodes that take the service information and perform the service selection task instead of blindly searching. Furthermore, to decrease the cost of service information collection and maintenance, scope flooding is used to limit the information transmission, and information piggybacking and periodical inquiry mechanism are used to increase the service information accuracy. The experimental results demonstrate that our scheme can effectively discover services, reduce request and reply message control overhead and lower the searching latency.