arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.2204cs.NI
收藏

无线传感器网络中最小能耗和延长网络寿命的虚拟骨干树

Virtual Backbone Trees for Most Minimal Energy Consumption and Increasing Network Lifetime In WSNs

S. Saibharath, J. Aarthi

摘要:

虚拟骨干树已被用于汇聚节点和部署区域中的任何其他节点之间的有效通信。但是所有提出的虚拟骨干树都不是完全节能的,EVBT也没有与之相关的缺陷。在本文中,提出了两个这样的虚拟骨干。第一个算法,最小能量虚拟骨干树(MMEVBT),背后的动机是最大限度地减少能量消耗时,数据包之间传输的汇和目标传感器节点。能量消耗是最小的和最优的,它示出了为什么它总是具有最小的能量消耗在每个节点与汇聚节点之间的任何传输的数据包。对于每个节点,具有最小能量消耗的路由路径被识别,并且只有当识别出更好的最小能量消耗路由时才选择新的树节点以用于节点与sink通信,反之亦然。通过周期性地移动sink,确保sink附近的节点的电池不被完全耗尽。提出了另一种骨干网构建算法,通过增加所有树节点的生命周期来最大化网络生命周期。在NS2中进行了仿真,对算法进行了实际测试,并对结果进行了详细讨论。

英文摘要:

Virtual backbone trees have been used for efficient communication between sink node and any other node in the deployed area. But all the proposed virtual backbone trees are not fully energy efficient and EVBTs have few flaws associated with them. In this paper two such virtual backbones are proposed. The motive behind the first algorithm, Most Minimal Energy Virtual Backbone Tree (MMEVBT), is to minimise the energy consumption when packets are transmitted between sink and a target sensor node. The energy consumption is most minimal and optimal and it is shown why it always has minimal energy consumption during any transfer of packet between every node with the sink node. For every node, route path with most minimal energy consumption is identified and a new tree node is elected only when a better minimal energy consumption route is identified for a node to communicate with the sink and vice versa. By moving sink periodically it is ensured the battery of the nodes near sink is not completely drained out. Another backbone construction algorithm is proposed which maximises the network lifetime by increasing the lifetime of all tree nodes. Simulations are done in NS2 to practically test the algorithms and the results are discussed in detail.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑