Optimal location management algorithms for mobile networks
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
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Mobility management for hierarchical wireless networks
Mobile Networks and Applications
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Information Dissemination in Partitionable Mobile Ad Hoc Networks
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Data-centric storage in sensornets with GHT, a geographic hash table
Mobile Networks and Applications
Computer
Localized techniques for broadcasting in wireless sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Combs, needles, haystacks: balancing push and pull for discovery in large-scale sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.24 |
In this paper we consider a distributed and efficient information dissemination and retrieval system for wireless sensor networks. In such a system each sensor node operates autonomously with no central node of control in the network, and it can be a data source (it produces data) as well as a data sink (it consumes data). We aim at developing energy efficient protocols that disseminate information sensed at a source node to any other nodes that are interested in the information. We propose two protocols, one is based on the quorum scheme and the other is based on the home agent scheme. The proposed protocols have three advantages: (1) Fully distributed. There is no need for any sensor node to have the global information of the network and each sensor node operates based on its local information; (2) high success rate for data retrieval; (3) capable of dealing with mobile sensors as well as static sensors. The energy efficiency of the protocols is evaluated by two metrics: (a) number of message transmissions required for the source node to advertise its data to all possible data consumers; (b) number of hops of the path between the source node and the querying node for data transmission. The theoretical analysis and simulation results show significant energy savings of the proposed protocols over the previous protocols for the similar goal.