Energy-efficient communications is crucial for wireless sensor networks(WSN) where energy consumption is constrained. The transmission and reception energy can be saved by applying network coding to many wireless comm...Energy-efficient communications is crucial for wireless sensor networks(WSN) where energy consumption is constrained. The transmission and reception energy can be saved by applying network coding to many wireless communications systems. In this paper,we present a coded cooperation scheme which employs network coding to WSN. In the scheme,the partner node forwards the combination of the source data and its own data instead of sending the source data alone. Afterward,both of the system block error rates(BLERs) and energy performance are evaluated. Experiment results show that the proposed scheme has higher energy efficiency. When Noise power spectral density is-171dBm/Hz,the energy consumption of the coded cooperation scheme is 81.1% lower than that of the single-path scheme,43.9% lower than that of the cooperation scheme to reach the target average BLER of 10-2. When the channel condition is getting worse,the energy saving effect is more obvious.展开更多
In this article,we exploit the idea of network-coded cooperative protocol in aeronautical communications which combines different source nodes'information at the relay and joint decoding at the destination.Recentl...In this article,we exploit the idea of network-coded cooperative protocol in aeronautical communications which combines different source nodes'information at the relay and joint decoding at the destination.Recently,the network coding in cooperative communications has been categorized into two mainstreams,bit-level and signal-level combinations,which are both discussed in the article.And to be exclusively,multiple access relay channel(MARC)is adopted.The mutual information expressions of both above-cited network-coded protocols are deduced,which prove that without proper selected relays to perform network coding,the spatial diversity of the proposed protocol cannot be obtained.This then leads to search for the selection and grouping algorithms.An adjacency matrix is defined to describe the connectivity of the nodes in one radio contact disk,so that,the selection and grouping of algorithm is equivalent to constructing this adjacency matrix to minimize the system outage probability evaluated in term of the mutual information.Besides,a network-coded cooperative protocol requires the acyclic network,of which the construction is to avoid loop-4 in the matrix.The article ends with simulations to demonstrate the viability of the proposed algorithms.展开更多
Cooperative communication can achieve spatial diversity gains,and consequently combats signal fading due to multipath propagation in wireless networks powerfully.A novel complex field network-coded cooperation(CFNCC...Cooperative communication can achieve spatial diversity gains,and consequently combats signal fading due to multipath propagation in wireless networks powerfully.A novel complex field network-coded cooperation(CFNCC) scheme based on multi-user detection for the multiple unicast transmission is proposed.Theoretic analysis and simulation results demonstrate that,compared with the conventional cooperation(CC) scheme and network-coded cooperation(NCC) scheme,CFNCC would obtain higher network throughput and consumes less time slots.Moreover,a further investigation is made for the symbol error probability(SEP) performance of CFNCC scheme,and SEPs of CFNCC scheme are compared with those of NCC scheme in various scenarios for different signal to noise ratio(SNR) values.展开更多
This paper investigates the simultaneous wireless information and powertransfer(SWIPT) for network-coded two-way relay network from an information-theoretic perspective, where two sources exchange information via an S...This paper investigates the simultaneous wireless information and powertransfer(SWIPT) for network-coded two-way relay network from an information-theoretic perspective, where two sources exchange information via an SWIPT-aware energy harvesting(EH) relay. We present a power splitting(PS)-based two-way relaying(PS-TWR) protocol by employing the PS receiver architecture. To explore the system sum rate limit with data rate fairness, an optimization problem under total power constraint is formulated. Then, some explicit solutions are derived for the problem. Numerical results show that due to the path loss effect on energy transfer, with the same total available power, PS-TWR losses some system performance compared with traditional non-EH two-way relaying, where at relatively low and relatively high signalto-noise ratio(SNR), the performance loss is relatively small. Another observation is that, in relatively high SNR regime, PS-TWR outperforms time switching-based two-way relaying(TS-TWR) while in relatively low SNR regime TS-TWR outperforms PS-TWR. It is also shown that with individual available power at the two sources, PS-TWR outperforms TS-TWR in both relatively low and high SNR regimes.展开更多
In relay-assisted multi-user system, relay coding is important to enhance the robustness and reliability of cooperative transmission. For better adaptability and efficiency, two joint network and fountain coding(JNFC)...In relay-assisted multi-user system, relay coding is important to enhance the robustness and reliability of cooperative transmission. For better adaptability and efficiency, two joint network and fountain coding(JNFC) schemes are proposed. When the condition of all direct channels is worse, JNFC scheme based on distributed LT(DLT) codes is used. Otherwise, JNFC scheme based on multi-dimensional LT(MD-LT) codes is suited. For both two above-mentioned schemes, the united degree distribution design method for short-length fountain codes is proposed. For the latter scheme, MD-LT codes are proposed for equal error protection(EEP) of each user. Simulation results and analysis show that the united degree distribution need less decoding overhead compared with other degree distribution for short-length fountain codes. And then, all users are protected equally in despite of asymmetric uplinks.展开更多
Airborne networks(ANs) are special types of ad hoc networks that can be used to enhance situational awareness, flight coordination and flight efficiency in civil and military aviation.Compared to ground networks, AN...Airborne networks(ANs) are special types of ad hoc networks that can be used to enhance situational awareness, flight coordination and flight efficiency in civil and military aviation.Compared to ground networks, ANs have some unique attributes including high node mobility, frequent topology changes, mechanical and aerodynamic constrains, strict safety requirements and harsh communication environment.Thus, the performance of conventional transmission control protocol(TCP) will be dramatically degraded in ANs.Aircraft commonly have two or more heterogeneous network interfaces which offer an opportunity to form multiple communication paths between any two nodes in ANs.To satisfy the communication requirements in ANs, we propose aeronautical multipath transport protocol(Aero MTP) for ANs, which effectively utilizes the available bandwidth and diversity provided by heterogeneous wireless paths.Aero MTP uses fountain codes as forward error correction(FEC) codes to recover from data loss and deploys a TCP-friendly rate-based congestion control mechanism for each path.Moreover, we design a packet allocation algorithm based on optimization to minimize the delivery time of blocks.The performance of Aero MTP is evaluated through OMNe T++ simulations under a variety of test scenarios.Simulations demonstrate that Aero MTP is of great potential to be applied to ANs.展开更多
Network Coding (NC) is a recent technique which is used to improve the transmission data rate and the power efficiency. These goals are obtained by combining data together before transmitting them, resulting to less t...Network Coding (NC) is a recent technique which is used to improve the transmission data rate and the power efficiency. These goals are obtained by combining data together before transmitting them, resulting to less transmitted data that carry the same amount of information. NC research work over the physical layer and the upper layers are popular and needed to be more investigated. In this paper, we propose a practical system of large-number of connected multi-source network coding (LMSNC), at the physical layer that exploits the broadcast nature of the wireless channel, using the practical and bandwidth-efficient schemes decode-and-forward (DF) and then compare it with Amplify and Forward (AF). The theoretical analysis and the simulation results show the effect of the noise when it cumulates in AF system and how DF is solving this severe default. Moreover, we consider the MSNC for Small-number of connected sources (SMSNC) and the two-way communication setup where two users exchange their information over an intermediate network node (ideally called Base Station), as two reference cases to compare with. With SMSNC, the number of necessary downlink transmissions from the intermediate node to the users is reduced, and thus the throughput is increased. Simulation results obtained using high-performance non-binary turbo codes, based on Partial Unit Memory (PUM) codes (4, 2, 1, 4) and (8, 4, 3, 8);confirm that combining PUM Turbo Code (PUMTC) and NC in the proposed MSNC setup gives almost the same BER performance as that for SMSNC at the small number of processing steps mainly when PUMTC (8, 4, 3, 8) is performed, which is required to retrieve the received coded messages. In the scenario of AF, combining packets results to cumulate the noise, which justifies the reason we decided to increase the number of transmitted coded messages in the network, i.e., the BER performance improves when sending extra coded messages. Finally, the possibility for a trade-off among BER, data rate and the number of transmitted coded messages is shown for LMSNC through graphics and simulation results.展开更多
In this paper, based on the characteristics of polar codes, a new decode-and-forward strategy called generalized partial information relaying protocol is proposed for degraded multiple-relay networks with orthogonal r...In this paper, based on the characteristics of polar codes, a new decode-and-forward strategy called generalized partial information relaying protocol is proposed for degraded multiple-relay networks with orthogonal receiver components(MRNORCs). In such a protocol, with the help of partial information from previous nodes, each relay node tries to recover the received source message and re-encodes part of the decoded message for transmission to satisfy the decoding requirements for the following relay node or the destination node. In order to construct practical polar codes, the nested structures are developed based on this protocol and the information sets corresponding to the partial messages forwarded are also calculated. The proposed scheme is proved to be capable of achieving the theoretical capacity of the degraded MRN-ORCs while still retains the low-complexity feature of polar codes. We perform simulations to testify the practicability of the proposed scheme and compare polar codes by using successive-cancellation list decoder(SCLD) with traditional low-density parity-check(LDPC) codes. The results show that the obtained polar codes provide significant gain.展开更多
A network-coding-based multisource LDPC-coded cooperative MIMO scheme is proposed,where multiple sources transmit their messages to the destination with the assistance from a single relay.The relay cooperates with mul...A network-coding-based multisource LDPC-coded cooperative MIMO scheme is proposed,where multiple sources transmit their messages to the destination with the assistance from a single relay.The relay cooperates with multiple sources simultaneously via network-coding.It avoids the issues of imperfect frequency/timing synchronization and large transmission delay which may be introduced by frequency-division multiple access(FDMA)/code-division multiple access(CDMA)and time-division multiple access(TDMA)manners.The proposed joint″Min-Sum″iterative decoding is effectively carried out in the destination.Such a decoding algorithm agrees with the introduced equivalent joint Tanner graph which can be used to fully characterize LDPC codes employed by the sources and relay.Theoretical analysis and numerical simulation show that the proposed scheme with joint iterative decoding can achieve significant cooperation diversity gain.Furthermore,for the relay,compared with the cascade scheme,the proposed scheme has much lower complexity of LDPC-encoding and is easier to be implemented in the hardware with similar bit error rate(BER)performance.展开更多
Optimal resource allocation is critical to the efficiency of cooperative communiCations. In this paper, we develop an auction-based power allocation mechanism for network-coded cooperation in wireless networks, in whi...Optimal resource allocation is critical to the efficiency of cooperative communiCations. In this paper, we develop an auction-based power allocation mechanism for network-coded cooperation in wireless networks, in which the sources compete for the relay power for maximum utility, while the relay node assigns the resource in accordance with the bids from the sources. Moreover, to improve the resource utilization, the relay node is allowed to perform network coding across the received information for the same destination. Finally, numerical results validate the performance of the proposed algorithm, and show that there exists a tradeoff between the system outage probability and the power consumed at the relay node.展开更多
Normally,in the downlink Network-Coded Multiple Access(NCMA)system,the same power is allocated to different users.However,equal power allocation is unsuitable for some scenarios,such as when user devices have differen...Normally,in the downlink Network-Coded Multiple Access(NCMA)system,the same power is allocated to different users.However,equal power allocation is unsuitable for some scenarios,such as when user devices have different Quality of Service(QoS)requirements.Hence,we study the power allocation in the downlink NCMA system in this paper,and propose a downlink Network-Coded Multiple Access with Diverse Power(NCMA-DP),wherein different amounts of power are allocated to different users.In terms of the Bit Error Rate(BER)of the multi-user decoder,and the number of packets required to correctly decode the message,the performance of the user with more allocated power is greatly improved compared to the Conventional NCMA(NCMA-C).Meanwhile,the performance of the user with less allocated power is still much better than NCMA-C.Furthermore,the overall throughput of NCMA-DP is greatly improved compared to that of NCMA-C.The simulation results demonstrate the remarkable performance of the proposed NCMA-DP.展开更多
Recently,coded caching has been treated as a promising technique to alleviate the traffic burden in wireless networks.To support high efficient coded caching multicast transmissions,the time-varying heterogeneous chan...Recently,coded caching has been treated as a promising technique to alleviate the traffic burden in wireless networks.To support high efficient coded caching multicast transmissions,the time-varying heterogeneous channel conditions need to be considered.In this paper,a practical and novel multi-source spinal coding(MSSC)scheme is developed for coded caching multicast transmissions under heterogeneous channel conditions.By exploring joint design of network coding and spinal coding(SC),MSSC can achieve unequal link rates in multicast transmissions for different users.Moreover,by leveraging the rateless feature of SC in our design,MSSC can well adapt the link rates of all users in multicast transmissions without any feedback of time-varying channel conditions.A maximum likelihood(ML)based decoding process for MSSC is also developed,which can achieve a linear complexity with respect to the user number in the multicast transmission.Simulation results validate the effectiveness of the MSSC scheme.Compared to the existing scheme,the sum rate of MSSC in multicast transmissions is improved by about 20%.When applying MSSC in coded caching systems,the total transmission time can be reduced by up to 48% for time-varying channels.展开更多
By mcans of stable attractors of discret Hopfield neural network (DHNN) , anew class of nonlinear error control codes is sugsested and some relativetheorems are presented. A kind of single error control codes is also ...By mcans of stable attractors of discret Hopfield neural network (DHNN) , anew class of nonlinear error control codes is sugsested and some relativetheorems are presented. A kind of single error control codes is also given forillustrating this new approach.展开更多
In this paper, we further study the connections between linear network error correction codes and representable matroids. We extend the concept of matroidal network introduced by Dougherty et al. to a generalized case...In this paper, we further study the connections between linear network error correction codes and representable matroids. We extend the concept of matroidal network introduced by Dougherty et al. to a generalized case when errors occur in multi- ple channels. Importantly, we show the necessary and sufficient conditions on the existence of linear network error correction mul- ticast/broadcast/dispersion maximum distance separable (MDS) code on a matroidal error correction network.展开更多
In this work, the homomorphism of the classic linear block code in linear network coding for the case of binary field and its extensions is studied. It is proved that the classic linear error-control block code is hom...In this work, the homomorphism of the classic linear block code in linear network coding for the case of binary field and its extensions is studied. It is proved that the classic linear error-control block code is homomorphic network error-control code in network coding. That is, if the source packets at the source node for a linear network coding are precoded using a linear block code, then every packet flowing in the network regarding to the source satisfies the same constraints as the source. As a consequence, error detection and correction can be performed at every intermediate nodes of multicast flow, rather than only at the destination node in the conventional way, which can help to identify and correct errors timely at the error-corrupted link and save the cost of forwarding error-corrupted data to the destination node when the intermediate nodes are ignorant of the errors. In addition, three examples are demonstrated which show that homomorphic linear code can be combined with homomorphic signature, McEliece public-key cryptosystem and unequal error protection respectively and thus have a great potential of practical utility.展开更多
By extending the notion of the minimum distance for linear network error correction code(LNEC), this paper introduces the concept of generalized minimum rank distance(GMRD) of variable-rate linear network error correc...By extending the notion of the minimum distance for linear network error correction code(LNEC), this paper introduces the concept of generalized minimum rank distance(GMRD) of variable-rate linear network error correction codes. The basic properties of GMRD are investigated. It is proved that GMRD can characterize the error correction/detection capability of variable-rate linear network error correction codes when the source transmits the messages at several different rates.展开更多
In this paper,we apply adaptive coded modulation (ACM) schemes to a wireless networked control system (WNCS) to improve the energy efficiency and increase the data rate over a fading channel.To capture the characteris...In this paper,we apply adaptive coded modulation (ACM) schemes to a wireless networked control system (WNCS) to improve the energy efficiency and increase the data rate over a fading channel.To capture the characteristics of varying rate, interference,and routing in wireless transmission channels,the concepts of equivalent delay (ED) and networked condition index (NCI) are introduced.Also,the analytic lower and upper bounds of EDs are obtained.Furthermore,we model the WNCS as a multicontroller switched system (MSS) under consideration of EDs and loss index in the wireless transmission.Sufficient stability condition of the closed-loop WNCS and corresponding dynamic state feedback controllers are derived in terms of linear matrix inequality (LMI). Numerical results show the validity and advantage of our proposed control strategies.展开更多
We study the detailed malicious code propagating process in scale-free networks with link weights that denotes traffic between two nodes. It is found that the propagating velocity reaches a peak rapidly then decays in...We study the detailed malicious code propagating process in scale-free networks with link weights that denotes traffic between two nodes. It is found that the propagating velocity reaches a peak rapidly then decays in a power-law form, which is different from the well-known result in unweighted network case. Simulation results show that the nodes with larger strength are preferential to be infected, but the hierarchical dynamics are not clearly found. The simulation results also show that larger dispersion of weight of networks leads to slower propagating, which indicates that malicious code propagates more quickly in unweighted scale-free networks than in weighted scale-free networks under the same condition. These results show that not only the topology of networks but also the link weights affect the malicious propagating process.展开更多
Code dissemination is one of the important services of wireless sensor networks (WSNs). Securing the process of code dissemination is essential in some certain WSNs applications, state-of-the-art secure code dissemina...Code dissemination is one of the important services of wireless sensor networks (WSNs). Securing the process of code dissemination is essential in some certain WSNs applications, state-of-the-art secure code dissemination protocols for WSNs aim for the efficient source authentication and integrity verification of code image, however, due to the resource constrains of WSNs and the epidemic behavior of the code dissemination system, existing secure code dissemination protocols are vulnerable to Denial of Service (DoS) attacks when sensor nodes can be compromised (insider DoS attacks). In this paper, we identify five different basic types of DoS attacks exploiting the epidemic propagation strategies used by Deluge. They are (1) Higher-version Advertisement attack, (2) False Request attack, (3) Larger-numbered Page attack, (4) Lower-version Adv attack, and (5) Same-version Adv attack. Simulation shows these susceptibilities caused by above insider DoS attacks. Some simple models are also proposed which promote understanding the problem of insider DoS attacks and attempt to quantify the severity of these attacks in the course of code dissemination in WSNs.展开更多
The Base Station (BS) or access point is the building block of wireless networks, so, we propose exploiting it together with the Network Coding (NC) principle. NC suffers from the complexity of the decoding processes,...The Base Station (BS) or access point is the building block of wireless networks, so, we propose exploiting it together with the Network Coding (NC) principle. NC suffers from the complexity of the decoding processes, i.e., complicated Jordan Gaussian Elimination (JGE) processes. So, this paper proposes a deterministic NC algorithm to reduce the number of sequential network decoding steps, and hence minimizing the complexity of JGE process resulting to better time delay and processing time. We propose an algorithm that combines higher number of the transmitted packets resulting to better data-rate but worse Bet Error Rate (BER). However, using such strong Forward error correction channel code, which is Partial Unit Memory Turbo Code (PUMTC) results to minimize the losses in the BER to a very acceptable lever, in fact, in Decode-and-Forward (DF) BS, the BER can be regarded as minimum. Simulation results, for both Amplify-and-Forward (AF) and DF BS schemes using PUMTC based on (8, 4, 3, 8) component codes, confirm that using PUMTC mitigates the problem of noise aggregation resulting from applying NC in the proposed schemes.展开更多
基金support in part from the National Natural Science Foundation of China (No. 60962002)the Program to Sponsor Teams for Innovation in the Construction of Talent Highlands in Guangxi Institutions of Higher Learning+1 种基金the Foundation of Guangxi Key Laboratory of Information and Communication (NO. 20904)the Scientific Research Foundation of Guangxi University (Grant No.XBZ091006)
文摘Energy-efficient communications is crucial for wireless sensor networks(WSN) where energy consumption is constrained. The transmission and reception energy can be saved by applying network coding to many wireless communications systems. In this paper,we present a coded cooperation scheme which employs network coding to WSN. In the scheme,the partner node forwards the combination of the source data and its own data instead of sending the source data alone. Afterward,both of the system block error rates(BLERs) and energy performance are evaluated. Experiment results show that the proposed scheme has higher energy efficiency. When Noise power spectral density is-171dBm/Hz,the energy consumption of the coded cooperation scheme is 81.1% lower than that of the single-path scheme,43.9% lower than that of the cooperation scheme to reach the target average BLER of 10-2. When the channel condition is getting worse,the energy saving effect is more obvious.
基金National Natural Science Foundation of China(60532030)National Outstanding Youth Science Fund(60625102)
文摘In this article,we exploit the idea of network-coded cooperative protocol in aeronautical communications which combines different source nodes'information at the relay and joint decoding at the destination.Recently,the network coding in cooperative communications has been categorized into two mainstreams,bit-level and signal-level combinations,which are both discussed in the article.And to be exclusively,multiple access relay channel(MARC)is adopted.The mutual information expressions of both above-cited network-coded protocols are deduced,which prove that without proper selected relays to perform network coding,the spatial diversity of the proposed protocol cannot be obtained.This then leads to search for the selection and grouping algorithms.An adjacency matrix is defined to describe the connectivity of the nodes in one radio contact disk,so that,the selection and grouping of algorithm is equivalent to constructing this adjacency matrix to minimize the system outage probability evaluated in term of the mutual information.Besides,a network-coded cooperative protocol requires the acyclic network,of which the construction is to avoid loop-4 in the matrix.The article ends with simulations to demonstrate the viability of the proposed algorithms.
基金supported by the National Natural Science Foundation of China(6104000561001126+5 种基金61271262)the China Postdoctoral Science Foundation Funded Project(201104916382012T50789)the Natural Science Foundation of Shannxi Province of China(2011JQ8036)the Special Fund for Basic Scientific Research of Central Colleges (CHD2012ZD005)the Research Fund of Zhejiang University of Technology(20100244)
文摘Cooperative communication can achieve spatial diversity gains,and consequently combats signal fading due to multipath propagation in wireless networks powerfully.A novel complex field network-coded cooperation(CFNCC) scheme based on multi-user detection for the multiple unicast transmission is proposed.Theoretic analysis and simulation results demonstrate that,compared with the conventional cooperation(CC) scheme and network-coded cooperation(NCC) scheme,CFNCC would obtain higher network throughput and consumes less time slots.Moreover,a further investigation is made for the symbol error probability(SEP) performance of CFNCC scheme,and SEPs of CFNCC scheme are compared with those of NCC scheme in various scenarios for different signal to noise ratio(SNR) values.
基金supported by the National Natural Science Foundation of China ( No . 61602034 )the Beijing Natural Science Foundation (No. 4162049)+2 种基金the Open Research Fund of National Mobile Communications Research Laboratory,Southeast University (No. 2014D03)the Fundamental Research Funds for the Central Universities Beijing Jiaotong University (No. 2016JBM015)the NationalHigh Technology Research and Development Program of China (863 Program) (No. 2015AA015702)
文摘This paper investigates the simultaneous wireless information and powertransfer(SWIPT) for network-coded two-way relay network from an information-theoretic perspective, where two sources exchange information via an SWIPT-aware energy harvesting(EH) relay. We present a power splitting(PS)-based two-way relaying(PS-TWR) protocol by employing the PS receiver architecture. To explore the system sum rate limit with data rate fairness, an optimization problem under total power constraint is formulated. Then, some explicit solutions are derived for the problem. Numerical results show that due to the path loss effect on energy transfer, with the same total available power, PS-TWR losses some system performance compared with traditional non-EH two-way relaying, where at relatively low and relatively high signalto-noise ratio(SNR), the performance loss is relatively small. Another observation is that, in relatively high SNR regime, PS-TWR outperforms time switching-based two-way relaying(TS-TWR) while in relatively low SNR regime TS-TWR outperforms PS-TWR. It is also shown that with individual available power at the two sources, PS-TWR outperforms TS-TWR in both relatively low and high SNR regimes.
基金supported in part by a grant from the Ph.D. Programs Foundation of Ministry of Education of China under Grants No. 20094307110004National Natural Science Foundation of China under Grants No.61372098, No.61101074Natural Science Foundation of Hunan Province, China under Grants No.12jj2037
文摘In relay-assisted multi-user system, relay coding is important to enhance the robustness and reliability of cooperative transmission. For better adaptability and efficiency, two joint network and fountain coding(JNFC) schemes are proposed. When the condition of all direct channels is worse, JNFC scheme based on distributed LT(DLT) codes is used. Otherwise, JNFC scheme based on multi-dimensional LT(MD-LT) codes is suited. For both two above-mentioned schemes, the united degree distribution design method for short-length fountain codes is proposed. For the latter scheme, MD-LT codes are proposed for equal error protection(EEP) of each user. Simulation results and analysis show that the united degree distribution need less decoding overhead compared with other degree distribution for short-length fountain codes. And then, all users are protected equally in despite of asymmetric uplinks.
文摘Airborne networks(ANs) are special types of ad hoc networks that can be used to enhance situational awareness, flight coordination and flight efficiency in civil and military aviation.Compared to ground networks, ANs have some unique attributes including high node mobility, frequent topology changes, mechanical and aerodynamic constrains, strict safety requirements and harsh communication environment.Thus, the performance of conventional transmission control protocol(TCP) will be dramatically degraded in ANs.Aircraft commonly have two or more heterogeneous network interfaces which offer an opportunity to form multiple communication paths between any two nodes in ANs.To satisfy the communication requirements in ANs, we propose aeronautical multipath transport protocol(Aero MTP) for ANs, which effectively utilizes the available bandwidth and diversity provided by heterogeneous wireless paths.Aero MTP uses fountain codes as forward error correction(FEC) codes to recover from data loss and deploys a TCP-friendly rate-based congestion control mechanism for each path.Moreover, we design a packet allocation algorithm based on optimization to minimize the delivery time of blocks.The performance of Aero MTP is evaluated through OMNe T++ simulations under a variety of test scenarios.Simulations demonstrate that Aero MTP is of great potential to be applied to ANs.
文摘Network Coding (NC) is a recent technique which is used to improve the transmission data rate and the power efficiency. These goals are obtained by combining data together before transmitting them, resulting to less transmitted data that carry the same amount of information. NC research work over the physical layer and the upper layers are popular and needed to be more investigated. In this paper, we propose a practical system of large-number of connected multi-source network coding (LMSNC), at the physical layer that exploits the broadcast nature of the wireless channel, using the practical and bandwidth-efficient schemes decode-and-forward (DF) and then compare it with Amplify and Forward (AF). The theoretical analysis and the simulation results show the effect of the noise when it cumulates in AF system and how DF is solving this severe default. Moreover, we consider the MSNC for Small-number of connected sources (SMSNC) and the two-way communication setup where two users exchange their information over an intermediate network node (ideally called Base Station), as two reference cases to compare with. With SMSNC, the number of necessary downlink transmissions from the intermediate node to the users is reduced, and thus the throughput is increased. Simulation results obtained using high-performance non-binary turbo codes, based on Partial Unit Memory (PUM) codes (4, 2, 1, 4) and (8, 4, 3, 8);confirm that combining PUM Turbo Code (PUMTC) and NC in the proposed MSNC setup gives almost the same BER performance as that for SMSNC at the small number of processing steps mainly when PUMTC (8, 4, 3, 8) is performed, which is required to retrieve the received coded messages. In the scenario of AF, combining packets results to cumulate the noise, which justifies the reason we decided to increase the number of transmitted coded messages in the network, i.e., the BER performance improves when sending extra coded messages. Finally, the possibility for a trade-off among BER, data rate and the number of transmitted coded messages is shown for LMSNC through graphics and simulation results.
基金supported by the National Natural Science Foundation of China (No.41574137, 41304117)
文摘In this paper, based on the characteristics of polar codes, a new decode-and-forward strategy called generalized partial information relaying protocol is proposed for degraded multiple-relay networks with orthogonal receiver components(MRNORCs). In such a protocol, with the help of partial information from previous nodes, each relay node tries to recover the received source message and re-encodes part of the decoded message for transmission to satisfy the decoding requirements for the following relay node or the destination node. In order to construct practical polar codes, the nested structures are developed based on this protocol and the information sets corresponding to the partial messages forwarded are also calculated. The proposed scheme is proved to be capable of achieving the theoretical capacity of the degraded MRN-ORCs while still retains the low-complexity feature of polar codes. We perform simulations to testify the practicability of the proposed scheme and compare polar codes by using successive-cancellation list decoder(SCLD) with traditional low-density parity-check(LDPC) codes. The results show that the obtained polar codes provide significant gain.
基金Supported by the Postdoctoral Science Foundation of China(2014M561694)the Science and Technology on Avionics Integration Laboratory and National Aeronautical Science Foundation of China(20105552)
文摘A network-coding-based multisource LDPC-coded cooperative MIMO scheme is proposed,where multiple sources transmit their messages to the destination with the assistance from a single relay.The relay cooperates with multiple sources simultaneously via network-coding.It avoids the issues of imperfect frequency/timing synchronization and large transmission delay which may be introduced by frequency-division multiple access(FDMA)/code-division multiple access(CDMA)and time-division multiple access(TDMA)manners.The proposed joint″Min-Sum″iterative decoding is effectively carried out in the destination.Such a decoding algorithm agrees with the introduced equivalent joint Tanner graph which can be used to fully characterize LDPC codes employed by the sources and relay.Theoretical analysis and numerical simulation show that the proposed scheme with joint iterative decoding can achieve significant cooperation diversity gain.Furthermore,for the relay,compared with the cascade scheme,the proposed scheme has much lower complexity of LDPC-encoding and is easier to be implemented in the hardware with similar bit error rate(BER)performance.
基金Project supported by the National Natural Science Foundation of China (Grant No.60802019)the Science and Technology Commission of Shanghai Municipality (Grant No.08220510900)
文摘Optimal resource allocation is critical to the efficiency of cooperative communiCations. In this paper, we develop an auction-based power allocation mechanism for network-coded cooperation in wireless networks, in which the sources compete for the relay power for maximum utility, while the relay node assigns the resource in accordance with the bids from the sources. Moreover, to improve the resource utilization, the relay node is allowed to perform network coding across the received information for the same destination. Finally, numerical results validate the performance of the proposed algorithm, and show that there exists a tradeoff between the system outage probability and the power consumed at the relay node.
文摘Normally,in the downlink Network-Coded Multiple Access(NCMA)system,the same power is allocated to different users.However,equal power allocation is unsuitable for some scenarios,such as when user devices have different Quality of Service(QoS)requirements.Hence,we study the power allocation in the downlink NCMA system in this paper,and propose a downlink Network-Coded Multiple Access with Diverse Power(NCMA-DP),wherein different amounts of power are allocated to different users.In terms of the Bit Error Rate(BER)of the multi-user decoder,and the number of packets required to correctly decode the message,the performance of the user with more allocated power is greatly improved compared to the Conventional NCMA(NCMA-C).Meanwhile,the performance of the user with less allocated power is still much better than NCMA-C.Furthermore,the overall throughput of NCMA-DP is greatly improved compared to that of NCMA-C.The simulation results demonstrate the remarkable performance of the proposed NCMA-DP.
基金supported by National Natural Science Foundation of China(No.61801290 and 61771312).
文摘Recently,coded caching has been treated as a promising technique to alleviate the traffic burden in wireless networks.To support high efficient coded caching multicast transmissions,the time-varying heterogeneous channel conditions need to be considered.In this paper,a practical and novel multi-source spinal coding(MSSC)scheme is developed for coded caching multicast transmissions under heterogeneous channel conditions.By exploring joint design of network coding and spinal coding(SC),MSSC can achieve unequal link rates in multicast transmissions for different users.Moreover,by leveraging the rateless feature of SC in our design,MSSC can well adapt the link rates of all users in multicast transmissions without any feedback of time-varying channel conditions.A maximum likelihood(ML)based decoding process for MSSC is also developed,which can achieve a linear complexity with respect to the user number in the multicast transmission.Simulation results validate the effectiveness of the MSSC scheme.Compared to the existing scheme,the sum rate of MSSC in multicast transmissions is improved by about 20%.When applying MSSC in coded caching systems,the total transmission time can be reduced by up to 48% for time-varying channels.
文摘By mcans of stable attractors of discret Hopfield neural network (DHNN) , anew class of nonlinear error control codes is sugsested and some relativetheorems are presented. A kind of single error control codes is also given forillustrating this new approach.
基金Supported by the National Natural Science Foundation of China(6127117461272492)
文摘In this paper, we further study the connections between linear network error correction codes and representable matroids. We extend the concept of matroidal network introduced by Dougherty et al. to a generalized case when errors occur in multi- ple channels. Importantly, we show the necessary and sufficient conditions on the existence of linear network error correction mul- ticast/broadcast/dispersion maximum distance separable (MDS) code on a matroidal error correction network.
基金supported by Natural Science Foundation of China (No.61271258)
文摘In this work, the homomorphism of the classic linear block code in linear network coding for the case of binary field and its extensions is studied. It is proved that the classic linear error-control block code is homomorphic network error-control code in network coding. That is, if the source packets at the source node for a linear network coding are precoded using a linear block code, then every packet flowing in the network regarding to the source satisfies the same constraints as the source. As a consequence, error detection and correction can be performed at every intermediate nodes of multicast flow, rather than only at the destination node in the conventional way, which can help to identify and correct errors timely at the error-corrupted link and save the cost of forwarding error-corrupted data to the destination node when the intermediate nodes are ignorant of the errors. In addition, three examples are demonstrated which show that homomorphic linear code can be combined with homomorphic signature, McEliece public-key cryptosystem and unequal error protection respectively and thus have a great potential of practical utility.
文摘By extending the notion of the minimum distance for linear network error correction code(LNEC), this paper introduces the concept of generalized minimum rank distance(GMRD) of variable-rate linear network error correction codes. The basic properties of GMRD are investigated. It is proved that GMRD can characterize the error correction/detection capability of variable-rate linear network error correction codes when the source transmits the messages at several different rates.
基金National Outstanding Youth Founda-tion (No.60525303)National Natural Science Foundation of China(No.60404022,60704009)Natural Science Foundation of Hebei Province (No.F2005000390,F2006000270).
文摘In this paper,we apply adaptive coded modulation (ACM) schemes to a wireless networked control system (WNCS) to improve the energy efficiency and increase the data rate over a fading channel.To capture the characteristics of varying rate, interference,and routing in wireless transmission channels,the concepts of equivalent delay (ED) and networked condition index (NCI) are introduced.Also,the analytic lower and upper bounds of EDs are obtained.Furthermore,we model the WNCS as a multicontroller switched system (MSS) under consideration of EDs and loss index in the wireless transmission.Sufficient stability condition of the closed-loop WNCS and corresponding dynamic state feedback controllers are derived in terms of linear matrix inequality (LMI). Numerical results show the validity and advantage of our proposed control strategies.
基金Supported by the National Natural Science Foundation of China (90204012, 60573036) and the Natural Science Foundation of Hebei Province (F2006000177)
文摘We study the detailed malicious code propagating process in scale-free networks with link weights that denotes traffic between two nodes. It is found that the propagating velocity reaches a peak rapidly then decays in a power-law form, which is different from the well-known result in unweighted network case. Simulation results show that the nodes with larger strength are preferential to be infected, but the hierarchical dynamics are not clearly found. The simulation results also show that larger dispersion of weight of networks leads to slower propagating, which indicates that malicious code propagates more quickly in unweighted scale-free networks than in weighted scale-free networks under the same condition. These results show that not only the topology of networks but also the link weights affect the malicious propagating process.
文摘Code dissemination is one of the important services of wireless sensor networks (WSNs). Securing the process of code dissemination is essential in some certain WSNs applications, state-of-the-art secure code dissemination protocols for WSNs aim for the efficient source authentication and integrity verification of code image, however, due to the resource constrains of WSNs and the epidemic behavior of the code dissemination system, existing secure code dissemination protocols are vulnerable to Denial of Service (DoS) attacks when sensor nodes can be compromised (insider DoS attacks). In this paper, we identify five different basic types of DoS attacks exploiting the epidemic propagation strategies used by Deluge. They are (1) Higher-version Advertisement attack, (2) False Request attack, (3) Larger-numbered Page attack, (4) Lower-version Adv attack, and (5) Same-version Adv attack. Simulation shows these susceptibilities caused by above insider DoS attacks. Some simple models are also proposed which promote understanding the problem of insider DoS attacks and attempt to quantify the severity of these attacks in the course of code dissemination in WSNs.
文摘The Base Station (BS) or access point is the building block of wireless networks, so, we propose exploiting it together with the Network Coding (NC) principle. NC suffers from the complexity of the decoding processes, i.e., complicated Jordan Gaussian Elimination (JGE) processes. So, this paper proposes a deterministic NC algorithm to reduce the number of sequential network decoding steps, and hence minimizing the complexity of JGE process resulting to better time delay and processing time. We propose an algorithm that combines higher number of the transmitted packets resulting to better data-rate but worse Bet Error Rate (BER). However, using such strong Forward error correction channel code, which is Partial Unit Memory Turbo Code (PUMTC) results to minimize the losses in the BER to a very acceptable lever, in fact, in Decode-and-Forward (DF) BS, the BER can be regarded as minimum. Simulation results, for both Amplify-and-Forward (AF) and DF BS schemes using PUMTC based on (8, 4, 3, 8) component codes, confirm that using PUMTC mitigates the problem of noise aggregation resulting from applying NC in the proposed schemes.