Abstract
Network reliability has vital importance for designing wireless multimedia sensor networks (WMSNs). The definition of network reliability for WMSNs differentiates from the traditional communication network types which simultaneously involves node deployment, connectivity and coverage issues. Therefore, in this study, a new information gathering network reliability definition is made for WMSNs. The information gathering network reliability is maximized under a given total budget constraint by including node and terrain characteristics. The model is developed to get surveillance from an enemy zone. Since the reliable WMSN design considering node deployment, connectivity and coverage has NP-hard complexity, new hybrid methods are proposed with hybridization of exact methods with nature-inspired metaheuristics. Five algorithms are generated. Firstly, problem-specific simulated annealing (SA) and genetic algorithm (GA) are developed, then branch and bound (B&B) is embedded into the SA and GA named as hybrid SA (HSA) and hybrid GA (HGA). The B&B method optimizes the orientations of the sensor nodes. Additionally, an HGA-based matheuristic (HGABM) is proposed. In HGABM, a mixed integer linear programming (MILP) network flow-based model is added into the initial population generation procedure of the HGA. The MILP model finds the exact deployment points of the relay nodes. In experimental study, it is noticed that the main time-consuming parts of the algorithms are network reliability calculations. Thence, a parallel Monte Carlo (MC) simulation is developed and the MC runs are made in multiple general purpose graphics processing units (GPGPUs). Full-factorial experimental design and Taguchi design approaches are preferred to tune the parameters, to generate the problem sets and to make the experiments. The experimental study is performed on synthetically generated terrains with different terrain and device-based scenarios. Statistical methods are used to compare the performances of the algorithms. In conclusion, for small-sized sets HGABM and for moderate- and large-sized sets, HGA outperforms the other algorithms. The algorithms are coded in MATLAB and the MILP model is solved with CPLEX.
Similar content being viewed by others
References
Aarts E, Korst J (1989) Simulated annealing and boltzmann machines: a stochastic approach to combinatorial optimization and neural computing. Wiley, New York
AboElFotoh HMF, Iyengar SS, Chakrabarty K (2005) Computing reliability and message delay for cooperative wireless distributed sensor networks subject to random failures. IEEE Trans Reliab 54(1):144–155
Abyaneh FR, Gholami S (2015) A comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem. J Ind Syst Eng 8(2):67–85
Adenso-Diaz B, Laguna M (2006) Fine-tuning of algorithms using fractional experimental designs and local search. Oper Res 54(1):99–114
Akan OB, Akyildiz IF (2005) Event-to-sink reliable transport in wireless sensor networks. IEEE/ACM Trans Netw 13(5):1003–1016
Akyildiz IF, Melodia T, Chowdhury KR (2007) A survey on wireless multimedia sensor networks. Comput Netw 51:921–960
Altiparmak F (1996) Genetik algoritma ile haberlesme sebekelerinin topolojik optimizasyonu. PhD thesis, Gazi University, Ankara
Azim MMA, Jiang X (2016) Wireless sensor multimedia networks: architectures protocols and applications. CRC Press, Boca Raton
Bajuelos AL, Canales S, Hernandez G, Martins AM (2008) Optimizing the minimum vertex guard set on simple polygons via a genetic algorithm. WSEAS Trans Inf Sci Appl 5(11):1584–1596
Ball MO (1986) Computational complexity of network reliability analysis: an overview. IEEE Trans Reliab 35(3):230–239
Bein WW, Bein D, Malladi S (2009) Reliability and fault tolerance of coverage models for sensor networks. Int J Sens Netw 5(4):199–209
Chen YL, Lai HP (2014) A fuzzy logical controller for traffic load parameter with priority-based rate in wireless multimedia sensor networks. Appl Soft Comput 14:594–602
Colbourn CJ (1987) The combinatorics of network reliability. Oxford University Press, Oxford
Coy SP, Golden BL, Runger GC, Wasil EA (2001) Using experimental design to find effective parameter settings for heuristics. J Heuristic 7(1):77–97
Efrat A, Har-Peled S (2006) Guarding galleries and terrains. Inf Process Lett 100(6):238–245
Garey MR, Johnson DS (1979) Computers and intractability, a guide to the theory of NP completness. W. H Freeman, New York
Ghosh SK (2010) Approximation algorithms for art gallery problems in polygons. Discr Appl Math 158(6):718–722
Gonzalez-Banos H (2001) A randomized art-gallery algorithm for sensor placement. In: 17th annual symposium on computational geometry, Medford, SCG’01, pp 232–240
Han X, Cao X, Lloyd EL, Shen CC (2008) Deploying directional sensor networks with guaranteed connectivity and coverage. In: 5th Annual IEEE communications society conference on sensor, mesh and ad hoc communications and networks, San Francisco, SECON-08, pp 153–160
Kolahan F, Doughabadi MH (2012) The effects of parameter settings on the performance of genetic algorithm through experimental design and statistical analysis. Adv Mater Res 433–440:5994–5999
Krishnamachari L, Estrin D, Wicker S (2002) Modelling data-centric routing in wireless sensor networks. In: The 21st annual joint conference of the IEEE computer and communications societies, New York, Infocom-02, pp 1–18
Lin HJ, Jin YL, Zhang ZM, Zhang XY, Zhang Z (2008) Coverage oriented reliability and lifetime of wireless sensor network. In: IEEE China–Japan joint microwave conference, Shanghai, pp 215–219
Magaia N, Horta N, Neves R, Pereira PR, Correia M (2015) A multi-objective routing algorithm for wireless multimedia sensor networks. Appl Soft Comput 30:104–112
Majumdar A, Ghosh D (2015) Genetic algorithm parameter optimization using taguchi robust design for multi-response optimization of experimental and historical data. Int J Comput Appl 127(5):26–32
Marengoni M, Draper B, Hanson A, Sitaraman R (2000) A system to place observers on a polyhedral terrain in polynomial time. Image Vis Comput 18(10):773–780
Mills KL, Filliben JJ, Haines AL (2015) Determining relative importance and effective settings for genetic algorithm control parameters. Evolut Comput 23(2):309–342
Provan J, Ball M (1983) The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J Comput 12:777–788
Shrestha A, Xing L, Liu H (2006) Infrastructure communication reliability of wireless sensor networks. In: 2nd International symposium on dependable autonomic and secure computing, Indianapolis, Indiana, DASC-06, pp 250–257
Shrestha A, Xing L, Liu H (2007) Modeling and evaluating the reliability of wireless sensor networks. In: IEEE reliability and maintainability symposium, Orlando, RAMS-07, pp 186–191
Stann F, Heidemann J (2003) Rmst: Reliable data transport in sensor networks. In: 1st IEEE international workshop on sensor network protocols and applications, Alaska, SNPA-03, pp 102–112
Taguchi G (1987) System of experimental design: engineering methods to optimize quality and minimize cost. UNIPUB, White Plains
Talbi EG (2009) Metaheuristics: from design to implementation. Wiley, Hoboken
Tezcan N, Wang W (2007) Art: an asymmetric and reliable transport mechanism for wireless sensor networks. Int J Sens Netw 2:188–200
Topcuoglu H, Ermis M, Bekmezci I, Sifyan M (2012) A new three-dimensional wireless multimedia sensor network simulation environment for connected coverage problems. Simulation 88(1):110–122
Wan C, Campbell AT, Krishnamurthy L (2002) Psfq: a reliable transport protocol for wireless sensor networks. In: 1st ACM international workshop on wireless sensor networks and applications, Atlanta, WSNA-02, pp 1–11
Xiao Y, Li X, Li Y, Chen S (2009) Evaluate reliability of wireless sensor networks with obdd. In: IEEE international conference on communications, Dresden, Germany, ICC-09, pp 1–5
Zhao J, Cheung SC, Nguyen T (2008) Optimal camera network configurations for visual tagging. IEEE J Select Top Signal Process 2(4):464–479
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Hector Cancela.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Ozkan, O., Ermis, M. & Bekmezci, I. Reliable wireless multimedia sensor network design: comparison of hybrid metaheuristics and a matheuristic. Comp. Appl. Math. 38, 106 (2019). https://doi.org/10.1007/s40314-019-0872-y
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-019-0872-y