Incorporating Network Coding into TCP Grounded on Network Utility Maximization in Multi-Radio Multi-Channel Wireless Mesh Networks

A new approach, named TCP-I2NC, is proposed to improve the interaction between network coding and TCP and to maximize the network utility in interference-free multi-radio multi-channel wireless mesh networks. It is grounded on a Network Utility Maxmization (NUM) formulation which can be decomposed into a rate control problem and a packet scheduling problem. The solutions to these two problems perform resource allocation among different flows. Simulations demonstrate that TCP-I2NC results in a significant throughput gain and a small delay jitter. Network resource is fairly allocated via the solution to the NUM problem and the whole system also runs stably. Moreover, TCP-I2NC is compatible with traditional TCP variants.

Performance Enhancement and Utility Maximization for TCP in Wireless Mesh Networks

In Wireless Mesh Networks (WMNs),the performance of conventional TCP significantly deteriorates due to the unreliable wireless channel.To enhance TCP performance in WMNs,TCP/LT is proposed in this paper.It introduces fountain codes into packet reorganization in the protocol stack of mesh gateways and mesh clients.Furthermore,it is compatible with conventional TCP.Regarded as a Performance Enhancement Proxies (PEP),a mesh gateway buffers TCP packets into several blocks.It simultaneously processes them by using fountain encoders and then sends them to mesh clients.Apart from the improvement of the throughput of a unitary TCP flow,the entire network utility maximization can also be ensured by adjusting the scale of coding blocks for each TCP flow adaptively.Simulations show that TCP/LT presents high throughput gains over single TCP in lossy links of WMNs while preserving the fairness for multiple TCPs.As losses increase,the transmission delay of TCP/LT experiences a slow linear growth in contrast to the exponential growth of TCP.

A utility-optimal backoff algorithm for wireless sensor networks

A novel backoff algorithm in CSMA/CA-based medium access control (MAC) protocols for clustered sensor networks was proposed. The algorithm requires that all sensor nodes have the same value of contention window (CW) in a cluster, which is revealed by formulating resource allocation as a network utility maximization problem. Then, by maximizing the total network utility with constrains of minimizing collision probability, the optimal value of CW (Wopt) can be computed according to the number of sensor nodes. The new backoff algorithm uses the common optimal value Wopt and leads to fewer collisions than binary exponential backoff algorithm. The simulation results show that the proposed algorithm outperforms standard 802.11 DCF and S-MAC in average collision times, packet delay, total energy consumption, and system throughput.

Distributed rate allocation for elastic flows in concurrent multipath transfer

Concurrent multipath transfer（CMT） using stream control transmission protocol（SCTP） multihoming has become an appealing option to increase the throughput and improve the performance of increasingly bandwidth-hungry applications.To investigate the rate allocation for applications in CMT,this paper analyzes the capacities of paths shared by competing sources,then proposes the rate allocation model for elastic flows based on the framework of network utility maximization（NUM）.In order to obtain the global optimum of the model,a distributed algorithm is presented which depends only on local available information.Simulation results confirm that the proposed algorithm can achieve the global optimum within reasonable convergence times.

Joint Bandwidth Allocation and Path Selection in WANs with Path Cardinality Constraints

In this paper,we study the joint bandwidth allocation and path selection problem,which is an extension of the well-known network utility maximization(NUM)problem,via solving a multi-objective minimization problem under path cardinality constraints.Specifically,such a problem formulation captures various types of objectives including proportional fairness,average delay,as well as load balancing.In addition,in order to handle the"unsplittable flows",path cardinality constraints are added,making the resulting optimization problem quite challenging to solve due to intrinsic nonsmoothness and nonconvexity.Almost all existing works deal with such a problem using relaxation techniques to transform it into a convex optimization problem.However,we provide a novel solution framework based on the linearized alternating direction method of multipliers(LADMM)to split the original problem with coupling terms into several subproblems.We then derive that these subproblems,albeit nonconvex nonsmooth,are actually simple to solve and easy to implement,which can be of independent interest.Under some mild assumptions,we prove that any limiting point of the generated sequence of the proposed algorithm is a stationary point.Numerical simulations are performed to demonstrate the advantages of our proposed algorithm compared with various baselines.