Abstract
Wireless sensor network consists of large number of sensor nodes which is used to capture environmental conditions, process and transfer it to base station. These sensor nodes are sensitive to energy consumption and gets exhausted on working. So we need to emphasize on reducing energy dissipation of sensor nodes in order to improve network lifetime. Various routing protocols are developed to enhance network scalability and stability. The cluster based routing is an efficient way of reducing energy dissipation by limiting data transmission from nodes to base station. For this purpose we proposed a new routing method which improves the life span of network, its data transmitting capability with low energy consumption. It is an improvised version of LEACH protocol which conserves energy by load balancing .Multi hop routing is proposed for the transmission of data. Reduction of energy consumption is achieved with the help of TDMA scheduling. Time division multiple access (TDMA)-based MAC can potentially reduce the delay and provide real-time guarantees as well as save power by eliminating collisions. To keep network alive we had added a random node on replacement of dyeing node. The performance evaluation of protocol is based on simulation test performed in network simulator 2 (NS2) to prove the effectiveness of this proposed method in terms of network lifetime and energy efficiency. Keywords: Base station (BS), Clustering, Energy efficiency, Routing protocol, Wireless sensor network (WS
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.