http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Zhang, Jinhuan,Long, Jun,Liu, Anfeng,Zhao, Guihu The Korea Institute of Information and Commucation 2016 Journal of communications and networks Vol.18 No.2
Data collection is a key function for wireless sensor networks. There has been numerous data collection scheduling algorithms, but they fail to consider the deep and complex relationship among network lifetime, sink aggregated information and sample cycle for wireless sensor networks. This paper gives the upper bound on the sample period under the given network topology. An optimal schedule algorithm focusing on aggregated information named OSFAI is proposed. In the schedule algorithm, the nodes in hotspots would hold on transmission and accumulate their data before sending them to sink at once. This could realize the dual goals of improving the network lifetime and increasing the amount of information aggregated to sink. We formulate the optimization problem as to achieve trade-off among sample cycle, sink aggregated information and network lifetime by controlling the sample cycle. The results of simulation on the random generated wireless sensor networks show that when choosing the optimized sample cycle, the sink aggregated information quantity can be increased by 30.5%, and the network lifetime can be increased by 27.78%.
Jinhuan Zhang,Jun Long,Anfeng Liu,Guihu Zhao 한국통신학회 2016 Journal of communications and networks Vol.18 No.2
Data collection is a key function for wireless sensor networks. There has been numerous data collection scheduling algorithms,but they fail to consider the deep and complex relationshipamong network lifetime, sink aggregated information and samplecycle for wireless sensor networks. This paper gives the upperbound on the sample period under the given network topology. An optimal schedule algorithm focusing on aggregated informationnamed OSFAI is proposed. In the schedule algorithm, the nodesin hotspots would hold on transmission and accumulate their databefore sending them to sink at once. This could realize the dualgoals of improving the network lifetime and increasing the amountof information aggregated to sink. We formulate the optimizationproblem as to achieve trade-off among sample cycle, sink aggregatedinformation and network lifetime by controlling the samplecycle. The results of simulation on the random generated wirelesssensor networks show that when choosing the optimized sample cycle,the sink aggregated information quantity can be increased by30.5%, and the network lifetime can be increased by 27.78%.