Network Coding Based Evolutionary Network Formation for Dynamic Wireless Networks

Abstract

In this paper, we aim to find a robust network formation strategy that can adaptively evolve the network topology against network dynamics in a distributed manner. We consider a network coding deployed wireless ad hoc network where source nodes are connected to terminal nodes with the help of intermediate nodes. We show that mixing operations in network coding can induce packet anonymity that allows the inter-connections in a network to be decoupled. This enables each intermediate node to consider complex network inter-connections as a node-environment interaction such that the Markov decision process (MDP) can be employed at each intermediate node. The optimal policy that can be obtained by solving the MDP provides each node with optimal amount of changes in transmission range given network dynamics (e.g., the number of nodes in the range and channel condition). Hence, the network can be adaptively and optimally evolved by responding to the network dynamics. The proposed strategy is used to maximize long-term utility, which is achieved by considering both current network conditions and future network dynamics. We define the utility of an action to include network throughput gain and the cost of transmission power. We show that the resulting network of the proposed strategy eventually converges to stationary networks, which maintain the states of the nodes. Moreover, we propose to determine initial transmission ranges and initial network topology that can expedite the convergence of the proposed algorithm. Our simulation results confirm that the proposed strategy builds a network which adaptively changes its topology in the presence of network dynamics. Moreover, the proposed strategy outperforms existing strategies in terms of system goodput and successful connectivity ratio.

A Constrained Coding-Aware Routing Scheme in Wireless Ad-Hoc Networks

“…To reduce the confusion of the coding opportunities, J. Chen et al revised the routing discovery procedures in the DCAR scheme by using the four steps of RREQ (route request), RREP (route reply), RCON (routing confirm), and RACK (routing acknowledge) [15]. To overcome network dynamics (e.g., high packet loss rate and node mobility), Minhae Kwon and Hyunggon Park proposed an NC-based evolutionary network formation to adapt to the topology change [29]. Shao Xing et al proposed a load-balanced coding-aware routing metric that considered the load degree of each node, and the traffic of the scheme was evenly spread [30].…”

Distributed topology design for network coding deployed networks

“…The network coding function Φ converts the link dependent data X ij into the link independent data p j . Hence, v j receives a single of packet p j from all incoming links no matter how many incoming links are formed 8 . Examples of this interpretation are illustrated in Figure 2, and more details of network coding operations are provided in Appendix A.…”

“…Therefore, it is difficult in general to solve the optimization problem for network topology unless it is formulated as a special class of optimization problem (e.g., the convex optimization problem). In order to lower the computational complexity associated with finding optimal network topology, distributed approaches are often deployed [7,8,9,10,11].…”

“…Therefore, the incoming rate of a node should be taken into account as a constraint for the network topology design problem, such that it should not exceed the link ca-pacity. As a solution to the problem of network topology design with the constraint, network coding [20,21] can be deployed [7,8]. Network coding is widely known to have several advantages, such as efficient resource usage (e.g., bandwidth and power), and improved robustness and throughput [22,23,24,25,26].…”

Data Dissemination Framework Using Low-Rank Approximation in Edge Networks

“…Unlike the retransmission-based data reliable dissemination approaches, network coding (NC) with broadcasting can be a solution to reliable and efficient data transmission [17]- [19]. NC technique can dramatically simplify the individual retransmission process into the broadcasting of equal data dissemination as NC can make packets anonymous [20]. The systematic network coding (SNC) [17] is proposed in a one-hop broadcasting network, which simply transmits additional packets encoded by the random linear network coding (RLNC) and enables each receiver node to recover the missing original packets.…”