http://iet.metastore.ingenta.com
1887

Area-priority-based sensor deployment optimisation with priority estimation using K-means

Area-priority-based sensor deployment optimisation with priority estimation using K-means

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Deployment in wireless sensor networks (WSN) addresses maximising the coverage of sensors and reducing the total cost of deployment. The area-priority concept for WSN deployment that the authors contributed to the literature recently allows environments with regions that have different importance or priority levels. In this study, the authors propose the first priority-estimation method for area-priority-based WSN deployments. First, a satellite image of the environment that will be used in the deployment of the sensors is clustered by a K-means algorithm using the colour features of the regions. In the sensor deployment phase, this cluster information is used to determine the priorities of the sensor coverage areas on positions of the image. Sensors are initially deployed quickly using a priority queue-based technique. Then, a simulated annealing algorithm is used to maximise the total covered area priority and to minimise the gaps between the sensors. Various experiments are performed for different scenarios (land, sea, and forest) on images captured from Google Maps using different parameter values. The experiments confirm that the proposed approach performs well and outperforms the random deployment of sensors.

References

    1. 1)
      • 1. Yick, Y., Mukherjee, B., Ghosal, D.: ‘Wireless sensor network survey’, Comput. Netw., 2008, 52, (12), pp. 22922330.
    2. 2)
      • 2. Kalayci, T.E., Ugur, A.: ‘Genetic algorithm-based sensor deployment with area priority’, Cybern. Syst., 2011, 42, (8), pp. 605620.
    3. 3)
      • 3. Younis, M., Akkaya, K.: ‘Strategies and techniques for node placement in wireless sensor networks: a survey’, Ad Hoc Netw., 2008, 6, (4), pp. 621655.
    4. 4)
      • 4. Huang, C.F., Tseng, Y.C.: ‘The coverage problem in a wireless sensor network’. Proc. of the 2nd ACM Int. Conf. on Wireless Sensor Networks and Applications, WSNA'03, New York, NY, USA, September 2003, pp. 115121.
    5. 5)
      • 5. Yildirim, K.S., Kalayci, T.E., Ugur, A.: ‘Optimizing coverage in a k-covered and connected sensor network using genetic algorithms’. Proc. of the 9th WSEAS Int. Conf. on Evolutionary Computing, EC'08, Stevens Point, Wisconsin, USA, May 2008, pp. 2126. WSEAS.
    6. 6)
      • 6. Weise, T.: ‘Global optimization algorithms theory and application’, 2009.
    7. 7)
      • 7. Mahfoudh, S., Minet, P., Laouiti, A.: ‘Overview of deployment and redeployment algorithms for mobile wireless sensor networks’, Procedia Comput. Sci., 2012, 10, pp. 946951.
    8. 8)
      • 8. Khoufi, I., Minet, P., Laouiti, A., et al: ‘Survey of deployment algorithms in wireless sensor networks: coverage and connectivity issues and challenges’, Int. J. Auton. Adapt. Commun. Syst., (IN PRESS), https://hal.inria.fr/hal-01095749, accessed March 2017.
    9. 9)
      • 9. Monica, , Sharma, A.K.: ‘Comparative study of energy consumption for wireless sensor networks based on random and grid deployment strategies’, Int. J. Comput. Appl., 2010, 6, (1), pp. 2835.
    10. 10)
      • 10. Singh, S., Chand, S., Kumar, R., et al: ‘Optimal sensor deployment for WSNs in grid environment’, Electron. Lett., 2013, 49, (16), pp. 10401041.
    11. 11)
      • 11. Liu, X., He, D.: ‘Ant colony optimization with greedy migration mechanism for node deployment in wireless sensor networks’, J. Netw. Comput. Appl., 2014, 39, pp. 310318.
    12. 12)
      • 12. Liu, B.H., Su, K.W.: ‘Enhanced algorithms for deploying the minimum sensors to construct a wireless sensor network having full coverage of critical square grids’, Wirel. Netw., 2014, 20, (2), pp. 331343.
    13. 13)
      • 13. Yadav, G.: ‘Analysis of grid based sensor deployment for area coverage in wireless sensor network’, Int. J. Comput. Sci., 2016, 2, (1), pp. 1621.
    14. 14)
      • 14. Fidanova, S., Marinov, P., Alba, E.: ‘Ant algorithm for optimal sensor deployment’, in Madani, K., Correia, A.D., Rosa, A., et al (Eds): ‘Computational intelligence, volume 399 of studies in computational intelligence’ (Springer Berlin Heidelberg, Spain, 2012), pp. 2129.
    15. 15)
      • 15. Ozturk, C., Karaboga, D., Gorkemli, B.: ‘Artificial bee colony algorithm for dynamic deployment of wireless sensor networks’, Turk. J. Electr. Eng. Comput. Sci., 2012, 20, pp. 255262.
    16. 16)
      • 16. Bar-Noy, A., Brown, T., Shamoun, S.: ‘Sensor allocation in diverse environments’, Wirel. Netw., 2012, 18, (6), pp. 697711.
    17. 17)
      • 17. Esnaashari, M., Meybodi, M.R.: ‘Deployment of a mobile wireless sensor network with k-coverage constraint: a cellular learning automata approach’, Wirel. Netw., 2013, 19, (5), pp. 945968.
    18. 18)
      • 18. Nazi, A., Raj, M., Di Francesco, M., et al: ‘Deployment of robust wireless sensor networks using gene regulatory networks: an isomorphism-based approach’, Pervasive Mob. Comput., 2014, 13, pp. 246257.
    19. 19)
      • 19. Sun, X., Zhang, Y., Ren, X., et al: ‘Optimization deployment of wireless sensor networks based on culture-ant colony algorithm’, Appl. Math. Comput., 2015, 250, pp. 5870.
    20. 20)
      • 20. Vecchio, M., Lopez-Valcarce, R.: ‘Improving area coverage of wireless sensor networks via controllable mobile nodes: A greedy approach’, J. Netw. Comput. Appl., 2015, 48, pp. 113.
    21. 21)
      • 21. Singh, A., Sharma, T.P.: ‘Position and hop-count assisted full coverage control in dense sensor networks’, Wirel. Netw., 2015, 21, (2), pp. 625638.
    22. 22)
      • 22. Rout, M., Roy, R.: ‘Dynamic deployment of randomly deployed mobile sensor nodes in the presence of obstacles’, Ad Hoc Netw., 2016, 46, pp. 1222.
    23. 23)
      • 23. Frattolillo, F.: ‘A deterministic algorithm for the deployment of wireless sensor networks’, Int. J. Commun. Netw. Inf. Sec., 2016, 8, (1), pp. 110.
    24. 24)
      • 24. Tsai, C.-W.: ‘An effective WSN deployment algorithm via search economics’, Comput. Netw., 2016, 101, pp. 178191.
    25. 25)
      • 25. MacKay, D.J.C.: ‘Information theory, inference & learning algorithms’ (Cambridge University Press, New York, NY, USA, 2003).
    26. 26)
      • 26. Suman, B., Kumar, P.: ‘A survey of simulated annealing as a tool for single and multiobjective optimization’, J. Oper. Res. Soc., 2006, 57, (18), pp. 11431160.
    27. 27)
      • 27. Xu, R., Wunsch,, D.II: ‘Survey of clustering algorithms’, Trans. Neural Netw., 2005, 16, (3), pp. 645678.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2016.1264
Loading

Related content

content/journals/10.1049/iet-com.2016.1264
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address