Minimum-Energy Cooperative Routing in Wireless Networks with Channel Variations
| dc.contributor.author | Dehghan, Mostafa | eng |
| dc.contributor.author | Ghaderi, Majid | eng |
| dc.contributor.author | Goeckel, Dennis | eng |
| dc.date.accessioned | 2010-08-05T16:46:10Z | |
| dc.date.available | 2010-08-05T16:46:10Z | |
| dc.date.issued | 2010-08-05T16:46:10Z | |
| dc.description.abstract | This paper considers the problem of finding minimum-energy cooperative routes in a wireless network with variable wireless channels. We assume that each node in the network is equipped with a single omnidirectional antenna and, motivated by the large body of physical layer research indicating its potential utility, that multiple nodes are able to coordinate their transmissions at the physical layer in order to take advantage of spatial diversity. Such coordination, however, is intrinsically intertwined with routing decisions, thus motivating the work. We first formulate the energy cost of forming a cooperative link between two nodes based on a two-stage transmission strategy assuming that only statistical knowledge about channels is available. Utilizing the link cost formulation, we show that optimal static routes in a network can be computed by running Dijkstra’s algorithm over an extended network graph created by cooperative links. However, due to the variability of wireless channels, we argue that many-to-one cooperation model in static routing is suboptimal. Hence, we develop an opportunistic routing algorithm based on many-to-many cooperation, and show that optimal routes in a network can be computed by a stochastic version of the Bellman-Ford algorithm. We use static and opportunistic optimal algorithms as baselines to develop heuristic link selection algorithms that are energy efficient while being computationally simpler than the optimal algorithms. We simulate our algorithms and show that while optimal cooperation and link selection can reduce energy consumption by almost an order of magnitude compared to non-cooperative approaches, our simple heuristics perform reasonably well achieving similar energy savings while being computationally efficient as well. | eng |
| dc.description.refereed | No | eng |
| dc.identifier.department | 2010-968-17 | eng |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30626 | |
| dc.identifier.uri | http://hdl.handle.net/1880/48017 | |
| dc.language.iso | eng | eng |
| dc.publisher.corporate | University of Calgary | eng |
| dc.publisher.faculty | Science | eng |
| dc.subject | Wireless | eng |
| dc.subject | networks | eng |
| dc.subject.other | Cooperative communication, minimum energy routing, variable wireless channels | eng |
| dc.title | Minimum-Energy Cooperative Routing in Wireless Networks with Channel Variations | eng |
| dc.type | technical report | eng |
| thesis.degree.discipline | Computer Science | eng |