DDeeaarr EEddiittoorr,,The encoding and retrieval of emotional memories demands intricate interplay within the limbic network,where the network state is subject to significant reconfiguration by learning-induced plast...DDeeaarr EEddiittoorr,,The encoding and retrieval of emotional memories demands intricate interplay within the limbic network,where the network state is subject to significant reconfiguration by learning-induced plasticity,behavioral state,and contextual information[1].展开更多
With the rapid development of air transportation, network service ability has attracted a lot of attention in academe. Aiming to improve the throughput of the air route network （ARN）, we propose an effective local d...With the rapid development of air transportation, network service ability has attracted a lot of attention in academe. Aiming to improve the throughput of the air route network （ARN）, we propose an effective local dynamic routing strategy in this paper. Several factors, such as the rout- ing distance, the geographical distance and the real-time local traffic, are taken into consideration. When the ARN is in the normal free-flow state, the proposed strategy can recover the shortest path routing （SPR） strategy. When the ARN undergoes congestion, the proposed strategy changes the paths of flights based on the real-time local traffic information. The throughput of the Chinese air route network （CARN） is evaluated. Results confirm that the proposed strategy can significantly improve the throughput of CARN. Meanwhile, the increase in the average flying distance and time is tiny. Results also indicate the importance of the distance related factors in a routing strategy designed for the ARN.展开更多
Malaria is a severe epidemic disease caused by Plasmodium falciparum.The parasite causes critical illness if persisted for longer durations and delay in precise treatment can lead to further complications.The automati...Malaria is a severe epidemic disease caused by Plasmodium falciparum.The parasite causes critical illness if persisted for longer durations and delay in precise treatment can lead to further complications.The automatic diagnostic model provides aid for medical practitioners to avail a fast and efficient diagnosis.Most of the existing work either utilizes a fully connected convolution neural network with successive pooling layers which causes loss of information in pixels.Further,convolutions can capture spatial invariances but,cannot capture rotational invariances.Hence to overcome these limitations,this research,develops an Imperative Dynamic routing mechanism with fully trained capsule networks for malaria classification.This model identifies the presence of malaria parasites by classifying thin blood smears containing samples of parasitized and healthy erythrocytes.The proposed model is compared and evaluated with novel machine vision models evolved over a decade such as VGG,ResNet,DenseNet,MobileNet.The problems in previous research are cautiously addressed and overhauled using the proposed capsule network by attaining the highest Area under the curve(AUC)and Specificity of 99.03%and 99.43%respectively for 20%test samples.To understand the underlying behavior of the proposed network various tests are conducted for variant shuffle patterns.The model is analyzed and assessed in distinct environments to depict its resilience and versatility.To provide greater generalization,the proposed network has been tested on thick blood smear images which surpassed with greater performance.展开更多
The purpose of this research is to create a simulated environment for teaching algorithms,big data processing,and machine learning.The environment is similar to Google Maps,with the capacity of finding the fastest pat...The purpose of this research is to create a simulated environment for teaching algorithms,big data processing,and machine learning.The environment is similar to Google Maps,with the capacity of finding the fastest path between two points in dynamic traffic situations.However,the system is significantly simplified for educational purposes.Students can choose different traffic patterns and program a car to navigate through the traffic dynamically based on the changing traffic.The environments used in the project are Visual IoT/Robotics Programming Language Environment(VIPLE)and a traffic simulator developed in the Unity game engine.This paper focuses on creating realistic traffic data for the traffic simulator and implementing dynamic routing algorithms in VIPLE.The traffic data are generated from the recorded real traffic data published on the Arizona Maricopa County website.Based on the generated traffic data,VIPLE programs are developed to implement the traffic simulation with support for dynamic changing data.展开更多
In the current era,anyone can freely access the Internet thanks to the development of information and communication technology.The cloud is attracting attention due to its ability to meet continuous user demands for r...In the current era,anyone can freely access the Internet thanks to the development of information and communication technology.The cloud is attracting attention due to its ability to meet continuous user demands for resources.Additionally,Cloud is effective for systems with large data flow such as the Internet of Things(IoT)systems and Smart Cities.Nonetheless,the use of traditional networking technology in the cloud causes network traffic overload and network security problems.Therefore,the cloud requires efficient networking technology to solve the existing challenges.In this paper,we propose one-time password-based software-defined cloud architecture for secure dynamic routing to mitigating the above-mention issues.The proposed cloud architecture provides a secure data path through dynamic routing using One-Time Internet Protocol(OTIP)algorithm between each layer.On the network side,we use software-defined technology to provide efficient network management and data security.We introduce a software-defined cloud architecture that applies OTIP algorithms for secure dynamic routing.We conduct a comparative analysis between general IP communication and proposed OTIP communication architecture.It evaluates the performance of OTIP algorithms.Finally,we examine the proposed software-defined cloud architecture,including how to apply OTIP in secure dynamic routing according to the results of the comparative analysis.展开更多
Time and space complexity is themost critical problemof the current routing optimization algorithms for Software Defined Networking(SDN).To overcome this complexity,researchers use meta-heuristic techniques inside the...Time and space complexity is themost critical problemof the current routing optimization algorithms for Software Defined Networking(SDN).To overcome this complexity,researchers use meta-heuristic techniques inside the routing optimization algorithms in the OpenFlow(OF)based large scale SDNs.This paper proposes a hybrid meta-heuristic algorithm to optimize the dynamic routing problem for the large scale SDNs.Due to the dynamic nature of SDNs,the proposed algorithm uses amutation operator to overcome the memory-based problem of the ant colony algorithm.Besides,it uses the box-covering method and the k-means clustering method to divide the SDN network to overcome the problemof time and space complexity.The results of the proposed algorithm compared with the results of other similar algorithms and it shows that the proposed algorithm can handle the dynamic network changing,reduce the network congestion,the delay and running times and the packet loss rates.展开更多
In order to overcome the adverse effects of Doppler wavelength shift on data transmission in the optical satellite networks,a dynamic routing and wavelength assignment algorithm based on crosslayer design( CL-DRWA) is...In order to overcome the adverse effects of Doppler wavelength shift on data transmission in the optical satellite networks,a dynamic routing and wavelength assignment algorithm based on crosslayer design( CL-DRWA) is introduced which can improve robustness of the network. Above all,a cross-layer optimization model is designed,which considers transmission delay and wavelength-continuity constraint,as well as Doppler wavelength shift. Then CL-DRWA is applied to solve this model,resulting in finding an optimal light path satisfying the above constraints for every connection request. In CL-DRWA,Bellman-Ford method is used to find an optimal route and a distributed relative capacity loss method is implemented to get an optimal wavelength assignment result on the optimal route. Moreover,compared with the dynamic routing and wavelength assignment algorithm based on minimum delay strategy( MD-DRWA),CL-DRWA can make an improvement of 5. 3% on the communication success probability. Meanwhile,CL-DRWA can meet the requirement of transmission delay for real-time services.展开更多
The challenge of keeping and getting new customers drives the development of new practices to meet the consumption needs of increasingly tends to micro-segmentation of product and consumer market. The new consumption ...The challenge of keeping and getting new customers drives the development of new practices to meet the consumption needs of increasingly tends to micro-segmentation of product and consumer market. The new consumption habits of brazilians brought new prospects for market. The objective of this paper is to develop of a dynamic vehicle routing system supported by the behavior of urban traffic in the city ofSao Paulo using Neuro Fuzzy Network. The methodology of this paper consists in the capture of relevant events that interfere with the flow of traffic of the city of Sao Paulo and implementation of a Fuzzy Neural Network trained with these events in order to foresee the traffic behavior. The system offers three labels of hierarchical routing, thus is possible to consider not only the basic factors of routing, but too external factors that directly influence on the flow of traffic and the disruption which may be avoided in large cities, through alternative routes （dynamic vehicle routing）. Predicting the behavior of traffic represents the strategic level routing, dynamic vehicle routing is the tactical level, and routing algorithms to the operational level. This paper will not be discussed the operational level.展开更多
In this paper,we study atomic dynamic routing games with multiple destinations.We first show that if the first-in–first-out(FIFO)principle is always fulfilled locally to regulate the congestion,then most probably we ...In this paper,we study atomic dynamic routing games with multiple destinations.We first show that if the first-in–first-out(FIFO)principle is always fulfilled locally to regulate the congestion,then most probably we cannot guarantee the existence of any reasonable approximate Nash equilibrium.By partly discarding the FIFO principle and introducing destination priorities in the regulation rules,we propose a new atomic routing model.In each such game,we prove that a pure strategy Nash equilibrium always exists and can be computed in polynomial time.In addition,the multicommodity routing game can be iteratively decomposed into a series of well-behaved single-destination routing games,which will provide a good characterization of all NEs of the original game.展开更多
Reliable and efficient communication is essential for Unmanned Aerial Vehicle(UAV)networks,especially in dynamic and resource-constrained environments such as disaster management,surveillance,and environmental monitor...Reliable and efficient communication is essential for Unmanned Aerial Vehicle(UAV)networks,especially in dynamic and resource-constrained environments such as disaster management,surveillance,and environmental monitoring.Frequent topology changes,high mobility,and limited energy availability pose significant challenges to maintaining stable and high-performance routing.Traditional routing protocols,such as Ad hoc On-Demand Distance Vector(AODV),Load-Balanced Optimized Predictive Ad hoc Routing(LB-OPAR),and Destination-Sequenced Distance Vector(DSDV),often experience performance degradation under such conditions.To address these limitations,this study evaluates the effectiveness of Dynamic Adaptive Routing(DAR),a protocol designed to adapt routing decisions in real time based on network dynamics and resource constraints.The research utilizes the Network Simulator 3(NS-3)platform to conduct controlled simulations,measuring key performance indicators such as latency,Packet Delivery Ratio(PDR),energy consumption,and throughput.Comparative analysis reveals that DAR consistently outperforms conventional protocols,achieving a 20%-30% reduction in latency,a 25% decrease in energy consumption,and marked improvements in throughput and PDR.These results highlight DAR’s ability to maintain high communication reliability while optimizing resource usage in challenging operational scenarios.By providing empirical evidence of DAR’s advantages in highly dynamic UAV network environments,this study contributes to advancing adaptive routing strategies.The findings not only validate DAR’s robustness and scalability but also lay the groundwork for integrating artificial intelligence-driven decision-making and real-world UAV deployment.Future work will explore cross-layer optimization,multi-UAV coordination,and experimental validation in field trials,aiming to further enhance communication resilience and energy efficiency in next-generation aerial networks.展开更多
The real-time path optimization for heterogeneous vehicle fleets in large-scale road networks presents significant challenges due to conflicting traffic demands and imbalanced resource allocation.While existing vehicl...The real-time path optimization for heterogeneous vehicle fleets in large-scale road networks presents significant challenges due to conflicting traffic demands and imbalanced resource allocation.While existing vehicleto-infrastructure coordination frameworks partially address congestion mitigation,they often neglect priority-aware optimization and exhibit algorithmic bias toward dominant vehicle classes—critical limitations in mixed-priority scenarios involving emergency vehicles.To bridge this gap,this study proposes a preference game-theoretic coordination framework with adaptive strategy transfer protocol,explicitly balancing system-wide efficiency(measured by network throughput)with priority vehicle rights protection(quantified via time-sensitive utility functions).The approach innovatively combines(1)a multi-vehicle dynamic routing model with quantifiable preference weights,and(2)a distributed Nash equilibrium solver updated using replicator sub-dynamic models.The framework was evaluated on an urban road network containing 25 intersections with mixed priority ratios(10%–30%of vehicles with priority access demand),and the framework showed consistent benefits on four benchmarks(Social routing algorithm,Shortest path algorithm,The comprehensive path optimisation model,The emergency vehicle timing collaborative evolution path optimization method)showed consistent benefits.Results showthat across different traffic demand configurations,the proposed method reduces the average vehicle traveling time by at least 365 s,increases the road network throughput by 48.61%,and effectively balances the road loads.This approach successfully meets the diverse traffic demands of various vehicle types while optimizing road resource allocations.The proposed coordination paradigm advances theoretical foundations for fairness-aware traffic optimization while offering implementable strategies for next-generation cooperative vehicle-road systems,particularly in smart city deployments requiring mixed-priority mobility guarantees.展开更多
To improve the efficiency of ship traffic in frequently traded sea areas and respond to the national“dual-carbon”strategy,a multi-objective ship route induction model is proposed.Considering the energy-saving and en...To improve the efficiency of ship traffic in frequently traded sea areas and respond to the national“dual-carbon”strategy,a multi-objective ship route induction model is proposed.Considering the energy-saving and environmental issues of ships,this study aims to improve the transportation efficiency of ships by providing a ship route induction method.Ship data from a certain bay during a defined period are collected,and an improved backpropagation neural network algorithm is used to forecast ship traffic.On the basis of the forecasted data and ship route induction objectives,dynamic programming of ship routes is performed.Experimental results show that the routes planned using this induction method reduce the combined cost by 17.55%compared with statically induced routes.This method has promising engineering applications in improving ship navigation efficiency,promoting energy conservation,and reducing emissions.展开更多
A state-dependent routing algorithm based on the neural network model, which takes advantage of other dynamic routing algorithm for circuit-switched network, is given in [1]. But, the Algorithm in [1] is a centralized...A state-dependent routing algorithm based on the neural network model, which takes advantage of other dynamic routing algorithm for circuit-switched network, is given in [1]. But, the Algorithm in [1] is a centralized control model with complex O (N 7), therefore, is difficult to realize by hardware. A simplified algorithm is put forward in this paper, in which routing can be controlled decentralizedly, and its complexity is reduced to O (10N 3). Computer simulations are made in a fully connected test network with eight nodes. The results show that the centralized control model has very effective performance that can match RTNR, and the centralized control model is not as good as the centralized one but better than DAR-1.展开更多
Efficiency in solving the Saint-Venant equations for watershed rainfall-runoff routing is important in flood hydrology. This paper presents a high-efficiency numerical solution of one-dimensional dynamic wave equation...Efficiency in solving the Saint-Venant equations for watershed rainfall-runoff routing is important in flood hydrology. This paper presents a high-efficiency numerical solution of one-dimensional dynamic wave equations(HEDWE) for watershed rainfall-runoff routing, in which the full momentum equation is written as a quadratic equation with only one unknown variable Q, water depth is derived from the continuity equation using the two-step predictorcorrector method, and the discrete scheme is the explicit upwind scheme. The results of numerical tests showed the HEDWE approach has several major advantages. 1) It is a stable numerical method, even for an initially dry area. 2) Its computational efficiency is higher than 4.76E+05 times/s. 3) It can be used for overland flow, river flow, and combinations thereof. The primary disadvantages of the HEDWE approach are its unsuitability for rapidly varying flow, such as dam-break floods.展开更多
The high-speed movement of satellites makes it not feasible to directly apply the mature routing scheme on the ground to the satellite network.DT-DVTR in the snapshot-based connectionoriented routing strategy is one o...The high-speed movement of satellites makes it not feasible to directly apply the mature routing scheme on the ground to the satellite network.DT-DVTR in the snapshot-based connectionoriented routing strategy is one of the representative solutions,but it still has room for improvement in terms of routing stability.In this paper,we propose an improved scheme for connection-oriented routing strategy named the Minimal Topology Change Routing based on Collaborative Rules(MTCR-CR).The MTCR-CR uses continuous time static topology snapshots based on satellite status to search for intersatellite link(ISL)construction solutions that meet the minimum number of topology changes to avoid route oscillations.The simulation results in Beidou-3 show that compared with DT-DVTR,MTCR-CR reduces the number of routing changes by about 92%,the number of path changes caused by routing changes is about38%,and the rerouting time is reduced by approximately 47%.At the same time,in order to show our algorithm more comprehensively,the same experimental index test was also carried out on the Globalstar satellite constellation.展开更多
The dynamic routing mechanism in evolvable networks enables adaptive reconfiguration of topol-ogical structures and transmission pathways based on real-time task requirements and data character-istics.However,the heig...The dynamic routing mechanism in evolvable networks enables adaptive reconfiguration of topol-ogical structures and transmission pathways based on real-time task requirements and data character-istics.However,the heightened architectural complexity and expanded parameter dimensionality in evolvable networks present significant implementation challenges when deployed in resource-con-strained environments.Due to the critical paths ignored,traditional pruning strategies cannot get a desired trade-off between accuracy and efficiency.For this reason,a critical path retention pruning(CPRP)method is proposed.By deeply traversing the computational graph,the dependency rela-tionship among nodes is derived.Then the nodes are grouped and sorted according to their contribu-tion value.The redundant operations are removed as much as possible while ensuring that the criti-cal path is not affected.As a result,computational efficiency is improved while a higher accuracy is maintained.On the CIFAR benchmark,the experimental results demonstrate that CPRP-induced pruning incurs accuracy degradation below 4.00%,while outperforming traditional feature-agnostic grouping methods by an average 8.98%accuracy improvement.Simultaneously,the pruned model attains a 2.41 times inference acceleration while achieving 48.92%parameter compression and 53.40%floating-point operations(FLOPs)reduction.展开更多
Energy consumption is a crucial design concern in Mobile Ad hoc NETworks (MANETs) since nodes are powered by batteries with limited energy, whereas Dynamic Source Routing (DSR) protocol does not take the energy limita...Energy consumption is a crucial design concern in Mobile Ad hoc NETworks (MANETs) since nodes are powered by batteries with limited energy, whereas Dynamic Source Routing (DSR) protocol does not take the energy limitation of MANET nodes into account. This paper proposes an energy-saving routing algorithm based on DSR: Power Aware Routing protocol based on DSR (PAR-DSR). The design objective of PAR-DSR is to select energy-efficient paths. The main features of PAR-DSR are: (1) Nodes use the Signal Attenuation Rate (SAR) to conduct power control operations; (2) Minimum path cost as metric to balance the traffic and energy consumption of wireless nodes. The simulation results show that PAR-DSR can greatly reduce the energy consumption of MANET nodes. The average node lifetime of PAR-DSR is 50%-77% longer than that of DSR.展开更多
A Mobile Ad hoc Network(MANET)is a group of low-power con-sumption of wireless mobile nodes that configure a wireless network without the assistance of any existing infrastructure/centralized organization.The primary a...A Mobile Ad hoc Network(MANET)is a group of low-power con-sumption of wireless mobile nodes that configure a wireless network without the assistance of any existing infrastructure/centralized organization.The primary aim of MANETs is to extendflexibility into the self-directed,mobile,and wireless domain,in which a cluster of autonomous nodes forms a MANET routing system.An Intrusion Detection System(IDS)is a tool that examines a network for mal-icious behavior/policy violations.A network monitoring system is often used to report/gather any suspicious attacks/violations.An IDS is a software program or hardware system that monitors network/security traffic for malicious attacks,sending out alerts whenever it detects malicious nodes.The impact of Dynamic Source Routing(DSR)in MANETs challenging blackhole attack is investigated in this research article.The Cluster Trust Adaptive Acknowledgement(CTAA)method is used to identify unauthorised and malfunctioning nodes in a MANET environment.MANET system is active and provides successful delivery of a data packet,which implements Kalman Filters(KF)to anticipate node trustworthiness.Furthermore,KF is used to eliminate synchronisation errors that arise during the sending and receiving data.In order to provide an energy-efficient solution and to minimize network traffic,route optimization in MANET by using Multi-Objective Particle Swarm Optimization(MOPSO)technique to determine the optimal num-ber of clustered MANET along with energy dissipation in nodes.According to the researchfindings,the proposed CTAA-MPSO achieves a Packet Delivery Ratio(PDR)of 3.3%.In MANET,the PDR of CTAA-MPSO improves CTAA-PSO by 3.5%at 30%malware.展开更多
An ad hoc network is a group of wireless mobile computers(or nodes),in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range.Beca...An ad hoc network is a group of wireless mobile computers(or nodes),in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range.Because of node mobility and power limitations,the network topology changes frequently.Routing protocol plays an important role in the ad hoc network.A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required.As an optimization for the current Dynamic Source Routing Protocol,a secure and pragmatic routes selection scheme based on Reputation Systems was proposed.We design the Secure and Pragmatic Routing protocol and implement simulation models using GloMoSim.Simulation results show that the Secure and Pragmatic Routing protocol provides better experimental results on packet delivery ratio,power consumption and system throughput than Dynamic Source Routing Protocol.展开更多
Automatically extracting Drug-Drug Interactions (DDIs) from text is a crucial and challenging task, particularly when multiple medications are taken concurrently. In this study, we propose a novel approach, called Enh...Automatically extracting Drug-Drug Interactions (DDIs) from text is a crucial and challenging task, particularly when multiple medications are taken concurrently. In this study, we propose a novel approach, called Enhanced Attention-driven Dynamic Graph Convolutional Network (E-ADGCN), for DDI extraction. Our model combines the Attention-driven Dynamic Graph Convolutional Network (ADGCN) with a feature fusion method and multi-task learning framework. The ADGCN effectively utilizes entity information and dependency tree information from biomedical texts to extract DDIs. The feature fusion method integrates User-Generated Content (UGC) and molecular information with drug entity information from text through dynamic routing. By leveraging external resources, our approach maximizes the auxiliary effect and improves the accuracy of DDI extraction. We evaluate the E-ADGCN model on the extended DDIExtraction2013 dataset and achieve an F1-score of 81.45%. This research contributes to the advancement of automated methods for extracting valuable drug interaction information from textual sources, facilitating improved medication management and patient safety.展开更多
基金supported by the National Natural Science Foundation of China(T2394531)the National Key R&D Program of China(2024YFF1206500)+1 种基金the Shanghai Municipal Science and Technology Major Project(2018SHZDZX01)ZJ Lab,and the Shanghai Center for Brain Science and Brain-Inspired Technology,China.
文摘DDeeaarr EEddiittoorr,,The encoding and retrieval of emotional memories demands intricate interplay within the limbic network,where the network state is subject to significant reconfiguration by learning-induced plasticity,behavioral state,and contextual information[1].
基金supported by the National Basic Research Program of China(No.2011CB707000)the Foundation for Innovative Research Groups of the National Natural Science Foundation of China(No.61221061)
文摘With the rapid development of air transportation, network service ability has attracted a lot of attention in academe. Aiming to improve the throughput of the air route network （ARN）, we propose an effective local dynamic routing strategy in this paper. Several factors, such as the rout- ing distance, the geographical distance and the real-time local traffic, are taken into consideration. When the ARN is in the normal free-flow state, the proposed strategy can recover the shortest path routing （SPR） strategy. When the ARN undergoes congestion, the proposed strategy changes the paths of flights based on the real-time local traffic information. The throughput of the Chinese air route network （CARN） is evaluated. Results confirm that the proposed strategy can significantly improve the throughput of CARN. Meanwhile, the increase in the average flying distance and time is tiny. Results also indicate the importance of the distance related factors in a routing strategy designed for the ARN.
基金supported by the Jawaharlal Nehru Technological University Hyderabad,India under Grant Procs No.JNTUH/TEQIP-III/CRS/2019/CSE/13.the financial support provided by the J.N.T.University Hyderabad,India.
文摘Malaria is a severe epidemic disease caused by Plasmodium falciparum.The parasite causes critical illness if persisted for longer durations and delay in precise treatment can lead to further complications.The automatic diagnostic model provides aid for medical practitioners to avail a fast and efficient diagnosis.Most of the existing work either utilizes a fully connected convolution neural network with successive pooling layers which causes loss of information in pixels.Further,convolutions can capture spatial invariances but,cannot capture rotational invariances.Hence to overcome these limitations,this research,develops an Imperative Dynamic routing mechanism with fully trained capsule networks for malaria classification.This model identifies the presence of malaria parasites by classifying thin blood smears containing samples of parasitized and healthy erythrocytes.The proposed model is compared and evaluated with novel machine vision models evolved over a decade such as VGG,ResNet,DenseNet,MobileNet.The problems in previous research are cautiously addressed and overhauled using the proposed capsule network by attaining the highest Area under the curve(AUC)and Specificity of 99.03%and 99.43%respectively for 20%test samples.To understand the underlying behavior of the proposed network various tests are conducted for variant shuffle patterns.The model is analyzed and assessed in distinct environments to depict its resilience and versatility.To provide greater generalization,the proposed network has been tested on thick blood smear images which surpassed with greater performance.
文摘The purpose of this research is to create a simulated environment for teaching algorithms,big data processing,and machine learning.The environment is similar to Google Maps,with the capacity of finding the fastest path between two points in dynamic traffic situations.However,the system is significantly simplified for educational purposes.Students can choose different traffic patterns and program a car to navigate through the traffic dynamically based on the changing traffic.The environments used in the project are Visual IoT/Robotics Programming Language Environment(VIPLE)and a traffic simulator developed in the Unity game engine.This paper focuses on creating realistic traffic data for the traffic simulator and implementing dynamic routing algorithms in VIPLE.The traffic data are generated from the recorded real traffic data published on the Arizona Maricopa County website.Based on the generated traffic data,VIPLE programs are developed to implement the traffic simulation with support for dynamic changing data.
基金This work was supported by the National Research Foundation of Korea(NRF)grant funded by the Korea government(NRF-2019R1A2B5B01070416)also supported by the Advanced Research Project funded by the SeoulTech(Seoul National University of Science and Technology).
文摘In the current era,anyone can freely access the Internet thanks to the development of information and communication technology.The cloud is attracting attention due to its ability to meet continuous user demands for resources.Additionally,Cloud is effective for systems with large data flow such as the Internet of Things(IoT)systems and Smart Cities.Nonetheless,the use of traditional networking technology in the cloud causes network traffic overload and network security problems.Therefore,the cloud requires efficient networking technology to solve the existing challenges.In this paper,we propose one-time password-based software-defined cloud architecture for secure dynamic routing to mitigating the above-mention issues.The proposed cloud architecture provides a secure data path through dynamic routing using One-Time Internet Protocol(OTIP)algorithm between each layer.On the network side,we use software-defined technology to provide efficient network management and data security.We introduce a software-defined cloud architecture that applies OTIP algorithms for secure dynamic routing.We conduct a comparative analysis between general IP communication and proposed OTIP communication architecture.It evaluates the performance of OTIP algorithms.Finally,we examine the proposed software-defined cloud architecture,including how to apply OTIP in secure dynamic routing according to the results of the comparative analysis.
文摘Time and space complexity is themost critical problemof the current routing optimization algorithms for Software Defined Networking(SDN).To overcome this complexity,researchers use meta-heuristic techniques inside the routing optimization algorithms in the OpenFlow(OF)based large scale SDNs.This paper proposes a hybrid meta-heuristic algorithm to optimize the dynamic routing problem for the large scale SDNs.Due to the dynamic nature of SDNs,the proposed algorithm uses amutation operator to overcome the memory-based problem of the ant colony algorithm.Besides,it uses the box-covering method and the k-means clustering method to divide the SDN network to overcome the problemof time and space complexity.The results of the proposed algorithm compared with the results of other similar algorithms and it shows that the proposed algorithm can handle the dynamic network changing,reduce the network congestion,the delay and running times and the packet loss rates.
基金Supported by the National Natural Science Foundation of China(No.61675033,61575026,61675232,61571440)the National High Technology Research and Development Program of China(No.2015AA015504)
文摘In order to overcome the adverse effects of Doppler wavelength shift on data transmission in the optical satellite networks,a dynamic routing and wavelength assignment algorithm based on crosslayer design( CL-DRWA) is introduced which can improve robustness of the network. Above all,a cross-layer optimization model is designed,which considers transmission delay and wavelength-continuity constraint,as well as Doppler wavelength shift. Then CL-DRWA is applied to solve this model,resulting in finding an optimal light path satisfying the above constraints for every connection request. In CL-DRWA,Bellman-Ford method is used to find an optimal route and a distributed relative capacity loss method is implemented to get an optimal wavelength assignment result on the optimal route. Moreover,compared with the dynamic routing and wavelength assignment algorithm based on minimum delay strategy( MD-DRWA),CL-DRWA can make an improvement of 5. 3% on the communication success probability. Meanwhile,CL-DRWA can meet the requirement of transmission delay for real-time services.
文摘The challenge of keeping and getting new customers drives the development of new practices to meet the consumption needs of increasingly tends to micro-segmentation of product and consumer market. The new consumption habits of brazilians brought new prospects for market. The objective of this paper is to develop of a dynamic vehicle routing system supported by the behavior of urban traffic in the city ofSao Paulo using Neuro Fuzzy Network. The methodology of this paper consists in the capture of relevant events that interfere with the flow of traffic of the city of Sao Paulo and implementation of a Fuzzy Neural Network trained with these events in order to foresee the traffic behavior. The system offers three labels of hierarchical routing, thus is possible to consider not only the basic factors of routing, but too external factors that directly influence on the flow of traffic and the disruption which may be avoided in large cities, through alternative routes （dynamic vehicle routing）. Predicting the behavior of traffic represents the strategic level routing, dynamic vehicle routing is the tactical level, and routing algorithms to the operational level. This paper will not be discussed the operational level.
基金supported partly by National Key R&D Program of China(Nos.2021YFA1000300 and 2021YFA1000301)the National Natural Science Foundation of China(No.11971046).
文摘In this paper,we study atomic dynamic routing games with multiple destinations.We first show that if the first-in–first-out(FIFO)principle is always fulfilled locally to regulate the congestion,then most probably we cannot guarantee the existence of any reasonable approximate Nash equilibrium.By partly discarding the FIFO principle and introducing destination priorities in the regulation rules,we propose a new atomic routing model.In each such game,we prove that a pure strategy Nash equilibrium always exists and can be computed in polynomial time.In addition,the multicommodity routing game can be iteratively decomposed into a series of well-behaved single-destination routing games,which will provide a good characterization of all NEs of the original game.
文摘Reliable and efficient communication is essential for Unmanned Aerial Vehicle(UAV)networks,especially in dynamic and resource-constrained environments such as disaster management,surveillance,and environmental monitoring.Frequent topology changes,high mobility,and limited energy availability pose significant challenges to maintaining stable and high-performance routing.Traditional routing protocols,such as Ad hoc On-Demand Distance Vector(AODV),Load-Balanced Optimized Predictive Ad hoc Routing(LB-OPAR),and Destination-Sequenced Distance Vector(DSDV),often experience performance degradation under such conditions.To address these limitations,this study evaluates the effectiveness of Dynamic Adaptive Routing(DAR),a protocol designed to adapt routing decisions in real time based on network dynamics and resource constraints.The research utilizes the Network Simulator 3(NS-3)platform to conduct controlled simulations,measuring key performance indicators such as latency,Packet Delivery Ratio(PDR),energy consumption,and throughput.Comparative analysis reveals that DAR consistently outperforms conventional protocols,achieving a 20%-30% reduction in latency,a 25% decrease in energy consumption,and marked improvements in throughput and PDR.These results highlight DAR’s ability to maintain high communication reliability while optimizing resource usage in challenging operational scenarios.By providing empirical evidence of DAR’s advantages in highly dynamic UAV network environments,this study contributes to advancing adaptive routing strategies.The findings not only validate DAR’s robustness and scalability but also lay the groundwork for integrating artificial intelligence-driven decision-making and real-world UAV deployment.Future work will explore cross-layer optimization,multi-UAV coordination,and experimental validation in field trials,aiming to further enhance communication resilience and energy efficiency in next-generation aerial networks.
基金funded by the National Key Research and Development Program Project 2022YFB4300404.
文摘The real-time path optimization for heterogeneous vehicle fleets in large-scale road networks presents significant challenges due to conflicting traffic demands and imbalanced resource allocation.While existing vehicleto-infrastructure coordination frameworks partially address congestion mitigation,they often neglect priority-aware optimization and exhibit algorithmic bias toward dominant vehicle classes—critical limitations in mixed-priority scenarios involving emergency vehicles.To bridge this gap,this study proposes a preference game-theoretic coordination framework with adaptive strategy transfer protocol,explicitly balancing system-wide efficiency(measured by network throughput)with priority vehicle rights protection(quantified via time-sensitive utility functions).The approach innovatively combines(1)a multi-vehicle dynamic routing model with quantifiable preference weights,and(2)a distributed Nash equilibrium solver updated using replicator sub-dynamic models.The framework was evaluated on an urban road network containing 25 intersections with mixed priority ratios(10%–30%of vehicles with priority access demand),and the framework showed consistent benefits on four benchmarks(Social routing algorithm,Shortest path algorithm,The comprehensive path optimisation model,The emergency vehicle timing collaborative evolution path optimization method)showed consistent benefits.Results showthat across different traffic demand configurations,the proposed method reduces the average vehicle traveling time by at least 365 s,increases the road network throughput by 48.61%,and effectively balances the road loads.This approach successfully meets the diverse traffic demands of various vehicle types while optimizing road resource allocations.The proposed coordination paradigm advances theoretical foundations for fairness-aware traffic optimization while offering implementable strategies for next-generation cooperative vehicle-road systems,particularly in smart city deployments requiring mixed-priority mobility guarantees.
基金Supported by the National Key R&D Program of China project (2017YFC0805309)the National Natural Science Foundation of China (60602020)。
文摘To improve the efficiency of ship traffic in frequently traded sea areas and respond to the national“dual-carbon”strategy,a multi-objective ship route induction model is proposed.Considering the energy-saving and environmental issues of ships,this study aims to improve the transportation efficiency of ships by providing a ship route induction method.Ship data from a certain bay during a defined period are collected,and an improved backpropagation neural network algorithm is used to forecast ship traffic.On the basis of the forecasted data and ship route induction objectives,dynamic programming of ship routes is performed.Experimental results show that the routes planned using this induction method reduce the combined cost by 17.55%compared with statically induced routes.This method has promising engineering applications in improving ship navigation efficiency,promoting energy conservation,and reducing emissions.
文摘A state-dependent routing algorithm based on the neural network model, which takes advantage of other dynamic routing algorithm for circuit-switched network, is given in [1]. But, the Algorithm in [1] is a centralized control model with complex O (N 7), therefore, is difficult to realize by hardware. A simplified algorithm is put forward in this paper, in which routing can be controlled decentralizedly, and its complexity is reduced to O (10N 3). Computer simulations are made in a fully connected test network with eight nodes. The results show that the centralized control model has very effective performance that can match RTNR, and the centralized control model is not as good as the centralized one but better than DAR-1.
基金funded by the National Natural Science Foundation of China (Grant No. 41501046)the Innovation Program of Guangdong Province, China (Grant No. 2016-14)
文摘Efficiency in solving the Saint-Venant equations for watershed rainfall-runoff routing is important in flood hydrology. This paper presents a high-efficiency numerical solution of one-dimensional dynamic wave equations(HEDWE) for watershed rainfall-runoff routing, in which the full momentum equation is written as a quadratic equation with only one unknown variable Q, water depth is derived from the continuity equation using the two-step predictorcorrector method, and the discrete scheme is the explicit upwind scheme. The results of numerical tests showed the HEDWE approach has several major advantages. 1) It is a stable numerical method, even for an initially dry area. 2) Its computational efficiency is higher than 4.76E+05 times/s. 3) It can be used for overland flow, river flow, and combinations thereof. The primary disadvantages of the HEDWE approach are its unsuitability for rapidly varying flow, such as dam-break floods.
基金supported by the National Key Research and Development Program of China(No.2020YFB1806000)。
文摘The high-speed movement of satellites makes it not feasible to directly apply the mature routing scheme on the ground to the satellite network.DT-DVTR in the snapshot-based connectionoriented routing strategy is one of the representative solutions,but it still has room for improvement in terms of routing stability.In this paper,we propose an improved scheme for connection-oriented routing strategy named the Minimal Topology Change Routing based on Collaborative Rules(MTCR-CR).The MTCR-CR uses continuous time static topology snapshots based on satellite status to search for intersatellite link(ISL)construction solutions that meet the minimum number of topology changes to avoid route oscillations.The simulation results in Beidou-3 show that compared with DT-DVTR,MTCR-CR reduces the number of routing changes by about 92%,the number of path changes caused by routing changes is about38%,and the rerouting time is reduced by approximately 47%.At the same time,in order to show our algorithm more comprehensively,the same experimental index test was also carried out on the Globalstar satellite constellation.
基金Supported by the National Key Research and Development Program of China(No.2022ZD0119003)and the National Natural Science Founda-tion of China(No.61834005).
文摘The dynamic routing mechanism in evolvable networks enables adaptive reconfiguration of topol-ogical structures and transmission pathways based on real-time task requirements and data character-istics.However,the heightened architectural complexity and expanded parameter dimensionality in evolvable networks present significant implementation challenges when deployed in resource-con-strained environments.Due to the critical paths ignored,traditional pruning strategies cannot get a desired trade-off between accuracy and efficiency.For this reason,a critical path retention pruning(CPRP)method is proposed.By deeply traversing the computational graph,the dependency rela-tionship among nodes is derived.Then the nodes are grouped and sorted according to their contribu-tion value.The redundant operations are removed as much as possible while ensuring that the criti-cal path is not affected.As a result,computational efficiency is improved while a higher accuracy is maintained.On the CIFAR benchmark,the experimental results demonstrate that CPRP-induced pruning incurs accuracy degradation below 4.00%,while outperforming traditional feature-agnostic grouping methods by an average 8.98%accuracy improvement.Simultaneously,the pruned model attains a 2.41 times inference acceleration while achieving 48.92%parameter compression and 53.40%floating-point operations(FLOPs)reduction.
文摘Energy consumption is a crucial design concern in Mobile Ad hoc NETworks (MANETs) since nodes are powered by batteries with limited energy, whereas Dynamic Source Routing (DSR) protocol does not take the energy limitation of MANET nodes into account. This paper proposes an energy-saving routing algorithm based on DSR: Power Aware Routing protocol based on DSR (PAR-DSR). The design objective of PAR-DSR is to select energy-efficient paths. The main features of PAR-DSR are: (1) Nodes use the Signal Attenuation Rate (SAR) to conduct power control operations; (2) Minimum path cost as metric to balance the traffic and energy consumption of wireless nodes. The simulation results show that PAR-DSR can greatly reduce the energy consumption of MANET nodes. The average node lifetime of PAR-DSR is 50%-77% longer than that of DSR.
文摘A Mobile Ad hoc Network(MANET)is a group of low-power con-sumption of wireless mobile nodes that configure a wireless network without the assistance of any existing infrastructure/centralized organization.The primary aim of MANETs is to extendflexibility into the self-directed,mobile,and wireless domain,in which a cluster of autonomous nodes forms a MANET routing system.An Intrusion Detection System(IDS)is a tool that examines a network for mal-icious behavior/policy violations.A network monitoring system is often used to report/gather any suspicious attacks/violations.An IDS is a software program or hardware system that monitors network/security traffic for malicious attacks,sending out alerts whenever it detects malicious nodes.The impact of Dynamic Source Routing(DSR)in MANETs challenging blackhole attack is investigated in this research article.The Cluster Trust Adaptive Acknowledgement(CTAA)method is used to identify unauthorised and malfunctioning nodes in a MANET environment.MANET system is active and provides successful delivery of a data packet,which implements Kalman Filters(KF)to anticipate node trustworthiness.Furthermore,KF is used to eliminate synchronisation errors that arise during the sending and receiving data.In order to provide an energy-efficient solution and to minimize network traffic,route optimization in MANET by using Multi-Objective Particle Swarm Optimization(MOPSO)technique to determine the optimal num-ber of clustered MANET along with energy dissipation in nodes.According to the researchfindings,the proposed CTAA-MPSO achieves a Packet Delivery Ratio(PDR)of 3.3%.In MANET,the PDR of CTAA-MPSO improves CTAA-PSO by 3.5%at 30%malware.
基金The National Natural Science Foundation of China (No.60403027)
文摘An ad hoc network is a group of wireless mobile computers(or nodes),in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range.Because of node mobility and power limitations,the network topology changes frequently.Routing protocol plays an important role in the ad hoc network.A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required.As an optimization for the current Dynamic Source Routing Protocol,a secure and pragmatic routes selection scheme based on Reputation Systems was proposed.We design the Secure and Pragmatic Routing protocol and implement simulation models using GloMoSim.Simulation results show that the Secure and Pragmatic Routing protocol provides better experimental results on packet delivery ratio,power consumption and system throughput than Dynamic Source Routing Protocol.
基金supported by the National Natural Science Foundation of China(No.62476025)the Shaanxi Provincial Department of Science and Technology Projects(No.2013K06-39).
文摘Automatically extracting Drug-Drug Interactions (DDIs) from text is a crucial and challenging task, particularly when multiple medications are taken concurrently. In this study, we propose a novel approach, called Enhanced Attention-driven Dynamic Graph Convolutional Network (E-ADGCN), for DDI extraction. Our model combines the Attention-driven Dynamic Graph Convolutional Network (ADGCN) with a feature fusion method and multi-task learning framework. The ADGCN effectively utilizes entity information and dependency tree information from biomedical texts to extract DDIs. The feature fusion method integrates User-Generated Content (UGC) and molecular information with drug entity information from text through dynamic routing. By leveraging external resources, our approach maximizes the auxiliary effect and improves the accuracy of DDI extraction. We evaluate the E-ADGCN model on the extended DDIExtraction2013 dataset and achieve an F1-score of 81.45%. This research contributes to the advancement of automated methods for extracting valuable drug interaction information from textual sources, facilitating improved medication management and patient safety.
