A Bio-Inspired Routing Optimization in UAV-enabled Internet of Everything

Internet of Everything(IoE)indicates a fantastic vision of the future,where everything is connected to the internet,providing intelligent services and facilitating decision making.IoE is the collection of static and moving objects able to coordinate and communicate with each other.The moving objects may consist of ground segments and ying segments.The speed of ying segment e.g.,Unmanned Ariel Vehicles(UAVs)may high as compared to ground segment objects.The topology changes occur very frequently due to high speed nature of objects in UAV-enabled IoE(Ue-IoE).The routing maintenance overhead may increase when scaling the Ue-IoE(number of objects increases).A single change in topology can force all the objects of the Ue-IoE to update their routing tables.Similarly,the frequent updating in routing table entries will result more energy dissipation and the lifetime of the Ue-IoE may decrease.The objects consume more energy on routing computations.To prevent the frequent updation of routing tables associated with each object,the computation of routes from source to destination may be limited to optimum number of objects in the Ue-IoE.In this article,we propose a routing scheme in which the responsibility of route computation(from neighbor objects to destination)is assigned to some IoE-objects in the Ue-IoE.The route computation objects(RCO)are selected on the basis of certain parameters like remaining energy and mobility.The RCO send the routing information of destination objects to their neighbors once they want to communicate with other objects.The proposed protocol is simulated and the results show that it outperform state-of-the-art protocols in terms of average energy consumption,messages overhead,throughput,delay etc.

Quality of Service Aware Cluster Routing in Vehicular Ad Hoc Networks

In vehicular ad hoc networks(VANETs),the topology information(TI)is updated frequently due to vehicle mobility.These frequent changes in topology increase the topology maintenance overhead.To reduce the control message overhead,cluster-based routing schemes are proposed.In clusterbased routing schemes,the nodes are divided into different virtual groups,and each group(logical node)is considered a cluster.The topology changes are accommodated within each cluster,and broadcasting TI to the whole VANET is not required.The cluster head(CH)is responsible for managing the communication of a node with other nodes outside the cluster.However,transmitting real-time data via a CH may cause delays in VANETs.Such real-time data require quick service and should be routed through the shortest path when the quality of service(QoS)is required.This paper proposes a hybrid scheme which transmits time-critical data through the QoS shortest path and normal data through CHs.In this way,the real-time data are delivered efciently to the destination on time.Similarly,the routine data are transmitted through CHs to reduce the topology maintenance overhead.The work is validated through a series of simulations,and results show that the proposed scheme outperforms existing algorithms in terms of topology maintenance overhead,QoS and real-time and routine packet transmission.

Adaptation of Vehicular Ad hoc Network Clustering Protocol for Smart Transportation

Clustering algorithms optimization can minimize topology maintenance overhead in large scale vehicular Ad hoc networks(VANETs)for smart transportation that results from dynamic topology,limited resources and noncentralized architecture.The performance of a clustering algorithm varies with the underlying mobility model to address the topology maintenance overhead issue in VANETs for smart transportation.To design a robust clustering algorithm,careful attention must be paid to components like mobility models and performance objectives.A clustering algorithm may not perform well with every mobility pattern.Therefore,we propose a supervisory protocol(SP)that observes the mobility pattern of vehicles and identies the realistic Mobility model through microscopic features.An analytical model can be used to determine an efcient clustering algorithm for a specic mobility model(MM).SP selects the best clustering scheme according to the mobility model and guarantees a consistent performance throughout VANET operations.The simulation has performed in three parts that is the central part simulation for setting up the clustering environment,In the second part the clustering algorithms are tested for efciency in a constrained atmosphere for some time and the third part represents the proposed scheme.The simulation results show that the proposed scheme outperforms clustering algorithms such as honey bee algorithm-based clustering and memetic clustering in terms of cluster count,re-afliation rate,control overhead and cluster lifetime.