• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Circuits and systems >An Improved Energy Balanced Dissimilar Clustered Routing Architecture for Wireless Sensor Networks
【24h】

An Improved Energy Balanced Dissimilar Clustered Routing Architecture for Wireless Sensor Networks

机译：无线传感器网络的一种改进的能量平衡异构集群路由架构

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In wireless sensor networks, clustering of nodes effectively conserves considerable amount of energy resulting in increased network life-time. Clustering protocols do not consider density of nodes in cluster formation, which increases the possibility of hotspots in areas where the density of nodes is very less. If the node density is very high, cluster-heads may expend high energy leading to their early death. Existing cluster protocols that concentrate on energy conservation have not exhibited their impact on packet delivery and delay. In this proposed protocol, clusters are constructed based on the range of nodes, distance between neighbouring nodes and density of nodes over a region resulting in the formation of dissimilar clusters. With this method, the entire sensing region is considered to be a large circular region with base station positioned at the centre. Initially, the nodes that can be able to reach base station in a single hop are considered for constructing inner smaller circular regions over the entire region. This method is iterated for n-hop nodes until n-concentric circular regions are formed. These circular boundaries are reconstructed based on a distance metric, density of nodes and a divergence factor. Using this architecture, network analysis is done by routing data to the base station from different sized clusters. Based on simulation results, this new protocol Dynamic Unequal Clustered Routing (D-UCR), despite being energy efficient, showed better data delivery ratio and minimized delay when compared with other traditional clustering algorithms such as Leach and Equal Clustered Routing.
机译：在无线传感器网络中，节点群集有效地节省了大量能量，从而延长了网络寿命。群集协议没有考虑群集形成中节点的密度，这增加了在节点密度非常小的区域出现热点的可能性。如果节点密度很高，则簇头可能会消耗大量能量，导致其过早死亡。现有的专注于节能的集群协议尚未表现出对数据包传送和延迟的影响。在该提出的协议中，基于节点的范围，相邻节点之间的距离以及区域上节点的密度来构造簇，从而导致形成不相似的簇。通过这种方法，整个感应区域被认为是一个大的圆形区域，基站位于中央。最初，考虑能够在单跳中到达基站的节点，以便在整个区域上构造内部较小的圆形区域。对n跳节点重复此方法，直到形成n个同心圆形区域。这些圆形边界是根据距离度量，节点的密度和散度因子进行重构的。使用此体系结构，网络分析是通过将数据从不同大小的群集路由到基站来完成的。根据仿真结果，与其他传统群集算法（如Leach和Equal群集路由）相比，这种新协议动态不平等群集路由（D-UCR）尽管具有能源效率，但显示出更好的数据传输率和最小的延迟。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号