Applied Network Coding and Spectral Graph Theory on Wireless Network-Wide Broadcast

Abstract

Network-wide broadcasting is used increasingly for code updates cloud robot construction and so on In such broadcasts there exists a single source node and the aim is to disseminate the data from this source node to all of the nodes in the network in the most efficient manner possible Recent studies have suggested that network coding provides an effective means of improving the throughput of ad hoc networks while simultaneously reducing the bandwidth consumption However the performance of network coding schemes is critically dependent on the coding length employed at each node Accordingly the present study proposes a distributed algorithm for improving the transmission performance in wireless broadcast networks in which spectral graph theory is employed to determine the critical value of each node based on an examination of its two-hop neighborhood and the network coding length at the node is then set accordingly A simple analytical model is derived to investigate the performance of the proposed broadcast protocol in terms of the average throughput average packet delay and transmission failure probability In general the results show that the proposed scheme shortens the total broadcast time reduces the total number of packet transmissions and prolongs the network lifetime with that of existing methods

Date of Award	2016 Aug 23
Original language	English
Supervisor	Hui-Tang Lin (Supervisor)