TY - GEN
T1 - Joint Convergecast and Power Allocation in Wireless Sensor Networks
AU - Duan, Yaoxin
AU - Nie, Wendi
AU - Liu, Kai
AU - Zhuge, Qingfeng
AU - Sha, Edwin H.M.
AU - Lee, Victor C.S.
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2015/7/31
Y1 - 2015/7/31
N2 - Converge cast is a critical communication paradigm for data collection in wireless sensor networks, where both energy and bandwidth are scarce resources. Previous converge cast algorithms only focused on minimizing the energy cost without considering the constraint of wireless bandwidth. This article shows that constructing a congestion-free converge cast tree cannot ignore the bandwidth constraint. Considering the adjustable transmission power of sensor nodes, it will affect not only the topology of networks but also the bandwidth of wireless links. In this paper, we formulate the Minimum Total Transmission Power (MTTP) problem, which aims to address the issue of constructing a congestion-free converge cast tree in WSNs with adjustable transmission power of sensor nodes. We transform MTTP to an Integer Linear Programming (ILP) model, by which the optimal solution to MTTP is derived. To strike a balance between scheduling overhead and system performance, we propose a heuristic algorithm called Nearest-to-Sink, which searches viable paths in a greedy way and achieves near optimal performance. We build the simulation model and give a comprehensive performance evaluation, which demonstrates the feasibility and the effectiveness of the proposed algorithm.
AB - Converge cast is a critical communication paradigm for data collection in wireless sensor networks, where both energy and bandwidth are scarce resources. Previous converge cast algorithms only focused on minimizing the energy cost without considering the constraint of wireless bandwidth. This article shows that constructing a congestion-free converge cast tree cannot ignore the bandwidth constraint. Considering the adjustable transmission power of sensor nodes, it will affect not only the topology of networks but also the bandwidth of wireless links. In this paper, we formulate the Minimum Total Transmission Power (MTTP) problem, which aims to address the issue of constructing a congestion-free converge cast tree in WSNs with adjustable transmission power of sensor nodes. We transform MTTP to an Integer Linear Programming (ILP) model, by which the optimal solution to MTTP is derived. To strike a balance between scheduling overhead and system performance, we propose a heuristic algorithm called Nearest-to-Sink, which searches viable paths in a greedy way and achieves near optimal performance. We build the simulation model and give a comprehensive performance evaluation, which demonstrates the feasibility and the effectiveness of the proposed algorithm.
KW - Convergecast
KW - Energy-efficient scheduling
KW - Power allocation
KW - Routing
KW - Wireless sensor networks
UR - https://www.scopus.com/pages/publications/84946111809
U2 - 10.1109/PDCAT.2014.24
DO - 10.1109/PDCAT.2014.24
M3 - 会议稿件
AN - SCOPUS:84946111809
T3 - Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings
SP - 98
EP - 104
BT - Proceedings - 15th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2014
PB - IEEE Computer Society
T2 - 15th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2014
Y2 - 9 December 2014 through 11 December 2014
ER -