References in periodicals archive ?
6 presents a comparison of source and hop-by-hop NC-Aware routing with a different number of the native data packets transmitted from both the sources [host.sub.0] and [host.sub.2] in terms of coding gain.
7 shows the percentage of the encoded transmissions over the total number of transmissions with source and hop-by-hop NC-Aware routing approach.
The proposed approach performs hop-by-hop inter-flow coding before forwarding packets towards destination vehicles while utilizing the fully broadcast nature of the wireless channel.
However, route-over consumes more delay time from hop-by-hop fragments assembly and reassembly.
Find queue of P; 1: if size (queue) > miniPackets add all packets from flow (P); if size (A) < MTU find a queue with the same dest go to 1; else send A directly to destination; else if size (MTU) do find the flows (P' >=) miniPackets and add miniPackets from them while size (A) > MTU else send A to the next hop Another method [36] that combines the features of hop-by-hop and end-to-end multiplexing methods was proposed by Kim, Kyungtae, and Sangjin Hong.
Therefore, this method reduces the end-to-end delay that results from hop-by-hop methods and improves bandwidth utilization by performing multiplexing at each hop.
Therefore, similar to end-to-end multiplexing methods, these methods reduce the end-to-end delay that results from the hop-by-hop multiplexing.