Search

Wireless Sensor Networks (WSNs) are emerging networks that are being utilized in a variety of applications, such as remote sensing images, military, healthcare, and traffic monitoring. Those critical applications require different levels of security; however, due to the limitation of the sensor networks, security is a challenge where traditional algorithms cannot be used. In addition, sensor networks are considered as the core of the Internet of Things (IoT) and smart cities, where security became one of the most significant problems with IoT and smart cities applications. Therefore, this paper proposes a novel and light trust algorithm to satisfy the security requirements of WSNs. It considers sensor nodes' limitations and cross-layer information for efficient secure routing in WSNs. It proposes a Tow-ACKs Trust (TAT) Routing protocol for secure routing in WSNs. TAT computes the trust values based on direct and indirect observation of the nodes. TAT uses the first-hand and second-hand information from the Data Link and the Transmission Control Protocol layers to modify the trust's value. The suggested TATs' protocols performance is compared to BTRM and Peertrust models in terms of malicious detection ratio, accuracy, average path length, and average energy consumption. The proposed algorithm is compared to BTRM and Peertrust models, the most recent algorithms that proved their efficiency in WSNs. The simulation results indicate that TAT is scalable and provides excellent performance over both BTRM and Peertrust models, even when the number of malicious nodes is high. [ABSTRACT FROM AUTHOR]

Location-based services (LBS) form the main part of the Internet of Things (IoT) and have received a significant amount of attention from the research community as well as application users due to the popularity of wireless devices and the daily growth in users. However, there are several risks associated with the use of LBS-enabled applications, as users are forced to send their queries based on their real-time and actual location. Attacks could be applied by the LBS server itself or by its maintainer, which consequently may lead to more serious issues such as the theft of sensitive and personal information about LBS users. Due to this fact, complete privacy protection (location and query privacy protection) is a critical problem. Collaborative (cache-based) approaches are used to prevent the LBS application users from connecting to the LBS server (malicious parties). However, no robust trust approaches have been provided to design a trusted third party (TTP), which prevents LBS users from acting as an attacker. This paper proposed a symbiotic relationship-based leader approach to guarantee complete privacy protection for users of LBS-enabled applications. Specifically, it introduced the mutual benefit underlying the symbiotic relationship, dummies, and caching concepts to avoid dealing with untrusted LBS servers and achieve complete privacy protection. In addition, the paper proposed a new privacy metric to predict the closeness of the attacker to the moment of her actual attack launch. Compared to three well-known approaches, namely enhanced dummy location selection (enhanced-DLS), hiding in a mobile crowd, and caching-aware dummy selection algorithm (enhanced-CaDSA), our experimental results showed better performance in terms of communication cost, resistance against inferences attacks, and cache hit ratio. [ABSTRACT FROM AUTHOR]