Divisible Load Scheduling inWireless Sensor Networks with Information Utility

Author

Choi, Kijeung ; Robertazzi, Thomas G.

Author_Institution

Dept. of Electr. & Comput. Eng., Stony Brook Univ., Stony Brook, NY

fYear

2008

fDate

7-9 Dec. 2008

Firstpage

9

Lastpage

17

Abstract

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.

Keywords

scheduling; wireless sensor networks; closed form solution; data aggregation; divisible load scheduling; hierarchical wireless sensor networks; information utility; measurement instruction assignment time; minimum round time; optimal data scheduling strategies; Closed-form solution; Constraint theory; Distributed computing; Network topology; Performance analysis; Processor scheduling; Time measurement; Wireless application protocol; Wireless communication; Wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Performance, Computing and Communications Conference, 2008. IPCCC 2008. IEEE International

Conference_Location

Austin, Texas

ISSN

1097-2641

Print_ISBN

978-1-4244-3368-1

Electronic_ISBN

1097-2641

Type

conf

DOI

10.1109/PCCC.2008.4745126

Filename

4745126