Introduction to algorithms
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
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
Characterizing user behavior and network performance in a public wireless LAN
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Internet indirection infrastructure
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
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
Indirect Routing Using Distributed Location Information
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Characterizing mobility and network usage in a corporate wireless local-area network
Proceedings of the 1st international conference on Mobile systems, applications and services
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
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
Performance of Taroko: a cluster-based addressing and routing scheme for self-organized networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Twins: A Dual Addressing Space Representation for Self-Organizing Networks
IEEE Transactions on Parallel and Distributed Systems
PROSE: scalable routing in MANETs using prefix labels and distributed hashing
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Combining virtual and physical structures for self-organized routing
IWSOS'06/EuroNGI'06 Proceedings of the First international conference, and Proceedings of the Third international conference on New Trends in Network Architectures and Services conference on Self-Organising Systems
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
Hi-index | 0.00 |
The evolution of the Internet toward ubiquity, mobility, and independence of wired infrastructure requires revising routing in large dynamic clouds. The need for frequent address updates caused by node mobility suggests decoupling the permanent node identifier from its topological address. This paper proposes Tribe, an indirect and scalable routing protocol for self-organizing networks. Tribe provides an anchor-based abstraction, where the communication is split into two phases: location of the destination node and direct communication between source and destination, associated with appropriate addressing schemes. Tribe anchor nodes play the role of rendezvous points and are responsible for translating a node's identifier into a topology-dependent address. Tribe achieves high scalability by distributing location information among all nodes in the network using peer-to-peer concepts. By managing regions of a logical addressing space, Tribe nodes route in a hop-by-hop basis with small amount of information and communication cost. A qualitative analysis of the Tribe topology and a performance evaluation of the protocol behavior are provided. Tribe raises fundamental issues and triggers a high potential for future work.