Permutation polynomials in finite fields are introduced for the first time into thedesign of full frequency hop codes(FHCs).Various kinds of full FHCs with good auto-and cross-correlation functions are presented in th...Permutation polynomials in finite fields are introduced for the first time into thedesign of full frequency hop codes(FHCs).Various kinds of full FHCs with good auto-and cross-correlation functions are presented in this paper.For example,the second class of FHCs are thebest full FHCs ever known.展开更多
Frequency Hopping Spread Spectrum (FHSS) system is often deployed to protect wireless communication from jamming or to preclude undesired reception of the signal. Such themes can only be achieved if the jammer or unde...Frequency Hopping Spread Spectrum (FHSS) system is often deployed to protect wireless communication from jamming or to preclude undesired reception of the signal. Such themes can only be achieved if the jammer or undesired receiver does not have the knowledge of the spreading code. For this reason, unencrypted M-sequences are a deficient choice for the spreading code when a high level of security is required. The primary objective of this paper is to analyze vulnerability of linear feedback shift register (LFSRs) codes. Then, a new method based on encryption algorithm applied over spreading codes, named hidden frequency hopping is proposed to improve the security of FHSS. The proposed encryption security algorithm is highly reliable, and can be applied to all existing data communication systems based on spread spectrum techniques. Since the multi-user detection is an inherent characteristic for FHSS, the multi-user interference must be studied carefully. Hence, a new method called optimum pair “key-input” selection is proposed which reduces interference below the desired constant threshold.展开更多
Luby transform （LT） codes are proposed to suppress the effect of partial band noise jam- ming in frequency hopping （FH） communication systems. A decoding scheme for joint erasures of severely jammed symbols and er...Luby transform （LT） codes are proposed to suppress the effect of partial band noise jam- ming in frequency hopping （FH） communication systems. A decoding scheme for joint erasures of severely jammed symbols and error correction is proposed. If an uncorrectable error is detected, the receiver erases the jammed symbols and uses incremental redundancy to increase the error-correcting capability. The performance of LT codes, under power-oppressive partial band noise jamming （ PB- N J） with the additive white Gaussian noise （AWGN）, is evaluated via simulation. Even if the jam- mer spreads its high power over half of the hopping bandwidth, LT codes are shown to achieve a tar- get bit error probability of 10 -5, demonstrating their effectiveness as high-performance codes to im- prove the ability of FH systems to combat varying partial band noise jamming.展开更多
A Two-hop Wireless Network (TWN) is the basic topology structure that provides network coding opportunity for improving throughput. Network coding on a homogeneous TWN, in which all the data flows have the same packet...A Two-hop Wireless Network (TWN) is the basic topology structure that provides network coding opportunity for improving throughput. Network coding on a homogeneous TWN, in which all the data flows have the same packet size and all the links have the same transmission rate, has been extensively investigated. In this paper, network coding on more practical heterogeneous TWNs, featured by various packet sizes and transmission rates, is studied. Based on the Markov model, the throughput of the proposed network coding scheme, together with the throughput gain, is derived, which matches the simulation results very well. Numerical analyses indicate that, encoding the packets with close size and close transmission rate and enlarging buffer size at the relay node help in improving the throughput gain.展开更多
Broadcasting is used as a building block in many MANET (Mobile Ad hoc Network) routing protocols. In addition, broadcasting is a key primitive in ad hoc networks to support group-based applications. Efficiently suppor...Broadcasting is used as a building block in many MANET (Mobile Ad hoc Network) routing protocols. In addition, broadcasting is a key primitive in ad hoc networks to support group-based applications. Efficiently supporting broadcasting in multihop wireless networks is therefore important. In this paper, we compare ef-ficient broadcasting protocols based on packet forwarding with those based on network coding. Using a number of network scenarios, we derive lower bounds for the required number of packet retransmissions at the MAC layer to support broadcast with and without applying network coding techniques. We compare these lower bounds with each other, as well as with protocols proposed for each approach. More specifically, we use SMF and PDP as sample forwarding-based broadcast protocols, and a simple XOR-based coding protocol over SMF and PDP as representative network coding solution. The results show that neither packet forwarding protocols nor network coding protocols achieve the theoretical lower bounds, in particular as the size of the network area (at constant density) increases. The comparison of the lower bounds also shows that network coding does have a potential performance advantage over packet forwarding solutions for broad-casting in multi-hop wireless networks, in particular for larger fixed density networks, justifying its inherent increased complexity.展开更多
基金Supported by National Natural Sciences Foundation of China
文摘Permutation polynomials in finite fields are introduced for the first time into thedesign of full frequency hop codes(FHCs).Various kinds of full FHCs with good auto-and cross-correlation functions are presented in this paper.For example,the second class of FHCs are thebest full FHCs ever known.
文摘Frequency Hopping Spread Spectrum (FHSS) system is often deployed to protect wireless communication from jamming or to preclude undesired reception of the signal. Such themes can only be achieved if the jammer or undesired receiver does not have the knowledge of the spreading code. For this reason, unencrypted M-sequences are a deficient choice for the spreading code when a high level of security is required. The primary objective of this paper is to analyze vulnerability of linear feedback shift register (LFSRs) codes. Then, a new method based on encryption algorithm applied over spreading codes, named hidden frequency hopping is proposed to improve the security of FHSS. The proposed encryption security algorithm is highly reliable, and can be applied to all existing data communication systems based on spread spectrum techniques. Since the multi-user detection is an inherent characteristic for FHSS, the multi-user interference must be studied carefully. Hence, a new method called optimum pair “key-input” selection is proposed which reduces interference below the desired constant threshold.
基金Supported by the National Nature Science Foundation of China(61072048)
文摘Luby transform （LT） codes are proposed to suppress the effect of partial band noise jam- ming in frequency hopping （FH） communication systems. A decoding scheme for joint erasures of severely jammed symbols and error correction is proposed. If an uncorrectable error is detected, the receiver erases the jammed symbols and uses incremental redundancy to increase the error-correcting capability. The performance of LT codes, under power-oppressive partial band noise jamming （ PB- N J） with the additive white Gaussian noise （AWGN）, is evaluated via simulation. Even if the jam- mer spreads its high power over half of the hopping bandwidth, LT codes are shown to achieve a tar- get bit error probability of 10 -5, demonstrating their effectiveness as high-performance codes to im- prove the ability of FH systems to combat varying partial band noise jamming.
基金Supported by the National Natural Science Foundation of China(No.61070190 and 61001126)Zhejiang Provincial Natural Science Foundation of China(No.Z1100455)Ph.D.Programs Foundation of Ministry of Education of China(No.20123317110002)
文摘A Two-hop Wireless Network (TWN) is the basic topology structure that provides network coding opportunity for improving throughput. Network coding on a homogeneous TWN, in which all the data flows have the same packet size and all the links have the same transmission rate, has been extensively investigated. In this paper, network coding on more practical heterogeneous TWNs, featured by various packet sizes and transmission rates, is studied. Based on the Markov model, the throughput of the proposed network coding scheme, together with the throughput gain, is derived, which matches the simulation results very well. Numerical analyses indicate that, encoding the packets with close size and close transmission rate and enlarging buffer size at the relay node help in improving the throughput gain.
文摘Broadcasting is used as a building block in many MANET (Mobile Ad hoc Network) routing protocols. In addition, broadcasting is a key primitive in ad hoc networks to support group-based applications. Efficiently supporting broadcasting in multihop wireless networks is therefore important. In this paper, we compare ef-ficient broadcasting protocols based on packet forwarding with those based on network coding. Using a number of network scenarios, we derive lower bounds for the required number of packet retransmissions at the MAC layer to support broadcast with and without applying network coding techniques. We compare these lower bounds with each other, as well as with protocols proposed for each approach. More specifically, we use SMF and PDP as sample forwarding-based broadcast protocols, and a simple XOR-based coding protocol over SMF and PDP as representative network coding solution. The results show that neither packet forwarding protocols nor network coding protocols achieve the theoretical lower bounds, in particular as the size of the network area (at constant density) increases. The comparison of the lower bounds also shows that network coding does have a potential performance advantage over packet forwarding solutions for broad-casting in multi-hop wireless networks, in particular for larger fixed density networks, justifying its inherent increased complexity.
基金Acknowledgments： This work was supported by the National Natural Science Foundation of China （No. 60773012） and Postdoctoral Science Foundation of China （No. 20070420184）, and in part by Joint Project KOSEF/NSFC Korea Research Foundation （No. KRF-D-2007-52 1-D00330）, and ETRI, Korea.
