One of the most important problems in directional sensor networks is k-coverage in which the orientation of a minimum number of directional sensors is determined in such a way that each target can be monitored at least k times. This problem has been already considered in two different environments: over provisioned where the number of sensors is enough to cover all targets, and under provisioned where there are not enough sensors to do the coverage task (known as imbalanced k-coverage problem). Due to the significance of solving the imbalanced k-coverage problem, this paper proposes a learning automata (LA)-based algorithm capable of selecting a minimum number of sensors in a way to provide k-coverage for all targets in a balanced way. To evaluate the efficiency of the proposed algorithm performance, several experiments were conducted and the obtained results were compared to those of two greedy-based algorithms. The results confirmed the efficiency of the proposed algorithm in terms of solving the problem.
MalekS.M.B., SadikM.M. and RahmanA., On balanced k-coverage in visual sensor networks, J Netw Comput Appl72 (2016), 72–86.
2.
AiJ. and AbouzeidA.A., Coverage by directional sensors in randomly deployed wireless sensor networks, Journal of Combinatorial Optimization11 (2006), 21–41.
3.
ZhuC., ZhengC., ShuL. and HanG., A survey on coverage and connectivity issues in wireless sensor networks, Journal of Network and Computer Applications35 (2012), 619–632.
4.
SinghA. and RossiA., A genetic algorithm based exact approach for lifetime maximization of directional sensor networks, Ad Hoc Netw11 (2013), 1006–1021.
5.
ThathacharM.A.L. and HaritaB.R., Learning automata with changing number of actions, IEEE Trans Syst Man Cybern17 (1987), 1095–1100.
6.
CardeiM. and DuD.-Z., Improving Wireless Sensor Network Lifetime through Power Aware Organization, Wireless Networks11 (2005), 333–340.
7.
CardeiM., ThaiM.T., YingshuL. and WeiliW., Energy efficient target coverage in wireless sensor networks, in: Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005, pp. 1976–1984 vol. 1973.
8.
MohamadiH., IsmailA.S., SallehS. and NodheiA., Learning automata-based algorithms for finding cover sets in wireless sensor networks, The Journal of Supercomputing66 (2013), 1533–1552.
9.
MohamadiH., IsmailA.S. and SallehS., Solving Target Coverage Problem Using Cover Sets in Wireless Sensor Networks Based on Learning Automata, Wireless Personal Communications75 (2014), 447–463.
10.
YenL.-H., YuC.W. and ChengY.-M., Expected k-coverage in wireless sensor networks, Ad Hoc Networks4(5) (2006), 636–650.
11.
HefeedaM. and BagheriM., Randomized k-coverage algorithms for dense sensor networks, in: INFOCOM2007. 26th IEEE International Conference on Computer Communications. IEEE, IEEE, 2007, 2376–2380.
12.
GareyM.R. and JohnsonD.S., Computers and intractability, Vol. 29, wh freeman, 2002.
13.
KumarS., LaiT.H. and BaloghJ., On k-coverage in amostly sleeping sensor network, in: Proceedings of the 10th annual international conference on 625 Mobile computing and networking, ACM, 2004, 144–158.
14.
AmmariH.M. and DasS.K., A study of k-coverage and measures of connectivity in 3d wireless sensor networks, Computers, IEEE Transactions on59 (2010), 243–257.
15.
BejeranoY., Simple and efficient k-coverage verification without location information, in: INFOCOM2008. The 27th Conference on Computer Communications. IEEE, IEEE, 2008.
16.
GuvensanM.A. and YavuzA.G., On coverage issues in directional sensor networks: A survey, Ad Hoc Networks9 (2011), 1238–1255.
17.
CaiY., LouW., LiM. and LiX.-Y., Energy Efficient Target-Oriented Scheduling in Directional Sensor Networks, IEEE Trans Comput b58 (2009), 1259–1274.
18.
GilJ.-M. and HanY.-H., A Target Coverage Scheduling Scheme Based on Genetic Algorithms in Directional Sensor Networks, Sensors11 (2011), 1888.
19.
MohamadiH., IsmailA.S.B.H. and SallehS., A learning automata-based algorithm for solving coverage problem in directional sensor networks, Computing95 (2013), 1–24.
20.
MohamadiH., SallehS., RazaliM.N. and MaroufS., A new learning automata-based approach for maximizing network lifetime in wireless sensor networks with adjustable sensing ranges, Neurocomputing153 (2015), 11–19.
21.
MohamadiH., SallehS., IsmailA.S. and MaroufS., Scheduling algorithms for extending directional sensor network lifetime, Wireless Networks21 (2015), 611–623.
22.
MohamadiH., IsmailA.S. and SallehS., Utilizing distributed learning automata to solve the connected target coverage problem in directional sensor networks, Sensors and Actuators A: Physical198 (2013), 21–30.
23.
RahmanianA.A., Ghobaei-AraniM. and TofighyS., A learning automata-based ensemble resource usage prediction algorithm for cloud computing environment, Future Generation Computer Systems79 (2018), 54–71.
24.
MohamadiH., SallehS. and IsmailA.S., A Learning Automata-Based Solution to the Priority-Based Target Coverage Problem in Directional Sensor Networks, Wirel Pers Commun79 (2014), 2323–2338.
25.
MohamadiH., SallehS. and RazaliM.N., Heuristic methods to maximize network lifetime in directional sensor networks with adjustable sensing ranges, J Netw Comput Appl46 (2014), 26–35.
26.
RazaliM.N., SallehS. and MohamadiH., Solving Priority-Based Target Coverage Problem in Directional Sensor Networks with Adjustable Sensing Ranges, Wireless Personal Communications95 (2017), 847–872.
27.
AlibeikiA., MotameniH. and MohamadiH., A new genetic-based approach for maximizing network lifetime in directional sensor networks with adjustable sensing ranges, Pervasive and Mobile Computing52 (2019), 1–12.
28.
YuJ., ChenY., MaL., HuangB. and ChengX., On Connected Target k-Coverage in Heterogeneous Wireless Sensor Networks, Sensors16 (2016), 104.
29.
RezvanianA. and MeybodiM.R., Sampling algorithms for stochastic graphs: A learning automata approach, Knowledge-Based Systems127 (2017), 126–144.
