Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Approximations for Steiner Trees with Minimum Number of Steiner Points
Journal of Global Optimization
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Networking Wireless Sensors
Lifetime planning for TDMA-based proactive WSN with structured deployment
Proceedings of the 4th international IFIP/ACM Latin American conference on Networking
Relay sensor placement in wireless sensor networks
Wireless Networks
Performance evaluation of MAC protocols for cooperative MIMO transmissions in sensor networks
Proceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Relay node placement in large scale wireless sensor networks
Computer Communications
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
On the development of a sensor network-based system for wildfire prevention
CDVE'11 Proceedings of the 8th international conference on Cooperative design, visualization, and engineering
| Hi-index | 0.00 |
Time-driven sensor networks are devoted to the continuous reporting of data to the user. Typically, their topology is that of a data-gathering tree rooted at the sink, whose vertexes correspond to nodes located at sampling locations that have been selected according to user or application requirements. Thus, generally these locations are not close to each other and the resulting node deployment is rather sparse. In a previous paper, we developed a heuristic algorithm based on simulated annealing capable of finding an optimal or suboptimal data-gathering tree in terms of lifetime expectancy. However, despite the enhanced lifetime, the overall link distance is not optimized, fact that increases the need for additional resources (relay nodes). Therefore, in this paper we propose the Link Distance Reduction algorithm, with the goal of reducing link distances as long as network lifetime is preserved. The benefits of this new algorithm are evaluated in detail.