Off-campus WSU users: To download campus access dissertations, please use the following link to log into our proxy server with your WSU access ID and password, then click the "Off-campus Download" button below.
Non-WSU users: Please talk to your librarian about requesting this thesis through interlibrary loan.
Access Type
WSU Access
Date of Award
January 2011
Degree Type
Thesis
Degree Name
M.S.
Department
Computer Science
First Advisor
Hongwei Zhang
Abstract
Towards understanding the complexity of joint QoS and in-network processing (INP) optimization in sensornets, we study the problem of jointly optimizing packet packing and the timeliness of data delivery. We identify the conditions under which the problem is strong NP-hard, and we find that the problem complexity heavily depends on aggregation constraints instead of network and traffic properties.
For cases when the problem is NP-hard, we show that there is no polynomial-time approximation scheme (PTAS); for cases when the problem can be solved in polynomial time, we design polynomial time, offline algorithms for finding the optimal packet packing schemes.
We design a distributed, online protocol tPack that schedules packet transmissions to maximize the local utility of packet packing at each node. We evaluate the properties of tPack in NetEye testbed. We find that jointly optimizing data delivery timeliness and packet packing and considering real-world aggregation constraints significantly improve network performance.
Recommended Citation
Xiang, Qiao, "When in-network processing meets time: complexity and effects of joint optimization in wireless sensor networks" (2011). Wayne State University Theses. 156.
https://digitalcommons.wayne.edu/oa_theses/156