<p>Wireless sensor networks offer easy implementation, flexibility and mobility of hand held </p><p>devices. Sensors consist of an internal power source, which is the great limitation for </p><p>the life time and the usage of sensor networks. To increase the life time, sensors should </p><p>stay in energy saving sleep mode as long as possible, because in sleep mode the radio is </p><p>either shut down or working with less energy. Better energy handling is implemented in </p><p>different power saving mechanism of common Medium Access Control protocols, which are </p><p>evaluated and analyzed and further extensions and ideas to improve the energy efficiency </p><p>are presented. Slotted PSM is simulated with the NS2 and compared to the WLAN 802.11 </p><p>PSM technology and the results show that energy efficiency and power consumption are </p><p>much better implemented and life time increases with the use of Slotted PSM.</p>

Wireless sensor networks offer easy implementation, flexibility and mobility of hand held devices. Sensors consist of an internal power source, which is the great limitation for the life time and the usage of sensor networks. To increase the life time, sensors should stay in energy saving sleep mode as long as possible, because in sleep mode the radio is either shut down or working with less energy. Better energy handling is implemented in different power saving mechanism of common Medium Access Control protocols, which are evaluated and analyzed and further extensions and ideas to improve the energy efficiency are presented. Slotted PSM is simulated with the NS2 and compared to the WLAN 802.11 PSM technology and the results show that energy efficiency and power consumption are much better implemented and life time increases with the use of Slotted PSM.

In this thesis, we proposed a simple yet novel multicast scheduling scheme for IEEE 802.16e wireless metropolitan area networks. Specifically, we want to solve the problem that how the base station schedules data messages in a multicast superframe such that mobile stations can receive their required multicast data and the total awake time of mobile stations is minimal. We first prove that this problem is NP-complete, and then propose a greedy k-approximation algorithm, named G-EEMS, whose running time is , where n is the total number of multicast data messages and k is the size of MBS (multicast and broadcast service) zone in a frame. Simulation results show that, in terms of energy throughput, G-EEMS significantly outperforms the existing scheme, called SMBC-D.