Downloads: 134 | Views: 314 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1

Research Paper | Mathematics | India | Volume 3 Issue 3, March 2014 | Popularity: 6.5 / 10

Rate This Article!      

Efficient Algorithm for Maximizing Life Time of Wireless Sensor Networks

Ram Baksh, Ranjan Kumar Thakur, Arabind Kumar, Aditya Pratap Singh

Abstract: In this paper we give domatic partition algorithm for obtaining the maximum number of disjoint dominating sets. At a time only one dominating set activated and other puts into rest mode. We also explore grid-based coordinated routing in wireless sensor networks and compare the energy available in the network over time for different grid sizes. A test area is divided into square-shaped grids of certain length. Fully charged battery powered nodes are randomly placed in the area with a fixed source and sink nodes. One node per grid is elected as the coordinator which does the actual routing. The source node starts flooding the network with every coordinator joining in the routing. Once the flooding reaches the sink node, information is sent back to the source by finding the back route to the source this process is continued until a node (coordinator) along that route runs out of energy. New coordinators are elected to replace the depleted ones. The source node refloods the network so that the sink can find a new back route to send information. This entire process continues until the network is partitioned and the connectivity between the source and the sink nodes is lost. In this work we compare domatic partition algorithm with grid based algorithm.

Keywords: Domatic, Dominating, Sensor, wireless, flooding

Edition: Volume 3 Issue 3, March 2014

Pages: 244 - 248

Make Sure to Disable the Pop-Up Blocker of Web Browser

Click to Cite this Article

Similar Articles