GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
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
Tapestry: a fault-tolerant wide-area application infrastructure
ACM SIGCOMM Computer Communication Review
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
Scalable, Efficient Range Queries for Grid Information Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
Nearest neighbor queries in road networks
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
P2P spatial query processing by delaunay triangulation
W2GIS'04 Proceedings of the 4th international conference on Web and Wireless Geographical Information Systems
Web architecture for monitoring and visualizing mobile objects in maritime contexts
W2GIS'07 Proceedings of the 7th international conference on Web and wireless geographical information systems
Optimizing predictive queries on moving objects under road-network constraints
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Predictive line queries for traffic prediction
Transactions on Large-Scale Data- and Knowledge-Centered Systems VI
| Hi-index | 0.00 |
Scalability is one of the crucial problems in realizing massively distributed systems such as ubiquitous computing. In this paper, we focus on indexing methods in massively distributed environments. A number of work on indexing in P2P, like CAN and Chord, have been devoted to overcome this problem. The lengths of routing path are O(dn1/d for CAN and O(log n) for Chord, which are in fact the cost of search, where there are n nodes. In this paper, we propose an alternative indexing scheme not only relying on P2P but also on broadcasting environments. The contributions of this paper include firstly the reduction of routing path to nearly O(1) for road-oriented query by using broadcasting, and secondly handling the mobility of nodes on road networks.