In wireless sensor networks, the maximum lifetime routing problem has received increasing attention among researchers. There are several critical features that need to be considered while designing a wireless sensor networks such as cost, network lifetime and Quality of service. Due to the limitation on the energy of sensor nodes, energy efficient routing is a very important issue in sensor networks. Therefore, to prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. One solution is to formulate the routing problem as a linear programming problem by maximizing the time at which the first node runs out of battery. In this paper, with the notion of maximizing the system lifetime, we implemented a new heuristic and evaluated the performance of it with the existing algorithm called flow augmentation algorithm. Further, our experimental results demonstrate that the proposed algorithm significantly outperform FA algorithm, in terms of system lifetime.
| Identifer | oai:union.ndltd.org:siu.edu/oai:opensiuc.lib.siu.edu:theses-1684 |
| Date | 01 August 2011 |
| Creators | Kuppaswamy, Karthik |
| Publisher | OpenSIUC |
| Source Sets | Southern Illinois University Carbondale |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Theses |
Page generated in 0.0021 seconds