Showing papers in "Wireless Personal Communications in 2014"
TL;DR: Simulation results show that ADCMCST could greatly reduce the topology formation time, and achieve good approximation results; when the compression ratio is less than 70 %, the network lifetime of ADC MCST will be larger than that of energy driven tree construction.
Abstract: In this paper we propose an approximation algorithm, which is called ADCMCST (algorithm with the minimum number of child nodes when the depth is restricted), to construct a tree network for homogeneous wireless sensor network, so as to reduce and balance the payload of each node, and consequently prolong the network lifetime. When the monitoring node obtains the neighbor graph, ADCMCST tries to find a tree topology with a minimum number of child nodes, and then broadcast the topology to every node, and finally a tree network is constructed. Simulation results show that ADCMCST could greatly reduce the topology formation time, and achieve good approximation results; when the compression ratio is less than 70 %, the network lifetime of ADCMCST will be larger than that of energy driven tree construction.
348 citations
TL;DR: The results indicated that both perspectives of factors affect initial trust, which further affects performance expectancy and usage intention, and service providers need to build users’ initial trust in order to facilitate their usage of mobile payment.
Abstract: Due to the high uncertainty and perceived risk associated with using mobile payment, it is critical to building users' initial trust in order to facilitate their adoption and usage. Drawing on both perspectives of self-perception-based and transference-based factors, this research examined initial trust in mobile payment. Self-perception-based factors include ubiquitous connection and effort expectancy, whereas transference-based factors include structural assurance and trust in online payment. The results indicated that both perspectives of factors affect initial trust, which further affects performance expectancy and usage intention. Thus, service providers need to build users' initial trust in order to facilitate their usage of mobile payment.
108 citations
TL;DR: The simulation results show that as the level of heterogeneity increases in the network, the nodes remain alive for longer time and the rate of energy dissipation decreases and also, increasing the heterogeneity level helps sending more packets to the base station and increases the network lifetime.
Abstract: One of the important protocols for increasing the network lifetime in wireless sensor networks (WSNs) is hybrid energy efficient distributed (HEED) protocol. This protocol considers two parameters for deciding the cluster heads, i.e., residual energy and node density and has been designed for the homogeneous WSNs. In this paper, we consider the implementation of HEED for a heterogeneous network. Depending upon the type of nodes, it defines one-level, two-level, and three-level heterogeneity and accordingly the implementation of HEED is referred to as hetHEED-1, hetHEED-2, and hetHEED-3, respectively. We also consider one more parameter, i.e., distance and apply fuzzy logic to determine the cluster heads and accordingly the hetHEED-1, hetHEED-2, and hetHEED-3 are named as HEED-FL, hetHEED-FL-2, hetHEED-FL-3, respectively. The simulation results show that as the level of heterogeneity increases in the network, the nodes remain alive for longer time and the rate of energy dissipation decreases. And also, increasing the heterogeneity level helps sending more packets to the base station and increases the network lifetime. The increase in the network energy increases the network lifetime manifold. In fact, using fuzzy logic, the network lifetime increases by 114.85 % that of the original HEED without any increase in the network energy. Thus, the hetHEED-FL-3 provides the longest lifetime (387.94 % increase) in lifetime at the cost of 19 % increase in network energy), sends maximum number of packets to the base station, and has minimum rate of energy dissipation.
105 citations
TL;DR: Wu et al. as mentioned in this paper proposed a novel anonymous authentication scheme for roaming service in global mobility networks, which has many important security attributes including prevention of various attacks, user anonymity, no verification table, local password verification and so on.
Abstract: Recently, Mun et al. analyzed Wu et al.'s authentication scheme and proposed an enhanced anonymous authentication scheme for roaming service in global mobility networks. However, through careful analysis, we find that Mun et al.'s scheme is vulnerable to impersonation attacks and insider attacks, and cannot provide user friendliness, user's anonymity, proper mutual authentication and local verification. To remedy these weaknesses, we propose a novel anonymous authentication scheme for roaming service in global mobility networks. Compared with previous related works, our scheme has many advantages. Firstly, the secure authenticity of the scheme is formally validated by an useful formal model called BAN logic. Secondly, the scheme enjoys many important security attributes including prevention of various attacks, user anonymity, no verification table, local password verification and so on. Thirdly, the scheme does not use timestamp, thus it avoids the clock synchronization problem. Further, the scheme contains the authentication and establishment of session key scheme when mobile user is located in his/her home network, therefore it is more practical and universal for global mobility networks. Finally, performance and cost analysis show our scheme is more suitable for low-power and resource limited mobile devices and thus availability for real implementation.
94 citations
TL;DR: The cuckoo search algorithm is implemented to estimate the sensor’s position and shows that the method outperforms the PSO and BBO variants which are recently used in the literature.
Abstract: Many applications of wireless sensor networks (WSN) require information about the geographical location of each sensor node. Devices that form WSN are expected to be remotely deployed in large numbers in a sensing field to perform sensing and acting task. The goal of localization is to assign geographical coordinates to each device with unknown position in the deployment area. Recently, the popular strategy is to apply optimization algorithms to solve the localization problem. In this paper, the cuckoo search algorithm is implemented to estimate the sensor's position. The proposed approach has been compared in terms of localization error with particle swarm optimization (PSO) and various variants of biogeography based optimization (BBO). The results show that our method outperforms the PSO and BBO variants which are recently used in the literature.
76 citations
TL;DR: An image encryption scheme that has the capability to tolerate noisy effects of a wireless channel, which means if the encrypted image data is corrupted by channel noise up to a certain level, correct decryption is possible with some distortion.
Abstract: In this paper, we present an image encryption scheme that has the capability to tolerate noisy effects of a wireless channel. This means if the encrypted image data is corrupted by channel noise up to a certain level, correct decryption is possible with some distortion. The proposed image encryption scheme relies on some very interesting properties of orthogonal matrices containing columns that form a set of orthonormal basis vectors. Besides being tolerant to noisy channels, the proposed scheme also provides good security against well-known cryptographic attacks as demonstrated in this paper by a number of experimental results and security analysis.
73 citations
TL;DR: This work is making energy efficient ALU using the most energy efficient LVCMOS IO standard for the highest frequency of i7 processor and making this ALU portable using MOBILE DDR IO standard in place of default LVCmOS33 IO standard which the authors use in traditional ALU.
Abstract: In this work, we are making energy efficient ALU using the most energy efficient LVCMOS IO standard for the highest frequency of i7 processor. It is observed that LVCMOS12 is the most energy efficient than all available LVCMOS having 26.23, 58.37 and 75.65 % less IO power reduction than LVCMOS18, LVCMOS25 and LVCMOS33 respectively at 1 GHz. Then we are making this ALU portable using MOBILE DDR IO standard in place of default LVCMOS33 IO standard which we use in traditional ALU. As we replace LVCMOS with MOBILE DDR, we are achieving 69.07 % portability in terms of IO power and 29.36 % in terms of Leakage power at 2.9 GHz. In next stage, we try to enhance the performance of ALU with MOBILE DDR but not beyond the power consumption with LVCMOS. In that way, we achieve the highest frequency of 12 GHz with MOBILE DDR. That was earlier possible for 3.8 GHz 64-bit ALU using CMOS. In this HDL based implementation of 64-bit ALU on FPGA, Kintex-7 FPGA is used with XC7K70T device and FBG676 package is used.
70 citations
TL;DR: An improved authentication scheme is proposed, which not only preserves the merits of the scheme of Hsieh et al., but also enjoys several other advantages and is effective in protection from the weaknesses identified and achieves user anonymity and unlinkability.
Abstract: The concept of anonymous channel ticket is one of the effective measures to protect user privacy and to reduce the overhead of re-authentication for wireless environments. Most recently, Hsieh et al. proposed an anonymous authentication protocol based on elliptic curve cryptography to enhance the efficiency and security strength. However, we identify that Hsieh et al.'s scheme has four weaknesses. (1) The scheme fails to provide identity anonymity. (2) The ticket authentication phase of the scheme suffers from desynchronization attack. (3) The scheme is vulnerable to the privileged insider attack. (4) Users cannot change passwords when required. We further propose an improved authentication scheme, which not only preserves the merits of the scheme of Hsieh et al., but also enjoys several other advantages. Our improved scheme is effective in protection from the weaknesses identified and achieves user anonymity and unlinkability. We compare the functionality and performance of our improved scheme with other related schemes, which indicates that our scheme is more secure and yet efficient for wireless access networks.
65 citations
TL;DR: This work points out that an anonymous authentication protocol based on elliptic curve Diffie–Hellman problem for wireless access networks cannot provide user anonymity, and proposes an improved protocol to overcome its weakness.
Abstract: Authentication protocols with anonymity attracted wide attention since they could protect users' privacy in wireless communications. Recently, Hsieh and Leu proposed an anonymous authentication protocol based on elliptic curve Diffie---Hellman problem for wireless access networks and claimed their protocol could provide anonymity. However, by proposing a concrete attack, we point out that their protocol cannot provide user anonymity. To overcome its weakness, we propose an improved protocol. We also provide an analysis of our proposed protocol to prove its superiority, even though its computational cost is slightly higher.
62 citations
TL;DR: A novel routing protocol called Layer by layer Angle-Based Flooding (L2-ABF) is proposed to address the issues of continuous node movements, end-to-end delays and energy consumption in a Underwater Wireless Sensor Network.
Abstract: Providing better communication and maximising the communication performance in a Underwater Wireless Sensor Network (UWSN) is always challenging due to the volatile characteristics of the underwater environment. Radio signals cannot properly propagate underwater, so there is a need for acoustic technology that can support better data rates and reliable underwater wireless communications. Node mobility, 3-D spaces and horizontal communication links are some critical challenges to the researcher in designing new routing protocols for UWSNs. In this paper, we have proposed a novel routing protocol called Layer by layer Angle-Based Flooding (L2-ABF) to address the issues of continuous node movements, end-to-end delays and energy consumption. In L2-ABF, every node can calculate its flooding angle to forward data packets toward the sinks without using any explicit configuration or location information. The simulation results show that L2-ABF has some advantages over some existing flooding-based techniques and also can easily manage quick routing changes where node movements are frequent.
60 citations
TL;DR: A novel multichannel MAC protocol called CS-TDMA considering the channel access scheduling and channel switching concurrently is proposed, which combines CSMA with the time division multiple access (TDMA) to improve the broadcast performance in VANETs.
Abstract: vehicular ad hoc networks (VANETs) have been a key topic for research community and industry alike. The wireless access in vehicular environment standard employs the IEEE 802.11p/1609.4 for the Medium Access Control (MAC) layer implementation for VANETs. However, the carrier sense multiple access (CSMA) based mechanism cannot provide reliable broadcast services, and the multi-channel operation defined in IEEE 1609.4 divides the available access time into fixed alternating control channel intervals (CCH) and service channel (SCH) intervals, which may lead to the low utilization of the scarce resources. In this paper, a novel multichannel MAC protocol called CS-TDMA considering the channel access scheduling and channel switching concurrently is proposed. The protocol combines CSMA with the time division multiple access (TDMA) to improve the broadcast performance in VANETs. Meanwhile, the dwelling ratio between CCH and SCH changes dynamically according to the traffic density, resulting in the improvement of resource utilization efficiency. Simulation results are presented to verify the effectiveness of our mechanism and comparisons are made with three existing MAC protocols, IEEE MAC, SOFT MAC and VeMAC. The simulation results demonstrate the superiority of CS-TDMA in the reduction of transmission delay and packet collision rate and improvement of network throughput.
TL;DR: Key reasons for transition to SDN based mobile networks are explained and several proposals of design scenario are described, special emphasis is placed on SDN’s contribution to more efficient inter-cell interference management, traffic control and network virtualization.
Abstract: Mobile Internet traffic is expected to grow faster than the fixed Internet traffic in a near future. Since, today's broadband networks are approaching theoretical limits in terms of spectral efficiency per link, mobile operators are compelled to seek for new solutions that will be able to accommodate the expected traffic growth and improve their position in the competitive market. Addressing those challenges with current inflexible, not scalable and complex architecture is very hard, if possible at all. Software defined networking (SDN) is a new networking architecture paradigm that holds great promise to overcome many of mentioned limitations and provides required improvements in performance by decoupling control functions from underlying physical infrastructure. In this paper, we explain key reasons for transition to SDN based mobile networks and briefly describe several proposals of design scenario. Special emphasis is placed on SDN's contribution to more efficient inter-cell interference management, traffic control and network virtualization.
TL;DR: An ESL attack-free identity-based mutual authentication and key agreement scheme for mobile multi-server environment is designed and proven to be provably secure in the random oracle model under the Computational Diffie–Hellman assumption.
Abstract: In mobile multi-server authentication, a client can access different servers over an insecure channel like Internet and wireless networks for numerous online applications. In the literature, several multi-server authentication schemes for mobile clients have been devised. However, most of them are insecure against ephemeral secret leakage (ESL) attack and other vulnerabilities. For mutual authentication and key agreement, mobile client and server used ephemeral secrets (random numbers) and leakage of these secrets may be possible in practice. Since these are generated by an external source that may be controlled by an adversary. Also they are generally pre-computed and stored in insecure devices. Thus, if the secrets are leaked then the session key would turn out to be known and the private keys of client and server may be compromised from the eavesdropped messages. This phenomenon is called ESL attack. To defeat the weaknesses, in this paper, we design an ESL attack-free identity-based mutual authentication and key agreement scheme for mobile multi-server environment. The proposed scheme is analyzed and proven to be provably secure in the random oracle model under the Computational Diffie---Hellman assumption.
TL;DR: An extensive survey of the existing load balancing and job migration techniques proposed so far is presented and a new Load balancing technique along with Job Migration approach has been proposed and discussed to fulfill the existing research gaps.
Abstract: Grid computing has recently become one of the most important research topics in the field of computing. The Grid computing paradigm has gained popularity due to its capability to offer easier access to geographically distributed resources operating across multiple administrative domains. The grid environment is considered as a combination of dynamic, heterogeneous and shared resources in order to provide faster and reliable access to the Grid resources, the resource overloading must be prevented which can be obtained by proper load balancing and job migration mechanisms. This paper presents an extensive survey of the existing load balancing and job migration techniques proposed so far. A detailed classification has also been included based on different parameters which are depending on the analysis of the existing techniques, a new Load balancing technique, along with Job Migration approach has been proposed and discussed to fulfill the existing research gaps.
TL;DR: Perceived usefulness negatively affected to actual use of healthcare applications, and both perceived ease of use and enjoyment positively influenced on intention to use.
Abstract: As the use of smartphones and applications has increased, the use of healthcare applications also has increased. In the burgeoning applications market, research regarding customers' characteristics is necessary for the development of specific application products or services that fulfill customers' various needs. This study aimed to analyze the characteristics of and differences in the influential factors of healthcare application use among smartphone users. A survey was conducted in 300 adults from September 16 to October 15, 2011. The research subjects were categorized into three groups, depending on their usage experience and intention to use healthcare applications. We analyzed the characteristics of each group and the differences in influential factors among the groups. The healthcare application users were female, older than 30 years old, and more educated. The current customers had high levels of self-efficacy and innovativeness. Perceived usefulness negatively affected to actual use of healthcare applications, and both perceived ease of use and enjoyment positively influenced on intention to use. Therefore, developers and managers of healthcare applications should consider these characteristics of current and potential customers to improve adoption of healthcare applications.
TL;DR: Experimental results indicate that the proposed modifications to the AES algorithm made the algorithm more compatible with HD image encryption.
Abstract: In this article, a high-speed and highly restricted encryption algorithm is proposed to cipher high-definition (HD) images based on the modified advanced encryption standard (AES) algorithm. AES is a well-known block cipher algorithm and has several advantages, such as high-level security and implementation ability. However, AES has some drawbacks, including high computation costs, pattern appearance, and high hardware requirements. The aforementioned problems become more complex when the AES algorithm ciphers an image, especially HD images. Three modifications are proposed in this paper to improve AES algorithm performance through, decreasing the computation costs, decreasing the hardware requirements, and increasing the security level. First, modification was conducted using MixColumn transformation in 5 rounds instead of 10 rounds in the original AES-128 to decrease the encryption time. Security is enhanced by improving the key schedule operation by adding MixColumn transformation to this operation as second modification. In addition, to decrease the hardware requirements, S-box and Inv. S-box in the original AES are replaced by one simple S-box used for encryption and decryption in the proposed method. The proposed AES version conducts one of the ciphering modes to solve the appearance pattern problem. Experimental results indicate that the proposed modifications to the AES algorithm made the algorithm more compatible with HD image encryption.
TL;DR: The outage performance of a cooperative hybrid satellite and terrestrial system configuration is analytically evaluated assuming that the satellite links suffer from shadowed Rician fading, while the terrestrial link suffers from the Nakagami-m fading.
Abstract: Next generation communication networks incorporate Land Mobile Satellite (LMS) systems in order to provide greater areas of coverage and higher throughput for specific applications. Cooperation between satellite communication networks and terrestrial relays is or increasing the system's performance and availability. In this paper, the outage performance of a cooperative hybrid satellite and terrestrial system configuration is analytically evaluated assuming that the satellite links suffer from shadowed Rician fading, while the terrestrial link suffers from the Nakagami-m fading. Two cooperative relaying strategies are examined and the final formulas for the calculation of the outage probability are given. Moreover, a block diagram for the generation of time series for the reliable simulations of the outage probability of the cooperative hybrid land mobile satellite systems is given. The theoretical results and the simulation results almost coincide. Moreover, extended numerical results investigate the impact, of different shadowing conditions and more generally of the satellite links elevation angles, on the overall cooperative LMS system performance.
TL;DR: An Optimized Congestion management protocol is proposed for HWSNs when the patients are stationary and simulation results show that the proposed protocol is more efficient than CCF, PCCP and backpressure algorithms in terms of packet loss, energy efficiency, end-to-end delay and fairness.
Abstract: The application of Wireless Sensor Networks (WSNs) in healthcare is dominant and fast growing. In healthcare WSN applications (HWSNs) such as medical emergencies, the network may encounter an unpredictable load which leads to congestion. Congestion problem which is common in any data network including WSN, leads to packet loss, increasing end-to-end delay and excessive energy consumption due to retransmission. In modern wireless biomedical sensor networks, increasing these two parameters for the packets that carry EKG signals may even result in the death of the patient. Furthermore, when congestion occurs, because of the packet loss, packet retransmission increases accordingly. The retransmission directly affects the lifetime of the nodes. In this paper, an Optimized Congestion management protocol is proposed for HWSNs when the patients are stationary. This protocol consists of two stages. In the first stage, a novel Active Queue Management (AQM) scheme is proposed to avoid congestion and provide quality of service (QoS). This scheme uses separate virtual queues on a single physical queue to store the input packets from each child node based on importance and priority of the source's traffic. If the incoming packet is accepted, in the second stage, three mechanisms are used to control congestion. The proposed protocol detects congestion by a three-state machine and virtual queue status; it adjusts the child's sending rate by an optimization function. We compare our proposed protocol with CCF, PCCP and backpressure algorithms using the OPNET simulator. Simulation results show that the proposed protocol is more efficient than CCF, PCCP and backpressure algorithms in terms of packet loss, energy efficiency, end-to-end delay and fairness.
TL;DR: A lightweight authentication scheme, TinyZKP, based on zero-knowledge proof (KP) is proposed and implemented on TinyOS-based sensor nodes, and the experimental results show that, compared to two ECDSA-based authentication schemes in TinyECC and WM-ECC, the TinyZkP runs 1.9 and 1.4 times faster and the energy cost is reduced by 48 % and 28 %, respectively.
Abstract: Secure communication over wireless body area network (WBAN) is a key issue in the design and deployment of WBAN systems, in which the authentication of sensor node is a critical process. Conventional authentication schemes are not suitable to the sensor node because of the limitations of memory, computational power and energy in the node. In order to provide an efficient method to verify the identity of sender sensor nodes of WBAN, in this paper a lightweight authentication scheme, TinyZKP, based on zero-knowledge proof (ZKP) is proposed and implemented on TinyOS-based sensor nodes. Our experimental results show that, compared to two ECDSA-based authentication schemes in TinyECC and WM-ECC, the TinyZKP runs 1.9 and 1.4 times faster and the energy cost is reduced by 48 % and 28 %, respectively.
TL;DR: This paper proposes a new two-factor authentication scheme for roaming service in global mobility network which satisfies all the requirements of this type of schemes and is validated applying the formal verification tool ProVerif based on applied pi calculus.
Abstract: Two-factor authentication scheme for roaming service in global mobility network enables the mobile user in possession of a password and a smart card to achieve mutual authentication and session key establishment with the foreign agent. In this paper, we first identify six properties of this type of schemes: (1) Anonymity and untraceability; (2) Robustness; (3) Authentication; (4) Session key security and fairness; (5) User friendliness; and (6) Efficiency, then propose a new scheme which satisfies all these requirements. Our result is validated applying the formal verification tool ProVerif based on applied pi calculus.
TL;DR: This survey focuses especially on approaches that suggest using new addressing schemes on layer 3, namely Locator/ID Separation and Core/Edge Separation, in order to tackle mobility and multihoming issues in an integrated manner.
Abstract: Mobility and multihoming represent key challenges for the development of the current and Future Internet, especially because of the rapid increase of user mobility and network heterogeneity. Both issues, mobility and multihoming, are closely related to each other and mainly issues of the used IP addressing scheme. This survey presents a general overview on approaches that enable mobility and multihoming in Future Internet; it focuses especially on approaches that suggest using new addressing schemes on layer 3, namely Locator/ID Separation and Core/Edge Separation, in order to tackle mobility and multihoming issues in an integrated manner. In our survey, we present a classification of the investigated approaches and summarize the main solution strategies. Furthermore, we evaluate the investigated approaches on basis of their capabilities and technical properties. On basis of the evaluation, where we emphasize the benefits and shortcomings of current solution strategies, we discuss future research issues related to mobility and multihoming.
TL;DR: This paper extends previous work concerning improving video traffic over wireless networks through professionally studying the dependencies between video frames and their implications on the overall network performance by proposing very efficient network and buffer models proportionately to novel algorithms that aim to minimize the cost of aforementioned possible losses.
Abstract: Video traffic over the Internet becomes increasingly popular and is expected to comprise the largest proportion of the traffic carried by wired and wireless networks. On the other hand, videos are usually compressed by exploiting spatial and temporal redundancy for the reason of increasing the number of video streams that can be simultaneously carried over links. Unfortunately, receiving high-quality video streaming over the Internet remains a challenge due to the packet loss encountered in the congested wired and wireless links. In addition, the problem is more apparent in wireless links due to not only employing limited system capacity, but also some of the major drawbacks of wireless networks, out of which the bandwidth limitations and link asymmetry which refers to the situation where the forward and reverse paths of a transmission have different channel capacities. Therefore, the wireless hops may be congested which result in dropping many video frames. Additionally, as a result of compressing videos, dependencies among frames and within a frame arise. Consequently, the overall video quality tends to be degraded dramatically. The main challenge is to support the growth of video traffic while keeping the perceived quality of the delivered videos high. In this paper, we extend our previous work concerning improving video traffic over wireless networks through professionally studying the dependencies between video frames and their implications on the overall network performance. In other words, we propose very efficient network and buffer models proportionately to novel algorithms that aim to minimize the cost of aforementioned possible losses by selectively discarding frames based on their contribution to picture quality, namely, partial and selective partial frame discarding policies considering the dependencies between video frames. The performance metrics that are employed to evaluate the performance of the proposed algorithms include the rate of non-decodable frames, peak signal-to-noise ratio, frameput, average buffer occupancy, average packet delay, as well as jitter. Our results are so promising and show significant improvements in the perceived video quality over what is relevant in the current literature. We do not end up to this extent, but rather the effect of producing different bit-stream rates by the FFMPEG codecs on aforementioned performance metrics has been extensively studied.
TL;DR: Simulation and hardware experiments results prove that nonlinear leastsquare method is suitable for parameters estimation of Bluetooth signal propagation, and generalized least square method has better performance than total least square methods.
Abstract: This paper discusses low-cost 3D indoor positioning with Bluetooth smart device and least square methods. 3D indoor location has become more and more attractive and it hasn't been well resolved. Almost each smart phone has a Bluetooth component and it can be used for indoor positioning and navigation in the nature of things. Least square algorithms are the powerful tools for linear and nonlinear parameters estimation. Various linear and nonlinear least square methods and their theoretical basics and application performance for indoor positioning have been studied. Simulation and hardware experiments results prove that nonlinear least square method is suitable for parameters estimation of Bluetooth signal propagation, and generalized least square method has better performance than total least square methods. Simulation and hardware experiments results also show that proposed method has the advantages of low cost, lost power consumption, perfect availability and high location accuracy.
TL;DR: By presenting concrete attacks, it is demonstrated that Pippal et al.
Abstract: A multi-server authentication scheme enables a remote user to access the services provided by multiple servers after registering with the registration center. Recently, Pippal et al. (Wirel Pers Commun 2013, doi: 10.1007/s11277-013-1039-6 ) introduced a robust smart card authentication scheme for multi-server architecture. They also illustrated that their scheme could be free from potential network attacks, and validated the scheme by using BAN logic. In this paper, by presenting concrete attacks, we demonstrate that Pippal et al.'s scheme can not withstand off-line password guessing attacks, impersonation attacks and privileged insider attacks. Furthermore, to overcome these attacks, we propose an improved authentication scheme for multi-server architecture using smart card and password. Security and efficiency analysis indicates that our scheme not only actually achieves intended security goals (e.g., two-factor authentication, perfect forward secrecy etc.), but also is efficient enough to be implemented for practical applications.
TL;DR: This paper proposes a localization-free routing protocol named MRP (multi-layered routing protocol) for UWSNs and proves that MRP contributes significant performance improvements against representative routing protocols.
Abstract: Underwater Wireless Sensor Networks (UWSNs) have distinctive characteristics due to the use of acoustic signals as its physical medium for communications, including high propagation delay, limited bandwidth and high error rates. Hence, designing communication protocols, particularly, an efficient routing protocol for UWSNs is a challenging issue. Routing protocols can take advantage of the localization of sensor nodes. However, the localization itself is not impeccable in UWSNs. In this paper, we therefore propose a localization-free routing protocol named MRP (multi-layered routing protocol) for UWSNs. MRP utilizes super nodes in order to eliminate the need of localization. MRP works in two phases: Layering phase and Data forwarding phase. During layering phase, different layers are formed around the super nodes. In data forwarding phase, data packets are forwarded based on these layers. Through simulation study using NS-2 simulator, we proved that MRP contributes significant performance improvements against representative routing protocols.
TL;DR: A differential configuration with two cross-coupled pairs by adopting admittance-transforming technique is employed to meet the requirement of low voltage applications and achieves wide tuning range by using a voltage-boosting circuit and the standard mode PMOS varactors in the proposed oscillator architecture.
Abstract: A fully integrated 018- $$\upmu \hbox {m}$$ μ m CMOS LC-tank voltage-controlled oscillator (VCO) suitable for low-voltage and low-power S-band wireless applications is proposed in this paper In order to meet the requirement of low voltage applications, a differential configuration with two cross-coupled pairs by adopting admittance-transforming technique is employed By using forward-body-biased metal oxide semiconductor field effect transistors, the proposed VCO can operate at 04 V supply voltage Despite the low power supply near threshold voltage, the VCO achieves wide tuning range by using a voltage-boosting circuit and the standard mode PMOS varactors in the proposed oscillator architecture The simulation results show that the proposed VCO achieves phase noise of $$-$$ - 1201 dBc/Hz at 1 MHz offset and 393 % tuning range while consuming only $$594~\upmu \hbox {W}$$ 594 μ W in 04 V supply Figure-of-merit with tuning range of the proposed VCO is $$-$$ - 1921 dB at 3 GHz
TL;DR: An overview of the different existing layered schemes in WMSNs is given, followed by a discussion on the significance and efficiency gains that can be achieved from cross layer interactions inWMSNs along with the review of the existing cross layer approaches.
Abstract: The emergence of wireless multimedia sensor networks (WMSN) has given birth to several civilian as well as defense applications. Some of the interesting applications employing low cost sensor nodes to manipulate rich multimedia content include traffic monitoring, border surveillance, smart homes, environment and habitat monitoring. Unlike the traditional sensor networks which are aimed at maximizing network lifetime by decreasing energy utilization, the main objective of WMSNs is optimized delivery of multimedia content along with energy efficiency. Multimedia communications in WMSNs, has stringent delay and high bandwidth requirement as compared to scalar data transfer in WSNs. Fulfilling these constraints in resource and energy constrained WMSNs is a huge challenge. In WMSNs, each layer of the protocol stack is responsible and fully involved in providing QoS guarantees. There is a need for new schemes at each layer of the protocol stack- from advanced coding techniques that reduce encoder complexity and achieve maximum compression to dynamic routing and MAC protocols that provide service differentiation and reduce end-to-end latency. In wireless sensor networks, where all layers have dependency on each other, QoS guarantees are possible through the cross layer interaction of different layers. This paper gives an overview of the different existing layered schemes in WMSNs, followed by a discussion on the significance and efficiency gains that can be achieved from cross layer interactions in WMSNs along with the review of the existing cross layer approaches. Finally, we identify the open research issues which have not been adequately addressed so far.
TL;DR: Simulation results prove that the Dempster–Shafer based Tit-for-Tat strategy is able to maintain the survivability of the vehicular network in the presence of high mobility and packet collisions with minimal time and overhead.
Abstract: In this paper, we address the problem of cooperation among vehicles in VANET using QoS-OLSR protocol in the presence of selfish nodes. QoS-OLSR is a proactive protocol that considers the Quality of Service (QoS) of the nodes while electing the cluster-heads and selecting the Multi-Point Relay (MPRs) nodes. Cluster-heads and MPRs might misbehave on the roads by over-speeding or under-speeding. Classical and generous Tit-for-Tats are proposed to analyze the interaction among vehicles. However, both strategies are not able to enforce the cooperation due the fact that they (1) count on individual watchdogs monitoring, (2) rely on the node-to-node cooperation decision, (3) and ignore the high mobility and packet collisions. Therefore, we propose a Dempster---Shafer based Tit-for-Tat strategy that is able to improve the decision and regulate the cooperation in the vehicular network. This is done by (1) launching a cooperative watchdogs monitoring, (2) correlating the observations of the different watchdogs using Dempster---Shafer theory, and (3) propagating the decisions among clusters. Thereafter, we compare the Dempster---Shafer based strategy with several strategies derived from the original Tit-for-Tat. Simulation results prove that the Dempster---Shafer based strategy is able to maintain the survivability of the vehicular network in the presence of high mobility and packet collisions with minimal time and overhead.
TL;DR: A security enhanced authentication protocol is developed to eliminate all identified weaknesses and can achieve the same order of computation complexity as Pippal et al.
Abstract: With the rapid growth of electronic commerce and demand on variants of Internet based applications, the system providing resources and business services often consists of many servers around the world. So far, a variety of authentication schemes have been published to achieve remote user authentication on multi-server communication environment. Recently, Pippal et al. proposed a multi-server based authentication protocol to pursue the system security and computation efficiency. Nevertheless, based on our analysis, the proposed scheme is insecure against user impersonation attack, server counterfeit attack, and man-in-the-middle attack. In this study, we first demonstrate how these malicious attacks can be invoked by an adversary. Then, a security enhanced authentication protocol is developed to eliminate all identified weaknesses. Meanwhile, the proposed protocol can achieve the same order of computation complexity as Pippal et al.'s protocol does.
TL;DR: Two techniques for improving the performance of transmission control protocol (TCP) over mobile ad hoc networks (MANETs) are proposed, which are simple, easy to implement, do not require network feedback, compatible with the standard TCP, anddo not require distinguishing between the causes of packet loss.
Abstract: Most of the schemes that were proposed to improve the performance of transmission control protocol (TCP) over mobile ad hoc networks (MANETs) are based on a feedback from the network, which can be expensive (require extra bandwidth) and unreliable. Moreover, most of these schemes consider only one cause of packet loss. They also resume operation based on the same stand-by parameters that might vary in the new route. Therefore, we propose two techniques for improving the performance of TCP over MANETs. The first one, called TCP with packet recycling (TCP-PR), allows the nodes to recycle the packets instead of dropping them after reaching the retransmission limit at the MAC layer. In the second technique, which is called TCP with adaptive delay window (TCP-ADW), the receiver delays sending TCP ACK for a certain time that is dynamically changed according to the congestion window and the trip time of the received packet. TCP-PR and TCP-ADW are simple, easy to implement, do not require network feedback, compatible with the standard TCP, and do not require distinguishing between the causes of packet loss. Our thorough simulations show that the integration of our two techniques improves the performance of TCP over MANETs.