In IEEE 802.11 infrastructure wireless local area network (WLAN), the communication between any two nodes is relayed by an access point (AP), which becomes the bottleneck of WLAN and severely restricts the overall thr...
详细信息
ISBN:
(纸本)9781631900259
In IEEE 802.11 infrastructure wireless local area network (WLAN), the communication between any two nodes is relayed by an access point (AP), which becomes the bottleneck of WLAN and severely restricts the overall throughput. It is well known that network coding technique is able to greatly improve the throughput of wireless networks. But, the available coding schemes do not make full advantage of channel capacity due to the fact that they pick at most one packet from each data flow for coding and the picked packets may have a great difference in packet size, wasting some channel capacity. To remedy the problem, in this paper, we propose the coding scheme that combines multiple buffered packets in one flow into a larger packet for coding so that the packets participating in coding have close sizes. We formulate an integer programming problem to find the optimal packet coding, which is solved by an optimal algorithm with relative high time complexity together with a heuristic algorithm with relative low time complexity. Simulation results show that the proposed coding scheme is able to greatly improve the throughput of WLAN and the throughput gain increases with the growth of the number of coding flows.
In order to address complex and resource demanding applications, Software Defined networks (SDN) and network coding (NC) paradigm has garnered much attention in recent years. NC is the key concept of networking to enh...
详细信息
ISBN:
(纸本)9781509052561
In order to address complex and resource demanding applications, Software Defined networks (SDN) and network coding (NC) paradigm has garnered much attention in recent years. NC is the key concept of networking to enhance network throughput and reliability, whereas SDN is the modern network architecture to virtualized network services for making route more flexible and allocating network resources on-the-fly. NC advances the conventional store-and-forward concept of packet flow by the notion of a store-code-forward among the intermediate nodes. With effect, source and destination no longer need to track singular packets, but rather targeting enough autonomous encoded packets. The practical coding gain lies on the complication of deploying coding techniques over the classical network of routers. The comprehensive view of SDN can overcome this challenge by separating network architecture into control plane and data plane. This paper counsels the use of SDN which not only assist traffic, but also manage buffering, scheduling and processing of packets. Further, the paper presents NC functionality rich Connected Dominated Set based Flow-oriented coding-aware Routing technique (CFCR) to optimize number of transmissions over the SDN network.
In this paper, we consider a time-division multiple-access relay channel (MARC), in which two source nodes (SNs) transmit data with different data rate to a destination node (DN) with the help of a relay node ( RN). T...
详细信息
ISBN:
(纸本)9781467399913
In this paper, we consider a time-division multiple-access relay channel (MARC), in which two source nodes (SNs) transmit data with different data rate to a destination node (DN) with the help of a relay node ( RN). To provide asymmetric data rates, we consider joint hierarchical 16QAM (HM 16QAM) and network coding. Simulations results show that the joint HM 16QAM and network coding has similar throughput to the conventional network coding with zero padding when the RN is closer to the DN, whereas the joint 16QAM and network coding outperforms the network coding with zero padding when the RN is closer to the SNs.
network coding (NC) enables us to mix two or more packets into a single coded packet at relay nodes and improve performances in wireless networks. Intra-session sliding window network coding is used at the source node...
详细信息
ISBN:
(纸本)9781467385152
network coding (NC) enables us to mix two or more packets into a single coded packet at relay nodes and improve performances in wireless networks. Intra-session sliding window network coding is used at the source nodes and intersession network coding is employed at the relay node to combine the recovered source packets of source nodes. In this paper, we investigate the performance of the network-coded system in terms of the probability that the destination node will successfully recover the source packets of the source nodes. We propose a sliding window network coding in relay wireless networks (SWNC-RN). The performance of the SWNC-RN is studied using NS2 and evaluated in terms of the network throughput, decoding delay, packet transmission rate when data packet is transmitted. The simulations result shows that the SWNC-RN with our proposition can significantly improve the network throughput and achieves higher diversity order.
For a (single-source) multicast network, the size of a base field is the most known and studied algebraic identity that is involved in characterizing its linear solvability over the base field. In this paper, we desig...
详细信息
ISBN:
(纸本)9781479919116
For a (single-source) multicast network, the size of a base field is the most known and studied algebraic identity that is involved in characterizing its linear solvability over the base field. In this paper, we design a new class N of multicast networks and obtain an explicit formula for the linear solvability of these networks, which involves the associated coset numbers of a multiplicative subgroup in a base field. The concise formula turns out to be the first that matches the topological structure of a multicast network and algebraic identities of a field other than size. It further facilitates us to unveil infinitely many new multicast networks linearly solvable over GF(q) but not over GF(q') with q < q', based on a subgroup order criterion. In particular: 1) for every k >= 2, an instance in Al can be found linearly solvable over GF(2(2k)) but not over GF(2(2k+1)) and 2) for arbitrary distinct primes p and pc there are infinitely many k and k' such that an instance in Al can be found linearly solvable over GF(p(k)) but not over GF(p'(k)') with p(k) < p'(k)'.
this paper studies and models the multicast routing problem with network coding in dynamic network environment, where computational and bandwidth resources are to be jointly optimized A quantum inspired evolutionary a...
详细信息
ISBN:
(纸本)9781509040995
this paper studies and models the multicast routing problem with network coding in dynamic network environment, where computational and bandwidth resources are to be jointly optimized A quantum inspired evolutionary algorithm (QEA) is developed to address the problem above, where a restart scheme is devised for well adapting QEA for tracing the ever-changing optima in dynamic environment. Experimental results show that the proposed QEA outperforms a number of existing evolutionary algorithms in terms of the best solution obtained.
Energy efficiency techniques is a important subject for Wireless Sensor networks (WSNs), that have received extensive attention from academic and industrial societies to reduce energy consumption and improve network l...
详细信息
Energy efficiency techniques is a important subject for Wireless Sensor networks (WSNs), that have received extensive attention from academic and industrial societies to reduce energy consumption and improve network lifetime. The network coding methods is one of the techniques that can help to improve some issues of WSNs such as load balancing, reliability and lifetime. This paper proposes a coding solution as an algorithm for reducing energy consumption in WSNs to prolong the lifetime. Simulation results show that the proposed algorithm increases network throughput and energy efficiency. 2016 The Authors. Published by Elsevier *** efficiency techniques is a important subject for Wireless Sensor networks (WSNs), that have received extensive attention from academic and industrial societies to reduce energy consumption and improve network lifetime. The network coding methods is one of the techniques that can help to improve some issues of WSNs such as load balancing, reliability and lifetime. This paper proposes a coding solution as an algorithm for reducing energy consumption in WSNs to prolong the lifetime. Simulation results show that the proposed algorithm increases network throughput and energy efficiency. 2016 The Authors. Published by Elsevier B.V.
The multiple-unicast conjecture in network coding states that for multiple unicast sessions in an undirected network, network coding has no advantage over routing in improving the throughput or saving bandwidth. In th...
详细信息
ISBN:
(纸本)9781509018062
The multiple-unicast conjecture in network coding states that for multiple unicast sessions in an undirected network, network coding has no advantage over routing in improving the throughput or saving bandwidth. In this work, we propose a reduction method to study the multiple-unicast conjecture, and prove the conjecture for a new class of networks that are characterized by relations between cut-sets and source-receiver paths. This class subsumes the two known types of networks with non-zero max-flow min-cut gaps. Further combing this result with a computer-aided search, we derive as a corollary that network coding is unnecessary in networks with up to 6 nodes. We also prove the multiple-unicast conjecture for almost all unit-link-length networks with up to 3 sessions and 7 nodes.
Energy efficiency and load balance of Wireless Sensor network (WSN) is the key to ensure its extensive and reliable deployment, and the fundamental problem is about how to control the energy consumption of communicati...
详细信息
ISBN:
(纸本)9781509007295
Energy efficiency and load balance of Wireless Sensor network (WSN) is the key to ensure its extensive and reliable deployment, and the fundamental problem is about how to control the energy consumption of communication module on the WSN node. This paper attempts to analyze and solve problems on the perspective of how to design efficient and balanced data collection methods. The amount of data to be collected is reduced by data compression, and the efficiency of data collection is enhanced by optimizing the transport mechanism. Through analysis on the inherent relation between network coding and compressed sensing, using both the correlation of data and the broadcasting characteristics of WSN nodes, an improvement WSN data collection method with high energy efficient called enhanced balance compressed network coding (EBCNC) is proposed. Through the deployment of WSN network based on Zigbee protocol, network tests are carried out for EBCNC method and currently representative Collection Tree Protocol (CTP) and Finite Field based Random Linear network coding (FFRL-NC) data transmission method. The result of tests verifies that EBCNC is significantly superior in terms of energy efficiency of data collection.
In this paper, we leverage the Set-Cover problem to design the multicast-capable routing, modulation and spectrum assignment (MC-RMSA) algorithms that utilizes network coding (NC) to achieve efficient service provisio...
详细信息
ISBN:
(纸本)9781467385794
In this paper, we leverage the Set-Cover problem to design the multicast-capable routing, modulation and spectrum assignment (MC-RMSA) algorithms that utilizes network coding (NC) to achieve efficient service provisioning in flexible-grid elastic optical networks (EONs). We use a realistic network model that considers the physical impairments from both transmission and light-splitting, and propose to serve each multicast request with a light-forest that includes one or more light-graphs(1) to improve spectrum efficiency. For each multicast request, the proposed algorithms firstly use a Set-Cover approach to select the destination subsets to cover all the destinations. Then, for each subset, we calculate the light-graph to cover all the destination in it. The proposed algorithms are evaluated with extensive simulations for dynamic service provisioning, and the simulation results indicate that they can achieve better performance on blocking probability than existing MC-RMSA algorithms.
暂无评论