Game-Theoretic Based Distributed Scheduling Algorithms for Minimum Coverage Breach in Directional Sensor Networks
A directional sensor network, where a lot of sensors are intensively and randomly deployed, is able to enhance coverage performances, since working directions can be partitioned into different K covers which are activated in a round-robin fashion. In this paper, we consider the problem of direction...
Saved in:
| Main Authors: | Jin Li, Kun Yue, Weiyi Liu, Qing Liu |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-05-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2014/341309 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Sensor scheduling for target coverage in directional sensor networks
by: Jinglan Jia, et al.
Published: (2017-06-01) -
A Theoretic Approach for Prolonging Lifetime of Wireless Sensor Networks Based on the Coalition Game Model
by: Kun Yue, et al.
Published: (2014-06-01) -
A Stochastic -Coverage Scheduling Algorithm in Wireless Sensor Networks
by: Jiguo Yu, et al.
Published: (2012-11-01) -
Coverage Capacity Optimization for Mobile Sensor Networks Based on Evolutionary Games
by: Jianhua Liu, et al.
Published: (2014-11-01) -
On the Minimum Quantity of Mobile Sensor Nodes for Full Coverage in Hybrid WSN
by: Monik Silva Sousa, et al.
Published: (2025-05-01)