Spacefilling curves and the planar travelling salesman problem
Journal of the ACM (JACM)
Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Space-filling curves and their use in the design of geometric data structures
Theoretical Computer Science - Special issue: Latin American theoretical informatics
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
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th 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
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
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
Analysis of the n-Dimensional Quadtree Decomposition for Arbitrary Hyperrectangles
IEEE Transactions on Knowledge and Data Engineering
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve
IEEE Transactions on Knowledge and Data Engineering
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
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
A Scalable Location Management Scheme in Mobile Ad-Hoc Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
The changing usage of a mature campus-wide wireless network
Proceedings of the 10th annual international conference on Mobile computing and networking
An underlay strategy for indirect routing
Wireless Networks - Special issue: Pervasive computing and communications
Trellis-Based virtual regular addressing structures in self-organized networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Relative location estimation in wireless sensor networks
IEEE Transactions on Signal Processing
Toward self-organized mobile ad hoc networks: the terminodes project
IEEE Communications Magazine
Gossiping on MANETs: the beauty and the beast
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Sensing and acting with predefined trajectories
Proceedings of the 1st ACM international workshop on Heterogeneous sensor and actor networks
SARA: A service architecture for resource aware ubiquitous environments
Pervasive and Mobile Computing
Near-zero triangular location through time-slotted mobility prediction
Wireless Networks
LORD: Tracking mobile clients in a real mesh
Ad Hoc Networks
A survey of adaptive services to cope with dynamics in wireless self-organizing networks
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
As the size of mobile self-organizing networks increases, the efficiency of location services must increase as well so that addressing/routing scalability does not become an issue. In this paper, we propose a novel architecture, called Twins, tailored for self-organizing networks. Twins architecture involves addressing and locating nodes in large networks, forwarding packets between them, and managing in the presence of mobility/topology changes. Twins defines a logical multidimensional space for addressing and forwarding, while location service and management operations make use of a one-dimensional space. To improve scalability and performance, forwarding is hop-by-hop with greedy next-hop choice and the location service uses a rendezvous paradigm to distribute information among nodes. In this paper, we describe the Twins architecture and present a performance evaluation to assess scalability, fairness in the overhead distribution among nodes, and routing robustness.