As Automated cars are gaining more and more interest among the public, the importance of Vehicle-toVehicle(V2V) communication has also increased. As the number of V2V vehicles increase there is a condition that occurs...
详细信息
ISBN:
(纸本)9781728152868
As Automated cars are gaining more and more interest among the public, the importance of Vehicle-toVehicle(V2V) communication has also increased. As the number of V2V vehicles increase there is a condition that occurs called congestion that occurs due to too many vehicles trying to communicate with each other. Thus, we require some protocols that can instruct when the vehicles can perform a V2V to avoid congestion. These congestion control protocols arc important in dense vehicular networks. The traditional backpressureroutingalgorithm investigates every attainable way between source and goal. The strategy is effective when the system is intensely loaded but the most important issue emerges when the communication routes are moderately blocked which increases throughput. To defeatthisissue,weareproposing Efficientbackpressurerouting (EBR) algorithm that enhances average throughput what's more, exhausts a normal power. It chooses many ideal courses in view of the brief way data. When contrasted with the Traditional backpressurealgorithm, we can accomplish greatest organize throughput because of which information can transmit unreservedly immediately.
We study stability and delay in dynamic networks under adversarial conditions. Adversarial conditions are mandatory in establishing deterministic performance guarantees in networks. Under this framework, we concentrat...
详细信息
ISBN:
(纸本)9781479960361
We study stability and delay in dynamic networks under adversarial conditions. Adversarial conditions are mandatory in establishing deterministic performance guarantees in networks. Under this framework, we concentrate on the general stability region for a network, i.e. without specifying the routingalgorithm. This is in contrast to related work for adversarial network conditions, where usually the back-pressure routingalgorithm is considered. Our work consists of four novel contributions: (1) We present a novel analysis model which is based on the theory of infinite two-player games;(2) Using this approach, we can characterize the stability region of networks under adversarial conditions for arbitrary routing schemes;(3) We determine conditions under which a delay bound for packet forwarding under adversarial conditions exists;(4) We provide a backtracking algorithm which determines in a model-checking fashion network stability. The backtracking algorithm is furthermore shown to reduce the computational effort significantly for practical scenarios.
暂无评论