Towards distributed hash tables (De)Composition in ambient networks

7Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © IMP International Federation for Information processing 2006.

Cite

CITATION STYLE

APA

Cheng, L., Ocampo, R., Jean, K., Galis, A., Simon, C., Szabo, R., … Giaffreda, R. (2006). Towards distributed hash tables (De)Composition in ambient networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4269 LNCS, pp. 258–268). Springer Verlag. https://doi.org/10.1007/11907466_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free