scholarly journals Coordination of Congestion and Awareness Control in Vehicular Networks

Electronics ◽  
2018 ◽  
Vol 7 (11) ◽  
pp. 335 ◽  
Author(s):  
Miguel Sepulcre ◽  
Javier Gozalvez

Vehicular networks need to guarantee the communication reliability levels necessary to satisfy the application requirements, while ensuring a stable network operation even under dense deployments. To this aim, congestion and awareness control protocols dynamically adapt the same communication parameters based on context conditions. If the two protocols operate independently, negative interactions or conflicts can arise. This situation can occur if for example congestion control requires decreasing the transmission power to reduce the channel load, but this reduction negatively influences the vehicles’ awareness range. To address these interactions or conflicts, this paper proposes and evaluates a methodology to coordinate congestion and awareness control protocols. A key advantage of the proposed methodology is that it does not require the integration of the interacting protocols, nor does it require changing their original design. The obtained results demonstrate the effectiveness of the proposed coordination methodology. In addition, the proposed methodology can be extended to the coordination of multiple protocols operating over the same communication parameters. This is here demonstrated considering the coordination of congestion, awareness and topology control protocols.


Author(s):  
Chih-Yung Chang ◽  
Kuei-Ping Shih ◽  
Hsu-Ruey Chang ◽  
Hsiao-Jung Liu




2015 ◽  
Vol 15 (4) ◽  
pp. 663-675 ◽  
Author(s):  
Xin-Yu Zhang ◽  
Jing-Tao Wang ◽  
Shun Yao ◽  
Zi-Jian Guo


Author(s):  
Qiang-Sheng Hua ◽  
Francis Lau

This chapter studies the joint link scheduling and topology control problems in wireless sensor networks. Given arbitrarily located sensor nodes on a plane, the task is to schedule all the wireless links (each representing a wireless transmission) between adjacent sensors using a minimum number of timeslots. There are two requirements for these problems: first, all the links must satisfy a certain property, such as that the wireless links form a data gathering tree towards the sink node; second, all the links simultaneously scheduled in the same timeslot must satisfy the SINR constraints. This chapter focuses on various scheduling algorithms for both arbitrarily constructed link topologies and the data gathering tree topology. We also discuss possible research directions.



Sign in / Sign up

Export Citation Format

Share Document