Secure and robust multi-constrained QoS aware routing algorithm for VANETs

Secure QoS routing algorithms are a fundamental part of wireless networks that aim to provide services with QoS and security guarantees. In Vehicular Ad hoc Networks (VANETs), vehicles perform routing functions, and at the same time act as end-systems thus routing control messages are transmitted unprotected over wireless channels. The QoS of the entire network could be degraded by an attack on the routing process, and manipulation of the routing control messages. In this paper, we propose a novel secure and reliable multi-constrained QoS aware routing algorithm for VANETs. We employ the Ant Colony Optimisation (ACO) technique to compute feasible routes in VANETs subject to multiple QoS constraints determined by the data traffic type. Moreover, we extend the VANET-oriented Evolving Graph (VoEG) model to perform plausibility checks on the exchanged routing control messages among vehicles. Simulation results show that the QoS can be guaranteed while applying security mechanisms to ensure a reliable and robust routing service

MPIGA – Multipath Selection Using Improved Genetic Algorithm

The Wireless Multimedia Networks (WMNs) have developed due to the extensive applications of wireless devices and increasing availability of lower cost hardware. The WMNs are used to transmit the multimedia content like audio and video streaming and they can be deployed within a lower budget. These networks can also be used in real-time data applications that demand energy-efficient management and awareness of Quality of Service (QoS). The energy resources are limited in the wireless devices that lead to the significant threats on the QoS for WMNs. An energy-efficient routing technique is needed to handle the dynamic topology of WMN that includes a vital resource as energy. The energy-efficient routing method was proposed in this work for the purpose of data communication based on a cluster head selection from each cluster in addition to the multipath route selection to reduce the network overhead and energy consumption. The cluster heads for each cluster are selected based on Node Coverage & average residual energy parameters.In this work, the proposed energy efficient routing algorithm uses improved genetic algorithm (IGA)based on a cost function for dynamic selection of the best path. The proposed cost function uses link lifetime &average link delay parameters to estimate the link cost. The proposed algorithm’s performance compared with other previous routing methods based on extensive simulation analysis. The results showed that the proposed method achieves better performance over three other routing techniques

QoS routing in ad-hoc networks using GA and multi-objective optimization

Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs) and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks) to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing).Peer ReviewedPostprint (published version

Abstract — Wireless Multimedia Sensor Networks

(WMSN) can handle different traffic classes of multimedia content (video, audio streams and still images) as well as scalar data over the network. Use of general and efficient routing protocols for WMSN is of crucial significance. Similar to other traditional networks, in WMSN a noticeable proportion of energy is consumed due to communications. Many routing protocols have been proposed for WMSN. The design of more efficient protocols in terms of energy awareness, video packet scheduling and QoS in terms of checkpoint arrangement still remains a challenge. This paper proposes the actuation of sensor on demand basis and routing protocol based on cost function which efficiently utilizes the network resources such as the intermediate nodes energy and load. Cost function is introduced to improve the route selection and control congestion. Simulation results, using the NS-2 simulator show that the proposed protocol prolongs the network lifetime, increase the reliability and decrease the network load

Real-Time QoS Routing Protocols in Wireless Multimedia Sensor Networks: Study and Analysis

Many routing protocols have been proposed for wireless sensor networks. These routing protocols are almost always based on energy efficiency. However, recent advances in complementary metal-oxide semiconductor (CMOS) cameras and small microphones have led to the development of Wireless Multimedia Sensor Networks (WMSN) as a class of wireless sensor networks which pose additional challenges. The transmission of imaging and video data needs routing protocols with both energy efficiency and Quality of Service (QoS) characteristics in order to guarantee the efficient use of the sensor nodes and effective access to the collected data. Also, with integration of real time applications in Wireless Senor Networks (WSNs), the use of QoS routing protocols is not only becoming a significant topic, but is also gaining the attention of researchers. In designing an efficient QoS routing protocol, the reliability and guarantee of end-to-end delay are critical events while conserving energy. Thus, considerable research has been focused on designing energy efficient and robust QoS routing protocols. In this paper, we present a state of the art research work based on real-time QoS routing protocols for WMSNs that have already been proposed. This paper categorizes the real-time QoS routing protocols into probabilistic and deterministic protocols. In addition, both categories are classified into soft and hard real time protocols by highlighting the QoS issues including the limitations and features of each protocol. Furthermore, we have compared the performance of mobility-aware query based real-time QoS routing protocols from each category using Network Simulator-2 (NS2). This paper also focuses on the design challenges and future research directions as well as highlights the characteristics of each QoS routing protocol.https://doi.org/10.3390/s15092220

Comparative Study on Ant Colony Optimization (ACO) and K-Means Clustering Approaches for Jobs Scheduling and Energy Optimization Model in Internet of Things (IoT)

The concept of Internet of Things (IoT) was proposed by Professor Kevin Ashton of the Massachusetts Institute of Technology (MIT) in 1999. IoT is an environment that people understand in many different ways depending on their requirement, point of view and purpose. When transmitting data in IoT environment, distribution of network traffic fluctuates frequently. If links of the network or nodes fail randomly, then automatically new nodes get added frequently. Heavy network traffic affects the response time of all system and it consumes more energy continuously. Minimization the network traffic/ by finding the shortest path from source to destination minimizes the response time of all system and also reduces the energy consumption cost. The ant colony optimization (ACO) and K-Means clustering algorithms characteristics conform to the auto-activator and optimistic response mechanism of the shortest route searching from source to destination. In this article, ACO and K-Means clustering algorithms are studied to search the shortest route path from source to destination by optimizing the Quality of Service (QoS) constraints. Resources are assumed in the active and varied IoT network atmosphere for these two algorithms. This work includes the study and comparison between ant colony optimization (ACO) and K-Means algorithms to plan a response time aware scheduling model for IoT. It is proposed to divide the IoT environment into various areas and a various number of clusters depending on the types of networks. It is noticed that this model is more efficient for the suggested routing algorithm in terms of response time, point-to-point delay, throughput and overhead of control bits