Energy Saving of Base Stations Sleep Scheduling for Multi-Hop Vehicular Networks
Tao Han, Xiong Liu, Lijun Wang, Jiang Wang, Kyung Sup Kwak, Qiang Li

TL;DR
This paper proposes a cooperative sleep scheduling strategy for base stations in multi-hop vehicular networks, significantly reducing energy consumption by leveraging vehicle speed and location data.
Contribution
It introduces a probabilistic model for vehicle clustering and derives energy savings and sleep durations, advancing energy-efficient base station management in vehicular networks.
Findings
Sleep scheduling reduces base station energy consumption
Derived probability distribution for vehicle cluster distances
Numerical results confirm significant energy savings
Abstract
This paper investigates the energy saving of base station (BS) deployed in a 1-D multi-hop vehicular network with sleep scheduling strategy. We consider cooperative BS scheduling strategy where BSs can switch between sleep and active modes to reduce the average energy consumption utilizing the information of vehicular speeds and locations. Assuming a Poisson distribution of vehicles, we derive an appropriate probability distribution function of distance between two adjacent cluster heads, where a cluster is a maximal set of vehicles in which every two adjacent vehicles can communicate directly when their Euclidean distance is less than or equal to a threshold, known as the communication range of vehicles. Furthermore, the expected value of the sojourn time in the sleep mode and energy saving are obtained. The numerical results show that the sleep scheduling strategy significantly…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
