Network Coding Tree Algorithm for Multiple Access System

Network coding is famous for its capability in significantly improving the throughput of network. The successful decoding of the network coded data relies on some side information of the original data. In that framework, independent data flows are usually decoded first and then network coded by relay nodes. If appropriate signal design is adopted, physical layer network coding is a natural way in wireless networks. In this work, a network coding tree algorithm which enhances the efficiency of the multiple access system (MAS) is presented. For MAS, researchers try to avoid the collisions but collisions happen frequently under heavy load. By introducing network coding into MAS, our proposed algorithm achieves a better trade-off between average delay and system throughput. When multiple users transmit signal in a time slot, the sum signals are saved and used to jointly decode the collided frames after some component frames of the network coded frame are received. Splitting tree structure is extended to our proposed algorithm for collision solving. The system throughput and average delay of frames are presented in a recursive way. Besides, extensive simulations show that network coding tree algorithm enhances the system performance in terms of system throughput and average frame delay compared with other algorithms.