P2P-based routing and data management using the virtual cord protocol (VCP)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

P2P-based routing and data management using the virtual cord protocol (VCP)

Full text

Pdf (320 KB)

Source

International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing table of contents

Hong Kong, Hong Kong, China

POSTER SESSION: Posters table of contents

Pages 443-444

Year of Publication: 2008

ISBN:978-1-60558-073-9

Authors

Abdalkarim Awad	University of Erlangen, Erlangen, Germany
Reinhard German	University of Erlangen, Erlangen, Germany
Falko Dressler	University of Erlangen, Erlangen, Germany

Sponsors

SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 13, Downloads (12 Months): 86, 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/1374618.1374678 What is a DOI?

ABSTRACT

We present Virtual Cord Protocol (VCP), a virtual relative position based routing protocol for sensor networks that also provides methods for data management as known from standard DHT services. Self-organizing and cooperative algorithms are thought to be the optimal solution to overcome the inherent resource limitations in sensor networks. On an abstract level, DHT techniques offer O(1) complexity data lookup. Unfortunately, they usually rely on underlayer routing techniques. The key contributions of VCP are the independence of real location information by relying on relative positions of neighboring nodes, successors and predecessors in the cord are always in their vicinity, and the high scalability because only information about direct neighbors are needed for routing. Furthermore, VCP inherently prevents dead-ends and it is easy to be implemented.

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	I. F. Akyildiz , W. Su , Y. Sankarasubramaniam , E. Cayirci, Wireless sensor networks: a survey, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.38 n.4, p.393-422, 15 March 2002 [doi>10.1016/S1389-1286(01)00302-4]
	2	Matthew Caesar , Miguel Castro , Edmund B. Nightingale , Greg O'Shea , Antony Rowstron, Virtual ring routing: network routing inspired by DHTs, Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, September 11-15, 2006, Pisa, Italy
	3	Y. Zhao, Y. Chen, B. Li, and Q. Zhang, "Hop ID: A Virtual Coordinate-Based Routing for Sparse Mobile Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 6, no. 9, pp. 1075--1089, September 2007.