Off-campus WSU users: To download campus access dissertations, please use the following link to log into our proxy server with your WSU access ID and password.
Non-WSU users: Please talk to your librarian about requesting this dissertation through interlibrary loan.
Date of Award
Electrical and Computer Engineering
Syed M. Mahmud
Due to the limited bandwidth available for Vehicular Ad-hoc Networks (VANETs), organizing the wireless channel access to efficiently use the bandwidth is one of the main challenges in VANET. In this dissertation, we focus on channel allocation and media access organization for Vehicle-to-Roadside Units (V2R) and Vehicle-to-Vehicle (V2V) communications. An efficient channel allocation algorithm for Roadside Unit (RSU) access is proposed. The goal of the algorithm is to increase system throughput by admitting more tasks (vehicles) and at the same time reduce the risk of the admitted tasks. The algorithm admits the new requests only when their requirements can be fulfilled and all in-session tasks' requirements are also guaranteed. The algorithm calculates the expected task finish time for the tasks, but allocates a virtual transmission plan for the tasks as they progress toward the edges of the RSU range. For V2V mode, we propose an efficient medium access organization method based on VANETs' clustering schemes. In order to make this method efficient in rapid topology change environment like VANET, it's important to make the network topology less dynamic by forming local strongly connected clustering structure, which leads to a stable network topology on the global scale. We propose an efficient cluster formation algorithm that takes vehicles' mobility into account for cluster formation. The results of the proposed methods show that the wireless channel utilization and the network stability are significantly improved compared to the existing methods.
Rawashdeh, Zaydoun Yahya, "Efficient channel allocation and medium access organization algorithms for vehicular networking" (2011). Wayne State University Dissertations. Paper 359.