The electrical resistance of a graph captures its commute and cover times
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A technique for lower bounding the cover time
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
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
Wireless integrated network sensors
Communications of the ACM
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Data-centric storage in sensornets
ACM SIGCOMM Computer Communication Review
The cover time, the blanket time, and the Matthews bound
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies
IEEE Transactions on Mobile Computing
The power of choice in random walks: an empirical study
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Energy and quality aware query processing in wireless sensor database systems
Information Sciences: an International Journal
On the cover time and mixing time of random geometric graphs
Theoretical Computer Science
Multievent Crisis Management Using Noncooperative Multistep Games
IEEE Transactions on Computers
Probabilistic heuristics for disseminating information in networks
IEEE/ACM Transactions on Networking (TON)
The power of choice in random walks: An empirical study
Computer Networks: The International Journal of Computer and Telecommunications Networking
Random walk based routing protocol for wireless sensor networks
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Efficient and robust query processing for mobile wireless sensor networks
International Journal of Sensor Networks
Many random walks are faster than one
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Empirical evaluation of querying mechanisms for unstructured wireless sensor networks
ACM SIGCOMM Computer Communication Review
A queueing approach to optimal resource replication in wireless sensor networks
Performance Evaluation
Random walk with long jumps for wireless ad hoc networks
Ad Hoc Networks
A Device Search Strategy Based on Connections History for Patient Monitoring
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Using Heterogeneity to Enhance Random Walk-based Queries
Journal of Signal Processing Systems
Lukewarm potato forwarding: a biased random walk routing protocol for wireless sensor networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Performance of random routing on grid-based sensor networks
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
International Journal of Sensor Networks
Level biased random walk for information discovery in wireless sensor networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Random-walk based approach to detect clone attacks in wireless sensor networks
IEEE Journal on Selected Areas in Communications
Random walk with jumps in large-scale random geometric graphs
Computer Communications
Partial information spreading with application to distributed maximum coverage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Probabilistic quorum systems in wireless Ad Hoc networks
ACM Transactions on Computer Systems (TOCS)
Radio cover time in hyper-graphs
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
In-network coding for resilient sensor data storage and efficient data mule collection
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Energy efficient and low latency biased walk techniques for search in wireless sensor networks
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Detecting proximity events in sensor networks
Information Systems
On the cover time of random geometric graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Querying dynamic wireless sensor networks with non-revisiting random walks
EWSN'10 Proceedings of the 7th European conference on Wireless Sensor Networks
Efficient data collection with spatial clustering in time constraint WSN applications
ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World
IEEE/ACM Transactions on Networking (TON)
Radio cover time in hyper-graphs
Ad Hoc Networks
| Hi-index | 0.00 |
Many existing systems for sensor networks rely on state information stored in the nodes for proper operation (e.g., pointers to parent in a spanning tree, routing information, etc). In dynamic environments, such systems must adopt failure recovery mechanisms, which significantly increase the complexity and impact the overall performance. In this paper, we investigate alternative schemes for query processing based on random walk techniques. The robustness of this approach under dynamics follows from the simplicity of the process, which only requires the connectivity of the neighborhood to keep moving. In addition we show that visiting a constant fraction of sensor network, say 80%, using a random walk is efficient in number of messages and sufficient for answering many interesting queries with high quality. Finally, the natural behavior of a random walk, also provide the important properties of load-balancing and scalability.