Kablosuz duyucu ağlarında enerji korunması için kısmi kapsamalı uyku düzenlemesi

Wireless sensor networks, which consist of many sensor devices communicatingwith each other in order to sense the environment, is an emerging field in thearea of wireless networking. The primary objective in these wireless networksis the efficiency of energy consumption. Since these networks consist of a largenumber of sensors, allowing some of the nodes to sleep intermittently can greatlyincrease the network lifetime. Furthermore, some applications do not require100% coverage of the network field and allowing the coverage to drop below100%, i.e., partial coverage, can further increase the network lifetime.A sleep scheduling algorithm must be distributed, simple, scalable and en-ergy efficient. In this thesis, the problem of designing such an algorithm whichextends network lifetime while maintaining a target level of partial coverage isinvestigated. An algorithm called Distributed Adaptive Sleep Scheduling Algo-rithm (DASSA) which does not require location information is proposed. Theperformance of DASSA is compared with an integer linear programming (ILP)based optimum sleep scheduling algorithm, an oblivious algorithm and with anexisting algorithm in the literature. DASSA attains network lifetimes up to 89%iof the optimum solution, and it achieves significantly longer lifetimes comparedwith the other two algorithms.Furthermore, the minimum number of sensors that should be deployed inorder to satisfy a given partial coverage target with a certain probability whilemaintaining connectivity is computed and an ILP formulation is presented forfinding the minimum number of sensors that should be activated within the setof deployed sensors.Keywords: Wireless Sensor Networks, Partial Coverage, Sleep Scheduling, Net-work Lifetimeii