Optimize adaptive self-organization mechanism for wireless sensor networks
Aimed at manage numerous wireless sensor nodes, some mechanisms of adaptive self-organization mechanism for wireless sensor networks (WSN) have been submitted,however not efficient. Optimizing adaptive self-organization mechanism for WSN, one proposed is optimizing partition nodes in different scale sensor network. The performance of difference partition nodes is demonstrated by simulation on TinyOS environment. Through analyze The WSN average cover lossy ratio, average number of covered nodes with variant hop count and average delay under different environment include the Minimum hop count and free hop count, Density effect, the classical 20/80 rule with different HMNR, Various number of nodes with fixed the number of header and Various number of nodes with fixed the HMNR is 20/80. We think that the 20/80 rule is experimentally supported and the performance is approximate for 30/70 and 40/60. The proposed algorithm guarantees the approximate cover loss and scale of large networks, in adjusting the number of nodes and maintaining the ratio of headers to nodes. A moderately high density will strengthen then links and yield a low cover loss.
wireless sensor networks node delay cover lossy ratio
Biyan Wu
College of Computer Science & Information Engineering, Zhejiang Gongshang University Hangzhou, Zhejiang Province, P.R.China, 310035
国际会议
杭州
英文
583-585
2006-10-12（万方平台首次上网日期，不代表论文的发表时间）