Delay and capacity in energy efficient sensor networks
Proceedings of the 4th ACM workshop on Performance evaluation of wireless ad hoc, sensor,and ubiquitous networks
Random walk based routing protocol for wireless sensor networks
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Energy efficient searching in delay-tolerant wireless sensor networks
Proceedings of the 1st ACM international workshop on Heterogeneous sensor and actor networks
Power-aware recovery for geographic routing
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Performance of random routing on grid-based sensor networks
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Coverage based expanding ring search for dense wireless sensor networks
HiPC'08 Proceedings of the 15th international conference on High performance computing
International Journal of Sensor Networks
On the efficiency of random walk routing in multihop wireless network
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Level biased random walk for information discovery in wireless sensor networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Biased random walks on resource network graphs for load balancing
The Journal of Supercomputing
On the scalability of expanding ring search for dense wireless sensor networks
Journal of Parallel and Distributed Computing
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
Efficient routing in MANETs using ordered walks
Wireless Networks
| Hi-index | 0.00 |
Topology is important for any type of networks because it has great impact on the performance of the network. For wireless sensor networks (WSN), regular topologies, which can help to efficiently save energy and achieve long networking lifetime, have been well studied in [1, 4, 5, 7, 9]. However, little work is focused on routing in patterned WSNs except the shortest path routing with the knowledge of global location information. In this paper, we propose a routing protocol based on random walk. It doesn't require global location information. Moreover, the random walk routing achieves load balancing property inherently for WSNs which is difficult to achieve for other routing protocols. We also prove that the random walk routing consumes the same amount of energy as the shortest path routing in the scenarios where the message required to be sent to the base station is in comparatively small size with the inquiry message among neighboring nodes. Since in many applications of WSNs, sensor nodes often send only beeplike small messages to the base station to report their status, our proposed random walk routing is a viable scheme. Though the random walk routing provides load balancing in the WSN, the nodes near to the base station (BS) are inevitably under heavier burden than the nodes far from the base station. Therefore we further propose a density-aware deployment scheme to guarantee that the heavy-load nodes do not affect the network lifetime even if they are exhausted.