With various new alternatives of low-cost sensor devices, there is a strong demand for large scale wireless sensor networks (WSN). Energy efficiency in routing is crucial for achieving the desired levels of longevity in these networks. Existing routing algorithms that do not combine information on transmission energies on links, residual energies at nodes, and the identity of data itself, cannot reach network capacity. A proof-of-concept routing algorithm that combines data aggregation with the minimum-weight path routing is studied in this thesis work. This new algorithm can achieve much larger network lifetime when there is redundancy in messages to be carried by the network, a practical reality in sensor network applications.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12608626/index.pdf |
| Date | 01 July 2007 |
| Creators | Zengin, Asli |
| Contributors | Uysal-biyikoglu, Elif |
| Publisher | METU |
| Source Sets | Middle East Technical Univ. |
| Language | English |
| Detected Language | English |
| Type | M.S. Thesis |
| Format | text/pdf |
| Rights | To liberate the content for public access |
Page generated in 0.0018 seconds