无线传感器网络中存在位置误差的高能效地理路由

Julien Champ, C. Saad
{"title":"无线传感器网络中存在位置误差的高能效地理路由","authors":"Julien Champ, C. Saad","doi":"10.1109/I-SPAN.2008.49","DOIUrl":null,"url":null,"abstract":"In wireless sensor networks, almost all geographic routing algorithms assume that sensors are accurately located. In this paper, we propose an energy efficient geographic routing algorithm (EEG-Routing). In our method, before the deployment of sensors in their environment, sensor positions are known with position error bounds which are potentially larges. According to this knowledge, it is possible to compute, before the deployment the probability that two sensors communicate. EEG-Routing introduces a new metric which defines, regarding to communication probabilities, energy consumptions and realized progress, communication costs between neighbors. EEG-Routing simultaneously optimizes two criteria: the energy consumption and the delivery rate, in networks where sensors are inaccurately located. Performances are validated by simulations which compare EEG-Routing with an energy-optimal algorithm.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks\",\"authors\":\"Julien Champ, C. Saad\",\"doi\":\"10.1109/I-SPAN.2008.49\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In wireless sensor networks, almost all geographic routing algorithms assume that sensors are accurately located. In this paper, we propose an energy efficient geographic routing algorithm (EEG-Routing). In our method, before the deployment of sensors in their environment, sensor positions are known with position error bounds which are potentially larges. According to this knowledge, it is possible to compute, before the deployment the probability that two sensors communicate. EEG-Routing introduces a new metric which defines, regarding to communication probabilities, energy consumptions and realized progress, communication costs between neighbors. EEG-Routing simultaneously optimizes two criteria: the energy consumption and the delivery rate, in networks where sensors are inaccurately located. Performances are validated by simulations which compare EEG-Routing with an energy-optimal algorithm.\",\"PeriodicalId\":305776,\"journal\":{\"name\":\"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/I-SPAN.2008.49\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/I-SPAN.2008.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

摘要

在无线传感器网络中,几乎所有的地理路由算法都假设传感器是精确定位的。本文提出了一种高效节能的地理路由算法(EEG-Routing)。在我们的方法中,在传感器在其环境中部署之前,传感器位置是已知的,位置误差范围可能很大。根据这些知识,可以在部署之前计算两个传感器通信的概率。EEG-Routing引入了一种新的度量,它根据通信概率、能耗和实现进度来定义邻居之间的通信成本。在传感器定位不准确的网络中,EEG-Routing同时优化了两个标准:能耗和传输速率。通过仿真验证了EEG-Routing算法与能量优化算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks
In wireless sensor networks, almost all geographic routing algorithms assume that sensors are accurately located. In this paper, we propose an energy efficient geographic routing algorithm (EEG-Routing). In our method, before the deployment of sensors in their environment, sensor positions are known with position error bounds which are potentially larges. According to this knowledge, it is possible to compute, before the deployment the probability that two sensors communicate. EEG-Routing introduces a new metric which defines, regarding to communication probabilities, energy consumptions and realized progress, communication costs between neighbors. EEG-Routing simultaneously optimizes two criteria: the energy consumption and the delivery rate, in networks where sensors are inaccurately located. Performances are validated by simulations which compare EEG-Routing with an energy-optimal algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Novel Congestion Control Scheme in Network-on-Chip Based on Best Effort Delay-Sum Optimization Memory and Thread Placement Effects as a Function of Cache Usage: A Study of the Gaussian Chemistry Code on the SunFire X4600 M2 Quantitative Evaluation of Common Subexpression Elimination on Queue Machines Bio-inspired Algorithms for Mobility Management On Non-Approximability of Coarse-Grained Workflow Grid Scheduling
×
引用
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