Abstract
This paper presents a distributed cell selection algorithm for energy savings in nomadic networks where randomly distributed devices (e.g., parked vehicles) serve as potential relay nodes. Based on load information and link quality, the nomadic relays and subsequently the users select access points so as to minimize the energy consumption in the network. Furthermore, admission control mechanisms are incorporated at the base stations and nomadic relay nodes to avoid overloading. We prove the convergence of our algorithm, while simulations show that the proposed algorithm has a great potential for reducing the energy consumption compared with traditional cell selection algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
