Distributed Set k-Cover Algorithms for Fusion-Based Coverage in Wireless Sensor Networks

LI Jin; YUE Kun; LIU Wei-yi

doi:10.3969/j.issn.0372-2112.2013.04.006

您当前的位置：

首页 >

文章列表页 >

Distributed Set k-Cover Algorithms for Fusion-Based Coverage in Wireless Sensor Networks

更新时间：2025-07-16

- Distributed Set k-Cover Algorithms for Fusion-Based Coverage in Wireless Sensor Networks
- Acta Electronica Sinica Vol. 41, Issue 4, Pages: 659-665(2013)
- 作者机构：
  
  1. 云南大学软件学院,云南,昆明,650500
  2. 云南省软件工程重点实验室,云南,昆明,650500
  3. 云南大学信息学院,云南,昆明,650091
  4. 云南大学软件学院云南昆明,650500
  5. 云南省软件工程重点实验室云南昆明,650500
  6. 云南大学信息学院云南昆明,650091
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of China (No.61063009, No.61163003);Ph.D. Programs Foundation of Ministry of Education of China (New Teacher Project) (No.20105301120001);Key Project of Chinese Ministry of Education of China (No.211172);Applied Basic Research Program of Yunnan Province (No.2011FB020);Scientific Research Project of Yunnan Education Department (No.2010Y251, No.2011Z015);Supported by Discipline Construction Foundation for College of Software of Yunnan University (No.2012SE303)
- DOI：10.3969/j.issn.0372-2112.2013.04.006
  CLC： TP393
- Published：2013
- 稿件说明：
移动端阅览
LI Jin, YUE Kun, LIU Wei-yi. Distributed Set k-Cover Algorithms for Fusion-Based Coverage in Wireless Sensor Networks[J]. Acta Electronica Sinica, 2013, 41(4): 659-665.
DOI：

LI Jin, YUE Kun, LIU Wei-yi. Distributed Set k-Cover Algorithms for Fusion-Based Coverage in Wireless Sensor Networks[J]. Acta Electronica Sinica, 2013, 41(4): 659-665. DOI： 10.3969/j.issn.0372-2112.2013.04.006.

摘要

当节点采用概率感知模型且融合多个节点的数据进行联合感知的情况下

提出了一个新的无线传感器网络的覆盖优化问题:基于融合的

-集覆盖优化问题.首先

将优化问题建模为融合覆盖博弈

证明该博弈是势博弈

且势函数与优化目标函数一致

因此

最优解是一个纯策略Nash均衡解.其次

给出了节点间融合覆盖效用独立的判定条件

进而分别提出同步、异步控制的、基于局部信息的、分布式的覆盖优化算法

证明了算法收敛到纯策略Nash均衡.最后

仿真实验结果表明

当算法收敛时

网络能达到高的覆盖率且具有好的覆盖稳定性.

Abstract

A new coverage optimization problem named disjoint set

-cover for fusion-based coverage of WSN is investigated in this paper where sensor nodes are assumed using a fusion-based collective probabilistic sensor model.First

the problem is formulated as a fusion-based coverage game and then the game is proved as a potential game.So that the optimal solution is a pure Nash equilibrium.Second

we present the conditions that determine the independence of coverage utility among sensor nodes.Furthermore

two distributed algorithms only based on local information are proposed and proven to be convergent to pure Nash equlibria.Finally

experimental results show that Nash equilibria can provide a near-optimal and well-balanced solution to th

e problem.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Heuristic Clustering Algorithm Based on Sub-Game Perfect Equilibrium

Detection and Localization of Outlier Nodes in Wireless Sensor Networks via Jointing Temporal and Spatial Residuals

Study on Data Pre-Deployment Based on Inference and Computing of Edge Devices in Smart Environment

Sequential Three-Way Decision Model Based on the Game Between Uncertainty and Error Classification Rate

An Event Region Detection Scheme Based on Splay Tree in Wireless Sensor Networks

Related Author

CHANG Lu-yao

NIU Xin-zheng

LUO Tao

QIAN Zao-guo

JIN Ming

DING Rong

WANG Cheng-liang

ZHAO Kai

Related Institution

School of Computer Science and Engineering， University of Electronics Science and Technology of China

Faculty of Electrical Engineering and Computer Science， Ningbo University

College of Computer Science and Technology, Chongqing University

College of Optoelectronic Engineering,Chongqing University

Chongqing Key Laboratory of Computational Intelligence, Chongqing University of Posts and Telecommunications

⁰