The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Secure wireless communication has always been a hot research topic due to the vulnerabilities associated with wireless channel. Physical layer aspects to secure wireless communication, based on the information-theoretic security and signal processing methods have gained much recognition over the last decade. Specifically, artificial noise (AN) methods are assumed to be good means for providing security...
Noise aggregation is an efficient way of aggregating the inherent noises introduced during wireless transmissions over multiple channels to degrade the eavesdropper's channel quality. While the performance of channel aggregation has not been thoroughly studied over wireless fading channels, we in this paper concentrating on analyses of its achievable average secrecy rate with emphasis on binary symmetric...
The development of wireless technologies makes telemedicine more and more popular. However, due to the broadcast and openness nature of radio propagation, it makes the image transmitted over wireless channel much easier to be eavesdropped. Moreover, delay requirements is another concern in most application scenarios. To deal with the security issue, a secure scheme for wireless image transmissions...
Guaranteeing the secure delivery is a critical yet challenging issue in wireless transmission. In this paper, a secure delivery scheme that utilizing the dynamic fountain code design is proposed. Using fountain-coded transmission, the transmitter continuously sends fountain packets until the legitimate receiver successfully recovers the original data from a sufficient number of fountain packets. Secure...
Secrecy capacity is the widely-used metric to evaluate the capability of wireless channels in delivering messages with the assurance of perfect security as well as reliability. However, with the proliferation and diversification of wireless services, there have been urgent needs in fine-grained and decoupled security metrics towards future mobile communications. In this paper, we propose a statistical...
Reactive jamming, which performs jamming attacks on condition of detecting the legitimate transmissions, is widely considered as one of the most serious security challenges in wireless communications. In this paper, we tackle the reactive jamming issue from a novel yet realistic perspective -- the jammer may not always be able to accurately detect the legitimate transmissions, which in turn, can be...
This paper analyzes the application of multihop relaying to improve the physical layer security of a wireless body area network (WBAN). Based on the channel characteristics of WBAN, the secrecy outage performance for single-hop and multihop transmission is studied. Results illustrate that multihop relaying performs much better than the single-hop due to the severe path loss caused by the human body.
In this letter, a secure delivery scheme that exploits fountain codes is analyzed. For fountain-coded transmission, the receivers have to obtain a sufficient number of fountain packets to recover the original data. Secure delivery can be achieved if the legitimate user receives enough fountain packets first. For this purpose, we utilize the independent channel fading of different users to ensure a...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.