Fast average consensus in clustered wireless sensor networks by superposition gossiping | |
Zheng M(郑萌)![]() ![]() | |
2012 | |
会议名称 | 2012 IEEE Wireless Communications and Networking Conference |
会议日期 | April 1-4, 2012 |
会议地点 | Paris, France |
关键词 | Mathematical programming Time division multiple access Wireless telecommunication systems |
页码 | 2009-2014 |
通讯作者 | 郑萌 |
中文摘要 | In this paper we propose a gossip algorithm for average consensus in clustered wireless sensor networks called superposition gossiping, where the nodes in each cluster exploit the natural superposition property of wireless multiple-access channels to significantly decrease local averaging times. More precisely, the considered network is organized into single-hop clusters and in each cluster average values are computed at a designated cluster head via the wireless channel and subsequently broadcasted to update the entire cluster. Since the clusters are activated randomly in a time division multiple-access fashion, we can apply well-established techniques for analyzing gossip algorithms to prove the convergence of the algorithm to the average consensus in the second moment and almost surely, provided that some connectivity condition between clusters is fulfilled. Finally, we follow a semidefinite programming approach to optimize wake up probabilities of cluster heads that further accelerates convergence. |
收录类别 | EI ; CPCI(ISTP) |
产权排序 | 1 |
会议主办者 | IEEE |
会议录 | IEEE Wireless Communications and Networking Conference, WCNC
![]() |
会议录出版者 | IEEE |
会议录出版地 | New York, USA |
语种 | 英语 |
ISBN号 | 978-1-4673-0437-5 |
WOS记录号 | WOS:000324580702015 |
内容类型 | 会议论文 |
源URL | [http://ir.sia.cn/handle/173321/10237] ![]() |
专题 | 沈阳自动化研究所_工业控制网络与系统研究室 |
推荐引用方式 GB/T 7714 | Zheng M,Mario Goldenbaum,Slawomir Stanczak,et al. Fast average consensus in clustered wireless sensor networks by superposition gossiping[C]. 见:2012 IEEE Wireless Communications and Networking Conference. Paris, France. April 1-4, 2012. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论