抽象的

TDMA Scheduling with Leach protocol

S.Padmini, Sri.Promod Kumar Sahu

In this paper, we propose a solution to the scheduling problem in clustered wireless sensor networks (WSNs). The objective is to provide network-wide optimized time division multiple access (TDMA) schedules that can achieve high power efficiency, zero conflict, and reduced end-to-end delay. To achieve this objective, we first build a nonlinear cross-layer optimization model involving the network, medium access control (MAC), and physical layers, which aims at reducing the overall energy consumption. We solve this problem by transforming the model into two simpler sub problems. Based on the network-wide flow distribution calculated from the optimization model and transmission power on every link, we then propose an algorithm for deriving the TDMA schedules, utilizing the slot reuse concept to achieve minimum TDMA frame length. Numerical results reveal that our proposed solution reduces the energy consumption and delay significantly, while simultaneously satisfying a specified reliability objective.In wireless sensor networks (WSNs), due to the limitation of nodesenergy, energy efficiency is an important factor should beconsidered when the protocols are designing. As a typical representative of hierarchical routing protocols, LEACH Protocol plays an important role. In response to the uneven energy distribution that is caused by the randomness of cluster heads forming , this paper proposes a new improved algorithm ofLEACH protocol (LEACH-TLCH) which is intended to balance the energy consumption of the entire network and extend the life of the network . The new algorithm simulation results indicate that both energy efficiency and the lifetime of the network are better than that of LEACH Protocol.