A Hybrid Genetic Algorithm for the Minimum Exposure Path Problem of Wireless Sensor Networks Based on a Numerical Functional Extreme Model

IEEE Transactions on Vehicular Technology

Volumn 65, Issue 10, 2016, Pages 8644-8657

  Ye, Miao ^a,b   Wang, Yuping ^a   Dai, Cai ^a   Wang, Xiaoli ^a  

^a XIDIAN UNIVERSITY   (China)

^b GUILIN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Hybrid genetic algorithm (HGA); minimum exposure path (MEP); numerical functional extreme (NFE); wireless sensor network (WSN)

Indexed keywords

GENETIC ALGORITHMS; NONLINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SENSOR NODES;

CROSSOVER OPERATOR; EXPOSURE PATH; FUNCTIONAL EXTREMES; GLOBAL CONVER-GENCE; HETEROGENEOUS SENSORS; HYBRID GENETIC ALGORITHMS; NON-LINEAR OPTIMIZATION PROBLEMS; WIRELESS SENSOR NETWORK (WSNS);

WIRELESS SENSOR NETWORKS;

EID: 85016101369     PISSN: 00189545     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVT.2015.2508504     Document Type: Article

References (41)

1. A. Ghosha and S. K. Das, "Coverage and connectivity issues in wireless sensor networks: A survey, " Pervasive Mobile Comput., vol. 4, no. 3, pp. 303-334, Jun. 2008.
2. B.Wang, "Coverage problems in sensor networks: A survey, " ACM Comput. Surveys, vol. 43, no. 4, pp. 32, Oct. 2011.
3. S.Meguredichian, F. Koushanfar, and G. Qu, "Exposure in wireless ad hoc sensor networks, " in Proc. MobiCom, Rome, Italy, 2001, pp. 139-150.
4. T. Clouqueur, V. Phipatanasuphorn, P. Ramanathan, and K. K. Saluja, "Sensor deployment strategy for detection of targets traversing a region, " Mobile Netw., vol. 8, no. 4, pp. 453-461, Apr. 2003.
5. S. Megerian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava, "Worst and best-case coverage in sensor networks, " IEEE Trans.Mobile Comput., vol. 4, no. 1, pp. 84-92. Jan./Feb. 2005.
6. S. Meguredichian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava, "Coverage problems in wireless ad-hoc sensor networks, " in Proc. INFOCOM, 2001, pp. 1380-1387.
7. G. Veltri, Q. Huang, G. Qu, and M. Potkonjak, "Minimal and maximal exposure path algorithms for wireless embedded sensor networks, " in Proc. ACM Int. Conf. Embedded Netw. SenSys, New York, NY, USA, 2003, pp. 40-50.
8. S. Megerian, F. Koushanfar, G. Qu, G. Veltri, and M. Potkonjak, "Exposure in wireless sensor networks: Theory and practical solutions, " Wireless. Netw., vol. 8, no. 5, pp. 443-454, Sep. 2002.
9. S. Meguerdichian, S. Slijepcevic, V. Karayan, and M. Potkonjak, "Localized algorithms in wireless ad-hoc networks: Location discovery and sensor exposure, " in Proc. 2nd ACM Int. Symp. Mobile Ad Hoc Netw. Comput., 2001, pp. 106-116.
10. L. Liang, Z. Xi, and M. Huadong, "Minimal exposure path algorithms for directional sensor networks, " in Proc. IEEE GLOBECOM, 2009, 1-6.
11. L. Liu, X. Zhang, and H. Ma, "Percolation theory based exposure-path prevention for wireless sensor networks coverage in Internet of things, " IEEE Sens. J., vol. 13, no. 10, pp. 3625-3636, Oct. 2003.
12. S. Yuning, L. Liang, M. Huadong, and A. V. Vasilakos, "A biologybased algorithm to minimal exposure problem of wireless sensor networks, " IEEE Trans. Netw. Service Manage., vol. 11, no. 3, pp. 417-430, Sep. 2014.
13. L. Liang, S. Yuning, Z. Haiyang, M. Huadong, and A. V. Vasilakos, "Physarum optimization: A biology-inspired algorithm for the steiner tree problem in networks, " IEEE Trans. Comput., vol. 64, no. 3, pp. 819-832, Mar. 2015.
14. H. N. Djidjev, "Approximation algorithms for computing minimum exposure paths in a sensor field, " ACM Trans. Sens. Netw., vol. 7, no. 3, pp. 23, Sep. 2010.
15. K. Chakrabarty, S. S. Iyengar, Q. Hairong, and C. Eungchun, "Grid coverage for surveillance and target location in distributed sensor networks, " IEEE Trans. Comput., vol. 51, no. 12. pp. 1448-1453, Dec. 2002.
16. M. Hata, "Empirical formula for propagation loss in land mobile radio services, " IEEE Trans. Veh. Technol., vol. VT-29, no. 3, pp. 317-325, Aug. 1980.
17. Y. Zou and K. Charkrabarty, "A distributed coverage-and connectivitycentric technique for selecting active nodes in wireless sensor networks, " IEEE Trans. Comput., vol. 54, no. 8, pp. 978-991, Aug. 2005.
18. Y. Zou and K. Charkrabarty, "Sensor deployment and target localization in distributed sensor networks, " ACMTrans. Embed. Comput. Syst., vol. 3, no. 1, pp. 61-91, 2004.
19. D. KeBo and L. Zhong, "Minimum path exposure and detection interval setting for target detection using wireless sensor network, " Int. J. Wireless Inf. Netw., vol. 14, no. 4, pp. 289-294, Dec. 2007.
20. I. M. Gelfand, S. V. Fomin, Calculus of Variations. NewYork, NY, USA: Dove, 2000, pp. 1-14.
21. J.-P. Aubin, Applied Functional Analysis, 2nd ed. New York, NY, USA: Wiley, 2000, pp. 31-41.
22. H. N. Djidjev, "Efficient computation of minimum exposure paths in a sensor network field, " in Proc. 3rd IEEE Int. Conf. DCOSS, Santa Fe, NM, USA, Jun. 18-20, 2007, pp. 295-308.
23. M. Elmorsy and E. S. Elmallah, "Breach path to target area detection reliability in wireless sensor networks, " in Proc. IEEE 39th Conf. LCN, 2014, pp. 253-261.
24. K. Rektorys, Variational Methods in Mathematics, Science and Engineering. Amsterdam, The Netherlands: Reidel, 1980, pp. 146-178.
25. R. V. Kulkarni, A. Förster, and G. K. Venayagamoorthy, "Computational intelligence in wireless sensor networks a survey, " IEEE Commun. Surveys Tuts., vol. 13, no. 1, pp. 68-96, 1st Quart. 2011.
26. Y.-W. Leung and Y. Wang, "An orthogonal genetic algorithm with quantization for global numerical optimization, " IEEE Trans. Evol. Comput., vol. 5, no. 1, pp. 41-53, Feb. 2001.
27. Y. Wang and C. Dang, "An evolutionary algorithm for global optimization based on level-set evolution and latin squares, " IEEE Trans. Evol. Comput., vol. 11, no. 5, pp. 579-595, Oct. 2007.
28. Y. Wang, Y.-C. Jiao, and H. Li, "An evolutionary algorithm for solving nonlinear bilevel programming based on a new constraint-handling scheme, " IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 35, no. 2, pp. 221-232, May 2005.
29. R. Qing-dao-er-ji and Y. Wang, "A new hybrid genetic algorithm for job shop scheduling problem, " Comput. Oper. Res., vol. 39, no. 10, pp. 2291-2299, Oct. 2012.
30. K. A. A. D. Raj and C. Rajendran, "A genetic algorithm for solving the fixed-charge transportation model: Two-stage problem, " Comput. Oper. Res., vol. 39, no. 9, pp. 2016-2032, Sep. 2012.
31. D. E. Goldberg, Genetic Algorithms in search, Optimization and Machine Learning. Reading, MA, USA: Addison-Wesley, 1989, p. 121.
32. S. S. Rao and S. S. Rao, Engineering Optimization: Theory and Practice. New York, NY, USA: Wiley, 2009, pp. 257-258.
33. C.Woodford and C. Phillips, Numerical Methods With Worked Examples: Matlab Edition, 2nd ed. Dordrecht, The Netherland: Springer-Verlag, 2011, pp. 173-174.
34. W. Sun and Y. Yuan, Optimization Theory and Methods: Nonlinear Programming. New York, NY, USA: Springer-Verlag, 2006, pp. 89-90.
35. A. O. Allen, Probability, Statistics, and Queuing Theory With Computer Science Applications, 2nd ed. Boston, MA, USA: Academic, 1990.
36. H. Tuan, S. A. Ericsson, F.Massy, and S. S.Moreira, "The heap-sort based ATM cells spacer, " in Proc. IEEE 2nd ICATM, Colmar, France, 1999, pp. 346-350.
37. A. P. Alves da Silva and D. M. Falcaõ, Fundamentals of Genetic Algorithms, in Modern Heuristic Optimization Techniques: Theory and Applications to Power Systems. Hoboken, NJ, USA: Wiley, 2008, pp. 25-42.
38. E. W. Dijkstra, "A note on two problems in connexion with graphs, " Numer. Math., vol. 1, no. 1, pp. 269-271, 1959.
39. J. W. Brandt and V. R. Algazi, "Continuous skeleton computation by Voronoi diagram, " CVGIP: Image Understand., vol. 55, no. 3, pp. 329-338, May 1992.
40. H. Edelsbrunner, A Short Course in Computational Geometry and Topology: Voronoi and Delaunay Diagrams. Berlin, Germany: Springer-Verlag, 2014, pp. 9-15.
41. C. K. Yap, "An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments, " Discrete Comput. Geom., vol. 2, no. 1, pp. 365-393, 1987.