Grid Lifespan Enlargement for Assessment in Multihop Wireless Detector Facilities

M. S, D. Senduraja
{"title":"Grid Lifespan Enlargement for Assessment in Multihop Wireless Detector Facilities","authors":"M. S, D. Senduraja","doi":"10.18535/ijecs/v10i12.4642","DOIUrl":null,"url":null,"abstract":"In energy limited wireless sensor networks, both local quantization andmultihop transmission are essential to save transmission energy and thus prolong the network lifetime. The goal is to maximize the network lifetime, defined as the estimation task cycles accomplished before the network becomes nonfunctional.The network lifetime optimization problem includes three components: Optimizing source coding at each sensor node, optimizing source throughput at each sensor node.Optimizing multihop routing path. Source coding optimization can be decoupled from source throughput and multihop routing path optimization and is solved by introducing a concept of equivalent 1-bit Mean Square Error (MSE) function. Based on optimal source coding, multihop routing path optimization is formulated as a linear programming problem, which suggests a new notion of character based routing. It is also seen that optimal multihop routing improves the network lifetime bound significantly compared with single-hop routing for heterogeneous networks. Furthermore, the gain is more significant when the network is denser since there are more opportunities for multihop routing. Also the gain is more significant when the observation noise variances are more diverse.","PeriodicalId":231371,"journal":{"name":"International Journal of Engineering and Computer Science","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Engineering and Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18535/ijecs/v10i12.4642","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In energy limited wireless sensor networks, both local quantization andmultihop transmission are essential to save transmission energy and thus prolong the network lifetime. The goal is to maximize the network lifetime, defined as the estimation task cycles accomplished before the network becomes nonfunctional.The network lifetime optimization problem includes three components: Optimizing source coding at each sensor node, optimizing source throughput at each sensor node.Optimizing multihop routing path. Source coding optimization can be decoupled from source throughput and multihop routing path optimization and is solved by introducing a concept of equivalent 1-bit Mean Square Error (MSE) function. Based on optimal source coding, multihop routing path optimization is formulated as a linear programming problem, which suggests a new notion of character based routing. It is also seen that optimal multihop routing improves the network lifetime bound significantly compared with single-hop routing for heterogeneous networks. Furthermore, the gain is more significant when the network is denser since there are more opportunities for multihop routing. Also the gain is more significant when the observation noise variances are more diverse.
多跳无线探测设备中网格寿命扩展评估
在能量有限的无线传感器网络中,局部量化和多跳传输是节省传输能量、延长网络寿命的关键。目标是最大化网络生命周期,定义为在网络失效之前完成的评估任务周期。网络生命周期优化问题包括三个部分:优化每个传感器节点上的源编码,优化每个传感器节点上的源吞吐量。优化多跳路由路径。源编码优化可以与源吞吐量和多跳路由路径优化解耦,并通过引入等效1位均方误差(MSE)函数的概念来解决。基于最优源编码,将多跳路由路径优化化为线性规划问题,提出了基于字符路由的新概念。在异构网络中,与单跳路由相比,最优多跳路由显著提高了网络生存期边界。此外,当网络更密集时,增益更显着,因为有更多的机会进行多跳路由。当观测噪声方差较大时,增益也更显著。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信