A taxonomy of wireless micro-sensor network models
ACM SIGMOBILE Mobile Computing and Communications Review
Sensor Networks
Temporal properties of low power wireless links: modeling and implications on multi-hop routing
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Analytical modeling and mitigation techniques for the energy hole problem in sensor networks
Pervasive and Mobile Computing
Maximizing network lifetime based on transmission range adjustment in wireless sensor networks
Computer Communications
ETC: Energy-Driven Tree Construction in Wireless Sensor Networks
MDM '09 Proceedings of the 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware
Balancing Energy Consumption to Maximize Network Lifetime in Data-Gathering Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Are there so many sons per node in a wireless sensor network data aggregation tree?
IEEE Communications Letters
Adjustable convergecast tree protocol for wireless sensor networks
Computer Communications
Localized Routing Protocols Based on Minimum Balanced Tree in Wireless Sensor Networks
MSN '09 Proceedings of the 2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks
Minimum-hot-spot query trees for wireless sensor networks
Proceedings of the Ninth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
Hi-index | 0.00 |
Many sensor networks suffer from the energy hole problem which is a special case of load imbalance caused by the funnelling effect of many sensor nodes transmitting their data to a single, central sink. In order to mitigate the problem, a balanced routing tree is often required and this can be constructed with either a centralised or distributed algorithm. Distributed solutions are typically less effective but are significantly cheaper than centralised solutions in terms of communication overhead and they scale better for the same reason. In this paper we propose a novel distributed algorithm for the construction of a load balanced routing tree. Our proposed solution, Degree Constrained Routing, is unique in that it aims to maximise global balance during construction rather that relying on rebalancing an arbitrary tree or only maximising local balance. The underlying principle is that if all nodes adopt the same number of children as each other while the routing tree grows, then the final tree will be globally balanced. Simulation results show that our algorithm can produce trees with improved balance which results in lifetimes increased by up to 80% compared to the next best distributed algorithm.