The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Cryptanalysis of video encryption based on space-filling curves
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Some computer science issues in ubiquitous computing
Communications of the ACM - Special issue on computer augmented environments: back to the real world
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Scalable routing protocol for ad hoc networks
Wireless Networks
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Distributed object location in a dynamic network
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Self Organized Terminode Routing
Cluster Computing
Looking up data in P2P systems
Communications of the ACM
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Indirect Routing Using Distributed Location Information
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A Scalable Location Management Scheme in Mobile Ad-Hoc Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
An underlay strategy for indirect routing
Wireless Networks - Special issue: Pervasive computing and communications
A study of the performance potential of DHT-based overlays
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Manipulation and Presentation of Multidimensional Image Data Using the Peano Scan
IEEE Transactions on Pattern Analysis and Machine Intelligence
The capacity of wireless networks
IEEE Transactions on Information Theory
Space-filling curves: Their generation and their application to bandwidth reduction
IEEE Transactions on Information Theory
Toward self-organized mobile ad hoc networks: the terminodes project
IEEE Communications Magazine
Self organization in mobile ad hoc networks: the approach of Terminodes
IEEE Communications Magazine
Easily-managed and topology-independent location service for self-organizing networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Twins: A Dual Addressing Space Representation for Self-Organizing Networks
IEEE Transactions on Parallel and Distributed Systems
Cost-effective mobile ad hoc networks management
Future Generation Computer Systems
Analysis of the impact of hello protocol parameters over a wireless network self-organization
Proceedings of the 4th ACM workshop on Performance evaluation of wireless ad hoc, sensor,and ubiquitous networks
A spontaneous ad hoc network to share WWW access
EURASIP Journal on Wireless Communications and Networking
Distributed node location in clustered multi-hop wireless networks
AINTEC'05 Proceedings of the First Asian Internet Engineering conference on Technologies for Advanced Heterogeneous Networks
A survey of adaptive services to cope with dynamics in wireless self-organizing networks
ACM Computing Surveys (CSUR)
Business Network Modelling: SOA-Based Approach and Dynamic Logistics Case Study
International Journal of Information System Modeling and Design
Hi-index | 0.00 |
The increase demand for flexibility, spontaneity, adaptability, independence of a wire infrastructure, and easy-managed architectures are driving a revolutionary change in the network community research. The number of proposals in the literature related to technologies like ad hoc, and more recently, sensor networks witnesses for the interest on the deployment of distributed, autonomous, spontaneous, and self-organizing systems. Distributed hash tables (DHTs) have been largely adopted as a useful substrate to the design and specification of self-organizing systems. The functionality of decoupling identification from location, and of providing a general mapping between them, have made the DHT abstraction an interesting principle to be integrated in network-level routing protocols. Although improving scalability, this integration also introduces new challenges for the network architecture specification. In this paper, we examine the main components related to the design of network architectures having DHT interactions in mind. We survey the recent proposals that attempt to deal with DHT-based self-organizing systems, and discuss their differences according the way in which the DHT functionalities are applied. It is verified that initial decisions of the designers about priorities of different issues and requirements are reflected on proposals' strengths and weakness. We conclude our investigations by presenting a discussion about the proposals' more significant features. Finally, based on our concluding observations, we also discuss a new and promising approach for the deployment of a distributed and self-organizing system.