Search

Summary: In the present scenario, wireless body area network (WBAN) use case has gone beyond medical monitoring (e.g., E‐Healthcare) and has become a vital part of our daily lives. WBANs, applied in E‐Healthcare systems, extract the physiological parameters through the implanted (in‐body) and/or wearable (on‐body) sensors applied to the human body and route them to the remote server in a systematized and well‐grounded manner. Thus, routing is the most primitive and non‐trivial task in WBANs for prompt and proper delivery of sensed data. The design of routing protocol is crucial for efficacious communication and high network performance. Therefore, the target of this paper is to present an all‐encompassing taxonomy of the state‐of‐the‐art routing protocols in WBANs. Firstly, this paper provides an insight into WBANs and their related projects. Next, WBAN routing challenges are explored, and after clustering these challenges based on their operating mechanism, the routing protocols are categorized into eight categories, which correspond to cluster‐ and tree‐based, cross‐layer‐based, fuzzy‐based, interference‐based, posture‐based, QoS‐based, SDN‐based, and temperature‐based routing protocols. Furthermore, comparison tables highlighting the goals, strengths, limitations, and novelty of each protocol, along with a qualitative comparison table of the routing protocols for each category based on their features are furnished. This exhaustive survey can serve as a starting point for WBAN researchers, as open research issues have been highlighted in the discussion section. [ABSTRACT FROM AUTHOR]

Summary: In this paper, a slotted printed rectangular monopole antenna (SPRMA) is proposed that covers the entire UWB (ultra‐wideband) except for WiMAX and WLAN (802.11/a‐n). In the first stage, a rectangular monopole antenna is designed, which covers the entire UWB frequency. Then, a T‐slot is inserted in the radiating patch to have the rejection of the band containing WiMAX and WLAN (802.11/a‐n). The notch characteristics of the proposed antenna are observed from 3.0 to 3.65 GHz and 4.5 to 6.65 GHz respectively. Measured peak gain of 3.28 dBi has been observed at 4.25 GHz frequency. To show the validation of antenna, mathematical analysis using circuit theory has been also given in the paper. The prototype has been also tested inside the anechoic chamber to give the validation in real‐time environment. Several other reported antenna structures have also the same notch band in UWB with different notching methods. The proposed structure's radiation properties are compared with other reported structures proving the compactness of the proposed structure. [ABSTRACT FROM AUTHOR]

Summary: As a branch of biometrics, face recognition focuses on face features and approaches to distinguishing different individuals through recognizing their faces by virtue of the uniqueness of each face. Face recognition technology using image set, and single image is the main application technology at present. Although the face recognition technology using a single image is relatively mature, it also has some shortcomings. In this paper, Honda/USCD video database is used to compare and analyze the two technologies, and the recognition accuracy of face recognition method based on local binary pattern (LBP) is tested. The results show that the face recognition technology using image sets has better recognition accuracy and can be better applied intelligent shopping, access control system, vehicle access system, intelligent security, identity recognition. [ABSTRACT FROM AUTHOR]

Summary: In this paper, we analyzed and compared the performance of cooperative diversity systems such as cooperative and multi dual‐hop networks with non‐regenerative relay nodes. The contributions of this study are twofolds. Firstly, analytical expressions of outage probability Pout and average symbol error rate ASER are derived using moment generating function (MGF) analysis of the received SNR with the assumption that the channel experiences Weibull fading and the best relay selection is used. Then, using the analytical results, comparative performance evaluation of cooperative and multi dual‐hop relay networks is done for varying number of relay nodes and different receive diversity schemes such as maximal ratio combining (MRC) and selection combining (SC). The results show that the cooperative relay network has better performance than a multi dual‐hop relay network in terms of Pout and ASER. The results also show that the multi dual‐hop network can achieve the same performance as the cooperative network with the requirement that it needs the deployment of three times more relay nodes. [ABSTRACT FROM AUTHOR]

Summary: It is widely believed that hyper elliptic curve cryptosystems (HECCs) are not attractive for wireless sensor network because of their complexity compared with systems based on lower genera, especially elliptic curves. Our contribution shows that for low cost security applications HECs cryptosystems can outperform elliptic curve cryptosystems. The aim of this paper is to propose a discrete logarithm problem‐based lightweight secure communication system using HEC. We propose this for different genus curves over varied prime fields performing a full scale study of their adaptability to various types of constrained networks. Also, we propose to evaluate the performance of the protocol for computational times with respect to different genus for main operations like Jacobian, Divisor identifications, key generation, signature generation/verification, message encryption, and decryption by changing the size of the field. A formal security model was established based on the hardness of HEC‐Decision Diffie‐Hellman (HEC‐DDH). Finally, a comparative analysis with ECC‐based cryptosystems was made, and satisfactory results were obtained. [ABSTRACT FROM AUTHOR]

Various sectors are likely to carry a set of emerging applications while targeting a reliable communication with low latency transmission. To address this issue, upon a spectrally-efficient transmission, this paper investigates the performance of a 1 full-dulpex relay system and considers for that purpose, 2 basic relaying schemes, namely, the symbol-by-symbol transmission, i.e., amplifyand- forward and the block-by-block transmission, i.e., selective decode-andforward. The conducted analysis presents an exhaustive comparison, covering both schemes, over 2 different transmission modes, i.e., the noncombining mode where the best link, direct, or relay link is decoded and the signals combining mode, where direct and relay links are combined at the receiver side. While targeting latency purpose as a necessity, simulations show a refined results of performed comparisons and reveal that amplify-and-forward relaying scheme is more adapted to combining mode, whereas the selective decode-and-forward relaying scheme is more suitable for noncombining mode. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the analytical performance of the multiple-input multiple-output system(MIMO) with orthogonal space-time block codes (STBCs) subject to Weibull fading channels (WFC). Space-time block code technique provides an efficient pattern for wireless transmission over various fading channels using multiple transmit antennas. Two approximating methods of the sum of independent Weibull randomvariables are studied. For each approach, we derive accurate approximate expressions for several performance metrics of MIMOSTBC system operating under independent and nonidenticalWFC. The proposed approximations are expressed in terms of 2 generalized hypergeometric functions, namely, Fox's H and Meijer's G functions. All the derived approximate expressions prove high accuracy, while compared with the simulation results established via Monte Carlo method and Kolmogorov-Smirnov test as well. Although the 2 approaches have approximately the same accuracy, the second method approximate expressions are much less complex than those of the first method. [ABSTRACT FROM AUTHOR]

SUMMARY This paper proposes a cooperative quadrature physical layer network coding (CQPNC) scheme for a dual-hop cooperative relay network, which consists of two source nodes, one relay node and one destination node. All nodes in the network have one antenna, and the two source nodes transmit their signals modulated with quadrature carriers. In this paper, a cooperative quadrature physical layer network coded decode-and-forward (DF) relay protocol (CQPNC-DF) is proposed to transmit the composite information from the two source nodes via the relay node to the destination node simultaneously to reduce the number of time slots required for a transmission. The proposed CQPNC-DF relay protocol is compared with time-division multiple-access amplify-and-forward (TDMA-AF), TDMA-DF, cooperative network coded DF (CNC-DF) and cooperative analog network coded AF (CANC-AF) relay protocols to demonstrate its effectiveness in terms of bit error rate (BER) and system throughput under different propagation conditions. The simulation results reveal that the proposed CQPNC-DF relay protocol can significantly improve the network performance. Compared with two TDMA schemes and CNC-DF, the proposal can provide up to 100% and 50% throughput gains, respectively. Moreover, no matter what the scene, the proposed scheme always has the lowest BER in the low SNR region. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Both least mean square (LMS) and least mean fourth (LMF) are popular adaptive algorithms with application to adaptive channel estimation. Because the wireless channel vector is often sparse, sparse LMS-based approaches have been proposed with different sparse penalties, for example, zero-attracting LMS and Lp-norm LMS. However, these proposed methods lead to suboptimal solutions in low signal-to-noise ratio (SNR) region, and the suboptimal solutions are caused by LMS-based algorithms that are sensitive to the scaling of input signal and strong noise. Comparatively, LMF can achieve better solution in low SNR region. However, LMF cannot exploit the sparse information because the algorithm depends only on its adaptive updating error but neglects the inherent sparse channel structure. In this paper, we propose several sparse LMF algorithms with different sparse penalties to achieve better solution in low SNR region and take the advantage of channel sparsity at the same time. The contribution of this paper is briefly summarized as follows: (1) construct the cost functions of the LMF algorithm with different sparse penalties; (2) derive their lower bounds; and (3) provide experiment results to show the performance advantage of the propose method in low SNR region. [ABSTRACT FROM AUTHOR]

This paper shows the analytical performance expressions of M-ary quadrature amplitude modulation burst symbol transmission for hybrid decode-or-amplify-forward (HDAF) relay schemes over quasi-static Rayleigh-fading channels. First, we derive the probability density function of the received instantaneous signal-to-noise ratio as the simplified form, which is related to all the possible occurrence probabilities of error-events for M-ary quadrature amplitude modulation burst transmission. On the basis of the derived probability density function, we express average bit error probability, average symbol error probability, and average burst error rate as closed forms, which can be also applied to both amplify-and-forward and adaptive decode-and-forward (ADF) schemes. The analysis and simulation results show that HDAF scheme for burst transmission can achieve the performance of ADF scheme with symbol-by-symbol transmission, which is the achievable lower bound. Furthermore, the outage probability, the normalized channel capacity, and the goodput performance are also derived as closed forms. The analysis shows the superiority of HDAF scheme to ADF scheme. Comparison with simulations confirms that the derived analytical expressions are accurate over all signal-to-noise ratio regions and for different numbers of relays and modulation orders. [ABSTRACT FROM AUTHOR]

SUMMARY This paper investigates authenticated key exchange (AKE) protocol under computational Diffie-Hellman assumption in the extended Canetti-Krawczyk model. The core technical component of our protocol is the trapdoor test technique, which is originally introduced to remove the gap Diffie-Hellman (GDH) assumption for the public key encryption schemes. Our contributions are twofold.First, we clarify some misunderstandings of the usage of the trapdoor test technique in AKE protocols showing its adaptation to the AKE protocols is not trivial. We point out some errors in some recent work which attempts to make use of the trapdoor test technique to remove GDH assumption.Second, based on trapdoor test technique, we propose an efficient extended Canetti-Krawczyk secure AKE protocol under computational Diffie-Hellman assumption instead of GDH assumption. Additionally, our protocol does not make use of NAXOS trick and has a tight reduction. In comparison with all existing AKE protocols with the properties as previously mentioned, our protocol with only three exponentiations is most efficient. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

SUMMARY Proxy signature is an important delegation technique. It allows that the original signer delegates his or her signing capability to a proxy signer that can generate valid signatures on behalf of the original signer. Until now, most of proxy signature schemes only were proven secure in the random oracle model. And the length of a proxy signature is usually a sum of the lengths of two signatures in most of the proxy signature schemes. Therefore, the factors make the proxy signature unsuitable for many applications with the constrained space or bandwidth. In this paper, we propose a novel short proxy signature scheme in the standard model. And the scheme is probably secure in the standard model. Compared with all existing proxy signature schemes without random oracles, the scheme achieves the following advantages: stronger security, shorter system parameters, shorter signature length and higher efficiency. To the best of our knowledge, this is the first shortest proxy signature scheme in the standard model, whose length is only 320 b for practical 80-bit security level and the same as that of Digital Signature Algorithm. Copyright © 2012 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

SUMMARY Non-line-of-sight (NLOS) identification is a critical issue in wireless location system. The traditional method only considers the probability of false alarm to obtain the single threshold to identify the wireless propagation environment as line of sight (LOS) or NLOS. However, the probability of missed detection is rarely discussed. In this paper, firstly, the optimal single threshold is derived through minimizing the total error probability, which is the sum of the probability of false alarm and the probability of missed detection. Further, if the prior probabilities for the LOS and NLOS environment are available, a novel double threshold method based on the optimal single threshold is proposed to perform NLOS identification. By comparing the total error probability, we show through simulation results that the performance of the optimal single threshold is better than that of the traditional single threshold. Moreover, the novel double threshold NLOS identification scheme is feasible and better than the optimal single threshold scheme. It is also shown that the analytical results are consistent with the simulated ones.Copyright © 2012 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

SUMMARY In this paper, a novel sensing scheme, uniform quantization for cooperative sensing (UniQCS), that employs a uniform quantizer is proposed. UniQCS is based on energy detection and uses weight vector for global decision function. It performs better than hard decision algorithms such as majority and k-out-of- n in terms of probability of detection and false alarm at the cost of a marginal increase in overhead bits under imperfect reporting channel and false reports. The probability of detection is maximized for a given probability of false alarm constraint by the proposed method. For detailed analysis, the UniQCS is compared with equal gain combiner scheme, which performs far better than hard decision algorithms, via highest bandwidth requirement. The proposed algorithm performs close to equal gain combiner. Moreover, the robustness of UniQCS to sensing error is analyzed when some nodes always report false decisions to the fusion center and the reporting channel is imperfect. For probability of false alarm equal to 0.01, performance gain of UniQCS is at least 45% compared with the other methods when there are two false reporting nodes. UniQCS performance gain is at least 15% compared with other methods for probability of reporting channel error equal to 0.001. Copyright © 2012 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Summary: Various version of Transmission Control Protocol (TCP) congestion window model are available in the literature. TCP congestion control is handled in two phases: (a) slow start and (b) congestion avoidance. This paper deals with congestion avoidance phase that is based on additive increase multiplicative decrease (AIMD) mechanism in which window size either increase by one or cuts to half of the previous window size. For distribution of window sizes, a model developed by Yan et al has been presented for two loss indications: (a) triple duplicate (TD) and (b) time‐outs (TOs) only while it does not deal with the window size limitation. It does not allow to cap over the TCP congestion window size if the buffer size is restricted to a fixed value though window size could not move beyond that. The unconstrained window size moves on in the presence of low loss probability. In this paper, we propose a model for the case where the window size is bounded by a maximum value that makes applicable to window size limitation as well. Further, the work has been extended to develop a new model that obtains a cumulative distribution function for TD periods (TDPs). The proposed model is validated on ns‐2, and we conclude that observed results for distribution function are very closed to our proposed model. [ABSTRACT FROM AUTHOR]

Summary: The advancements in wireless technologies have paved the way for offering seamless services to mobile consumers in global mobility networks (GLOMONETs). Nonetheless, since in these networks, the communication channels are open and public, devising proper measures to protect the security and privacy of exchanging messages is critical. Moreover, because of the energy and computational power limitations of the mobile devices, a security mechanism should put the least possible burden on these devices. To do so, plenty authentication schemes have been proposed in recent years to be employed in the context of GLOMONETs. Quite recently, four interesting authentication and key agreement schemes have been put forward, which have improved the efficiency and security of their previous related schemes. Besides the nice contributions of these four, in this paper, it is first indicated that all of them are vulnerable to the known session‐specific information attack. Then, a new chaotic map‐based authentication scheme is presented that not only is secure against the aforementioned attack but also has less computational complexity and communication overhead. The comprehensive descriptive discussion on security alongside the formal verification of security using the widely accepted ProVerif tool show that our scheme is secure against the known attacks, and the comparative performance analysis demonstrates its betterment for the constrained‐resource mobile devices. In this paper, we have first analyzed four authentication and key agreement schemes, which have been proposed quite recently for the global mobility networks, and have demonstrated their susceptibility to the known session‐specific temporary information attack. Then, in order to cover this security issue, we have presented a security‐enhanced scheme based on the enhanced Chebyshev chaotic map that not only is secure against the aforementioned attack but also offers acceptable level of efficiency in terms of communication and computational costs. [ABSTRACT FROM AUTHOR]

Summary: A vehicular ad hoc network (VANET) is composed mainly of fixed roadside entities (RSUs) and mobile entities (vehicles). In order to exchange information and data relating to the safety and comfort of road users, these different entities must establish communications between them. In these communications, one of the main problems is related to congestion and saturation of RSUs. In this paper, we first study the main protocols that involve RSUs in their strategy of routing by classifying them according to four levels. Furthermore, to deal with the problem of saturation of RSUs, we present a new approach of cooperation between the RSUs of a VANET in order to reduce its congestion and avoid as much as possible the saturation of these entities. This approach, called "D2A2RS" (defensive alliance–based approach for reducing RSUs saturation), is based on the concept of defensive alliances in graphs that ensures effective collaboration between RSUs. To evaluate the performance of the proposed approach, we conduct a comparative analysis by using both analytical models and simulations. The obtained comparison results have shown the efficiency and the performance of our approach compared with other concurrent approaches in the literature in terms of packet loss/success rate, end‐to‐end transmission delay, and network scalability. [ABSTRACT FROM AUTHOR]