Multipath route construction methods for wireless sensor networks
| dc.contributor.author | Rizvi, Saad | |
| dc.contributor.examiningcommittee | McNeill, Dean (Electrical and Computer Engineering) Hashemian, Fariborz (Civil Engineering) | en_US |
| dc.contributor.supervisor | Ferens, Ken (Electrical and Computer Engineering) | en_US |
| dc.date.accessioned | 2013-06-06T12:43:25Z | |
| dc.date.available | 2013-06-06T12:43:25Z | |
| dc.date.issued | 2013-06-06 | |
| dc.degree.discipline | Electrical and Computer Engineering | en_US |
| dc.degree.level | Master of Science (M.Sc.) | en_US |
| dc.description.abstract | Routing plays an important role in energy constrained Wireless Sensor Networks (WSNs). To conserve energy in WSN, energy-efficiency of the routing protocol is an important design consideration. These protocols should maximize network lifetime and minimize energy consumption. In this thesis, a novel multipath routing protocol is proposed for WSNs, which constructs multiple paths based on residual energy of the nodes. The protocol allows the source node to select a path for data transmission from the set of discovered multiple paths based on cumulative residual energy or variance. Choosing a next-hop node based on energy, and using an alternative path for routing achieves load balancing. The results show that the proposed algorithm M-VAR has lower residual energy variance (96%, 90%, 72%, 12% less) and longer network lifetime (404%, 205%, 115%, 10%) than basic Directed Diffusion, load-balanced Directed Diffusion (LBDD-ED-RD), multipath Directed Diffusion (MDD-CRE), and the proposed algorithm M-CRE, respectively. | en_US |
| dc.description.note | October 2013 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1993/21280 | |
| dc.language.iso | eng | en_US |
| dc.rights | open access | en_US |
| dc.subject | Wireless Sensor Networks | en_US |
| dc.subject | Routing protocols | en_US |
| dc.title | Multipath route construction methods for wireless sensor networks | en_US |
| dc.type | master thesis | en_US |