Bridging distributed hash tables in wireless ad-hoc networks

Advanced search
Browse by:

Department | Year

UCL Theses | Latest

Deposit your research

Bridging distributed hash tables in wireless ad-hoc networks

Cheng, L.; (2007) Bridging distributed hash tables in wireless ad-hoc networks. In: 2007 Global IEEE Telecommunications Conference (GLOBECOM '07). (pp. pp. 5159-5163). IEEE: Piscataway, NJ, USA. Green open access

Preview

PDF
5198.pdf
Download (328kB)

Abstract

The adaptation of structured P2P networks, i.e. Distributed Hash Tables (DHTs), to wireless ad-hoc networks has been investigated in recent years. Existing work assume all peers would come to an agreement on establishing one uniform DHT across the entire network. However, in reality, there isn’t a defacto standard of DHT implementation, different DHTs co-exist. We present a novel protocol, known as the DHT-gatewaying model, which enables cross-DHT searching between multiple DHTs of different implementations.

Type:	Proceedings paper
Title:	Bridging distributed hash tables in wireless ad-hoc networks
Event:	Global Telecommunications Conference, 2007 (GLOBECOM '07)
Location:	Washington, DC, USA
Dates:	26 - 30 November, 2007
ISBN-13:	9781424410439
Open access status:	An open access version is available from UCL Discovery
DOI:	10.1109/GLOCOM.2007.978
Publisher version:	http://dx.doi.org/10.1109/GLOCOM.2007.978
Language:	English
Additional information:	©2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords:	ad-hoc; cross-DHT searching; Distributed Hash Tables (DHTs); gatewaying; self-organisation; wireless networks
URI:	https://discovery.ucl.ac.uk/id/eprint/5198