With the flexible deployment and high mobility of Unmanned Aerial Vehicles(UAVs)in an open environment,they have generated con-siderable attention in military and civil applications intending to enable ubiquitous conn...With the flexible deployment and high mobility of Unmanned Aerial Vehicles(UAVs)in an open environment,they have generated con-siderable attention in military and civil applications intending to enable ubiquitous connectivity and foster agile communications.The difficulty stems from features other than mobile ad-hoc network(MANET),namely aerial mobility in three-dimensional space and often changing topology.In the UAV network,a single node serves as a forwarding,transmitting,and receiving node at the same time.Typically,the communication path is multi-hop,and routing significantly affects the network’s performance.A lot of effort should be invested in performance analysis for selecting the optimum routing system.With this motivation,this study modelled a new Coati Optimization Algorithm-based Energy-Efficient Routing Process for Unmanned Aerial Vehicle Communication(COAER-UAVC)technique.The presented COAER-UAVC technique establishes effective routes for communication between the UAVs.It is primarily based on the coati characteristics in nature:if attacking and hunting iguanas and escaping from predators.Besides,the presented COAER-UAVC technique concentrates on the design of fitness functions to minimize energy utilization and communication delay.A varied group of simulations was performed to depict the optimum performance of the COAER-UAVC system.The experimental results verified that the COAER-UAVC technique had assured improved performance over other approaches.展开更多
Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with s...Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.展开更多
Cognitive Radio Networks(CRNs)have become a successful platform in recent years for a diverse range of future systems,in particularly,industrial internet of things(IIoT)applications.In order to provide an efficient co...Cognitive Radio Networks(CRNs)have become a successful platform in recent years for a diverse range of future systems,in particularly,industrial internet of things(IIoT)applications.In order to provide an efficient connection among IIoT devices,CRNs enhance spectrum utilization by using licensed spectrum.However,the routing protocol in these networks is considered one of the main problems due to node mobility and time-variant channel selection.Specifically,the channel selection for routing protocol is indispensable in CRNs to provide an adequate adaptation to the Primary User(PU)activity and create a robust routing path.This study aims to construct a robust routing path by minimizing PU interference and routing delay to maximize throughput within the IIoT domain.Thus,a generic routing framework from a cross-layer perspective is investigated that intends to share the information resources by exploiting a recently proposed method,namely,Channel Availability Probability.Moreover,a novel cross-layer-oriented routing protocol is proposed by using a time-variant channel estimation technique.This protocol combines lower layer(Physical layer and Data Link layer)sensing that is derived from the channel estimation model.Also,it periodically updates and stores the routing table for optimal route decision-making.Moreover,in order to achieve higher throughput and lower delay,a new routing metric is presented.To evaluate the performance of the proposed protocol,network simulations have been conducted and also compared to the widely used routing protocols,as a benchmark.The simulation results of different routing scenarios demonstrate that our proposed solution outperforms the existing protocols in terms of the standard network performance metrics involving packet delivery ratio(with an improved margin of around 5–20%approximately)under varying numbers of PUs and cognitive users in Mobile Cognitive Radio Networks(MCRNs).Moreover,the cross-layer routing protocol successfully achieves high routing performance in finding a robust route,selecting the high channel stability,and reducing the probability of PU interference for continued communication.展开更多
Interconnected devices and intelligent applications have slashed human intervention in the Internet of Things(IoT),making it possible to accomplish tasks with less human interaction.However,it faces many problems,incl...Interconnected devices and intelligent applications have slashed human intervention in the Internet of Things(IoT),making it possible to accomplish tasks with less human interaction.However,it faces many problems,including lower capacity links,energy utilization,enhancement of resources and limited resources due to its openness,heterogeneity,limited resources and extensiveness.It is challenging to route packets in such a constrained environment.In an IoT network constrained by limited resources,minimal routing control overhead is required without packet loss.Such constrained environments can be improved through the optimal routing protocol.It is challenging to route packets in such a constrained environment.Thus,this work is motivated to present an efficient routing protocol for enhancing the lifetime of the IoT network.Lightweight On-demand Ad hoc Distance-vector Routing Protocol—Next Generation(LOADng)protocol is an extended version of the Ad Hoc On-Demand Distance Vector(AODV)protocol.Unlike AODV,LOADng is a lighter version that forbids the intermediate nodes on the route to send a route reply(RREP)for the route request(RREQ),which originated from the source.A resource-constrained IoT network demands minimal routing control overhead and faster packet delivery.So,in this paper,the parameters of the LOADng routing protocol are optimized using the black widow optimization(BWO)algorithm to reduce the control overhead and delay.Furthermore,the performance of the proposed model is analyzed with the default LOADng in terms of delay,delivery ratio and overhead.Obtained results show that the LOADng-BWO protocol outperforms the conventional LOADng protocol.展开更多
Wireless sensor network (WSN) has been widely used due to its vastrange of applications. The energy problem is one of the important problems influencingthe complete application. Sensor nodes use very small batteries a...Wireless sensor network (WSN) has been widely used due to its vastrange of applications. The energy problem is one of the important problems influencingthe complete application. Sensor nodes use very small batteries as a powersource and replacing them is not an easy task. With this restriction, the sensornodes must conserve their energy and extend the network lifetime as long as possible.Also, these limits motivate much of the research to suggest solutions in alllayers of the protocol stack to save energy. So, energy management efficiencybecomes a key requirement in WSN design. The efficiency of these networks ishighly dependent on routing protocols directly affecting the network lifetime.Clustering is one of the most popular techniques preferred in routing operations.In this work we propose a novel energy-efficient protocol for WSN based on a batalgorithm called ECO-BAT (Energy Consumption Optimization with BAT algorithmfor WSN) to prolong the network lifetime. We use an objective function thatgenerates an optimal number of sensor clusters with cluster heads (CH) to minimizeenergy consumption. The performance of the proposed approach is comparedwith Low-Energy Adaptive Clustering Hierarchy (LEACH) and EnergyEfficient cluster formation in wireless sensor networks based on the Multi-Objective Bat algorithm (EEMOB) protocols. The results obtained are interestingin terms of energy-saving and prolongation of the network lifetime.展开更多
In recent years,with the rapid development of the Internet and wireless communication technology,wireless Ad hoc networks have received more attention.Due to the limited transmission range and energy of nodes in Ad ho...In recent years,with the rapid development of the Internet and wireless communication technology,wireless Ad hoc networks have received more attention.Due to the limited transmission range and energy of nodes in Ad hoc networks,it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks.This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol,which has the following two aspects of improvement:(1)In the route discovery process,a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a“Mark”bit that representing remaining energy of a node.(2)Based on(1),a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively.Simulation results demonstrate that compared with AODV and other existing routing protocols,proposed algorithm can reduce network energy consumption and balance node energy,thus extending the network lifetime.展开更多
With the inclusion of satellite Internet as the information infrastructure in China's "new infrastructure" category,relevant domestic industries and scientific research institutes have successively carri...With the inclusion of satellite Internet as the information infrastructure in China's "new infrastructure" category,relevant domestic industries and scientific research institutes have successively carried out the design of broadband low earth orbit(LEO) constellation systems and key technical research.As the core technology for the satellite-to-ground network communications of a broadband LEO constellation system,routing technology is extremely important for the efficient and reliable transmission of various service data.Focusing on the two important broadband LEO constellation systems in China,in-depth analysis and simulation of the high dynamics of the satellite-to-ground satellites are conducted in this paper to obtain more accurate network topology changes and characteristics;then the adaptability of the ground standard IP routing protocol to the broadband LEO constellation system is analyzed,and an LEO constellation simulation scenario is built with the Opnet software.The simulation results of the convergence performance of the standard IP routing protocol are produced.The results show that the IP protocol does not perform well for LEO satellite constellation networks.Based on the studies,some solutions are proposed to take full advantages of the characteristics of LEO satellite systems.These can also provide a reference for the choice of intersatellite routing architecture and protocol technology for broadband LEO constellation in the future development.展开更多
Replacing or recharging batteries in the sensor nodes of a wireless sensor network(WSN)is a significant challenge.Therefore,efficient power utilization by sensors is a critical requirement,and it is closely related to...Replacing or recharging batteries in the sensor nodes of a wireless sensor network(WSN)is a significant challenge.Therefore,efficient power utilization by sensors is a critical requirement,and it is closely related to the life span of the network.Once a sensor node consumes all its energy,it will no longer function properly.Therefore,various protocols have been proposed to minimize the energy consumption of sensors and thus prolong the network operation.Recently,clustering algorithms combined with artificial intelligence have been proposed for this purpose.In particular,various protocols employ the K-means clustering algorithm,which is a machine learning method.The number of clustering configurations required by the K-means clustering algorithm is greater than that required by the hierarchical algorithm.Further,the selection of the cluster heads considers only the residual energy of the nodes without accounting for the transmission distance to the base station.In terms of energy consumption,the residual energy of each node,the transmission distance,the cluster head location,and the central relative position within the cluster should be considered simultaneously.In this paper,we propose the KOCED(K-means with Optimal clustering for WSN considering Centrality,Energy,and Distance)protocol,which considers the residual energy of nodes as well as the distances to the central point of the cluster and the base station.A performance comparison shows that the KOCED protocol outperforms the LEACH protocol by 259%(223 rounds)for first node dead(FND)and 164%(280 rounds)with 80%alive nodes.展开更多
As a special type of mobile ad hoc network(MANET),the flying ad hoc network(FANET)has the potential to enable a variety of emerging applications in both civilian wireless communications(e.g.,5G and 6G)and the defense ...As a special type of mobile ad hoc network(MANET),the flying ad hoc network(FANET)has the potential to enable a variety of emerging applications in both civilian wireless communications(e.g.,5G and 6G)and the defense industry.The routing protocol plays a pivotal role in FANET.However,when designing the routing protocol for FANET,it is conventionally assumed that the aerial nodes move randomly.This is clearly inappropriate for a mission-oriented FANET(MO-FANET),in which the aerial nodes typically move toward a given destination from given departure point(s),possibly along a roughly deterministic flight path while maintaining a well-established formation,in order to carry out certain missions.In this paper,a novel cyber–physical routing protocol exploiting the particular mobility pattern of an MO-FANET is proposed based on cross-disciplinary integration,which makes full use of the missiondetermined trajectory dynamics to construct the time sequence of rejoining and separating,as well as the adjacency matrix for each node,as prior information.Compared with the existing representative routing protocols used in FANETs,our protocol achieves a higher packet-delivery ratio(PDR)at the cost of even lower overhead and lower average end-to-end latency,while maintaining a reasonably moderate and stable network jitter,as demonstrated by extensive ns-3-based simulations assuming realistic configurations in an MO-FANET.展开更多
Wireless Body Area Network(WBAN)technologies are emerging with extensive applications in several domains.Health is a fascinating domain of WBAN for smart monitoring of a patient’s condition.An important factor to con...Wireless Body Area Network(WBAN)technologies are emerging with extensive applications in several domains.Health is a fascinating domain of WBAN for smart monitoring of a patient’s condition.An important factor to consider in WBAN is a node’s lifetime.Improving the lifetime of nodes is critical to address many issues,such as utility and reliability.Existing routing protocols have addressed the energy conservation problem but considered only a few parameters,thus affecting their performance.Moreover,most of the existing schemes did not consider traffic prioritization which is critical in WBANs.In this paper,an adaptive multi-cost routing protocol is proposed with a multi-objective cost function considering minimum distance from sink,temperature of sensor nodes,priority of sensed data,and maximum residual energy on sensor nodes.The performance of the proposed protocol is compared with the existing schemes for the parameters:network lifetime,stability period,throughput,energy consumption,and path loss.It is evident from the obtained results that the proposed protocol improves network lifetime and stability period by 30%and 15%,respectively,as well as outperforms the existing protocols in terms of throughput,energy consumption,and path loss.展开更多
Recently,Opportunistic Networks(OppNets)are considered to be one of the most attractive developments of Mobile Ad Hoc Networks that have arisen thanks to the development of intelligent devices.OppNets are characterize...Recently,Opportunistic Networks(OppNets)are considered to be one of the most attractive developments of Mobile Ad Hoc Networks that have arisen thanks to the development of intelligent devices.OppNets are characterized by a rough and dynamic topology as well as unpredictable contacts and contact times.Data is forwarded and stored in intermediate nodes until the next opportunity occurs.Therefore,achieving a high delivery ratio in OppNets is a challenging issue.It is imperative that any routing protocol use network resources,as far as they are available,in order to achieve higher network performance.In this article,we introduce the Resource-Aware Routing(ReAR)protocol which dynamically controls the buffer usage with the aim of balancing the load in resource-constrained,stateless and non-social OppNets.The ReAR protocol invokes our recently introduced mutual informationbased weighting approach to estimate the impact of the buffer size on the network performance and ultimately to regulate the buffer consumption in real time.The proposed routing protocol is proofed conceptually and simulated using the Opportunistic Network Environment simulator.Experiments show that the ReAR protocol outperforms a set of well-known routing protocols such as EBR,Epidemic MaxProp,energy-aware Spray and Wait and energy-aware PRoPHETin terms of message delivery ratio and overhead ratio.展开更多
Energy conservation is a significant task in the Internet of Things(IoT)because IoT involves highly resource-constrained devices.Clustering is an effective technique for saving energy by reducing duplicate data.In a c...Energy conservation is a significant task in the Internet of Things(IoT)because IoT involves highly resource-constrained devices.Clustering is an effective technique for saving energy by reducing duplicate data.In a clustering protocol,the selection of a cluster head(CH)plays a key role in prolonging the lifetime of a network.However,most cluster-based protocols,including routing protocols for low-power and lossy networks(RPLs),have used fuzzy logic and probabilistic approaches to select the CH node.Consequently,early battery depletion is produced near the sink.To overcome this issue,a lion optimization algorithm(LOA)for selecting CH in RPL is proposed in this study.LOA-RPL comprises three processes:cluster formation,CH selection,and route establishment.A cluster is formed using the Euclidean distance.CH selection is performed using LOA.Route establishment is implemented using residual energy information.An extensive simulation is conducted in the network simulator ns-3 on various parameters,such as network lifetime,power consumption,packet delivery ratio(PDR),and throughput.The performance of LOA-RPL is also compared with those of RPL,fuzzy rule-based energyefficient clustering and immune-inspired routing(FEEC-IIR),and the routing scheme for IoT that uses shuffled frog-leaping optimization algorithm(RISARPL).The performance evaluation metrics used in this study are network lifetime,power consumption,PDR,and throughput.The proposed LOARPL increases network lifetime by 20%and PDR by 5%–10%compared with RPL,FEEC-IIR,and RISA-RPL.LOA-RPL is also highly energy-efficient compared with other similar routing protocols.展开更多
The wireless sensor network(WSN)is a growing sector in the network domain.By implementing it many industries developed smart task for different purposes.Sensor nodes interact with each other and this interaction techn...The wireless sensor network(WSN)is a growing sector in the network domain.By implementing it many industries developed smart task for different purposes.Sensor nodes interact with each other and this interaction technique are handled by different routing protocol.Extending the life of the network in WSN is a challenging issue because energy in sensor nodes are quickly drained.So the overall performance of WSN are degraded by this limitation.To resolve this unreliable low power link,many researches have provided various routing protocols to make the network as dependable and sustainable as possible.While speeding up the data delivery is also considered to be an effective approach to save energy.To achieve this objective,we propose a new energy efficient routing protocol using genetic fuzzy logic system.Our primary objective is to save energy by sending data packets via the shortest path.Numerous studies have proved that the clustering protocol plays an important role in prolonging the life of the sensor node in theWSN.Keeping up with this our second objective is selection of head node from a cluster.This cluster head is selected based on the availability of maximum residual energy among the nodes,lifetime of head-to-head link,and its minimum distance to the base station.The genetic fitness approach is proposed for optimal routing and the selection of cluster head(CH)is employed with fuzzy logic system.As a result,the genetic fuzzy logic system(GFLS)can effectively accelerate the process to solve this problem.MATLAB is used to deploy nodes inWSN.The performance is calculated in terms of efficiency,delay,packet delivery rate and network throughput.The performance is compared with previous pertinent work.The proposed approach has elevated its performance around 8%in packet delivery and 6%in overall network throughput.展开更多
Mobile ad hoc network(MANET)is a dynamically reconfigurable wireless network with time-variable infrastructure.Given that nodes are highly mobile,MANET’s topology often changes.These changes increase the difficulty i...Mobile ad hoc network(MANET)is a dynamically reconfigurable wireless network with time-variable infrastructure.Given that nodes are highly mobile,MANET’s topology often changes.These changes increase the difficulty in finding the routes that the packets use when they are routed.This study proposes an algorithm called genetic algorithm-based location-aided routing(GALAR)to enhance the MANET routing protocol efficiency.The GALAR algorithm maintains an adaptive update of the node location information by adding the transmitting node location information to the routing packet and selecting the transmitting node to carry the packets to their destination.The GALAR was constructed based on a genetic optimization scheme that considers all contributing factors in the delivery behavior using criterion function optimization.Simulation results showed that the GALAR algorithm can make the probability of packet delivery ratio more than 99%with less network overhead.Moreover,GALAR was compared to other algorithms in terms of different network evaluation measures.The GALAR algorithm significantly outperformed the other algorithms that were used in the study.展开更多
Opportunistic Networks(OppNets)is gaining popularity day-by-day due to their various applications in the real-life world.The two major reasons for its popularity are its suitability to be established without any requi...Opportunistic Networks(OppNets)is gaining popularity day-by-day due to their various applications in the real-life world.The two major reasons for its popularity are its suitability to be established without any requirement of additional infrastructure and the ability to tolerate long delays during data communication.Opportunistic Network is also considered as a descendant of Mobile Ad hoc Networks(Manets)and Wireless Sensor Networks(WSNs),therefore,it inherits most of the traits from both mentioned networking techniques.Apart from its popularity,Opportunistic Networks are also starting to face challenges nowadays to comply with the emerging issues of the large size of data to be communicated and blind forwarding of data among participating nodes in the network.These issues lower the overall performance of the network.Keeping this thing in mind,ML-Fresh-a novel framework has been proposed in this paper which focuses to overcome the issue of blind forwarding of data by maintaining an optimum path between any pair of participating nodes available in the OppNet using machine learning techniques viz.pattern prediction,decision tree prediction,adamic-adar method for complex networks.Apart from this,ML-Fresh also uses the history of successful encounters between a pair of communicating nodes for route prediction in the background.Simulation results prove that the ML-Fresh outperforms the existing framework of Opportunistic Networks on the grounds of standard Quality-of-Service(QoS)parameters.展开更多
The single planar routing protocol has a slow convergence rate in the large-scale Wireless Sensor Network(WSN).Although the hierarchical routing protocol can effectively cope with large-scale application scenarios,how...The single planar routing protocol has a slow convergence rate in the large-scale Wireless Sensor Network(WSN).Although the hierarchical routing protocol can effectively cope with large-scale application scenarios,how to elect a secure cluster head and balance the network load becomes an enormous challenge.In this paper,a Trust Management-based and Low Energy Adaptive Clustering Hierarchy protocol(LEACH-TM)is proposed.In LEACH-TM,by using the number of dynamic decision cluster head nodes,residual energy and density of neighbor nodes,the size of the cluster can be better constrained to improve energy efficiency,and avoid excessive energy consumption of a node.Simultaneously,the trust management scheme is introduced into LEACH-TM to defend against internal attacks.The simulation results show that,compared with LEACH-SWDN protocol and LEACH protocol,LEACH-TM outperforms in prolonging the network lifetime and balancing the energy consumption,and can effectively mitigate the influence of malicious nodes on cluster head selection,which can greatiy guarantee the security of the overall network.展开更多
Improving capacity and reducing delay are the most challenging topics in wireless ad hoc networks. Nodes that equip multiple radios working on different channels simultaneously permit ef-fective utility of frequency s...Improving capacity and reducing delay are the most challenging topics in wireless ad hoc networks. Nodes that equip multiple radios working on different channels simultaneously permit ef-fective utility of frequency spectrum and can also reduce interference. In this paper, after analyzing several current protocols in Multi-Radio Multi-Channel (MR-MC) ad hoc networks, a new multi-channel routing metric called Integrative Route Metric (IRM) is designed. It takes channel load, inter-flow, and intra-flow interference into consideration. In addition, an MR-MC routing protocol based on Interference-Aware and Channel-Load (MR-IACL) is also presented. The MR-IACL can assign channels and routings for nodes according to channel load and interference degree of links, and optimize channel distribution dynamically to satisfy the features of topology changing and traffic frequent fluctuation during network running. The simulation results show that the new protocol outperforms others in terms of network throughput, end-to-end delay, routing overhead, and network lifetime.展开更多
The application environments of wireless Ad hoc networks require that it should support Quality of Service (QoS). However, that is very difficult because of the inherent characteristics of the wireless channel and the...The application environments of wireless Ad hoc networks require that it should support Quality of Service (QoS). However, that is very difficult because of the inherent characteristics of the wireless channel and the frequent changes of network topology caused by nodes movement. An Ad hoc QoS Multicasting (AQM) protocol can solve this problem by previously reserving the neighbor nodes for tracking resource availability. By considering QoS restrictions of transport delay, loss ratio, bandwidth requirement, delay jitter, and throughout, and by finding the adaptive routing, the AQM protocol can obviously improve the efficiency of multicastsession. The results of network simulation show that QoS is essentially applicable to Ad hoc networks.展开更多
The inception of Wireless Sensor Networks (WSN) has brought convenience into many lives with uninterrupted wireless network. The nodes that transmit data consist of heterogeneous and battery equipped sensor nodes (SNs...The inception of Wireless Sensor Networks (WSN) has brought convenience into many lives with uninterrupted wireless network. The nodes that transmit data consist of heterogeneous and battery equipped sensor nodes (SNs) that are deployed randomly for network surveillance. To manage the random deployment of nodes, clustering algorithms are used with efficient routing protocols. This results in aggregation and dropping of redundant data packets that enables flawless data transmission from cluster nodes to Base Station (BS) via Cluster Heads (CHs). In this paper, a dynamic and multi-hop clustering and routing protocol for thorough behavior analysis is proposed, taking distance and energy into consideration. This forms a smooth routing path from the cluster nodes, CHs, Sub-CHs to the BS. On comparing proposed process with the existing system, experimental analysis shows a significant enhancement in the performance of network lifetime, with improved data aggregation, throughput, as the protocol showing deterministic behavior while traversing the network for data transmission, we name this protocol as Multi-hop Deterministic energy efficient Routing protocol (MDR).展开更多
The necessary background as well as the details of simulation was presented to simulate and evaluate the performance of the ad hoc on-demand distance vector routing protocol in mobile ad hoc network with the help of t...The necessary background as well as the details of simulation was presented to simulate and evaluate the performance of the ad hoc on-demand distance vector routing protocol in mobile ad hoc network with the help of the network simulator NS2 using the common transmission range to deliver the data packets at the destination node. The number of participating nodes played an important role to predict the conditions for the best performance of the protocol with respect to throughput, delay, packet delivery ratio, drop packets, consumed and residual energy of the network. Further, the efforts can be put to control the transmission range dynamically and overheads for reducing the energy consumption in the network and improving its lifetime of the nodes and the lifespan of the network.展开更多
基金The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through Large Groups Project under grant number(235/44)Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2023R114)+1 种基金Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.The authors would like to thank the Deanship of Scientific Research at Umm Al-Qura University for supporting this work by Grant Code:(22UQU4310373DSR71)This study is supported via funding from Prince Sattam bin Abdulaziz University project number(PSAU/2023/R/1444).
文摘With the flexible deployment and high mobility of Unmanned Aerial Vehicles(UAVs)in an open environment,they have generated con-siderable attention in military and civil applications intending to enable ubiquitous connectivity and foster agile communications.The difficulty stems from features other than mobile ad-hoc network(MANET),namely aerial mobility in three-dimensional space and often changing topology.In the UAV network,a single node serves as a forwarding,transmitting,and receiving node at the same time.Typically,the communication path is multi-hop,and routing significantly affects the network’s performance.A lot of effort should be invested in performance analysis for selecting the optimum routing system.With this motivation,this study modelled a new Coati Optimization Algorithm-based Energy-Efficient Routing Process for Unmanned Aerial Vehicle Communication(COAER-UAVC)technique.The presented COAER-UAVC technique establishes effective routes for communication between the UAVs.It is primarily based on the coati characteristics in nature:if attacking and hunting iguanas and escaping from predators.Besides,the presented COAER-UAVC technique concentrates on the design of fitness functions to minimize energy utilization and communication delay.A varied group of simulations was performed to depict the optimum performance of the COAER-UAVC system.The experimental results verified that the COAER-UAVC technique had assured improved performance over other approaches.
基金This work was supported by the Serbian Ministry of Science and Education(project TR-32022)by companies Telekom Srbija and Informatika.
文摘Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.
文摘Cognitive Radio Networks(CRNs)have become a successful platform in recent years for a diverse range of future systems,in particularly,industrial internet of things(IIoT)applications.In order to provide an efficient connection among IIoT devices,CRNs enhance spectrum utilization by using licensed spectrum.However,the routing protocol in these networks is considered one of the main problems due to node mobility and time-variant channel selection.Specifically,the channel selection for routing protocol is indispensable in CRNs to provide an adequate adaptation to the Primary User(PU)activity and create a robust routing path.This study aims to construct a robust routing path by minimizing PU interference and routing delay to maximize throughput within the IIoT domain.Thus,a generic routing framework from a cross-layer perspective is investigated that intends to share the information resources by exploiting a recently proposed method,namely,Channel Availability Probability.Moreover,a novel cross-layer-oriented routing protocol is proposed by using a time-variant channel estimation technique.This protocol combines lower layer(Physical layer and Data Link layer)sensing that is derived from the channel estimation model.Also,it periodically updates and stores the routing table for optimal route decision-making.Moreover,in order to achieve higher throughput and lower delay,a new routing metric is presented.To evaluate the performance of the proposed protocol,network simulations have been conducted and also compared to the widely used routing protocols,as a benchmark.The simulation results of different routing scenarios demonstrate that our proposed solution outperforms the existing protocols in terms of the standard network performance metrics involving packet delivery ratio(with an improved margin of around 5–20%approximately)under varying numbers of PUs and cognitive users in Mobile Cognitive Radio Networks(MCRNs).Moreover,the cross-layer routing protocol successfully achieves high routing performance in finding a robust route,selecting the high channel stability,and reducing the probability of PU interference for continued communication.
文摘Interconnected devices and intelligent applications have slashed human intervention in the Internet of Things(IoT),making it possible to accomplish tasks with less human interaction.However,it faces many problems,including lower capacity links,energy utilization,enhancement of resources and limited resources due to its openness,heterogeneity,limited resources and extensiveness.It is challenging to route packets in such a constrained environment.In an IoT network constrained by limited resources,minimal routing control overhead is required without packet loss.Such constrained environments can be improved through the optimal routing protocol.It is challenging to route packets in such a constrained environment.Thus,this work is motivated to present an efficient routing protocol for enhancing the lifetime of the IoT network.Lightweight On-demand Ad hoc Distance-vector Routing Protocol—Next Generation(LOADng)protocol is an extended version of the Ad Hoc On-Demand Distance Vector(AODV)protocol.Unlike AODV,LOADng is a lighter version that forbids the intermediate nodes on the route to send a route reply(RREP)for the route request(RREQ),which originated from the source.A resource-constrained IoT network demands minimal routing control overhead and faster packet delivery.So,in this paper,the parameters of the LOADng routing protocol are optimized using the black widow optimization(BWO)algorithm to reduce the control overhead and delay.Furthermore,the performance of the proposed model is analyzed with the default LOADng in terms of delay,delivery ratio and overhead.Obtained results show that the LOADng-BWO protocol outperforms the conventional LOADng protocol.
文摘Wireless sensor network (WSN) has been widely used due to its vastrange of applications. The energy problem is one of the important problems influencingthe complete application. Sensor nodes use very small batteries as a powersource and replacing them is not an easy task. With this restriction, the sensornodes must conserve their energy and extend the network lifetime as long as possible.Also, these limits motivate much of the research to suggest solutions in alllayers of the protocol stack to save energy. So, energy management efficiencybecomes a key requirement in WSN design. The efficiency of these networks ishighly dependent on routing protocols directly affecting the network lifetime.Clustering is one of the most popular techniques preferred in routing operations.In this work we propose a novel energy-efficient protocol for WSN based on a batalgorithm called ECO-BAT (Energy Consumption Optimization with BAT algorithmfor WSN) to prolong the network lifetime. We use an objective function thatgenerates an optimal number of sensor clusters with cluster heads (CH) to minimizeenergy consumption. The performance of the proposed approach is comparedwith Low-Energy Adaptive Clustering Hierarchy (LEACH) and EnergyEfficient cluster formation in wireless sensor networks based on the Multi-Objective Bat algorithm (EEMOB) protocols. The results obtained are interestingin terms of energy-saving and prolongation of the network lifetime.
基金This Paper is supported by the National Natural Science Foundation of China(Grants Nos.61761035,41761086,61461037,61661041).
文摘In recent years,with the rapid development of the Internet and wireless communication technology,wireless Ad hoc networks have received more attention.Due to the limited transmission range and energy of nodes in Ad hoc networks,it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks.This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol,which has the following two aspects of improvement:(1)In the route discovery process,a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a“Mark”bit that representing remaining energy of a node.(2)Based on(1),a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively.Simulation results demonstrate that compared with AODV and other existing routing protocols,proposed algorithm can reduce network energy consumption and balance node energy,thus extending the network lifetime.
文摘With the inclusion of satellite Internet as the information infrastructure in China's "new infrastructure" category,relevant domestic industries and scientific research institutes have successively carried out the design of broadband low earth orbit(LEO) constellation systems and key technical research.As the core technology for the satellite-to-ground network communications of a broadband LEO constellation system,routing technology is extremely important for the efficient and reliable transmission of various service data.Focusing on the two important broadband LEO constellation systems in China,in-depth analysis and simulation of the high dynamics of the satellite-to-ground satellites are conducted in this paper to obtain more accurate network topology changes and characteristics;then the adaptability of the ground standard IP routing protocol to the broadband LEO constellation system is analyzed,and an LEO constellation simulation scenario is built with the Opnet software.The simulation results of the convergence performance of the standard IP routing protocol are produced.The results show that the IP protocol does not perform well for LEO satellite constellation networks.Based on the studies,some solutions are proposed to take full advantages of the characteristics of LEO satellite systems.These can also provide a reference for the choice of intersatellite routing architecture and protocol technology for broadband LEO constellation in the future development.
文摘Replacing or recharging batteries in the sensor nodes of a wireless sensor network(WSN)is a significant challenge.Therefore,efficient power utilization by sensors is a critical requirement,and it is closely related to the life span of the network.Once a sensor node consumes all its energy,it will no longer function properly.Therefore,various protocols have been proposed to minimize the energy consumption of sensors and thus prolong the network operation.Recently,clustering algorithms combined with artificial intelligence have been proposed for this purpose.In particular,various protocols employ the K-means clustering algorithm,which is a machine learning method.The number of clustering configurations required by the K-means clustering algorithm is greater than that required by the hierarchical algorithm.Further,the selection of the cluster heads considers only the residual energy of the nodes without accounting for the transmission distance to the base station.In terms of energy consumption,the residual energy of each node,the transmission distance,the cluster head location,and the central relative position within the cluster should be considered simultaneously.In this paper,we propose the KOCED(K-means with Optimal clustering for WSN considering Centrality,Energy,and Distance)protocol,which considers the residual energy of nodes as well as the distances to the central point of the cluster and the base station.A performance comparison shows that the KOCED protocol outperforms the LEACH protocol by 259%(223 rounds)for first node dead(FND)and 164%(280 rounds)with 80%alive nodes.
基金This work is financially supported by the Beijing Municipal Natural Science Foundation(L202012)the Open Research Project of the State Key Laboratory of Media Convergence and Communication,Communication University of China(SKLMCC2020KF008)the Fundamental Research Funds for the Central Universities(2020RC05).The authors would like to thank Professor Ping Zhang(Member of the Chinese Academy of Engineering,Beijing University of Posts and Telecommunications)and Professor Quan Yu(Member of the Chinese Academy of Engineering,Peng Cheng Laboratory)for their insightful comments and suggestions.
文摘As a special type of mobile ad hoc network(MANET),the flying ad hoc network(FANET)has the potential to enable a variety of emerging applications in both civilian wireless communications(e.g.,5G and 6G)and the defense industry.The routing protocol plays a pivotal role in FANET.However,when designing the routing protocol for FANET,it is conventionally assumed that the aerial nodes move randomly.This is clearly inappropriate for a mission-oriented FANET(MO-FANET),in which the aerial nodes typically move toward a given destination from given departure point(s),possibly along a roughly deterministic flight path while maintaining a well-established formation,in order to carry out certain missions.In this paper,a novel cyber–physical routing protocol exploiting the particular mobility pattern of an MO-FANET is proposed based on cross-disciplinary integration,which makes full use of the missiondetermined trajectory dynamics to construct the time sequence of rejoining and separating,as well as the adjacency matrix for each node,as prior information.Compared with the existing representative routing protocols used in FANETs,our protocol achieves a higher packet-delivery ratio(PDR)at the cost of even lower overhead and lower average end-to-end latency,while maintaining a reasonably moderate and stable network jitter,as demonstrated by extensive ns-3-based simulations assuming realistic configurations in an MO-FANET.
文摘Wireless Body Area Network(WBAN)technologies are emerging with extensive applications in several domains.Health is a fascinating domain of WBAN for smart monitoring of a patient’s condition.An important factor to consider in WBAN is a node’s lifetime.Improving the lifetime of nodes is critical to address many issues,such as utility and reliability.Existing routing protocols have addressed the energy conservation problem but considered only a few parameters,thus affecting their performance.Moreover,most of the existing schemes did not consider traffic prioritization which is critical in WBANs.In this paper,an adaptive multi-cost routing protocol is proposed with a multi-objective cost function considering minimum distance from sink,temperature of sensor nodes,priority of sensed data,and maximum residual energy on sensor nodes.The performance of the proposed protocol is compared with the existing schemes for the parameters:network lifetime,stability period,throughput,energy consumption,and path loss.It is evident from the obtained results that the proposed protocol improves network lifetime and stability period by 30%and 15%,respectively,as well as outperforms the existing protocols in terms of throughput,energy consumption,and path loss.
文摘Recently,Opportunistic Networks(OppNets)are considered to be one of the most attractive developments of Mobile Ad Hoc Networks that have arisen thanks to the development of intelligent devices.OppNets are characterized by a rough and dynamic topology as well as unpredictable contacts and contact times.Data is forwarded and stored in intermediate nodes until the next opportunity occurs.Therefore,achieving a high delivery ratio in OppNets is a challenging issue.It is imperative that any routing protocol use network resources,as far as they are available,in order to achieve higher network performance.In this article,we introduce the Resource-Aware Routing(ReAR)protocol which dynamically controls the buffer usage with the aim of balancing the load in resource-constrained,stateless and non-social OppNets.The ReAR protocol invokes our recently introduced mutual informationbased weighting approach to estimate the impact of the buffer size on the network performance and ultimately to regulate the buffer consumption in real time.The proposed routing protocol is proofed conceptually and simulated using the Opportunistic Network Environment simulator.Experiments show that the ReAR protocol outperforms a set of well-known routing protocols such as EBR,Epidemic MaxProp,energy-aware Spray and Wait and energy-aware PRoPHETin terms of message delivery ratio and overhead ratio.
基金This research was supported by X-mind Corps program of National Research Foundation of Korea(NRF)funded by the Ministry of Science,ICT(No.2019H1D8A1105622)the Soonchunhyang University Research Fund.
文摘Energy conservation is a significant task in the Internet of Things(IoT)because IoT involves highly resource-constrained devices.Clustering is an effective technique for saving energy by reducing duplicate data.In a clustering protocol,the selection of a cluster head(CH)plays a key role in prolonging the lifetime of a network.However,most cluster-based protocols,including routing protocols for low-power and lossy networks(RPLs),have used fuzzy logic and probabilistic approaches to select the CH node.Consequently,early battery depletion is produced near the sink.To overcome this issue,a lion optimization algorithm(LOA)for selecting CH in RPL is proposed in this study.LOA-RPL comprises three processes:cluster formation,CH selection,and route establishment.A cluster is formed using the Euclidean distance.CH selection is performed using LOA.Route establishment is implemented using residual energy information.An extensive simulation is conducted in the network simulator ns-3 on various parameters,such as network lifetime,power consumption,packet delivery ratio(PDR),and throughput.The performance of LOA-RPL is also compared with those of RPL,fuzzy rule-based energyefficient clustering and immune-inspired routing(FEEC-IIR),and the routing scheme for IoT that uses shuffled frog-leaping optimization algorithm(RISARPL).The performance evaluation metrics used in this study are network lifetime,power consumption,PDR,and throughput.The proposed LOARPL increases network lifetime by 20%and PDR by 5%–10%compared with RPL,FEEC-IIR,and RISA-RPL.LOA-RPL is also highly energy-efficient compared with other similar routing protocols.
文摘The wireless sensor network(WSN)is a growing sector in the network domain.By implementing it many industries developed smart task for different purposes.Sensor nodes interact with each other and this interaction technique are handled by different routing protocol.Extending the life of the network in WSN is a challenging issue because energy in sensor nodes are quickly drained.So the overall performance of WSN are degraded by this limitation.To resolve this unreliable low power link,many researches have provided various routing protocols to make the network as dependable and sustainable as possible.While speeding up the data delivery is also considered to be an effective approach to save energy.To achieve this objective,we propose a new energy efficient routing protocol using genetic fuzzy logic system.Our primary objective is to save energy by sending data packets via the shortest path.Numerous studies have proved that the clustering protocol plays an important role in prolonging the life of the sensor node in theWSN.Keeping up with this our second objective is selection of head node from a cluster.This cluster head is selected based on the availability of maximum residual energy among the nodes,lifetime of head-to-head link,and its minimum distance to the base station.The genetic fitness approach is proposed for optimal routing and the selection of cluster head(CH)is employed with fuzzy logic system.As a result,the genetic fuzzy logic system(GFLS)can effectively accelerate the process to solve this problem.MATLAB is used to deploy nodes inWSN.The performance is calculated in terms of efficiency,delay,packet delivery rate and network throughput.The performance is compared with previous pertinent work.The proposed approach has elevated its performance around 8%in packet delivery and 6%in overall network throughput.
基金funded by the Deanship of Scientific Research at Princess Nourah bint Abdulrahman University through the Fast-track Research Funding Program.
文摘Mobile ad hoc network(MANET)is a dynamically reconfigurable wireless network with time-variable infrastructure.Given that nodes are highly mobile,MANET’s topology often changes.These changes increase the difficulty in finding the routes that the packets use when they are routed.This study proposes an algorithm called genetic algorithm-based location-aided routing(GALAR)to enhance the MANET routing protocol efficiency.The GALAR algorithm maintains an adaptive update of the node location information by adding the transmitting node location information to the routing packet and selecting the transmitting node to carry the packets to their destination.The GALAR was constructed based on a genetic optimization scheme that considers all contributing factors in the delivery behavior using criterion function optimization.Simulation results showed that the GALAR algorithm can make the probability of packet delivery ratio more than 99%with less network overhead.Moreover,GALAR was compared to other algorithms in terms of different network evaluation measures.The GALAR algorithm significantly outperformed the other algorithms that were used in the study.
文摘Opportunistic Networks(OppNets)is gaining popularity day-by-day due to their various applications in the real-life world.The two major reasons for its popularity are its suitability to be established without any requirement of additional infrastructure and the ability to tolerate long delays during data communication.Opportunistic Network is also considered as a descendant of Mobile Ad hoc Networks(Manets)and Wireless Sensor Networks(WSNs),therefore,it inherits most of the traits from both mentioned networking techniques.Apart from its popularity,Opportunistic Networks are also starting to face challenges nowadays to comply with the emerging issues of the large size of data to be communicated and blind forwarding of data among participating nodes in the network.These issues lower the overall performance of the network.Keeping this thing in mind,ML-Fresh-a novel framework has been proposed in this paper which focuses to overcome the issue of blind forwarding of data by maintaining an optimum path between any pair of participating nodes available in the OppNet using machine learning techniques viz.pattern prediction,decision tree prediction,adamic-adar method for complex networks.Apart from this,ML-Fresh also uses the history of successful encounters between a pair of communicating nodes for route prediction in the background.Simulation results prove that the ML-Fresh outperforms the existing framework of Opportunistic Networks on the grounds of standard Quality-of-Service(QoS)parameters.
基金supported by the National Natural Science Foundation of China(Grant No.61571303,No.61571004)the Shanghai Natural Science Foundation(Grant No.21ZR1461700)+3 种基金the Shanghai Sailing Program(Grant No.19YF1455800)the National Science and Technology Major Project of China(No.2018ZX03001031)the Fundamental Research Funds for State Key Laboratory of Synthetical Automation for Process Industries(Grant No.PAL-N201703)the National Key Research and Development Program of China-Internet of Things and Smart City Key Program(No.2019YFB2101600,NO.2019YFB2101602,No.2019YFB2101602-03).
文摘The single planar routing protocol has a slow convergence rate in the large-scale Wireless Sensor Network(WSN).Although the hierarchical routing protocol can effectively cope with large-scale application scenarios,how to elect a secure cluster head and balance the network load becomes an enormous challenge.In this paper,a Trust Management-based and Low Energy Adaptive Clustering Hierarchy protocol(LEACH-TM)is proposed.In LEACH-TM,by using the number of dynamic decision cluster head nodes,residual energy and density of neighbor nodes,the size of the cluster can be better constrained to improve energy efficiency,and avoid excessive energy consumption of a node.Simultaneously,the trust management scheme is introduced into LEACH-TM to defend against internal attacks.The simulation results show that,compared with LEACH-SWDN protocol and LEACH protocol,LEACH-TM outperforms in prolonging the network lifetime and balancing the energy consumption,and can effectively mitigate the influence of malicious nodes on cluster head selection,which can greatiy guarantee the security of the overall network.
基金Supported by the National Natural Science Foundation of China (No. 60873195, No. 61070220)the Research Fund for the Doctoral Program of Higher Education of China (No. 20090111110002)
文摘Improving capacity and reducing delay are the most challenging topics in wireless ad hoc networks. Nodes that equip multiple radios working on different channels simultaneously permit ef-fective utility of frequency spectrum and can also reduce interference. In this paper, after analyzing several current protocols in Multi-Radio Multi-Channel (MR-MC) ad hoc networks, a new multi-channel routing metric called Integrative Route Metric (IRM) is designed. It takes channel load, inter-flow, and intra-flow interference into consideration. In addition, an MR-MC routing protocol based on Interference-Aware and Channel-Load (MR-IACL) is also presented. The MR-IACL can assign channels and routings for nodes according to channel load and interference degree of links, and optimize channel distribution dynamically to satisfy the features of topology changing and traffic frequent fluctuation during network running. The simulation results show that the new protocol outperforms others in terms of network throughput, end-to-end delay, routing overhead, and network lifetime.
文摘The application environments of wireless Ad hoc networks require that it should support Quality of Service (QoS). However, that is very difficult because of the inherent characteristics of the wireless channel and the frequent changes of network topology caused by nodes movement. An Ad hoc QoS Multicasting (AQM) protocol can solve this problem by previously reserving the neighbor nodes for tracking resource availability. By considering QoS restrictions of transport delay, loss ratio, bandwidth requirement, delay jitter, and throughout, and by finding the adaptive routing, the AQM protocol can obviously improve the efficiency of multicastsession. The results of network simulation show that QoS is essentially applicable to Ad hoc networks.
文摘The inception of Wireless Sensor Networks (WSN) has brought convenience into many lives with uninterrupted wireless network. The nodes that transmit data consist of heterogeneous and battery equipped sensor nodes (SNs) that are deployed randomly for network surveillance. To manage the random deployment of nodes, clustering algorithms are used with efficient routing protocols. This results in aggregation and dropping of redundant data packets that enables flawless data transmission from cluster nodes to Base Station (BS) via Cluster Heads (CHs). In this paper, a dynamic and multi-hop clustering and routing protocol for thorough behavior analysis is proposed, taking distance and energy into consideration. This forms a smooth routing path from the cluster nodes, CHs, Sub-CHs to the BS. On comparing proposed process with the existing system, experimental analysis shows a significant enhancement in the performance of network lifetime, with improved data aggregation, throughput, as the protocol showing deterministic behavior while traversing the network for data transmission, we name this protocol as Multi-hop Deterministic energy efficient Routing protocol (MDR).
文摘The necessary background as well as the details of simulation was presented to simulate and evaluate the performance of the ad hoc on-demand distance vector routing protocol in mobile ad hoc network with the help of the network simulator NS2 using the common transmission range to deliver the data packets at the destination node. The number of participating nodes played an important role to predict the conditions for the best performance of the protocol with respect to throughput, delay, packet delivery ratio, drop packets, consumed and residual energy of the network. Further, the efforts can be put to control the transmission range dynamically and overheads for reducing the energy consumption in the network and improving its lifetime of the nodes and the lifespan of the network.