In this article, we focus on the issue of multihop broadcasting for a batch of packets in duty-cycled wireless sensor networks (WSNs). When the conventional single-hop broadcasting scheme with network coding is applie...
详细信息
In this article, we focus on the issue of multihop broadcasting for a batch of packets in duty-cycled wireless sensor networks (WSNs). When the conventional single-hop broadcasting scheme with network coding is applied to multihop scenario, a forwarder has to occupy its surrounding wireless medium until all its one-hop forwarders decode the received packets. Thus, forwarding of neighboring forwarders is significantly delayed. We propose an efficient multihop broadcasting with network coding (EMBNC) by selecting downstream forwarders in a two-hop manner. Encoded packets are delivered from a forwarder to its downstream forwarders with the cooperation of auxiliary nodes. A forwarder terminates its forwarding once auxiliary nodes collectively receive enough packets, which efficiently decreases time to occupy wireless medium. Auxiliary nodes can also receive more encoded packets when downstream forwarders are transmitting. Simulation results show EMBNC achieves high performance in terms of broadcast delay, energy consumption, and average duty cycle.
Ever since the introduction of network coding (NC) technique, several Medium Access Control (MAC) protocols based on NC have been developed for wireless networks of three node topology as well as `X' topology, con...
详细信息
Ever since the introduction of network coding (NC) technique, several Medium Access Control (MAC) protocols based on NC have been developed for wireless networks of three node topology as well as `X' topology, considering that the information flows originate from the source (or reaches the relay) simultaneously. However, there are cases when these information flows do not occur simultaneously. In this context, a new medium access mechanism which is a modified version of CSMA/CA based IEEE 802.11 protocol is proposed in this paper, considering `X' topology based wireless network. It consists of two independent sources, transmitting to the same pair of destinations with the help of a relay node. The relay node of an ongoing cooperative transmission checks for NC opportunity before forwarding the packet to the destinations. If NC opportunity exists, then the relay initiates packet exchange with the other potential source. If not, it continues with the procedures of existing protocol. A suboptimal method of relay selection is also discussed. The proposed method is analyzed in terms of throughput and packet delay and the performance is compared with that of IEEE 802.11 based cooperative MAC protocol. Results show that the proposed protocol shows an improved performance.
Information-theoretic security is considered in the paradigm of network coding in the presence of wiretappers, who can access one arbitrary edge subset up to a certain size, also referred to as the security level. Sec...
详细信息
One of the most promising techniques for network-wide interference management necessitates a redesign of the network architecture known as cloud radio access network (CRAN). The cloud is responsible for coordinating m...
详细信息
In the paper, we present a road-map towards a near-capacity large-scale multi-user cooperative-communications (NLMC) system, where all the evolution paths converge to the construction of the NLMC system. More specific...
详细信息
In the paper, we present a road-map towards a near-capacity large-scale multi-user cooperative-communications (NLMC) system, where all the evolution paths converge to the construction of the NLMC system. More specifically, we will summarize all relevant schemes appearing on the road-map in the unified frame-work of forward error correction. various network coding design paradigms are highlighted for illustrating how the NLMC systems might be designed for meeting diverse design criteria in the context of cooperative and cognitive communications, where the channel capacity of the NLMC systems is used for comparing the different design paradigms.
This paper is devoted to multicomponent subspace codes with zero prefix (MZP) and their role in network coding. In fact, it is a collection of our results about multicomponent codes for last years. The MZP constructio...
详细信息
ISBN:
(纸本)9781728104331
This paper is devoted to multicomponent subspace codes with zero prefix (MZP) and their role in network coding. In fact, it is a collection of our results about multicomponent codes for last years. The MZP construction is described. The cardinality for different parameters is calculated. The efficiency as a ratio cardinality to the upper bound is estimated. It is shown that MZP additional components can increase cardinality up to 30 percents. The iterative decoding algorithm is presented. At the first stage of decoding it is necessary to obtain a MZP component and then, at the next stage to apply the decoding algorithm of Silva-Koetter-Kschischang (SKK) codes.
We revisit Physical-Layer network coding (PLNC) and the reasons preventing it from becoming a staple in wireless networks. We identify its strong coupling to the Two-Way Relay Channel (TWRC) as key among them due to i...
详细信息
ISBN:
(纸本)9781538647264
We revisit Physical-Layer network coding (PLNC) and the reasons preventing it from becoming a staple in wireless networks. We identify its strong coupling to the Two-Way Relay Channel (TWRC) as key among them due to its requiring crossing traffic flows and two-hop node coordination. We introduce SE-PLNC, a Source-Encoded PLNC scheme that is traffic pattern independent and involves coordination only among one-hop neighbors, making it significantly more practical to adopt PLNC in multi-hop wireless networks. To accomplish this, SE-PLNC introduces three innovations: it combines bit-level with physical-level network coding, it shifts most of the coding burden from the relay to the source of the PLNC scheme, and it leverages multi-path relaying opportunities available to a particular traffic flow. We evaluate SE-PLNC using theoretical analysis, proof-of-concept implementation on a Universal Software Radio Peripherals (USRP) testbed, and simulations. The theoretical analysis shows the scalability of SE-PLNC and its efficiency in large ad-hoc networks while the testbed experiments its real-life feasibility. Large-scale simulations show that TWRC PLNC barely boosts network throughput while SE-PLNC improves it by over 30%.
In this paper, we propose PopNetCod, a popularity-based caching policy for network coding enabled Named Data networking. PopNetCod is a distributed caching policy, in which each router measures the local popularity of...
详细信息
ISBN:
(纸本)9781538662809;9783903176089
In this paper, we propose PopNetCod, a popularity-based caching policy for network coding enabled Named Data networking. PopNetCod is a distributed caching policy, in which each router measures the local popularity of the content objects by analyzing the requests that it receives. It then uses this information to decide which Data packets to cache or evict from its content store. Since network coding is used, partial caching of content objects is supported, which facilitates the management of the content store. The routers decide the Data packets that they cache or evict in an online manner when they receive requests for Data packets. This allows the most popular Data packets to be cached closer to the network edges. The evaluation of PopNetCod shows an improved cache-hit rate compared to the widely used Leave Copy Everywhere placement policy and the Least Recently Used eviction policy. The improved cache-hit rate helps the clients to achieve higher goodput, while it also reduces the load on the source servers.
This paper presents yet another instance of the power of vector linear network coding over scalar linear network coding. Previous works have established that the size of the finite field required to achieve a vector l...
详细信息
ISBN:
(纸本)9781538682234;9784885523182
This paper presents yet another instance of the power of vector linear network coding over scalar linear network coding. Previous works have established that the size of the finite field required to achieve a vector linear solution may be smaller than that size of the finite field required to achieve a scalar linear solution. It has been also shown there exist networks which do not have a scalar linear solution but have a vector linear solution. In this paper we show that the set of characteristics over which a network has a vector linear solution may be larger than the set of characteristics over which it has a scalar linear solution. We prove this result by showing a network which has a scalar linear solution if and only if the characteristic of the finite field is 2, but has a 2-dimensional vector linear solution over every finite fields.
For wireless broadcast networks over erasure channels, this paper considers coding opportunities of encoded packets, and proposes an improved algorithm for instantly decodable network coding based on encoded packets f...
详细信息
For wireless broadcast networks over erasure channels, this paper considers coding opportunities of encoded packets, and proposes an improved algorithm for instantly decodable network coding based on encoded packets for transmission scheme of wireless data (TSCEP-IDNC, Transmission Scheme Considering Encoded Packets-IDNC). In this scheme, all terminal nodes need to buffer the received encoded packets and feedback receiving state to the wireless sender; then the sender dynamically updates the state feedback matrix and the undirected coding graph to select a better packet, including re-encoding the encoded packets with other packets, and then retransmits them. Compared to existing solutions, simulation results show that the data transmission scheme proposed in this paper can significantly reduce the number of transmissions and improve the transmission efficiency and bandwidth utilization.
暂无评论