Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
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
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
The Small-World Phenomenon: An Algorithmic Perspective
The Small-World Phenomenon: An Algorithmic Perspective
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Minimum power configuration in wireless sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
An Ultra Low Power System Architecture for Sensor Network Applications
Proceedings of the 32nd annual international symposium on Computer Architecture
Protocols and Architectures for Wireless Sensor Networks
Protocols and Architectures for Wireless Sensor Networks
Wireless adhoc sensor and actuator networks on the farm
Proceedings of the 5th international conference on Information processing in sensor networks
Random walk based node sampling in self-organizing networks
ACM SIGOPS Operating Systems Review
From Rosenstock model to random walk based routing in wireless sensor networks
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Analysis of latency of stateless opportunistic forwarding in intermittently connected networks
IEEE/ACM Transactions on Networking (TON)
Analytical revisit on the use of biased random walks for data forwarding in wireless sensor networks
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
| Hi-index | 0.00 |
Wireless environment monitoring applications with significantly relaxed quality-of-service constraints are emerging. Hence, the possibility to use rough low knowledge routing in sensor networks to reduce hardware resource and software complexity is questionable. Moreover, low knowledge handling allows better genericity, which is of interest, for instance, for basic operation enabling system set-up. In this framework, this paper revisits stateless unicast random walk routing in wireless sensor networks. Based on random walk theory, original closed-form expressions of the delay, the power consumption and related spatial behaviors are provided according to the scale of the system. Basic properties of such a random routing are discussed. Exploiting its properties, data gathering schemes that fulfill the requirements of the application with rather good energy efficiency are then identified.