The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
The performance of query control schemes for the zone routing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
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
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual 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
Caching strategies in on-demand routing protocols for wireless ad hoc networks
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
ZRP: a hybrid framework for routing in Ad Hoc networks
Ad hoc networking
Bandwidth-efficient link-state routing in wireless networks
Ad hoc networking
The performance of query control schemes for the zone routing protocol
IEEE/ACM Transactions on Networking (TON)
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Ensuring cache freshness in on-demand ad hoc network routing protocols
Proceedings of the second ACM international workshop on Principles of mobile computing
Anchored Path Discovery in Terminode Routing
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Contact-Based Architecture for Resource Discovery (CARD) in Large Scale MANets
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
A Cluster-Based Backbone Infrastructure for Broadcasting in MANETs
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Scalable object-tracking through unattended techniques (SCOUT)
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
On-demand routing in multi-hop wireless mobile ad hoc networks
On-demand routing in multi-hop wireless mobile ad hoc networks
Mobility-assisted resolution of queries in large-scale mobile sensor networks (MARQ)
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
CARD: a contact-based architecture for resource discovery in wireless ad hoc networks
Mobile Networks and Applications
Determining the optimal configuration for the zone routing protocol
IEEE Journal on Selected Areas in Communications
Active rules for sensor databases
DMSN '04 Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004
Hi-index | 0.00 |
Queries and small transfers are likely to constitute a significant portion of the flows in emerging classes of sensor networks. Route discovery for such queries incurs much more communication overhead than the actual data transfer. Especially for large-scale sensor networks, it is quite costly to establish shortest path routes for such types of requests. Flooding-based approaches for routing are designed to search for high quality routes. Such approaches may be suitable for prolonged transfers, but not for small ones. In this paper, we present an architecture that is geared towards one-shot frequent queries in sensor networks. In our approach we aim at reducing the total energy cost query resolution as opposed to searching for high quality routes.Our architecture uses a hybrid approach, where each node collects information about nodes in its proximity, up to R hops away, using a link state protocol. Beyond the proximity, we introduce the novel notion of contacts that act as short cuts to reduce the degrees of separation between the request source and the target. A new efficient, on-demand, contact selection protocol is integrated into the search process. We do not assume knowledge of node locations. Several protocols to implement different policies for the search are introduced. Extensive simulations are used to systematically evaluate the performance of our protocols. Our results show substantial communication overhead reduction for our contact-based technique as compared to related schemes. The study also shows reasonable settings of parameters that work well for a wide range of networks.