Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

OPEN: an optimisation scheme of N-node coverage in wireless sensor networks

OPEN: an optimisation scheme of N-node coverage in wireless sensor networks

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

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.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 Wireless Sensor Systems — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Deployment is an important issue in wireless sensor networks (WSNs). Most recent researches focus on the optimal deployment strategy to achieve full coverage in WSNs. However, the sensing devices in practical applications are finite, and cannot achieve full coverage in the whole monitored region. Moreover, the monitored objects distribute unevenly, and thus the monitored significance differs from region to region. How to deploy limited number of sensors efficiently has been to an important issue. In this study, we propose a new coverage problem in WSNs, named N-node coverage, to acquire the maximum information about monitored objects with N sensors. In this problem, the captured information is used as the new evaluation metric for network coverage. On the basis of the metric, we establish the N-node network coverage model, and prove that the N-node coverage problem is NP-hard. The authors propose a heuristic algorithm for deployment, named optimisation schEme of N-node (OPEN), to obtain the near-optimal solution of the problem. Experimental results show that the OPEN can effectively improve the coverage performance of the WSNs, and is able to provide practical guideline for deployment of WSNs with limited number of nodes.

References

    1. 1)
    2. 2)
    3. 3)
      • Wang, J., Sirisha, M., Muralidhar, M.: `Energy-efficient k-coverage for wireless sensor networks with variable sensing radii', Proc. IEEE GLOBECOM, December 2009, p. 1–6.
    4. 4)
      • Balister, P., Zheng, Z., Kumar, S., Sinha, P.: `Trap coverage: Allowing coverage holes of bounded diameter in wireless sensor networks', Proc. IEEE INFOCOM, April 2009, p. 136–144.
    5. 5)
    6. 6)
      • Andreas, K., Acrlos, G., Anupam, G., Jon, K.: `Near optimal sensor placements: maximizing information while minimizing communication cost', Proc. IEEE/ACM IPSN, April 2006, p. 19–21.
    7. 7)
      • Kar, K., Banerjee, S.: `Node placement for connected coverage in sensor networks', Proc. IEEE WIOPT, 2003, p. 34–43.
    8. 8)
      • Q. Wu , S. Iyengar , N. Rao . (2002) On efficient deployment of sensors on planar grid.
    9. 9)
      • K. Andreas , G. Acrlos , G. Anupam , K. Jon . Robust sensor placements at informative and communication-efficient locations. ACM Trans. Sens. Netw. , 1550 - 4859
    10. 10)
      • Liu, B., Brass, P., Dousse, O., Nain, P., Towsky, D.: `Mobility improves coverage of sensor networks', Proc. ACM MOBIHOC, May 2005, p. 300–308.
    11. 11)
      • Xing, G., Tan, R., Liu, B., Wang, J., Jia, X., Yi, C.W.: `Data fusion improves the coverage of wireless sensor networks', Proc. ACM MOBICOM, September 2009, p. 157–168.
    12. 12)
      • P. Hall . (1988) In introduction to the theory of coverage processes.
    13. 13)
      • Bai, X.L., Yun, Z.Q., Xuan, D., Chen, B., Zhao, W.: `Optimal multiple-coverage of sensor networks', Proc. IEEE INFOCOM, April 2011, p. 2122–2132.
    14. 14)
    15. 15)
    16. 16)
    17. 17)
    18. 18)
    19. 19)
      • Balister, P., Kumar, S.: `Random vs. deterministic deployment of sensors in the presence of failures and placement errors', Proc. IEEE INFOCOM, April 2009, p. 2896–2900.
    20. 20)
    21. 21)
      • Yuan, Z., Tan, R., Xing, G.L., Lu, C., Chen, Y., Wang, J.: `Fast sensor placement algorithms for fusion-based target detection', Proc. IEEE RTSS, 2008, p. 103–112.
    22. 22)
    23. 23)
      • Hefeeda, M., Ahmadi, H.: `A probabilistic coverage protocol for wireless sensor networks', Proc. IEEE ICNP, 2007, p. 41–50.
    24. 24)
      • Fei, X., Azzedine, B., Regina, B.A.: `Irregular sensing range detection model for coverage based protocols in wireless sensor networks', Proc. IEEE GLOBECOM, December 2009, p. 122–128.
    25. 25)
      • Bejerano, Y.: `Simple and efficient k-coverage verification without location information', Proc. IEEE INFOCOM, April 2008, p. 291–295.
    26. 26)
      • Liu, B., Towsley, D.: `A study of the coverage of large-scale sensor networks', Proc IEEE MOBIHOC, October 2004, p. 475–483.
    27. 27)
      • Zhao, M.C., Lei, J.Y., Wu, M.Y., Liu, Y.H., Shu, W.: `Surface coverage in wireless sensor networks', Proc. IEEE, INFOCOM, April 2009, p. 109–117.
    28. 28)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-wss.2011.0012
Loading

Related content

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