当前位置: X-MOL 学术Iran. J. Sci. Technol. Trans. Electr. Eng. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Probabilistic Coverage in Wireless Sensor Networks: a Game Theoretical Approach
Iranian Journal of Science and Technology, Transactions of Electrical Engineering ( IF 2.4 ) Pub Date : 2021-06-22 , DOI: 10.1007/s40998-020-00393-7
Elham Golrasan , Hossein Shirazi , Kourosh Dadashtabar

In this paper, the problem of full area coverage in wireless sensor networks is investigated by keeping the minimum number of heterogeneous sensor nodes. The coverage problem is considered for both deterministic and probabilistic heterogeneous sensors. We propose a new distributed game theory-based algorithm to maximize the area coverage while minimizing the number of activated sensors. Due to the energy limitations in sensor networks, we formulate the area coverage problem as a multi-player game in which a utility function is formulated to consider the tradeoff between energy consumption and coverage quality. To achieve an efficient action profile, we present a new distributed payoff-based learning algorithm where each sensor only has access to the activities it has played and the utility values it has received. The simulation results show that our proposed game-theoretic algorithm has greater energy efficiency and can maximize area coverage, as compared to previous approaches.



中文翻译:

无线传感器网络中的概率覆盖:一种博弈论方法

在本文中,通过保持异构传感器节点的最小数量来研究无线传感器网络中的全区域覆盖问题。确定性和概率异构传感器都考虑了覆盖问题。我们提出了一种新的基于分布式博弈论的算法,以最大化区域覆盖范围,同时最小化激活传感器的数量。由于传感器网络的能量限制,我们将区域覆盖问题表述为多人游戏,其中制定效用函数以考虑能耗和覆盖质量之间的权衡。为了实现有效的动作配置文件,我们提出了一种新的基于收益的分布式学习算法,其中每个传感器只能访问它所进行的活动和它收到的效用值。

更新日期:2021-06-22
down
wechat
bug