The wireless mesh networks trathc are of selt：snmlarlty and the network pertOrmance is degraded by seltsimillar traffic. Network coding is a new technology which improves network performance. An algorithm is presented that it uses network coding to reduce queue length and delay time when self-similar traffic occurs. Based on synchronization, data packets are classified by destination address and lengths. Simulation results show that with the proposed synchronization techniques, network coding, even in scenarios with burst self-similar traffic, where network coding could not have been deployed so far, increases throughput and lowers packet loss in wireless mesh networks.
In N-policy, the nodes attempt to seize the channel when the number of packets in the buffer approaches N. The performance of N-policy on the energy efficiency is widely studied in the past years. And it is presented that there exists one optimal N to minimize the energy consumption. However, it is noticed that the delay raised by N-policy receives little attention. This work mathematically proves the delay to monotonically increase with increasing N in the collision-unfree channel. For planar network where the near-to-sink nodes burden heavier traffic than the external ones, the data stemming from the latter undergo longer delay.The various-N algorithm is proposed to address this phenomenon by decreasing the threshold N of outer nodes. Without the impacting on the network longevity, the maximum delay among the network has decreased 62.9% by the algorithm. Extensive simulations are given to verify the effectiveness and correctness of our analysis.
