Energy saving of base stations sleep scheduling for multi-hop vehicular networks

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 theirEuclidean 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 reduces the energy consumption of the base stations. 1

Energy Competence of Base Station in cellular Network

“…Thus, the transmitter and amplifier of the base station can be turned on and off to spare energy. Hence the time span of base station in the sleep mode is T. [10] proves that with multi-hop communication base station energy is been saved when it is compared without multi-hop communication. In infrastructurebased vehicular networks, theever increasinginformation demand of vehicles lead to more operational power of base station which is a straight capacity of transmission control [11].…”

“…The light cell indicates the cell is served by the base station which is in active mode. It is clear from the picture that each sleep mode base station has its neighboringactive base station and it implies that at traffic arriving at sleep mode base station can be served by neighboring active base station .In [10] a static energy saving model is developed which focuses on 1-D multihop vehicular network which has uniform base station deployed at road side. This paper deals with the communication between two mobile vehicles on the road.…”

“…Here Euclidean distance (U) between two arbitrarily chosen adjacent vehicles and Euclidean distance (V) between two arbitrarily chosen adjacent cluster head (CH),where the CH is the one which can directly communicate with the closest base station and the other entire vehicle in the group of vehicles (cluster) can communicate to the base station through the CH only. The energy saving analysis in this paper [10] is that a set of base station is deployed with a distance S between adjacent base stations. If V is larger than S, then T represents the time taken from first CH which leaves the communication scope of base station to the following CH which enters the communication range of base station.…”