Conference Paper

Dynamic Adaptation of Joint Transmission Power and Contention Window in VANET

Dept. of Electr. & Comput. Eng., Old Dominion Univ., Norfolk, VA, USA
DOI: 10.1109/VETECF.2009.5378793 Conference: Vehicular Technology Conference Fall (VTC 2009-Fall), 2009 IEEE 70th
Source: IEEE Xplore

ABSTRACT In this paper, we propose an algorithm for joint adaptation of transmission power and contention window to improve the performance of vehicular network in a cross layer approach. The high mobility of vehicles in vehicular communication results in the change in topology of the Vehicular Ad-hoc Network (VANET) dynamically, and the communication link between two vehicles might remain active only for short duration of time. In order for VANET to make a connection for long time and to mitigate adverse effects due to high and fixed transmission power, the proposed algorithm adapts transmission power dynamically based on estimated local traffic density. In addition to that, the prioritization of messages according to their urgency is performed for timely propagation of high priority messages to the destination region. In this paper, we incorporate the contention based MAC protocol 802.11e enhanced distributed channel access (EDCA) mechanism to implement a priority-based vehicle-to-vehicle (V2V) communication. Simulation results show that the proposed algorithm is successful in getting better throughput with lower average end-to-end delay than the algorithm with static/default parameters.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Roadside infrastructure can be used provide a wide variety of commercial services in vehicular ad hoc networks. One particular challenge is that of providing roadside radio coverage in highway locations where wired electricity is not available. In this case, roadside access points (APs) powered by renewable energy such as solar power, is a viable alternative. The cost of provisioning this type of roadside infrastructure is dependent on the average power consumption of the AP, and can be reduced by energy efficient scheduling. In this paper, we consider the problem of satisfying vehicle communication requirements while minimizing the energy needed by the roadside access point. The problem is formulated as a Mixed Integer Linear Program (MILP) which provides an upper bound for the performance of any realizable scheduling algorithm. We then propose a Nearest Fastest Set (NFS) scheduler that uses vehicle location and velocity inputs to address the problem. Results from a variety of experiments show that the proposed scheduling algorithm performs well when compared to the performance bound.
    Proceedings of the Global Communications Conference, 2010. GLOBECOM 2010, 6-10 December 2010, Miami, Florida, USA; 01/2010
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Future development of Intelligent Transportation Systems (ITS) depends on Vehicular Ad-hoc Networks (VANETs) in which communications will help to improve traffic safety and efficiency through exchanging information among vehicles. As each vehicle cannot be a source of all messages in VANET, most communications depend on the information received from other vehicles. To protect VANET from malicious action, each vehicle must be able to evaluate, decide and react locally on information received from other vehicles. Message verification is more challenging in VANETs since the security and privacy of the participating vehicles, in general, and of the drivers and passengers specifically is of major concern. Each vehicle needs to verify the accuracy of the message and needs to verify that the received message is from a legitimate vehicle. In this paper, we propose a new algorithm to secure vehicular communication with the help of trust measured for the given period using a probabilistic approach. The proposed algorithm secures VANETs against the untrustworthy drivers. The proposed algorithm is illustrated through numerical results obtained from simulations.
    International Conference on Complex, Intelligent and Software Intensive Systems, CISIS 2011, June 30 - July 2, 2011, Korean Bible University, Seoul, Korea; 01/2011
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper investigates the network connectivity properties of a vehicular ad hoc network (VANET) from a physical layer perspective. Specifically, we investigate the minimum transmit power used by all vehicles, sufficient to guarantee network connectivity. As opposed to the conventional graph-theoretic approach, in this paper, the network connectivity problem is analyzed according to a physical layer-based quality of service constraint. Under this approach, a multi-hop path joining a pair of vehicles in a VANET is said to be connected if and only if the average route BER meets a target requirement. We derive closed form analytical expression for the minimum transmit power sufficient to ensure network connectivity. We also derive analytical expression for the maximum number of hops, a packet can traverse satisfying the route BER constraint, for a given transmit power. The validity of our theoretical analysis is verified by extensive simulation studies. The analysis provides a framework for investigating the impact of traffic dependent parameters such as vehicle arrival rate, vehicle density, mean and standard deviation of vehicle speed, highway length and physical layer-based parameters such as path loss exponent, fading factor, Doppler spread, and data rate on VANET connectivity characteristics.
    Wireless Personal Communications 07/2013; 71(1). · 0.43 Impact Factor

Full-text (2 Sources)

Available from
May 29, 2014