Multipath Wireless Network Coding: A Scheduling Constraint in Game Perspective

This paper considers wireless networks in which various paths are obtainable involving each source and destination. It is allowing each source to tear traffic among all of its existing paths, and it may conquer the lowest achievable number of transmissions per unit time to sustain a prearranged traffic matrix. Traffic bound in contradictory instructions in excess of two wireless hops can utilize the “reverse carpooling” advantage of network coding in order to decrease the number of transmissions used. These call such coded hops “hyper-links.” With the overturn carpooling procedure, longer paths might be cheaper than shorter ones. However, convenient is an irregular situation among sources. The network coding advantage is realized only if there is traffic in both directions of a shared path. This project regard as the problem of routing amid network coding by egotistic agents (the sources) as a potential game and develop a method of state-space extension in which extra agents (the hyper-links) decouple sources’ choices from each other by declaring a hyper-link capacity, allowing sources to split their traffic selfishly in a distributed fashion, and then altering the hyper-link capacity based on user actions. Furthermore, each hyper-link has a scheduling constraint in stipulations of the maximum number of transmissions authorized per unit time. Finally these project show that our two-level control scheme is established and verify our investigative insights by simulation.

Analisis Optimasi Round Trip Time (RTT) pada Jaringan Transmission Control Protocol (TCP) New Reno

The research objective is to simulate and analyze existing algorithms developed previously using the NS-3 application, which affects the measurement of RTT, cwnd, and throughput, and to evaluate the performance of TCP New Reno based on topology and research parameters so that it is obtained specifically how to optimize RTT and throughput on wireless networks. at the Banda Aceh City coffee shop. The research method simulates and analyzes the development of the TCP New Reno algorithm on wireless network coding so that the results can be applied directly. The approach describes a variety of steps or techniques based on a certain distance in increasing throughput, controlling the congestion window (cwnd) and reducing RTO. The results of the study concluded that the use of the TCP New Reno algorithm on a wireless network for multi-hop ad-hoc topology (5 nodes) produced better values than single-hop (2 nodes). The TCP New Reno algorithm has a retransmit phase (at flow-1 and flow-2) which indicates that the slow start phase again starts, cwnd will effectively double (slowly add data) the size of the windows RTT (time) thereby reducing the loss of data packets. In general, strategies and techniques based on distance (6 m and 3 m) in achieving RTT optimization, the TCP New Reno's network strategy of 3 m is a good technique, especially in multi-hop.Keywords:TCP New Reno, RTT, Cwnd, Throughput, Coffee Shop