Robust communications for sensor networks in hostile environments

O. Younis, S. Fahmy, P. Santi
{"title":"Robust communications for sensor networks in hostile environments","authors":"O. Younis, S. Fahmy, P. Santi","doi":"10.1109/IWQOS.2004.1309350","DOIUrl":null,"url":null,"abstract":"Clustering sensor nodes increases the scalability and energy efficiency of communications among them. In hostile environments, unexpected failures or attacks on cluster heads (through which communication takes place) may partition the network or degrade application performance. In this work, we propose a new approach, REED (Robust Energy Efficient Distributed clustering), for clustering sensors deployed in hostile environments. Our primary objective is to construct a k (i.e., k-connected) network, where k is a constant determined by the application. Fault tolerance can be achieved by selecting k independent sets of cluster heads (i.e., cluster head overlays) on top of the physical network, so that each node can quickly switch to other cluster heads in case of failures or attacks on its current cluster head. The independent cluster head overlays also provide multiple vertex-disjoint routing paths for load balancing and security. Network lifetime is prolonged by selecting cluster heads with high residual energy and low communication cost, and periodically reclustering the network in order to distribute energy consumption among sensor nodes. We prove that REED can asymptotically achieve k tolerance if certain constraints on node density are satisfied. We also investigate via simulations the clustering properties of REED, and show that building multiple cluster head overlays does not consume significant energy.","PeriodicalId":266235,"journal":{"name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"46","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWQOS.2004.1309350","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 46

Abstract

Clustering sensor nodes increases the scalability and energy efficiency of communications among them. In hostile environments, unexpected failures or attacks on cluster heads (through which communication takes place) may partition the network or degrade application performance. In this work, we propose a new approach, REED (Robust Energy Efficient Distributed clustering), for clustering sensors deployed in hostile environments. Our primary objective is to construct a k (i.e., k-connected) network, where k is a constant determined by the application. Fault tolerance can be achieved by selecting k independent sets of cluster heads (i.e., cluster head overlays) on top of the physical network, so that each node can quickly switch to other cluster heads in case of failures or attacks on its current cluster head. The independent cluster head overlays also provide multiple vertex-disjoint routing paths for load balancing and security. Network lifetime is prolonged by selecting cluster heads with high residual energy and low communication cost, and periodically reclustering the network in order to distribute energy consumption among sensor nodes. We prove that REED can asymptotically achieve k tolerance if certain constraints on node density are satisfied. We also investigate via simulations the clustering properties of REED, and show that building multiple cluster head overlays does not consume significant energy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
敌对环境下传感器网络的鲁棒通信
聚类传感器节点增加了它们之间通信的可扩展性和能效。在恶劣的环境中,意外故障或对集群头(通过它进行通信)的攻击可能会导致网络分区或降低应用程序性能。在这项工作中,我们提出了一种新的方法,REED(鲁棒高效分布式聚类),用于部署在恶劣环境中的聚类传感器。我们的主要目标是构建一个k(即k连接)网络,其中k是由应用程序确定的常数。容错可以通过在物理网络上选择k个独立的簇头集(即簇头覆盖)来实现,以便在当前簇头发生故障或受到攻击时,每个节点可以快速切换到其他簇头。独立的簇头覆盖还为负载平衡和安全性提供了多个顶点不相交的路由路径。通过选择剩余能量高、通信成本低的簇头,周期性地对网络进行重新聚类,使能量消耗在传感器节点之间进行分配,从而延长网络寿命。证明了在满足节点密度约束的条件下,REED可以渐近地实现k容限。我们还通过模拟研究了REED的聚类特性,并表明构建多个簇头覆盖并不会消耗大量的能量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Delay bound Guarantees with WFQ-based CBQ discipline Single-service quality differentiation Towards a formal model for QoS specification and handling in networks Decay function model for resource configuration and adaptive allocation on Internet servers Towards content distribution networks with latency guarantees
×
引用
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