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

Coverage analysis and active scheme of wireless sensor networks

Coverage analysis and active scheme of 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.

Coverage is regarded as one of the important quality of service merits of a wireless sensor network (WSN) to evaluate its monitoring capability. In this study, the authors develop a novel quantitative method to evaluate the quality of coverage of sensors. Deployment entropy is introduced to measure non-uniformity in sensor coverage, which could reveal the quality of sensor deployment without considering the sensing region of the sensors. Moreover, the authors develop a scheme of activating pre-deployed sensors based on the result of deployment entropy, which is to activate additional pre-deployed sensors in keeping with the tendency of increasing the deployment entropy. The simulation results show that it can improve the sensing coverage with less active sensors than the other sensor placement method.

References

    1. 1)
    2. 2)
      • Ye, F., Zhong, G., Cheng, J., Lu, S., Zhang, L.: `PEAS: a robust energy conserving protocol for long-lived sensor networks', Proc. 23rd IEEE Int. Conf. Distributed Computing Systems, 2003, p. 28–37.
    3. 3)
      • S. Boyd , L. Vandenberghe . (2004) Convex optimization.
    4. 4)
      • Tian, D., Georganas, N.D.: `A coverage-preserving node scheduling scheme for large wireless sensor networks', Proc. First ACM Int. Workshop Wireless Sensor Networks and Applications, 2002, p. 32–41.
    5. 5)
    6. 6)
      • Liu, M., Cao, J., Luo, W.: `Coverage analysis for wireless sensor networks', Proc. MSN’2005, Heidelberg, p. 711–720.
    7. 7)
      • Wang, G., Cao, G., Porta, T.L., Zhang, W.: `Sensor relocation in mobile sensor networks', Proc. IEEE INFOCOM, 2005, p. 2302–2312.
    8. 8)
      • Wang, X., Xing, G., Zhang, Y.: `Integrated coverage and connectivity configuration in wireless sensor networks', Proc. First ACM Int. Conf. Embedded Networked Sensor Systems, 2003, p. 28–39.
    9. 9)
    10. 10)
      • M. Abramowitz , I.A. Stegun . (1964) Handbook of mathematical functions with formulas, graphs, and mathematical tables.
    11. 11)
      • Du, X., Lin, F.: `Improving sensor network performance by deploying mobile sensors', Proc. 24th IEEE Int. Performance, Computing, and Communication Conf., 2005, p. 67–71.
    12. 12)
      • Meguerdichian, S., Koushanfar, F., Potkonjak, M.: `Coverage problems in wireless ad-hoc sensor networks', IEEE INFOCOM-2001, 2001, Anchorage, USA, p. 1380–1387.
    13. 13)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-wss.2011.0092
Loading

Related content

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