Synonyms
Storage retrieval of dynamic content
Definition
Resource discovery and rendezvous mechanisms are necessary to dynamically locate media servers (e.g., the nearest or best servers), data storages, membership servers (for multicast sessions), or peers (e.g., other users) for direct connections.
In general, the resource discovery module of CHaMeLeoN can be categorized as either “location-aware” or “location-free.” Location-aware architectures require availability of location information. They typically use geographic or trajectory routing to forward the updates or queries and include geographic rendezvous mechanisms (such as GLS [1], Rendezvous Regions [2], and GHT [3]) and trajectory advertisement schemes (such as TBF [4]). In location-aware networks, geographic-based distributed hash tables [2,3] are utilized to efficiently establish content based routing schemes.
In earlier work [2], we designed a geographic rendezvous mechanism based on rendezvous regions. In this...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
J. Li, J. Jannotti, D. Couto, D. Karger, and R. Morris, “A Scalable Location Service for Geographic Ad Hoc Routing (GLS/Grid),” Proceedings of the ACM MobiCom, 2000.
K. Seada and A. Helmy, “Rendezvous Regions: A Scalable Architecture for Service Location and Data-Centric Storage in Large-Scale Wireless Networks,” Proceedings of the IEEE/ACM IPDPS International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN), pp. 218–225, April 2004.
S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker, “GHT: A Geographic Hash Table for Data-Centric Storage,” Proceedings of the ACM WSNA, September 2002.
D. Niculescu and B. Nath, “Trajectory-Based Forwarding and Its Applications,” Proceedings of the ACM Mobicom, September 2003.
A. Helmy, “Efficient Resource Discovery in Wireless AdHoc Networks: Contacts Do Help,” in M. Cardei, I. Cardei, and D. Zhu (Eds.) “Book Chapter in Resource Management in Wireless Networking,” Springer, Series: Network Theory and Applications, Vol. 16, 2005.
A. Helmy, “Architectural Framework for Large-Scale Multicast in Mobile Ad Hoc Networks,” Proceedings of the IEEE International Conference on Communications (ICC 2002), April, 2002.
K. Seada and A. Helmy, “Efficient and Robust Geocasting Protocols for Sensor Networks,” Journal of Computer Communications – Elsevier, Special Issue on Dependable Wireless Sensor Networks, 2005.
C. Carter, S. Yi, P. Ratanchandani, and R. Kravets, “Manycast: Exploring the Space Between Anycast and Multicast in Ad Hoc Networks,” Proceedings of the ACM Mobicom, September 2003.
A. Helmy, “Small Worlds in Wireless Networks,” IEEE Communications Letters, Vol. 7, No. 10, October 2003, pp. 490–492.
J. Faruque, K. Psounis, and A. Helmy, “Analysis of Gradient-based Routing Protocols in Sensor Networks,” Proceedings of the IEEE/ACM International Conference on Distributed Computing in Sensor Systems (DCOSS), pp. 258–275, June 2005.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
(2008). Data Discovery, Routing and Traffic Patterns. In: Furht, B. (eds) Encyclopedia of Multimedia. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-78414-4_286
Download citation
DOI: https://doi.org/10.1007/978-0-387-78414-4_286
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74724-8
Online ISBN: 978-0-387-78414-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering