TY - GEN
T1 - Divisible load scheduling in wireless sensor networks with information utility
AU - Choi, Kijeung
AU - Robertazzi, Thomas G.
PY - 2008
Y1 - 2008
N2 - Optimal data scheduling strategies in a hierarchical wireless sensor network (WSN) are considered. Data aggregation in clusterheads is considered to find a closed form solution for the optimal amount of data that is to be reported by each sensor node using a newly introduced parameter, information utility. The optimal conditions for the feasible measurement instruction assignment time and for the minimum round time are derived and examined. Based on the optimal conditions, a performance evaluation is demonstrated via simulation study.
AB - Optimal data scheduling strategies in a hierarchical wireless sensor network (WSN) are considered. Data aggregation in clusterheads is considered to find a closed form solution for the optimal amount of data that is to be reported by each sensor node using a newly introduced parameter, information utility. The optimal conditions for the feasible measurement instruction assignment time and for the minimum round time are derived and examined. Based on the optimal conditions, a performance evaluation is demonstrated via simulation study.
UR - https://www.scopus.com/pages/publications/63049126641
U2 - 10.1109/PCCC.2008.4745126
DO - 10.1109/PCCC.2008.4745126
M3 - Conference contribution
AN - SCOPUS:63049126641
SN - 9781424433674
T3 - Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference
SP - 9
EP - 17
BT - 2008 IEEE International Performance Computing and Communications Conference, IPCCC 2008
T2 - 2008 IEEE International Performance Computing and Communications Conference, IPCCC 2008
Y2 - 7 December 2008 through 9 December 2008
ER -