• Information Technology
  • Human Resources
  • Careers
  • Giving
  • Library
  • Bookstore
  • Active Living
  • Continuing Education
  • Go Dinos
  • UCalgary Maps
  • UCalgary Directory
  • Academic Calendar
My UCalgary
Webmail
D2L
ARCHIBUS
IRISS
  • Faculty of Arts
  • Cumming School of Medicine
  • Faculty of Environmental Design
  • Faculty of Graduate Studies
  • Haskayne School of Business
  • Faculty of Kinesiology
  • Faculty of Law
  • Faculty of Nursing
  • Faculty of Nursing (Qatar)
  • Schulich School of Engineering
  • Faculty of Science
  • Faculty of Social Work
  • Faculty of Veterinary Medicine
  • Werklund School of Education
  • Information TechnologiesIT
  • Human ResourcesHR
  • Careers
  • Giving
  • Library
  • Bookstore
  • Active Living
  • Continuing Education
  • Go Dinos
  • UCalgary Maps
  • UCalgary Directory
  • Academic Calendar
  • Libraries and Cultural Resources
View Item 
  •   PRISM Home
  • Science
  • Science Research & Publications
  • View Item
  •   PRISM Home
  • Science
  • Science Research & Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Energy Efficient Cooperative Routing in Wireless Networks

Thumbnail
Download
2009-930-09.pdf (232.5Kb)
Author
Dehghan, Mostafa
Ghaderi, Majid
Accessioned
2009-06-05T19:45:20Z
Available
2009-06-05T19:45:20Z
Issued
2009-06-05T19:45:20Z
Other
Minimum energy routing, cooperative communication, cooperative MIMO, wireless networks
Subject
routing, wireless
Type
technical report
Metadata
Show full item record

Abstract
In this paper, we explore physical layer cooperative communication in order to design network layer routing algorithms that are energy efficient. We assume each node in the network is equipped with a single omnidirectional antenna and that multiple nodes are able to coordinate their transmissions in order to take advantage of spatial diversity to save energy. Specifically, we consider cooperative MIMO at physical layer and multi-hop routing at network layer, and formulate minimum energy routing as a joint optimization of the transmission power at the physical layer and the link selection at the network layer. Using dynamic programming, we compute the energy consumption of the optimal cooperative routing in different network scenarios, which shows energy savings of up to 55%, compared with the optimal non-cooperative routing. As the network becomes larger, however, finding optimal routes becomes computationally intractable as the complexity of the dynamic programming approach increases as O(22n), where n is the number of nodes in the network. As such, we develop two greedy routing algorithms that have complexity of O(n2), and yet achieve significant energy savings. Simulation results indicate that the proposed greedy algorithms perform almost as good as the optimal algorithm and achieve energy savings of more than 50% in the simulated scenarios.
Refereed
No
Corporate
University of Calgary
Faculty
Science
Doi
http://dx.doi.org/10.11575/PRISM/30624
Uri
http://hdl.handle.net/1880/47277
Collections
  • Science Research & Publications

Browse

All of PRISMCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors

  • Email
  • SMS
  • 403.220.8895
  • Live Chat

Energize: The Campaign for Eyes High

Privacy Policy
Website feedback

University of Calgary
2500 University Drive NW
Calgary, AB T2N 1N4
CANADA

Copyright © 2017