The cooperative nature of multihop wireless sensor networks (WSNs) makes it vulnerable to varied types of attacks. The sensitive application environments and resource constraints of WSNs mandate the requirement of lightweight security scheme. The earlier security solutions were based on historical behavior of neighbor but the security can be enhanced by predicting the future behavior of the nodes in the network. In this paper, we proposed a fuzzy-based trust prediction model for routing (FTPR) in WSNs with minimal overhead in regard to memory and energy consumption. FTPR incorporates a trust prediction model that predicts the future behavior of the neighbor based on the historical behavior, fluctuations in trust value over a period of time, and recommendation inconsistency. In order to reduce the control overhead, FTPR received recommendations from a subset of neighbors who had maximum number of interactions with the requestor. Theoretical analysis and simulation results of FTPR protocol demonstrate higher packet delivery ratio, higher network lifetime, lower end-to-end delay, and lower memory and energy consumption than the traditional and existing trust-based routing schemes.
Security is an inherent and challenging task in Wireless Sensor Networks (WSNs) characterized by multihop routing and stringent resource constraints such as limited processing capability, storage capacity, communication bandwidth, and energy. Most of the existing trust-based routing schemes require the support of promiscuous mode of operation and gather a large number of recommendations from the neighbors for trust derivation. These result in higher energy consumption, higher communication overhead, and larger memory requirements in a resource constrained sensor network. In this paper, we propose a new twoway acknowledgment-based trust (2-ACKT) framework with individual (2-ACKT-I) and group (2-ACKT-G) acknowledgment to minimize the communication overhead and memory requirement for trust establishment in WSNs. The 2-ACKT protocol calculates the direct trust using a link layer acknowledgment and a two-hop acknowledgment from a downstream neighbor. The simulation and theoretical results indicate that 2-ACKT scheme significantly outperforms the conventional multihop and trust-based routing schemes in terms of packet delivery ratio, network lifetime, communication overhead, and memory requirements.
Cognitive radio techniques provide the capability to use or share the spectrum in an opportunistic manner. The major functions of cognitive radio include spectrum sensing, spectrum management, spectrum mobility and spectrum sharing. Spectrum sensing is the primary technique which is used by all the Cognitive radio users to harvest the advantage of Cognitive radio technique. In Spectrum sensing various popular methods have been already proposed and studied exhaustively by the CR researchers. In this paper spectrum sensing methods such as Eigen value based detection, energy detection and matched filter detection are implemented. All the above techniques have their own pros and cons. The main aim of this work is to classify the techniques based on the key parameters such as probability of detection, probability of false alarm and signal to noise ratio, to identify the adaptive threshold for each technique, implement and evaluate an adaptive sensing technique using MATLAB Keywords-cognitive radio, spectrum sensing, energy detection, matched filter detection, eigen value detection 978-1-4799-7623-2/15/$31.00 c 2015 IEEE
The healthcare industries research trends focus on patient reliable communication and security is a paramount requirement of healthcare applications. Jamming in wireless communication medium has become a major research issue due to the ease of blocking communication in wireless networks and throughput degradation. The most commonly used technique to overcome jamming is frequency hopping (FH). However, in traditional FH pre-sharing of key for channel selection and a high-throughput overhead is required. So to overcome this pre-sharing of key and to increase the security chaotic frequency hopping (CFH) has been proposed. The design of chaos-based hop selection is a new development that offers improved performance in transmission of information without pre-shared key and also increases the security. The authors analysed the performance of proposed CFH system under different reactive jamming durations. The percentage of error reduction by the reactive jamming for jamming duration 0.01 and 0.05 s for FH and CFH is 55.03 and 84.24%, respectively. The obtained result shows that CFH is more secure and difficult to jam by the reactive jammer.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.