Correlation Dominating Set Construction Based upon Entropy Evaluation in Wireless Sensor Networks
Rui-Yun YU, Xing-Wei WANG, Yong-He LIU · Chinese Journal of Computers · 2011
Wireless sensor networks are usually densely deployed,so the data sensed from neighboring sensor nodes is highly correlated.For redundancy removal in wireless sensor networks,this paper presents an algorithm named entropy evaluation for correlation dominating set construction(EECDS).The algorithm first determines the correlation degree between sensor nodes by evaluating the entropy of Gaussian random variables,and then distributively generates a correlation graph.Based on the correlation graph,the EECDS algorithm finally constructs a connected correlation dominating set by removing redundant sensor nodes.Data gathering policies with the help of connected correlation dominating sets will greatly reduce data redundancy of dense sensor networks,and therefore result in decrease of energy consumption and prolong lifetime of wireless sensor networks.