No abstract

Vehicular ad hoc networks (VANETs) are a special type of wireless ad hoc network that requires highly scalable routing strategies to establishing reliable end-to-end communication. Because of the high dynamic of VANETs, the mobility of vehicle nodes increases the control traffic overhead. Accordingly, establishing reliable end-to-end communication paths depends entirely on the routing mechanism and the type of nodes mobility information. In this paper, we propose a new improvement to the mechanism of the Optimized Link State Routing Protocol(OLSR) protocol, named Cluster-based Adept Cooperative Algorithm (CACA), where each vehicle estimate a reliable low-overhead path using the cluster-based QoS algorithm. The CACA algorithm is introduced to improve the ability of the MPR scheme for maintaining long-lived routes. Moreover, the network scalability is enhanced by adaptively selecting most sustainable paths based on a signal strength beacon and the mobility degree of a node, which reduces significantly minimizes the size of control messages overhead as well the routing tables recalculation process. Simulation experiments using the network simulator are presented to demonstrate the effectiveness of our solution. The results show that the proposed algorithm can improve network performance effectively relative to other algorithms. INDEX TERMS Quality of Service, VANETs, cooperative MPR scheme, Routing, cluster-based, OLSR protocol.

No abstract

Nowadays, the usage of resource constrained devices is increasing and these devices are primarily working with sensitive data. Consequently, data security has become crucial for both producers and users. Limitation of resources is deemed as the major issue that makes these devices vulnerable. Attackers might exploit these limitations to get access to the valuable data. Therefore, carefully chosen and practically tested encryption algorithm must be applied to increase the device efficiency and mitigate the risk of sensitive data loss. This study will compare elliptic curve cryptography (ECC) algorithm with Key size of 160-bit and Rivest-Shamir-Adleman (RSA) algorithm with Key size of 1024-bit. As a result of this study utilizing ECC in resource constrained devices has advantages over RSA but ECC needs continues enhancement to satisfy the limitations of newly designed chips.

Problem statement: Sensor nodes are easily exposed to many attacks since it were deployed in unattended adversarial environment with no global addressing and used for critical applications such as battlefield surveillance and emergency response. While the sensor also needs to act as a router to relay a message to a required recipient, then this increased the vulnerabilities to a network layer. However, existing security mechanisms are not permissible to be fitted directly into any sensor network due to constraints on energy and computational capabilities of sensor node itself that require on the modification on the protocols that associated with the sensor node itself in order to provide the security. Approach: In this study, a Dynamic Window Secured Implicit Geographic Forwarding (DWIGF) routing protocol was presented which based on an approach of lazy binding technique and dynamic time on collection window and inherits a geographical routing techniques. Results: The DWIGF was intelligent to minimize a Clear To Send (CTS) rushing attack and robust against black hole and selective forwarding attacks with high packet delivery ratios because of selection of a failed node and an attacker was minimized respectively. Moreover, few routing attacks were eliminated since the routing technique used was classified as geographic routing. Conclusion: This novel routing protocol was promising a secured routing without inserting any existing security mechanism inside.