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
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
Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
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
ZRP: a hybrid framework for routing in Ad Hoc networks
Ad hoc networking
Bandwidth-efficient link-state routing in wireless networks
Ad hoc networking
LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
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
Efficient resource discovery for large scale ad hoc networks using contacts
ACM SIGCOMM Computer Communication Review
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Advances in Network Simulation
Computer
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
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Contact-Based Architecture for Resource Discovery (CARD) in Large Scale MANets
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Impact of Network Density on Data Aggregation in Wireless Sensor Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Scalable object-tracking through unattended techniques (SCOUT)
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Determining the optimal configuration for the zone routing protocol
IEEE Journal on Selected Areas in Communications
CAPTURE: location-free contact-assisted power-efficient query resolution for sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review - Special issue on wireless pan & sensor networks
CARD: a contact-based architecture for resource discovery in wireless ad hoc networks
Mobile Networks and Applications
Mobile Telemedicine Sensor Networks with Low-Energy Data Query and Network Lifetime Considerations
IEEE Transactions on Mobile Computing
Querying sensor networks by using dynamic task sets
Computer Networks: The International Journal of Computer and Telecommunications Networking
A link availability-based QoS-aware routing protocol for mobile ad hoc sensor networks
Computer Communications
Discovering timely information in MANETs
Computers & Mathematics with Applications
Querying sensor networks by using dynamic task sets
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
One of the most crucial aspects of the design of sensor networks is provisioning of efficient query resolution and resource discovery. In many cases sensor networks are expected to be large-scale, and in some cases these sensors may be installed on moving objects, rendering the query resolution problem even more challenging. Flooding techniques, including global flooding or expanding ring search techniques, may be very inefficient in large-scale networks, especially in wireless (spatial) networks where the diameter of the network tends to be quite high. More so is the case when queries are one-shot and frequent.In this study, a novel architecture is presented for query resolution in large-scale mobile sensor networks. A salient feature of our architecture is that it takes advantage of mobility to increase the efficiency of query resolution. The architecture borrows from the concept of small worlds and introduces the concept of contacts that act as short cuts to reduce the degrees of separation between the sources of the query and the targeted objects. Contacts are initially chosen from nearby neighbors, as they move away they discover new neighbors and hence become more effective in query resolution. Unlike conventional approaches for routing protocols, our primary design goal is not to optimize routes or response delays, but to reduce communication overhead. This is particularly important in energy-constraint environments, as are many sensor networks, particularly for one-shot queries, where the communication is short lived. We design our protocols to be scalable, self-configuring, and highly adaptive to mobility. In fact, it utilizes mobility.We evaluate our protocols through extensive simulations and present a detailed analysis of its performance. We further compare our approach to other query resolution protocols. Our results clearly indicate the drastic improvement obtained by using contacts, especially in high mobility scenarios. For non-replicated objects, we obtain 60-70% improvement over zone routing approaches, 80-90% improvement in communication overhead over flooding, and even greater improvements over expanding ring search approaches. Our protocols respond extremely well to replication, as the number of transmitted packets per query drops significantly.