C2WSN:用于大规模无线传感器网络高效查询的两层和弦覆盖服务

Jiguo Yu, Wenjun Liu, Jingjing Song
{"title":"C2WSN:用于大规模无线传感器网络高效查询的两层和弦覆盖服务","authors":"Jiguo Yu, Wenjun Liu, Jingjing Song","doi":"10.1109/ADCOM.2007.51","DOIUrl":null,"url":null,"abstract":"Efficiently locate data is a fundamental problem for future applications of wireless sensor networks (WSNs). It is known that distributed hash table (DHT) based Internet peer-to-peer (P2P) protocols provide near-optimum data lookup times for queries made on networks of distributed nodes. In this paper we propose a novel two-tier Chord based network protocol for serving efficient queries in WSNs (C2WSN), which has a <3(log M+log lambdai) bounded times for data lookup, where M is the number of cluster and lambdai is the maximal number of sensor nodes within a cluster, respectively. Furthermore, in C2WSN a new dynamic rotation mechanism of cluster head is presented, which increases the network lifetime greatly.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"C2WSN: A Two-Tier Chord Overlay Serving for Efficient Queries in Large-Scale Wireless Sensor Networks\",\"authors\":\"Jiguo Yu, Wenjun Liu, Jingjing Song\",\"doi\":\"10.1109/ADCOM.2007.51\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Efficiently locate data is a fundamental problem for future applications of wireless sensor networks (WSNs). It is known that distributed hash table (DHT) based Internet peer-to-peer (P2P) protocols provide near-optimum data lookup times for queries made on networks of distributed nodes. In this paper we propose a novel two-tier Chord based network protocol for serving efficient queries in WSNs (C2WSN), which has a <3(log M+log lambdai) bounded times for data lookup, where M is the number of cluster and lambdai is the maximal number of sensor nodes within a cluster, respectively. Furthermore, in C2WSN a new dynamic rotation mechanism of cluster head is presented, which increases the network lifetime greatly.\",\"PeriodicalId\":185608,\"journal\":{\"name\":\"15th International Conference on Advanced Computing and Communications (ADCOM 2007)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"15th International Conference on Advanced Computing and Communications (ADCOM 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ADCOM.2007.51\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ADCOM.2007.51","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

有效地定位数据是未来无线传感器网络应用的一个基本问题。众所周知,基于分布式哈希表(DHT)的互联网点对点(P2P)协议为在分布式节点网络上进行的查询提供了近乎最佳的数据查找时间。在本文中,我们提出了一种新的基于两层Chord的网络协议,用于在wsn (C2WSN)中提供高效的查询服务,该协议具有<3(log M+log lambdai)有界的数据查找时间,其中M是集群的数量,lambdai是集群内传感器节点的最大数量。此外,在C2WSN中,提出了一种新的簇头动态旋转机制,大大提高了网络的生存时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
C2WSN: A Two-Tier Chord Overlay Serving for Efficient Queries in Large-Scale Wireless Sensor Networks
Efficiently locate data is a fundamental problem for future applications of wireless sensor networks (WSNs). It is known that distributed hash table (DHT) based Internet peer-to-peer (P2P) protocols provide near-optimum data lookup times for queries made on networks of distributed nodes. In this paper we propose a novel two-tier Chord based network protocol for serving efficient queries in WSNs (C2WSN), which has a <3(log M+log lambdai) bounded times for data lookup, where M is the number of cluster and lambdai is the maximal number of sensor nodes within a cluster, respectively. Furthermore, in C2WSN a new dynamic rotation mechanism of cluster head is presented, which increases the network lifetime greatly.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信