We consider a communication network where there exist wiretappers who can access a subset of channels, called a wiretap set, which is chosen from a given collection of wiretap sets. The collection of wiretap sets can ...
详细信息
ISBN:
(纸本)9781509030972
We consider a communication network where there exist wiretappers who can access a subset of channels, called a wiretap set, which is chosen from a given collection of wiretap sets. The collection of wiretap sets can be arbitrary. Secure network coding is applied to prevent the source information from being leaked to the wiretappers. In secure network coding, the minimum required alphabet size is an open problem not only of theoretical interest but also of practical importance, because it is closely related to the implementation of such coding schemes in terms of computational complexity and storage requirement. In this paper, we develop a systematic graph-theoretic approach for improving Cai and Yeung's lower bound on the required alphabet size for the existence of secure network codes. The new lower bound thus obtained, which depends only on the network topology and the collection of wiretap sets, can be significantly smaller than Cai and Yeung's lower bound. A polynomial-time algorithm is devised for efficient computation of the new lower bound. The graph-theoretic concepts introduced and the results obtained appear to be of fundamental interest in graph theory.
A network coding approach for indoor wireless optical communication is proposed and experimentally demonstrated, both in point-to-point scenario and multiuser case. Results show the scheme could support network commun...
详细信息
ISBN:
(纸本)9781943580347
A network coding approach for indoor wireless optical communication is proposed and experimentally demonstrated, both in point-to-point scenario and multiuser case. Results show the scheme could support network communications under link loss and random occlusion.
Caching is a promising technique to reduce traffic by storing popular content items in the buffers of users prior to user demand. In this paper, a two-phase physical layer multicasting system is investigated, in which...
详细信息
ISBN:
(纸本)9781509050192
Caching is a promising technique to reduce traffic by storing popular content items in the buffers of users prior to user demand. In this paper, a two-phase physical layer multicasting system is investigated, in which the users are equipped with buffers and content request delay information (RDI) is available at the serving base station (BS). Based on RDI, transmissions are initiated to satisfy user requests within delay constraints. To minimize the expected traffic, a joint pushing and caching (JPC) method is presented to jointly determine the content items transmitted by the BS and cached in the user buffers. It is shown that minimizing the expected traffic can be transformed into a network coding problem. A framework is presented to formulate the JPC policies via optimization problems, which however are intractable. To find the optimal uncoded caching policy, the optimization problems are reduced to linear programs. In addition, a generalized coded caching algorithm is proposed to give a sub-optimal coded JPC policy. A lower bound on the expected traffic is also analyzed. Simulations show that the traffic resulting from the proposed algorithms approaches the lower bound if the buffer size is large.
Reliable broadcasting data to multiple receivers over lossy wireless channels is challenging due to the heterogeneity of the wireless link conditions. Automatic Repeat-reQuest (ARQ) based retransmission schemes are ba...
详细信息
ISBN:
(纸本)9781509042289
Reliable broadcasting data to multiple receivers over lossy wireless channels is challenging due to the heterogeneity of the wireless link conditions. Automatic Repeat-reQuest (ARQ) based retransmission schemes are bandwidth inefficient due to data duplication at receivers. network coding (NC) has been shown to be a promising technique for improving network bandwidth efficiency by combining multiple lost data packets for retransmission. However, it is challenging to accurately determine which lost packets should be combined together due to disrupted feedback channels. This paper proposes an adaptive data encoding scheme at the transmitter by joining network coding and machine learning (NCML) for retransmission of lost packets. Our proposed NCML extracts the important features from historical feedback signals received by the transmitter to train a classifier. The constructed classifier is then used to predict states of transmitted data packets at different receivers based on their corrupted feedback signals for effective data mixing. We have conducted extensive simulations to collaborate the efficiency of our proposed approach. The simulation results show that our machine learning algorithm can be trained efficiently and accurately. The simulation results show that on average the proposed NCML can correctly classify 90% of the states of transmitted data packets at different receivers. It achieves significant bandwidth gain compared with the ARQ and NC based schemes in different transmission terrains, power levels, and the distances between the transmitter and receivers.
We study an uplink distributed multiple-input multiple-output (D-MIMO) system, where multiple users are served by multiple base stations (BSs) connected to a common central unit (CU) via independent backhaul links. We...
详细信息
ISBN:
(纸本)9781538645024
We study an uplink distributed multiple-input multiple-output (D-MIMO) system, where multiple users are served by multiple base stations (BSs) connected to a common central unit (CU) via independent backhaul links. We propose an optimized signal-space aligned network coding transceiver scheme for sum-rate maximization. In the scheme, the signal alignment pattern and computed message combinations are determined by a carefully designed indicator matrix. Linear precoding operations at users are applied to realize the signal-space alignment. The aligned spatial streams at BSs are used to generate message combinations. We jointly optimize the alignment pattern and linear precoding operations to achieve a higher sum rate. Numerical results demonstrate the superiority of our proposed scheme over other benchmark schemes.
Relay selection and network coding are two main factors for improving cooperative networks. Employing all the relays without any relay selection in the network increase power consumption and cost to transfer data. Sel...
详细信息
ISBN:
(纸本)9781538631324
Relay selection and network coding are two main factors for improving cooperative networks. Employing all the relays without any relay selection in the network increase power consumption and cost to transfer data. Selection of one or more relays decreases the power consumption, reduces the interference and complexity. network coding increase throughput and decrease error rate. This research proposes a new method for relay selection in two-way relay channel with considering network coding. This choice is based on absolute value of the log-likelihood ratio(LLR) of the received signal at each relay node. The proposed scheme is derived for BPSK modulation. System performance is evaluated by numerical simulations and compared with Max-Min relay selection method. The proposed method is evaluated by bit error rate (BER) simulated curves for AWGN channels and compared to Max-Min relay selection method.
Two-way relaying is one of the major applications of broadband communication satellites, for which Physical Layer network coding (PLNC) is an efficient technique. Earlier studies have considered satellites employing P...
详细信息
ISBN:
(纸本)9781509059355
Two-way relaying is one of the major applications of broadband communication satellites, for which Physical Layer network coding (PLNC) is an efficient technique. Earlier studies have considered satellites employing PLNC with onboard processing. This paper investigates the performance of PLNC over non-regenerative satellites, as a majority of the operational and planned satellites do not have onboard processing. Assuming that the channel magnitudes of the two users are equal, two operating conditions are considered with uncodedQPSK relaying. In the first operating condition, both users are completely synchronized in phase and transmit power, and in the second operating condition, phase is not synchronized. The peak power constraint imposed by the satellite amplifier is considered and the error performance bounds are derived for both the conditions. The simulation results for end-to-end Bit Error Rate (BER) and throughput are provided. These results shall enable communication system designers to decide system parameters like power and linearity, and perform trade-off analysis between different relaying schemes.
Vehicle movement, limited wireless resources, and lossy feature of the wireless channel make it is extreamly demanding to design an efficient routing protocol for vehicular ad hoc networks. The proposed protocol uses ...
详细信息
ISBN:
(纸本)9781538627457
Vehicle movement, limited wireless resources, and lossy feature of the wireless channel make it is extreamly demanding to design an efficient routing protocol for vehicular ad hoc networks. The proposed protocol uses common backbone vehicles which are used for different traffic flows. It also employs interflow network coding to encode packets at the backbone vehicles. Vehicle movement dynamics and link quality between vehicles are the deciding factors for selecting a reliably connected backbone. Interflow network coding at the backbone vehicles helps the protocol to reduce the number of generated packets compared to the conventional routing approach. The main advantages are high packet delivery ratio, low overhead and low delay. To solve security issues, RSA encryption technique is to be used.
We consider Delay Tolerant Mobile Social networks (DTMSNs), made of wireless nodes with intermittent connections and clustered into social communities. The lack of infrastructure and its reliance on nodes' mobilit...
详细信息
ISBN:
(纸本)9781450347747
We consider Delay Tolerant Mobile Social networks (DTMSNs), made of wireless nodes with intermittent connections and clustered into social communities. The lack of infrastructure and its reliance on nodes' mobility make routing a challenge. network coding (NC) is a generalization of routing and has been shown to bring a number of advantages over routing. We consider the problem of pollution attacks in these networks, that are a very important issue both for NC and for DTMSNs. Our first contribution is to propose a protocol which allows controlling adversary's capacity by combining cryptographic hash dissemination and error-correction to ensure message recovery at the receiver. Our second contribution is the modeling of the performance of such a protection scheme. To do so, we adapt an inter-session NC model based on a fluid approximation of the dissemination process. We provide a numerical validation of the model. We are eventually able to provide a work-flow to set the correct parameters and counteract the attacks. We conclude by highlighting how these contributions can help secure a real-world DTMSN application (e.g., a smart-phone app.).
Named Data networking (NDN) is a content-oriented future Internet architecture, which well suits the increasingly mobile and information-intensive applications that dominate today's Internet. NDN relies on in-netw...
详细信息
ISBN:
(纸本)9781509050192
Named Data networking (NDN) is a content-oriented future Internet architecture, which well suits the increasingly mobile and information-intensive applications that dominate today's Internet. NDN relies on in-network caching to facilitate content delivery. This makes it challenging to enforce access control since the content has been cached in the routers and the content producer has lost the control over it. Due to its salient advantages in content delivery, network coding has been introduced into NDN to improve content delivery effectiveness. In this paper, we design ACNC, the first Access Control solution specifically for network coding-based NDN. By combining a novel linear AONT (All Or Nothing Transform) and encryption, we can ensure that only the legitimate user who possesses the authorization key can successfully recover the encoding matrix for network coding, and hence can recover the content being transmitted. In addition, our design has two salient merits: 1) the linear AONT well suits the linear nature of network coding;2) only one vector of the encoding matrix needs to be encrypted/decrypted, which only incurs small computational overhead. Security analysis and experimental evaluation in ndnSIM show that our design can successfully enforce access control on network coding-based NDN with an acceptable overhead.
暂无评论