Abstract
When different wireless networks come in close proximity there is often a need for them to logically combine, or compose. We focus on a known research problem particularly in Ambient Networks (ANs), where hetero-geneous Distributed Hash Tables (DHTs) contained in these wireless networks need to merge or divide as a result of these dynamic (de)composition processes, respectively. We present two novel DHT (de)composition models for ANs, known as absorption and gatewaying, that are designed to handle (de)composition of DHTs in different AN network environments, with minimal disturbance to existing member nodes.
Chapter PDF
Similar content being viewed by others
References
Pucha, H., Das, S., Hu, Y.: Ekta: An Efficient DHT Substrate for Distributed Applications in Mobile Ad Hoc Networks. In: Proceedings of the 6th IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), English Lake District, UK (December 2004)
Heer, T., Gotz, S., Rieche, S., Wehrle, K.: Adapting Distributed Hash Tables for Mobile Ad Hoc Networks. In: Proceedings of the 4th IEEE International Conference on Pervasive Computing and Communications Workshop (PERCOM), Pisa, Italy, pp. 173–178 (March 2006)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM), San Diego, CA, USA, pp. 161–172 (August 2001)
Ocampo, R., Cheng, L., Jean, K., Prieto, A., Galis, A.: Towards a Context Monitoring System for Ambient Networks. In: Proceedings of the 1st International Conference on Communications and Networking in China (Chinacom), Peking, China (to appear, 2006), temporarily available at: http://www.ee.ucl.ac.uk/~lcheng/Papers/CHINACOM_2006.pdf
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proceedings of the IFIP/ACM Middleware, Heidelberg, Germany, pp. 329–350 (November 2001), http://research.microsoft.com/~antr/PAST/pastry.pdf
Stoica, I., Morris, R., Karger, D., Frans Kaashoek, M., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM), San Diego, CA, USA (August 2001)
Campos, R., Pinho, C., Ricardo, M., Ruela, J., Poyhonen, P., Kappler, C.: Dynamic and Automatic Interworking between Personal Area Networks using Composition. In: Proceedings of the 16th IEEE International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC), Berlin, Germany (September 2005)
Zahn, T., Schiller, J.: MADPastry: A DHT Substrate for Practicably Sized MANETs. In: Proceedings of the 5th Workshop on Applications and Services in Wireless Networks (ASWN), Paris, France (June 2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 IFIP International Federation for Information Processing
About this paper
Cite this paper
Cheng, L. et al. (2006). Towards Distributed Hash Tables (De)Composition in Ambient Networks. In: State, R., van der Meer, S., O’Sullivan, D., Pfeifer, T. (eds) Large Scale Management of Distributed Systems. DSOM 2006. Lecture Notes in Computer Science, vol 4269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11907466_24
Download citation
DOI: https://doi.org/10.1007/11907466_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47659-7
Online ISBN: 978-3-540-47662-7
eBook Packages: Computer ScienceComputer Science (R0)