The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
LH: Linear Hashing for distributed files
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
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
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
P-Grid: A Self-Organizing Access Structure for P2P Information Systems
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Using proximity and quantized RSS for sensor localization in wireless networks
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Routing restorable bandwidth guaranteed connections using maximum 2-route flows
IEEE/ACM Transactions on Networking (TON)
Peer-Tree: A Peer-to-Peer Message Forwarding Structure for Relaying Messages in Mobile Applications
HOT-P2P '05 Proceedings of the Second International Workshop on Hot Topics in Peer-to-Peer Systems
A survey of geocast routing protocols
IEEE Communications Surveys & Tutorials
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We present a location look-up service for aiding location-based routing in wireless networks with mobile hosts. This location look up service is constructed based on a peer-tree indexing structure which represents the friendship relations among mobile hosts. The friendship is derived from the relations of sharing various-length common suffixes of host identifiers. A friendship relation determines the cooperation relation among mobile hosts. The Peer-Tree indexing structure provides a guideline for propagating location updates and queries in an organized manner. Each host periodically propagates its up-to-date location to a small number of its friends. Location queries are forwarded to and serviced at one of the hosts which hold a copy of the location under query. Paths for forwarding location updates or queries are jointly determined by the Peer-Tree indexing structure and the temporary connectivity in a network. The goals of this location look-up service include achieving a high success rate on location discovery, having low demands on network resources, and being robust to frequent changes of network topology.