A Mathematical Model for Energy-Efficient Coverage and Detection in Wireless Sensor Networks
The tradeoff between system lifetime and system reliability is a paramount design consideration for wireless sensor networks. In order to prolong the system lifetime, random sleep scheme can be adopted without coordinating with its neighboring nodes. Based on the random sleep scheme, an accurate mathematical model for expected coverage ratio and point event detection quality is put forward in this paper. Furthermore, the model also takes the border effects into account and thus improves the accuracy of performance and quality analysis. Our model is flexible enough to capture the interaction among the essential system parameters. Therefore, this model could provide beneficial guidelines for optimal sensor network deployment satisfying both the lifetime and reliability requirements. Additional simulation results confirm the correctness and effectiveness of our analysis.
KeywordsSensor Network Sensor Node Wireless Sensor Network Time Slot Border Area
Unable to display preview. Download preview PDF.
- 1.Shih, E., Cho, S., Ickes, N., Min, R., Sinha, A., Wang, A., Chandrakasan, A.: Physical Layer Driven Protocol and Algorithm Design for Energy-efficient Wireless Sensor Networks. Proceedings of the seventh annual international conference on Mobile computing and networking (MobiCom 01), Rome, Italy, July (2001) 272–287Google Scholar
- 2.Tian, D., Georganas, N.D.: A Coverage-preserved Node Scheduling scheme for Large Wireless Sensor Networks. Proceedings of First International Workshop on Wireless Sensor Networks and Applications (WSNA’02), Atlanta, USA, September (2002) 32–41Google Scholar
- 3.Ye, F., Zhong, G., Lu, S., Zhang, L.: Energy Efficient Robust Sensing Coverage in Large Sensor Networks. UCLA Technical Report, (2002)Google Scholar
- 4.Xing, G., Wang, X., Zhang, Y, Lu, C., Pless, R., Gill, C.: Integrated Coverage and Connectivity Configuration for Energy Conservation in Sensor Networks. ACM Trans. Sensor Networks, in pressGoogle Scholar
- 5.Lu, J., Suda, T.: Coverage-aware Self-scheduling in Sensor Networks. Proceedings IEEE 18th Annual Workshop on Computer Communications, (2003) 117–123Google Scholar
- 6.Liu, M., Cao, J.N., Li X., Lou, W.: Coverage Analysis for Wireless Sensor Networks. Proc. 1st International Conference on Mobile Ad-Hoc and Sensor Networks (MSN’05), (2005) 711–720Google Scholar
- 7.Yen, L.H., Yu, C. W, Cheng, Y.M.: Expected K-coverage in Wireless Sensor Networks. Ad Hoc Networks, in pressGoogle Scholar
- 8.Tilak, S., Abu-Ghazaleh, N.B., Heinzelman, W.: Infrastructure Tradeoffs for Sensor Networks. Proceedings of First International Workshop on Wireless Sensor Networks and Applications (WSNA’02), Atlanta, USA, (2002) 49–57Google Scholar
- 9.Hsin, C.F., Liu, M.: Network Coverage using Low Duty Cycled Sensors: Random & Coordinated Sleep Algorithms. International Symposium on Information Processing in Sensor Networks, (2004) 433–442Google Scholar