A game theory-based approach for robots deploying wireless sensor nodes

Khoufi, Ines; Minet, Pascale; Koulali, Mohammed-Amine; Erradi, Mohammed

doi:10.1109/iwcmc.2015.7289144

Cited by 5 publications

(6 citation statements)

References 14 publications

(13 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In that case, we often optimize the robot network via a path planning algorithm in the deterministic deployment modes. Khoufi et al studied the deployment of static sensor nodes in an area containing obstacles with two mobile robots [30]. In their study, the time needed for the two robots to deploy all sensor nodes and return to their starting positions is minimized by game theory.…”

Section: A Coverage Of Wsnsmentioning

confidence: 99%

A Novel Mobile-Coverage Scheme for Hybrid Sensor Networks

Huang

Liu

et al. 2020

IEEE Access

View full text Add to dashboard Cite

In this paper, a novel Mobile-Coverage scheme is proposed to improve the coverage and lifetime of hybrid sensor networks, and thus the target region can be completely covered with minimum number of mobile sensor nodes and the energy consumption can be reduced in hybrid sensor networks at the same time. Our scheme is applied to a hybrid network comprising of both static and mobile sensor nodes, which are randomly deployed in a rectangle area. We derived the minimum number of sensor nodes as well as the mobile nodes required to cover the target region completely. Compared to the existing works, the minimum number of mobile sensor nodes required in this paper is significantly smaller, which implies that the movement distance and energy consumption of mobile nodes in our scheme is reduced. Moreover, we proved that the construction of our scheme based on the Virtual Force and Voronoi Graph (VFVG) is correct, and then derived the optimal trade-off between the coverage of the target region and energy consumption of mobile nodes. Our scheme can achieve the maximum coverage which is 98.7% by minimum number of mobile sensor nodes. Meanwhile, a connectivity rate of 76.84% can also be achieved by our connectivity evaluation method. Finally, a new topology construction algorithm-Topology Construction and Maintenance based on Trust (TCMT) is created to further increase the lifetime of the sensor network. We also evaluated the performance of our scheme in terms of coverage and lifetime, and carried out extensive experiments to compare the coverage and energy consumption in our scheme and several previous schemes. The experimental results showed that our scheme is more efficient than the previous schemes simulated. INDEX TERMS Topology construction and maintain, Minimum numbers of mobile sensor, Voronoi graph, Virtual force, TCMT.

show abstract

Section: A Coverage Of Wsnsmentioning

confidence: 99%

A Novel Mobile-Coverage Scheme for Hybrid Sensor Networks

Huang

Liu

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Multiple sinks play a coordination game with the common objective of covering the network while minimizing the sinks moves. In a previous work [13], we considered the deployment of wireless sensor nodes using mobile and autonomous robots. We formulated this problem as a non-cooperative game between two players that are the mobile robots.…”

Section: Related Workmentioning

confidence: 99%

Path planning of mobile sinks in charge of data gathering: A coalitional game theory approach

Khoufi

Minet

Koulali

et al. 2016

2016 IEEE 35th International Performance Computing and Communications Conference (IPCCC)

Self Cite

View full text Add to dashboard Cite

Game theory is often used to find equilibria where no player can unilaterally increase its own payoff by changing its strategy without changing the strategies of other players. In this paper, we propose to use coalition formation to compute the optimized tours of mobile sinks in charge of collecting data from static wireless sensor nodes. Mobile sinks constitute a very attractive solution for wireless sensor networks, WSNs, where the application requirements in terms of node autonomy are very strong unlike the requirement in terms of latency. Mobile sinks allow wireless sensor nodes to save energy The associated coalition formation problem has a stable solution given by the final partition obtained. However, the order in which the players play has a major impact on the final result. We determine the best order to minimize the number of mobile sinks needed. We evaluate the complexity of this coalitional game as well as the impact of the number of collect points per surface unit on the number of mobile sinks needed and on the maximum tour duration of these mobile sinks. In addition, we show how to extend the coalitional game to support different latencies for different types of data. Finally, we formalize our problem as an optimization problem and we perform a comparative evaluation.

show abstract

“…The game theory approach is also widely employed in wireless sensor networks. To effectively cover a target field with the minimum number of sensor nodes, the game theoretic approach is used in [ 30 , 31 ]. Concerning the communication systems in WSN, Gao et al present a game theoretic approach for both cell section and resource allocation in heterogeneous wireless network in [ 32 ].…”

Section: Related Workmentioning

confidence: 99%

A Game Theoretic Optimization Method for Energy Efficient Global Connectivity in Hybrid Wireless Sensor Networks

Lee

Pak

2016

Sensors

View full text Add to dashboard Cite

For practical deployment of wireless sensor networks (WSN), WSNs construct clusters, where a sensor node communicates with other nodes in its cluster, and a cluster head support connectivity between the sensor nodes and a sink node. In hybrid WSNs, cluster heads have cellular network interfaces for global connectivity. However, when WSNs are active and the load of cellular networks is high, the optimal assignment of cluster heads to base stations becomes critical. Therefore, in this paper, we propose a game theoretic model to find the optimal assignment of base stations for hybrid WSNs. Since the communication and energy cost is different according to cellular systems, we devise two game models for TDMA/FDMA and CDMA systems employing power prices to adapt to the varying efficiency of recent wireless technologies. The proposed model is defined on the assumptions of the ideal sensing field, but our evaluation shows that the proposed model is more adaptive and energy efficient than local selections.

show abstract

A game theory-based approach for robots deploying wireless sensor nodes

Cited by 5 publications

References 14 publications

A Novel Mobile-Coverage Scheme for Hybrid Sensor Networks

A Novel Mobile-Coverage Scheme for Hybrid Sensor Networks

Path planning of mobile sinks in charge of data gathering: A coalitional game theory approach

A Game Theoretic Optimization Method for Energy Efficient Global Connectivity in Hybrid Wireless Sensor Networks

Contact Info

Product

Resources

About