检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:曹涌涛[1] 何晨[1] 蒋铃鸽[1] 郑春雷[2]
机构地区:[1]上海交通大学电子工程系,上海200240 [2]上海微系统与信息技术研究所,上海200030
出 处:《上海交通大学学报》2006年第7期1126-1129,共4页Journal of Shanghai Jiaotong University
基 金:国家自然科学基金资助项目(60272082;60372076);上海市科委重大科技攻关项目(05dz15004)
摘 要:证明了LEACH算法的不确定特性将会导致某些节点过快耗尽电池能量而缩短系统寿命.提出了一种基于退避策略的负载均衡的分簇算法,通过自适应地调整每个节点的退避等待时间,从而保证拥有较多电池能量的节点有更大的机会成为簇首,并引入信道竞争的机制来保证簇首的均匀分布.仿真实验表明,该算法有效延长了系统寿命,提高了网络的能耗效率.The fact that the randomness of the LEACH algorithm may result in faster death of some nodes i.e. shorten the system life was proved. A distributed clustering algorithm based on adaptive backoff strategy was presented. By adaptively adjusting the wakeup rate of the exponential distribution, a node with higher residual energy is more likely to be elected a clusterhead. The contention-based channel access method was also introduced to ensure that the elected clusterheads are well scattered. The simulation experiments illustrate that the proposed algorithm is able to significantly prolong system life compared with LEACH.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3