National Natural Science Foundation of China (No.61173153, No.60903159, No.61070162, No.71071028, No.70931001);National Natural Science Foundation of China for Distinguished Young Schoolars (No.61225012);Supported by Fundamental Research Funds for the Central Universities (No.N110404014, No.N110318001, No.N110204003, No.N120104001);China Postdoctoral Science Foundation (No.20110491508, No.2012T50248);Ph.D. Programs Foundation of Higher Education Institutions of China Priority Development Fields (No.20120042130003);Supported by the Open Foundation for Computer Application Technology of Shenyang Ligong University (No.4771004kfx06);Research Fund for the Doctoral Program of Higher Education of China (No.20100042110025, No.20110042110024);This work was supported by Internet of Things Research Foundation of Ministry of Industry and Information Technology of the People's Republic of China
JIA Jie, DAI En-liang, CHEN Jian, et al. Energy-Efficient Link Scheduling Combined with Routing Optimization in Wireless Sensor Network[J]. Acta Electronica Sinica, 2014, 42(6): 1118-1124.
DOI:
JIA Jie, DAI En-liang, CHEN Jian, et al. Energy-Efficient Link Scheduling Combined with Routing Optimization in Wireless Sensor Network[J]. Acta Electronica Sinica, 2014, 42(6): 1118-1124. DOI: 10.3969/j.issn.0372-2112.2014.06.013.
Energy-Efficient Link Scheduling Combined with Routing Optimization in Wireless Sensor Network
Link scheduling technology plays an important role in improving data transmission reliability in wireless sensor networks.Traditional link scheduling algorithms mainly focus on how to find the minimum scheduling frame under the condition of interference-free transmission
but ignore the impact of route selection on link scheduling
which leads to an expansion of interference set for some links and reduces the slot reusability.In response to this problem
the relationship between link scheduling
route selection and energy consumption is analyzed systematically
and an energy-efficient link scheduling model combined with routing optimization is presented.Through variables deletion and model transformation
an optimal routing tree construction algorithm is proposed to accelerate the solution speed based on integer programming.Furthermore
according to the routing tree and link demands achieved by integer programming
a heuristic slot allocation algorithm is proposed based on maximum degree of interference
to minimize the scheduling period.Extensive simulation results are presented to demonstrate the effectiveness of our proposed algorithm.