Maximizing the wireless sensor networks lifetime

Nouredine Seddiki, Amel Douli
{"title":"Maximizing the wireless sensor networks lifetime","authors":"Nouredine Seddiki, Amel Douli","doi":"10.1109/ICITST.2016.7856719","DOIUrl":null,"url":null,"abstract":"The technological developments in microelectronics have enabled the integration of capacity for the achievement of several important tasks for monitoring the environment using very small components named sensors with low cost and low power consumption. A sensor node detects environmental phenomena to obtain data and transmits them to the sink via a single hop or multi-hop path in wireless sensor network applications. For monitoring applications, a topology of tree or forest is often used to collect data of global detection. The tree or forest is built after the initial deploying of nodes and are rebuilt on important topology changes. As the sensor node has limited energy, building a good tree to prolong the lifetime of the network is an important problem. In this paper we propose an approach for optimizing the lifetime of sensors network. First, we divide our network into disjoint sets, where each set represents a tree (tree construction). Then, we optimize the lifetime of network by using an efficient algorithm for balancing weight between trees in the network.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITST.2016.7856719","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The technological developments in microelectronics have enabled the integration of capacity for the achievement of several important tasks for monitoring the environment using very small components named sensors with low cost and low power consumption. A sensor node detects environmental phenomena to obtain data and transmits them to the sink via a single hop or multi-hop path in wireless sensor network applications. For monitoring applications, a topology of tree or forest is often used to collect data of global detection. The tree or forest is built after the initial deploying of nodes and are rebuilt on important topology changes. As the sensor node has limited energy, building a good tree to prolong the lifetime of the network is an important problem. In this paper we propose an approach for optimizing the lifetime of sensors network. First, we divide our network into disjoint sets, where each set represents a tree (tree construction). Then, we optimize the lifetime of network by using an efficient algorithm for balancing weight between trees in the network.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
最大化无线传感器网络寿命
微电子技术的发展使集成能力能够实现几个重要的任务,即使用非常小的元件,称为低成本和低功耗的传感器来监测环境。在无线传感器网络应用中,传感器节点检测环境现象以获取数据,并通过单跳或多跳路径将数据传输到接收器。对于监控应用程序,通常使用树或森林的拓扑结构来收集全局检测数据。树或树林在节点初始部署之后构建,并在重要的拓扑更改时重新构建。由于传感器节点的能量有限,构建良好的树来延长网络的生命周期是一个重要的问题。本文提出了一种优化传感器网络寿命的方法。首先,我们将网络划分为不相交的集合,其中每个集合代表一棵树(树型结构)。然后,我们使用一种有效的算法来平衡网络中树之间的权重,从而优化网络的生存期。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Which metrics for vertex-cut partitioning? Compressive Sensing encryption modes and their security Range query integrity in the cloud: the case of video surveillance Performance study of the index structures in audited environment System and Protocols for secure Intercloud Communications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1