Probabilistic network coding techniques for vehicular ad-hoc networks

vehicular ad hoc network (vanet) is an emerging technology that enables moving vehicles on the road to connect and communicate as network devices. vanets enhance roads safety measures and improve traffic efficiency. however, due to the lack of centralization and the large number of highly mobile nod...

Full description

Saved in:

Bibliographic Details
Main Author:	Ahmed, Shereen Ali Malek
Format:	Thesis
Language:	English
Published:	2016
Subjects:	TK Electrical engineering Electronics Nuclear engineering
Online Access:	http://eprints.utm.my/id/eprint/81670/1/ShereenAliMalekPFKE2016.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.81670
record_format	uketd_dc
spelling	my-utm-ep.816702019-09-10T01:53:30Z Probabilistic network coding techniques for vehicular ad-hoc networks 2016 Ahmed, Shereen Ali Malek TK Electrical engineering. Electronics Nuclear engineering vehicular ad hoc network (vanet) is an emerging technology that enables moving vehicles on the road to connect and communicate as network devices. vanets enhance roads safety measures and improve traffic efficiency. however, due to the lack of centralization and the large number of highly mobile nodes, vanets are considered as highly congested networks with significant packet collisions and retransmissions. on the other hand, network coding is an emerging technique known to effectively utilize network resources by significantly reducing the number of transmissions. in network coding, intermediate nodes minimize the number of transmission by combining different packets before transmitting. however, a fundamental problem for network coding relay when it receives a packet is whether to wait for a coding opportunity to reduce network congestion; or to send the packet immediately without coding to reduce packet delay. this thesis proposes network coding techniques to reduce the number of transmissions and the bandwidth consumption in vanet multi-hop scenario. it also presents an analytical study on the trade-off between the average packet delay and the network throughput in network coding. it proposes a probabilistic approach for the intermediate nodes and therefore develops an analytical framework to present the effect of using such technique on the network performance. the system stability conditions have also been investigated. moreover, flows with different and same priorities are considered and different mechanisms that consider the nature of the different applications are proposed. for fair delay, this thesis provides the optimum transmission probability which achieves the minimum fair delay and results in an optimum throughput. while for different priority flows, a queue state based probabilistic scheduling schemes are proposed to avoid unbounded packet delays. to highlight the result, for symmetric rate flows, fairness scheme shows that the optimum fair delay can be achieved with probability of transmission of 0.5. it also shows that despite the flow data rate, using this probability will result in 33% improvement in the bandwidth consumption, and in an equal hop delay for both flows that is 0.5/?, where ? is the average flow data rate. moreover, for asymmetric rate flows the work provides the optimum transmission probability and its corresponding fair delay and throughput improvement. simulation is carried out to verify the analytical results where it is closely matched the theoretical results. 2016 Thesis http://eprints.utm.my/id/eprint/81670/ http://eprints.utm.my/id/eprint/81670/1/ShereenAliMalekPFKE2016.pdf application/pdf en public http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:126332 phd doctoral Universiti Teknologi Malaysia Electrical Engineering
institution	Universiti Teknologi Malaysia
collection	UTM Institutional Repository
language	English
topic	TK Electrical engineering Electronics Nuclear engineering
spellingShingle	TK Electrical engineering Electronics Nuclear engineering Ahmed, Shereen Ali Malek Probabilistic network coding techniques for vehicular ad-hoc networks
description	vehicular ad hoc network (vanet) is an emerging technology that enables moving vehicles on the road to connect and communicate as network devices. vanets enhance roads safety measures and improve traffic efficiency. however, due to the lack of centralization and the large number of highly mobile nodes, vanets are considered as highly congested networks with significant packet collisions and retransmissions. on the other hand, network coding is an emerging technique known to effectively utilize network resources by significantly reducing the number of transmissions. in network coding, intermediate nodes minimize the number of transmission by combining different packets before transmitting. however, a fundamental problem for network coding relay when it receives a packet is whether to wait for a coding opportunity to reduce network congestion; or to send the packet immediately without coding to reduce packet delay. this thesis proposes network coding techniques to reduce the number of transmissions and the bandwidth consumption in vanet multi-hop scenario. it also presents an analytical study on the trade-off between the average packet delay and the network throughput in network coding. it proposes a probabilistic approach for the intermediate nodes and therefore develops an analytical framework to present the effect of using such technique on the network performance. the system stability conditions have also been investigated. moreover, flows with different and same priorities are considered and different mechanisms that consider the nature of the different applications are proposed. for fair delay, this thesis provides the optimum transmission probability which achieves the minimum fair delay and results in an optimum throughput. while for different priority flows, a queue state based probabilistic scheduling schemes are proposed to avoid unbounded packet delays. to highlight the result, for symmetric rate flows, fairness scheme shows that the optimum fair delay can be achieved with probability of transmission of 0.5. it also shows that despite the flow data rate, using this probability will result in 33% improvement in the bandwidth consumption, and in an equal hop delay for both flows that is 0.5/?, where ? is the average flow data rate. moreover, for asymmetric rate flows the work provides the optimum transmission probability and its corresponding fair delay and throughput improvement. simulation is carried out to verify the analytical results where it is closely matched the theoretical results.
format	Thesis
qualification_name	Doctor of Philosophy (PhD.)
qualification_level	Doctorate
author	Ahmed, Shereen Ali Malek
author_facet	Ahmed, Shereen Ali Malek
author_sort	Ahmed, Shereen Ali Malek
title	Probabilistic network coding techniques for vehicular ad-hoc networks
title_short	Probabilistic network coding techniques for vehicular ad-hoc networks
title_full	Probabilistic network coding techniques for vehicular ad-hoc networks
title_fullStr	Probabilistic network coding techniques for vehicular ad-hoc networks
title_full_unstemmed	Probabilistic network coding techniques for vehicular ad-hoc networks
title_sort	probabilistic network coding techniques for vehicular ad-hoc networks
granting_institution	Universiti Teknologi Malaysia
granting_department	Electrical Engineering
publishDate	2016
url	http://eprints.utm.my/id/eprint/81670/1/ShereenAliMalekPFKE2016.pdf
_version_	1747818385295540224

Probabilistic network coding techniques for vehicular ad-hoc networks

Similar Items