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

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

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

Full text

Pdf (286 KB)

Source

International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems archive
Proceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks table of contents

Vancouver, British Columbia, Canada

SESSION: Multicast table of contents

Pages 33-37

Year of Publication: 2008

ISBN:978-1-60558-236-8

Authors

Pei-Jung Lin	Feng Chia University, Taichung, Taiwan and Hungkung University, Taichung, Taiwan Roc
Chyi-Ren Dow	Feng Chia University, Taichung, Taiwan Roc
Sheng-Chang Chen	Feng Chia University, Taichung, Taiwan Roc
Chia-Jung Li	Feng Chia University, Taichung, Taiwan Roc
Shiow-Fen Hwang	Feng Chia University, Taichung, Taiwan Roc

Sponsors

ACM: Association for Computing Machinery
SIGSIM: ACM Special Interest Group on Simulation and Modeling

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 54, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1454609.1454617 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Xiang Zeng , Rajive Bagrodia , Mario Gerla, GloMoSim: a library for parallel simulation of large-scale wireless networks, Proceedings of the twelfth workshop on Parallel and distributed simulation, p.154-161, May 26-29, 1998, Banff, Alberta, Canada
	2	S. C. Chen, C. R. Dow, S. K. Chen, J.H. Lin, and S.F. Hwang, "An Efficient Anycasting Scheme in Ad-hoc Wireless Networks," Proceedings of the Consumer Communications and Networking Conference, pp.178--183, Jane 2005.
	3	Casey Carter , Seung Yi , Prashant Ratanchandani , Robin Kravets, Manycast: exploring the space between anycast and multicast in ad hoc networks, Proceedings of the 9th annual international conference on Mobile computing and networking, September 14-19, 2003, San Diego, CA, USA [doi>10.1145/938985.939013]
	4	C. R. Dow, P. Hsuan, and S. F. Hwang, "Design and Implementation of Anycast Protocols for Mobile Ad-hoc Networks," Proceedings of the 8th International Conference on Advanced Communication Technology(ICACT), vol. 1, pp. 419--424, February, 2006.
	5	Chung-Ming Huang , Chao-Hsien Lee, Layer 7 Multimedia Proxy Handoff Using Anycast/Multicast in Mobile Networks, IEEE Transactions on Mobile Computing, v.6 n.4, p.411-422, April 2007 [doi>10.1109/TMC.2007.55]
	6	Weijia Jia , Dong Xuan , Wanqing Tu , Lidong Lin , Wei Zhao, Distributed Admission Control for Anycast Flows, IEEE Transactions on Parallel and Distributed Systems, v.15 n.8, p.673-686, August 2004 [doi>10.1109/TPDS.2004.34]
	7	J. H. Lin, C. R. Dow, S. F. Hwang, and Y. W. Wang, "An Efficient Distributed Clustering Scheme for Ad-hoc Wireless Networks," IEICE Transactions on Communications, pp. 1561--1571, August 2002.
	8	Jyh-Horng Lin , Chyi-Ren Dow , Shiow-Fen Hwang, A Distributed Virtual Backbone Development Scheme for Ad-Hoc Wireless Networks, Wireless Personal Communications: An International Journal, v.27 n.3, p.215-233, 2003 [doi>10.1023/B:WIRE.0000010135.75404.23]
	9	C. P. Lee, K. Attrey, C. Caballero, N. Feamster, M. Mihail, and J. A. Copeland, "MobCast: Overlay Architecture for Seamless IP Mobility using Scalable Anycast Proxies," Proceedings of the IEEE Wireless Communications and Networking Conference(WCNC), pp. 3872--3876, March 2007.
	10	Thomas Wu , Michael Malkin , Dan Boneh, Building intrusion tolerant applications, Proceedings of the 8th conference on USENIX Security Symposium, p.7-7, August 23-26, 1999, Washington, D.C.
	11	E. W. Vollsetand, and P. D. Ezhilchelvan, "Scribble: an Efficient Reliable Manycast Protocol for Ad-Hoc Networks," Proceedings of the IEEE International Conference on Mobile Ad-hoc and Sensor Systems, pp. 561--563, October 2004.
	12	B. Wu and J. Wu, "K-anycast Routing Schemes for Mobile Ad Hoc Networks," Proceedings of IEEE IPDPS, April 2006.
	13	S. Yi and R. Kravets, "MOCA: Mobile Certificate Authority for Wireless Ad Hoc Networks," Proceedings of the 2nd Annual PKI Research Workshop, April 2003.
	14	Lidong Zhou , Fred B. Schneider , Robbert Van Renesse, COCA: A secure distributed online certification authority, ACM Transactions on Computer Systems (TOCS), v.20 n.4, p.329-368, November 2002 [doi>10.1145/571637.571638]