Multicast In Transport Communication Network Based On Network Coding

With the rapid development of economy, the transportation problems of big cities become more and more serious. Advanced information, communications, control and computer technology are adopted in the intelligent transport system, contributing to building the real-time, precision, efficient transport information and control system. Communication network is the basis of intellectual transportation system for transmitting traffic information requiring both high channel capacity and reliability. Network coding is a new technique which can be used to improve the performance of multicast by strengthening the coding ability of the nodes. Moreover the topology of the communication network may have an effect on transmitting traffic information. The topology and reliability of Transport Communication Network based on network coding are investigated. Following is the main works:Firstly, the background and significance of the research are introduced. Then the basic characteristic of Mesh network and the principle of network coding are described.Secondly, two typical communication network and their modeling methods are introduced. The definition of multicast and maxflow algorithm is described. The maximum multicast throughput can be derived using maxflow algorithm. Additionally a polynomial time network coding algorithm was introduced.Thirdly, an empirical approach to evaluate the performance of multicast is proposed. As for a specific transport communication network, the set of source and terminal nodes can be got by various ways. Then the overall performance of multicast can be derived. The performance of scale free network and random network were compared based on the simulation. Additionally, a new method based on demand functions to evaluate the performance of multicast is proposed. The performance of scale free network and random network in three different scenarios are evaluated using both C++ and Matlab.Finally, the reliability of transport communication network is investigated. On the basis of reliability analysis of network, node failing is simulated by deleting the node and its channels. The demanding function can be derived by analyzing the communication log, which can be used to evaluate the performance of the network. Moreover, the dynamical features of the performance of scale free network and random network under both random and intentional attack are investigated by removing the failure node and the corresponding channels. Cooperative communications could improve the reliability of the transport communication network. The extent of improvement can be evaluated with the degree of the adjacent nodes.