检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机工程与应用》2010年第23期82-84,121,共4页Computer Engineering and Applications
摘 要:在无线传感器网络中,分簇路由具有管理方便、高效节能、易于实现等特点,成为当前重点研究的路由算法。现有的典型分簇路由算法存在着簇首节点能耗分布不均,簇首节点与基站未采用最短路径,数据可能"绕道"传递等缺陷,使得在网络规模较大时网络能耗及生命周期等性能表现不佳。针对这些问题,结合LEACH和SHORT的思想提出了一种改进的多层分簇路由算法(LEACH-S),它建立了簇首到簇首路由,并保证相邻簇首之间距离最短。NS2仿真结果表明,在网络规模较大,密度较低时,LEACH-S较LEACH-C将网络生命周期延长了约15%。In the research of wireless sensor networks,cluster-based routing protocols become important since they excel in network topology management,energy efficiency,and applications.The existing cluster-based routing protocols do not perform so well in network energy consumption and lifetime when the network is large,because energy consumption among cluster-heads are not uniform,the route between BS and cluster-heads may be not the shortest,and data may make a detour.A novel multilayer cluster-based scheme(LEACH-S) is proposed,which integrates the concepts of LEACH and SHORT. LEACH-S setups routes between cluster-heads and ensures the distance is smallest.The simulation with NS2 shows that LEACH-S outperforms LEACH-C nearly 15% when the network is sparse and large.
分 类 号:TN915[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229