Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
PAMAS—power aware multi-access protocol with signalling for ad hoc networks
ACM SIGCOMM Computer Communication Review
A Survey of Energy Efficient Network Protocols for Wireless Networks
Wireless Networks
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fiber-wireless (FiWi) access networks: a survey
IEEE Communications Magazine
Interference-aware energy-efficient power optimization
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
The next frontier for communications networks: power management
Computer Communications
Improving the performance of reliable transport protocols in mobile computing environments
IEEE Journal on Selected Areas in Communications
Fiber-wireless (FiWi) access networks: Challenges and opportunities
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
New multimedia services and ubiquitous networking pose great challenges on existing access network infrastructures. To cope with such requirements new access technologies, such as the fiber-wireless (FiWi), are being developed. Together with the emergence of new access networks, efforts are being made to reduce the amount of energy required to provide services. Indeed, this issue plays an increasingly important role. Here we propose an energy efficient routing algorithm for FiWi access networks. The main idea is to exploit the multipath capabilities of the wireless mesh front end of FiWi access networks to create energy efficient routes that optimize the sleeping and active periods of all ONUs and wireless nodes. To achieve this goal, an energy efficient network model based on network formation game theory is used. This model allows several network formation processes to be compared in regard to the energy efficiency of the routes they generate. Our results reveal that the farsighted network formation process establishes the most energy efficient routes, meaning that the choices done by this formation process were the best ones. However, this farsighted process is computationally expensive. For this reason a heuristic algorithm is developed, which explores the most energy efficient choices taken by the network formation processes, and farsighted process in particular. Results show that the proposed heuristic is able to obtain results close to the farsighted process.