Because of different system capacities of base station （BS） or access point （AP） and ununiformity of traffic distribution in different cells, quantities of new call users may be blocked in overloaded cell in commu...Because of different system capacities of base station （BS） or access point （AP） and ununiformity of traffic distribution in different cells, quantities of new call users may be blocked in overloaded cell in communication hot spots. Whereas in some neighboring under-loaded cells, bandwidth may be superfluous because there are only few users to request services. In order to raise resource utilization of the whole heterogeneous networks, several novel load balancing strategies are proposed, which combine the call ad- mission control policy and multi-hop routing protocol of ad-hoc network for load balancing. These loadbalancing strategies firstly make a decision whether to admit a new call or not by considering some parameters like load index and route cost, etc., and then transfer the denied users into neighboring under-loaded cell with surplus channel according to optimum multi-hop routing algorithm. Simulation results show that the proposed load balancing strategies can distribute traffics to the whole heterogeneous wireless netorks, improve the load balance index efficiently, and avoid the call block phenomenon almost absolutely.展开更多
Military tactical network is one of the most important applications of ad hoc network. Currently the existing routing protocols are put forward based on the simple and universal network model which has the ability of ...Military tactical network is one of the most important applications of ad hoc network. Currently the existing routing protocols are put forward based on the simple and universal network model which has the ability of multi-hop routing but cannot work efficiently in the special military applications. The narrow bandwidth and limited energy of the wireless network make general routing protocols seem to be more redundant. In order to satisfy military needs properly, this letter makes a detailed analysis of physical nodes and traffic distribution in military network, uses cross-layer design concept tbr reference, combines traffic characteristic of application layer with routing protocol design. It categorized routing problem as crucial routes and non-crucial routes which adopted separate maintenance methods. It not only realizes basic transmission function but also works efficiently. It is quite fit for military application.展开更多
In Wireless Sensor Network (WSNs), sensor nodes collect data and send them to a Base Station (BS) for further processing. One of the most issues in WSNs that researchers have proposed a hundred of technique to solve i...In Wireless Sensor Network (WSNs), sensor nodes collect data and send them to a Base Station (BS) for further processing. One of the most issues in WSNs that researchers have proposed a hundred of technique to solve its impact is the energy constraint since sensor nodes have small battery, small memory and less data processing with low computational capabilities. However, many researches efforts have focused on how to prolong the battery lifetime of sensor nodes by proposing different routing, MAC, localization, data aggregation, topology construction techniques. In this paper, we will focus on routing techniques which aim to prolonging the network lifetime. Hence, we propose an Energy-Efficient Routing technique in WSNs based on Stationary and Mobile nodes (EERSM). Sensing filed is divided into intersected circles which contain Mobile Nodes (MN). The proposed data aggregation technique via the circular topology will eliminate the redundant data to be sent to the Base Station (BS). MN in each circle will rout packets for their source nodes, and move to the intersected area where another MN is waiting (sleep mode) to receive the transmitted packet, and then the packet will be delivered to the next intersected area until the packet is arrived to the BS. Our proposed EERSM technique is simulated using MATLAB and compared with conventional multi-hop techniques under different network models and scenarios. In the simulation, we will show how the proposed EERSM technique overcomes many routing protocols in terms of the number of hops counted when sending packets from a source node to the destination (i.e. BS), the average residual energy, number of sent packets to the BS, and the number of a live sensor nodes verse the simulation rounds.展开更多
Lossy link is one of the unique characteristics in random-deployed sensor networks. We envision that robustness and reliability of routing cannot be ensured purely in network layer. Our idea is to enhance the performa...Lossy link is one of the unique characteristics in random-deployed sensor networks. We envision that robustness and reliability of routing cannot be ensured purely in network layer. Our idea is to enhance the performance of routing protocol by cross-layer interaction. We modified mint protocol, a routing protocol in TinyOS and proposed an enhanced version of mint called PA-mint. A transmission power control interface is added to network layer in PA-mint. When routing performance of the current network is not satisfied, PA-mint monotonically increases the transmission power via the interface we added. PA-mint is able to connect orphan nodes and robust to node mobility or key nodes failure. In the case that automatic request retransmission is employed, the number of retransmissions can be reduced by PA-mint. Results from experiments show that PA-mint increases the reliability and robustness of routing protocol by cross-layer interaction.展开更多
Wireless Sensor Networks(WSN)has evolved into a key technology for ubiquitous living and the domain of interest has remained active in research owing to its extensive range of applications.In spite of this,it is chall...Wireless Sensor Networks(WSN)has evolved into a key technology for ubiquitous living and the domain of interest has remained active in research owing to its extensive range of applications.In spite of this,it is challenging to design energy-efficient WSN.The routing approaches are leveraged to reduce the utilization of energy and prolonging the lifespan of network.In order to solve the restricted energy problem,it is essential to reduce the energy utilization of data,transmitted from the routing protocol and improve network development.In this background,the current study proposes a novel Differential Evolution with Arithmetic Optimization Algorithm Enabled Multi-hop Routing Protocol(DEAOA-MHRP)for WSN.The aim of the proposed DEAOA-MHRP model is select the optimal routes to reach the destination in WSN.To accomplish this,DEAOA-MHRP model initially integrates the concepts of Different Evolution(DE)and Arithmetic Optimization Algorithms(AOA)to improve convergence rate and solution quality.Besides,the inclusion of DE in traditional AOA helps in overcoming local optima problems.In addition,the proposed DEAOA-MRP technique derives a fitness function comprising two input variables such as residual energy and distance.In order to ensure the energy efficient performance of DEAOA-MHRP model,a detailed comparative study was conducted and the results established its superior performance over recent approaches.展开更多
Routing plays a critical role in data transmission for underwater acoustic sensor networks(UWSNs)in the internet of underwater things(IoUT).Traditional routing methods suffer from high end-toend delay,limited bandwidt...Routing plays a critical role in data transmission for underwater acoustic sensor networks(UWSNs)in the internet of underwater things(IoUT).Traditional routing methods suffer from high end-toend delay,limited bandwidth,and high energy consumption.With the development of artificial intelligence and machine learning algorithms,many researchers apply these new methods to improve the quality of routing.In this paper,we propose a Qlearning-based multi-hop cooperative routing protocol(QMCR)for UWSNs.Our protocol can automatically choose nodes with the maximum Q-value as forwarders based on distance information.Moreover,we combine cooperative communications with Q-learning algorithm to reduce network energy consumption and improve communication efficiency.Experimental results show that the running time of the QMCR is less than one-tenth of that of the artificial fish-swarm algorithm(AFSA),while the routing energy consumption is kept at the same level.Due to the extremely fast speed of the algorithm,the QMCR is a promising method of routing design for UWSNs,especially for the case that it suffers from the extreme dynamic underwater acoustic channels in the real ocean environment.展开更多
Network coding has been considered as one of the effective strategies that improve the throughput of multi- hop wireless networks. In order to effectively apply network coding techniques to the real multi-hop wireless...Network coding has been considered as one of the effective strategies that improve the throughput of multi- hop wireless networks. In order to effectively apply network coding techniques to the real multi-hop wireless networks, a practical network coding aware routing protocol is proposed in this paper, for unicast sessions in multi- hop wireless networks. The protocol is based on a novel routing metric design that captures the characteristics of network coding and unicast sessions. To ensure the novel routing mettle can operate with practical and widely available path calculation algorithms, a unique mapping process is used to map a real wireless network to a virtual network. The mapping process ensures that the paths with the biggest coding opportunities will be selected by commonly used path calculation algorithms. Simulation results show that the proposed routing protocol is effective to improve the network throughput.展开更多
Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To sa...Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.展开更多
Opportunistic routing(OR) is an effective way to guarantee transmission reliability in wireless multi-hop networks.However,little research focuses on transmission efficiency.Thus,an analytical model based on open queu...Opportunistic routing(OR) is an effective way to guarantee transmission reliability in wireless multi-hop networks.However,little research focuses on transmission efficiency.Thus,an analytical model based on open queuing network with Markov chains was proposed to evaluate the efficiency.By analyzing two typical ORs,we find duplicate transmission and collision avoidance overhead are the root reasons behind inefficiency.Therefore,a new scheme called dual priority cooperative opportunistic routing(DPCOR) was proposed.In DPCOR,forwarding candidates are configured with dual priority,which enables the network to classify forwarding candidates more effectively so as to reduce the back-off time and obtain more diversity gain.Theoretical analysis and simulation results show DPCOR achieves significant performance improvement with less time overhead compared with traditional routings and typical ORs.展开更多
Cross-domain routing in Integrated Heterogeneous Networks(Inte-HetNet)should ensure efficient and secure data transmission across different network domains by satisfying diverse routing requirements.However,current so...Cross-domain routing in Integrated Heterogeneous Networks(Inte-HetNet)should ensure efficient and secure data transmission across different network domains by satisfying diverse routing requirements.However,current solutions face numerous challenges in continuously ensuring trustworthy routing,fulfilling diverse requirements,achieving reasonable resource allocation,and safeguarding against malicious behaviors of network operators.We propose CrowdRouting,a novel cross-domain routing scheme based on crowdsourcing,dedicated to establishing sustained trust in cross-domain routing,comprehensively considering and fulfilling various customized routing requirements,while ensuring reasonable resource allocation and effectively curbing malicious behavior of network operators.Concretely,CrowdRouting employs blockchain technology to verify the trustworthiness of border routers in different network domains,thereby establishing sustainable and trustworthy crossdomain routing based on sustained trust in these routers.In addition,CrowdRouting ingeniously integrates a crowdsourcing mechanism into the auction for routing,achieving fair and impartial allocation of routing rights by flexibly embedding various customized routing requirements into each auction phase.Moreover,CrowdRouting leverages incentive mechanisms and routing settlement to encourage network domains to actively participate in cross-domain routing,thereby promoting optimal resource allocation and efficient utilization.Furthermore,CrowdRouting introduces a supervisory agency(e.g.,undercover agent)to effectively suppress the malicious behavior of network operators through the game and interaction between the agent and the network operators.Through comprehensive experimental evaluations and comparisons with existing works,we demonstrate that CrowdRouting excels in providing trustworthy and fine-grained customized routing services,stimulating active participation in cross-domain routing,inhibiting malicious operator behavior,and maintaining reasonable resource allocation,all of which outperform baseline schemes.展开更多
Financial and environment considerations present new trends in wireless network known as green communication. As one of the most promising network architectures, the device-to-device （D2D） communication should take ...Financial and environment considerations present new trends in wireless network known as green communication. As one of the most promising network architectures, the device-to-device （D2D） communication should take seriously account to the energy-efficiency. Most of the existing work in the area of D2D communication only focus on the direct communication, however, the direct link D2D communication has to be limited in practice because of long distance, poor propagation medium and cellular interference, etc. A new energy-efficient multi-hop routing algorithm was investigated for multi-hop D2D system by jointly optimizing channel reusing and power allocation. Firstly, the energy-efficient multi-hop routing problem was formulated as a combinatorial optimization problem. Secondly, to obtain a desirable solution with reasonable computation cost, a heuristic multi-hop routing algorithm was presented to solve the formulated problem and to achieve a satisfactory energy-efficiency performance. Simulation shows the effectiveness of the proposed routing algorithm.展开更多
This paper systematically reviews the latest research developments in Vehicle Routing Problems(VRP).It examines classical VRP models and their classifications across different dimensions,including load capacity,operat...This paper systematically reviews the latest research developments in Vehicle Routing Problems(VRP).It examines classical VRP models and their classifications across different dimensions,including load capacity,operational characteristics,optimization objectives,vehicle types,and time constraints.Based on literature retrieval results from the Web of Science database,the paper analyzes the current state and trends in VRP research,providing detailed explanations of VRP models and algorithms applied to various scenarios in recent years.Additionally,the article discusses limitations in existing research and provides perspectives on future development trends in VRP research.This review offers researchers in the VRP field a comprehensive overview while identifying future research directions.展开更多
This paper proposes an efficient strategy for resource utilization in Elastic Optical Networks (EONs) to minimize spectrum fragmentation and reduce connection blocking probability during Routing and Spectrum Allocatio...This paper proposes an efficient strategy for resource utilization in Elastic Optical Networks (EONs) to minimize spectrum fragmentation and reduce connection blocking probability during Routing and Spectrum Allocation (RSA). The proposed method, Dynamic Threshold-Based Routing and Spectrum Allocation with Fragmentation Awareness (DT-RSAF), integrates rerouting and spectrum defragmentation as needed. By leveraging Yen’s shortest path algorithm, DT-RSAF enhances resource utilization while ensuring improved service continuity. A dynamic threshold mechanism enables the algorithm to adapt to varying network conditions, while its fragmentation awareness effectively mitigates spectrum fragmentation. Simulation results on NSFNET and COST 239 topologies demonstrate that DT-RSAF significantly outperforms methods such as K-Shortest Path Routing and Spectrum Allocation (KSP-RSA), Load Balanced and Fragmentation-Aware (LBFA), and the Invasive Weed Optimization-based RSA (IWO-RSA). Under heavy traffic, DT-RSAF reduces the blocking probability by up to 15% and achieves lower Bandwidth Fragmentation Ratios (BFR), ranging from 74% to 75%, compared to 77% - 80% for KSP-RSA, 75% - 77% for LBFA, and approximately 76% for IWO-RSA. DT-RSAF also demonstrated reasonable computation times compared to KSP-RSA, LBFA, and IWO-RSA. On a small-sized network, its computation time was 8710 times faster than that of Integer Linear Programming (ILP) on the same network topology. Additionally, it achieved a similar execution time to LBFA and outperformed IWO-RSA in terms of efficiency. These results highlight DT-RSAF’s capability to maintain large contiguous frequency blocks, making it highly effective for accommodating high-bandwidth requests in EONs while maintaining reasonable execution times.展开更多
As commercial drone delivery becomes increasingly popular,the extension of the vehicle routing problem with drones(VRPD)is emerging as an optimization problem of inter-ests.This paper studies a variant of VRPD in mult...As commercial drone delivery becomes increasingly popular,the extension of the vehicle routing problem with drones(VRPD)is emerging as an optimization problem of inter-ests.This paper studies a variant of VRPD in multi-trip and multi-drop(VRP-mmD).The problem aims at making schedules for the trucks and drones such that the total travel time is minimized.This paper formulate the problem with a mixed integer program-ming model and propose a two-phase algorithm,i.e.,a parallel route construction heuristic(PRCH)for the first phase and an adaptive neighbor searching heuristic(ANSH)for the second phase.The PRCH generates an initial solution by con-currently assigning as many nodes as possible to the truck–drone pair to progressively reduce the waiting time at the rendezvous node in the first phase.Then the ANSH improves the initial solution by adaptively exploring the neighborhoods in the second phase.Numerical tests on some benchmark data are conducted to verify the performance of the algorithm.The results show that the proposed algorithm can found better solu-tions than some state-of-the-art methods for all instances.More-over,an extensive analysis highlights the stability of the pro-posed algorithm.展开更多
Border Gateway Protocol(BGP),as the standard inter-domain routing protocol,is a distance-vector dynamic routing protocol used for exchanging routing information between distributed Autonomous Systems(AS).BGP nodes,com...Border Gateway Protocol(BGP),as the standard inter-domain routing protocol,is a distance-vector dynamic routing protocol used for exchanging routing information between distributed Autonomous Systems(AS).BGP nodes,communicating in a distributed dynamic environment,face several security challenges,with trust being one of the most important issues in inter-domain routing.Existing research,which performs trust evaluation when exchanging routing information to suppress malicious routing behavior,cannot meet the scalability requirements of BGP nodes.In this paper,we propose a blockchain-based trust model for inter-domain routing.Our model achieves scalability by allowing the master node of an AS alliance to transmit the trust evaluation data of its member nodes to the blockchain.The BGP nodes can expedite the trust evaluation process by accessing a global view of other BGP nodes through the master node of their respective alliance.We incorporate security service evaluation before direct evaluation and indirect recommendations to assess the security services that BGP nodes provide for themselves and prioritize to guarantee their security of routing service.We forward the trust evaluation for neighbor discovery and prioritize the nodes with high trust as neighbor nodes to reduce the malicious exchange routing behavior.We use simulation software to simulate a real BGP environments and employ a comparative experimental research approach to demonstrate the performance evaluation of our trust model.Compared with the classical trust model,our trust model not only saves more storage overhead,but also provides higher security,especially reducing the impact of collusion attacks.展开更多
The Internet of Things (IoT) integrates diverse devices into the Internet infrastructure, including sensors, meters, and wearable devices. Designing efficient IoT networks with these heterogeneous devices requires the...The Internet of Things (IoT) integrates diverse devices into the Internet infrastructure, including sensors, meters, and wearable devices. Designing efficient IoT networks with these heterogeneous devices requires the selection of appropriate routing protocols, which is crucial for maintaining high Quality of Service (QoS). The Internet Engineering Task Force’s Routing Over Low Power and Lossy Networks (IETF ROLL) working group developed the IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) to meet these needs. While the initial RPL standard focused on single-metric route selection, ongoing research explores enhancing RPL by incorporating multiple routing metrics and developing new Objective Functions (OFs). This paper introduces a novel Objective Function (OF), the Reliable and Secure Objective Function (RSOF), designed to enhance the reliability and trustworthiness of parent selection at both the node and link levels within IoT and RPL routing protocols. The RSOF employs an adaptive parent node selection mechanism that incorporates multiple metrics, including Residual Energy (RE), Expected Transmission Count (ETX), Extended RPL Node Trustworthiness (ERNT), and a novel metric that measures node failure rate (NFR). In this mechanism, nodes with a high NFR are excluded from the parent selection process to improve network reliability and stability. The proposed RSOF was evaluated using random and grid topologies in the Cooja Simulator, with tests conducted across small, medium, and large-scale networks to examine the impact of varying node densities. The simulation results indicate a significant improvement in network performance, particularly in terms of average latency, packet acknowledgment ratio (PAR), packet delivery ratio (PDR), and Control Message Overhead (CMO), compared to the standard Minimum Rank with Hysteresis Objective Function (MRHOF).展开更多
In large-scaleWireless Rechargeable SensorNetworks(WRSN),traditional forward routingmechanisms often lead to reduced energy efficiency.To address this issue,this paper proposes a WRSN node energy optimization algorith...In large-scaleWireless Rechargeable SensorNetworks(WRSN),traditional forward routingmechanisms often lead to reduced energy efficiency.To address this issue,this paper proposes a WRSN node energy optimization algorithm based on regional partitioning and inter-layer routing.The algorithm employs a dynamic clustering radius method and the K-means clustering algorithm to dynamically partition the WRSN area.Then,the cluster head nodes in the outermost layer select an appropriate layer from the next relay routing region and designate it as the relay layer for data transmission.Relay nodes are selected layer by layer,starting from the outermost cluster heads.Finally,the inter-layer routing mechanism is integrated with regional partitioning and clustering methods to develop the WRSN energy optimization algorithm.To further optimize the algorithm’s performance,we conduct parameter optimization experiments on the relay routing selection function,cluster head rotation energy threshold,and inter-layer relay structure selection,ensuring the best configurations for energy efficiency and network lifespan.Based on these optimizations,simulation results demonstrate that the proposed algorithm outperforms traditional forward routing,K-CHRA,and K-CLP algorithms in terms of node mortality rate and energy consumption,extending the number of rounds to 50%node death by 11.9%,19.3%,and 8.3%in a 500-node network,respectively.展开更多
Underwater Wireless Sensor Networks(UWSNs)are gaining popularity because of their potential uses in oceanography,seismic activity monitoring,environmental preservation,and underwater mapping.Yet,these networks are fac...Underwater Wireless Sensor Networks(UWSNs)are gaining popularity because of their potential uses in oceanography,seismic activity monitoring,environmental preservation,and underwater mapping.Yet,these networks are faced with challenges such as self-interference,long propagation delays,limited bandwidth,and changing network topologies.These challenges are coped with by designing advanced routing protocols.In this work,we present Under Water Fuzzy-Routing Protocol for Low power and Lossy networks(UWF-RPL),an enhanced fuzzy-based protocol that improves decision-making during path selection and traffic distribution over different network nodes.Our method extends RPL with the aid of fuzzy logic to optimize depth,energy,Received Signal Strength Indicator(RSSI)to Expected Transmission Count(ETX)ratio,and latency.Theproposed protocol outperforms other techniques in that it offersmore energy efficiency,better packet delivery,lowdelay,and no queue overflow.It also exhibits better scalability and reliability in dynamic underwater networks,which is of very high importance in maintaining the network operations efficiency and the lifetime of UWSNs optimized.Compared to other recent methods,it offers improved network convergence time(10%–23%),energy efficiency(15%),packet delivery(17%),and delay(24%).展开更多
Subarea Tree Routing (STR), a new routing protocol for multi-hop wireless ad hoc networks, is proposed. The novelty of the STR protocol is to divide the whole network into many subareas constructed as a result of esta...Subarea Tree Routing (STR), a new routing protocol for multi-hop wireless ad hoc networks, is proposed. The novelty of the STR protocol is to divide the whole network into many subareas constructed as a result of establishing subarea trees. Its main idea is to identify root nodes by manual configuration or auto-discovery process firstly, then the root nodes originate the process of establishing subarea trees, and finally each node either joins in a subarea tree or become an interconnect node. STR belongs to hierarchical routing protocol and does not attempt to consistently maintain routing information in every node. Furthermore, through the use of tree’s intrinsic routing function, the STR protocol exhibits hybrid behavior of proactive and on-demand routing protocols. We prove the correctness of STR, and our simulation results show that the pro-posed scheme achieves lower route discovery delays, lower route discovery load and better performance of normalized routing load in large, mobile, ad hoc networks as compared with AODV.展开更多
基金Supported by the National Natural Science Foundation of China (No. 60672059, 60496315 )the National High Technology Research and Development Programme of China (No.2006AA01Z233)
文摘Because of different system capacities of base station （BS） or access point （AP） and ununiformity of traffic distribution in different cells, quantities of new call users may be blocked in overloaded cell in communication hot spots. Whereas in some neighboring under-loaded cells, bandwidth may be superfluous because there are only few users to request services. In order to raise resource utilization of the whole heterogeneous networks, several novel load balancing strategies are proposed, which combine the call ad- mission control policy and multi-hop routing protocol of ad-hoc network for load balancing. These loadbalancing strategies firstly make a decision whether to admit a new call or not by considering some parameters like load index and route cost, etc., and then transfer the denied users into neighboring under-loaded cell with surplus channel according to optimum multi-hop routing algorithm. Simulation results show that the proposed load balancing strategies can distribute traffics to the whole heterogeneous wireless netorks, improve the load balance index efficiently, and avoid the call block phenomenon almost absolutely.
文摘Military tactical network is one of the most important applications of ad hoc network. Currently the existing routing protocols are put forward based on the simple and universal network model which has the ability of multi-hop routing but cannot work efficiently in the special military applications. The narrow bandwidth and limited energy of the wireless network make general routing protocols seem to be more redundant. In order to satisfy military needs properly, this letter makes a detailed analysis of physical nodes and traffic distribution in military network, uses cross-layer design concept tbr reference, combines traffic characteristic of application layer with routing protocol design. It categorized routing problem as crucial routes and non-crucial routes which adopted separate maintenance methods. It not only realizes basic transmission function but also works efficiently. It is quite fit for military application.
文摘In Wireless Sensor Network (WSNs), sensor nodes collect data and send them to a Base Station (BS) for further processing. One of the most issues in WSNs that researchers have proposed a hundred of technique to solve its impact is the energy constraint since sensor nodes have small battery, small memory and less data processing with low computational capabilities. However, many researches efforts have focused on how to prolong the battery lifetime of sensor nodes by proposing different routing, MAC, localization, data aggregation, topology construction techniques. In this paper, we will focus on routing techniques which aim to prolonging the network lifetime. Hence, we propose an Energy-Efficient Routing technique in WSNs based on Stationary and Mobile nodes (EERSM). Sensing filed is divided into intersected circles which contain Mobile Nodes (MN). The proposed data aggregation technique via the circular topology will eliminate the redundant data to be sent to the Base Station (BS). MN in each circle will rout packets for their source nodes, and move to the intersected area where another MN is waiting (sleep mode) to receive the transmitted packet, and then the packet will be delivered to the next intersected area until the packet is arrived to the BS. Our proposed EERSM technique is simulated using MATLAB and compared with conventional multi-hop techniques under different network models and scenarios. In the simulation, we will show how the proposed EERSM technique overcomes many routing protocols in terms of the number of hops counted when sending packets from a source node to the destination (i.e. BS), the average residual energy, number of sent packets to the BS, and the number of a live sensor nodes verse the simulation rounds.
基金Supported by National Natural Science Foundation of P. R. China (60374072, 60434030)
文摘Lossy link is one of the unique characteristics in random-deployed sensor networks. We envision that robustness and reliability of routing cannot be ensured purely in network layer. Our idea is to enhance the performance of routing protocol by cross-layer interaction. We modified mint protocol, a routing protocol in TinyOS and proposed an enhanced version of mint called PA-mint. A transmission power control interface is added to network layer in PA-mint. When routing performance of the current network is not satisfied, PA-mint monotonically increases the transmission power via the interface we added. PA-mint is able to connect orphan nodes and robust to node mobility or key nodes failure. In the case that automatic request retransmission is employed, the number of retransmissions can be reduced by PA-mint. Results from experiments show that PA-mint increases the reliability and robustness of routing protocol by cross-layer interaction.
基金The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work under grant number(RGP 2/142/43)Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2022R237)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:(22UQU4310373DSR14).
文摘Wireless Sensor Networks(WSN)has evolved into a key technology for ubiquitous living and the domain of interest has remained active in research owing to its extensive range of applications.In spite of this,it is challenging to design energy-efficient WSN.The routing approaches are leveraged to reduce the utilization of energy and prolonging the lifespan of network.In order to solve the restricted energy problem,it is essential to reduce the energy utilization of data,transmitted from the routing protocol and improve network development.In this background,the current study proposes a novel Differential Evolution with Arithmetic Optimization Algorithm Enabled Multi-hop Routing Protocol(DEAOA-MHRP)for WSN.The aim of the proposed DEAOA-MHRP model is select the optimal routes to reach the destination in WSN.To accomplish this,DEAOA-MHRP model initially integrates the concepts of Different Evolution(DE)and Arithmetic Optimization Algorithms(AOA)to improve convergence rate and solution quality.Besides,the inclusion of DE in traditional AOA helps in overcoming local optima problems.In addition,the proposed DEAOA-MRP technique derives a fitness function comprising two input variables such as residual energy and distance.In order to ensure the energy efficient performance of DEAOA-MHRP model,a detailed comparative study was conducted and the results established its superior performance over recent approaches.
基金the National Key Research and Development Program of China under Grant No.2016YFC1400200in part by the Basic Research Program of Science and Technology of Shenzhen,China under Grant No.JCYJ20190809161805508+2 种基金in part by the Fundamental Research Funds for the Central Universities of China under Grant No.20720200092in part by the Xiamen University’s Honors Program for Undergraduates in Marine Sciences under Grant No.22320152201106in part by the National Natural Science Foundation of China under Grants No.41476026,41976178 and 61801139。
文摘Routing plays a critical role in data transmission for underwater acoustic sensor networks(UWSNs)in the internet of underwater things(IoUT).Traditional routing methods suffer from high end-toend delay,limited bandwidth,and high energy consumption.With the development of artificial intelligence and machine learning algorithms,many researchers apply these new methods to improve the quality of routing.In this paper,we propose a Qlearning-based multi-hop cooperative routing protocol(QMCR)for UWSNs.Our protocol can automatically choose nodes with the maximum Q-value as forwarders based on distance information.Moreover,we combine cooperative communications with Q-learning algorithm to reduce network energy consumption and improve communication efficiency.Experimental results show that the running time of the QMCR is less than one-tenth of that of the artificial fish-swarm algorithm(AFSA),while the routing energy consumption is kept at the same level.Due to the extremely fast speed of the algorithm,the QMCR is a promising method of routing design for UWSNs,especially for the case that it suffers from the extreme dynamic underwater acoustic channels in the real ocean environment.
基金Supported by the National Natural Science Foundation of China （No. 60903156）, and the National Science and Technology Major Project of the Ministry of Science and Technology of China （No. 2010ZX03004-001-02）.
文摘Network coding has been considered as one of the effective strategies that improve the throughput of multi- hop wireless networks. In order to effectively apply network coding techniques to the real multi-hop wireless networks, a practical network coding aware routing protocol is proposed in this paper, for unicast sessions in multi- hop wireless networks. The protocol is based on a novel routing metric design that captures the characteristics of network coding and unicast sessions. To ensure the novel routing mettle can operate with practical and widely available path calculation algorithms, a unique mapping process is used to map a real wireless network to a virtual network. The mapping process ensures that the paths with the biggest coding opportunities will be selected by commonly used path calculation algorithms. Simulation results show that the proposed routing protocol is effective to improve the network throughput.
基金National Key Research and Development Program(2021YFB2900604)。
文摘Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.
基金supported by the National Science and Technology Major Projects under Grant No.2011ZX03001-007-03
文摘Opportunistic routing(OR) is an effective way to guarantee transmission reliability in wireless multi-hop networks.However,little research focuses on transmission efficiency.Thus,an analytical model based on open queuing network with Markov chains was proposed to evaluate the efficiency.By analyzing two typical ORs,we find duplicate transmission and collision avoidance overhead are the root reasons behind inefficiency.Therefore,a new scheme called dual priority cooperative opportunistic routing(DPCOR) was proposed.In DPCOR,forwarding candidates are configured with dual priority,which enables the network to classify forwarding candidates more effectively so as to reduce the back-off time and obtain more diversity gain.Theoretical analysis and simulation results show DPCOR achieves significant performance improvement with less time overhead compared with traditional routings and typical ORs.
基金supported in part by the National Natural Science Foundation of China under Grant U23A20300 and 62072351in part by the Key Research Project of Shaanxi Natural Science Foundation under Grant 2023-JC-ZD-35+1 种基金in part by the Concept Verification Funding of Hangzhou Institute of Technology of Xidian University under Grant GNYZ2024XX007in part by the 111 Project under Grant B16037.
文摘Cross-domain routing in Integrated Heterogeneous Networks(Inte-HetNet)should ensure efficient and secure data transmission across different network domains by satisfying diverse routing requirements.However,current solutions face numerous challenges in continuously ensuring trustworthy routing,fulfilling diverse requirements,achieving reasonable resource allocation,and safeguarding against malicious behaviors of network operators.We propose CrowdRouting,a novel cross-domain routing scheme based on crowdsourcing,dedicated to establishing sustained trust in cross-domain routing,comprehensively considering and fulfilling various customized routing requirements,while ensuring reasonable resource allocation and effectively curbing malicious behavior of network operators.Concretely,CrowdRouting employs blockchain technology to verify the trustworthiness of border routers in different network domains,thereby establishing sustainable and trustworthy crossdomain routing based on sustained trust in these routers.In addition,CrowdRouting ingeniously integrates a crowdsourcing mechanism into the auction for routing,achieving fair and impartial allocation of routing rights by flexibly embedding various customized routing requirements into each auction phase.Moreover,CrowdRouting leverages incentive mechanisms and routing settlement to encourage network domains to actively participate in cross-domain routing,thereby promoting optimal resource allocation and efficient utilization.Furthermore,CrowdRouting introduces a supervisory agency(e.g.,undercover agent)to effectively suppress the malicious behavior of network operators through the game and interaction between the agent and the network operators.Through comprehensive experimental evaluations and comparisons with existing works,we demonstrate that CrowdRouting excels in providing trustworthy and fine-grained customized routing services,stimulating active participation in cross-domain routing,inhibiting malicious operator behavior,and maintaining reasonable resource allocation,all of which outperform baseline schemes.
基金supported by the National Natural Science Foundation of China (61271182)the National Natural Science Funds of China for Young Scholar (61302080)
文摘Financial and environment considerations present new trends in wireless network known as green communication. As one of the most promising network architectures, the device-to-device （D2D） communication should take seriously account to the energy-efficiency. Most of the existing work in the area of D2D communication only focus on the direct communication, however, the direct link D2D communication has to be limited in practice because of long distance, poor propagation medium and cellular interference, etc. A new energy-efficient multi-hop routing algorithm was investigated for multi-hop D2D system by jointly optimizing channel reusing and power allocation. Firstly, the energy-efficient multi-hop routing problem was formulated as a combinatorial optimization problem. Secondly, to obtain a desirable solution with reasonable computation cost, a heuristic multi-hop routing algorithm was presented to solve the formulated problem and to achieve a satisfactory energy-efficiency performance. Simulation shows the effectiveness of the proposed routing algorithm.
文摘This paper systematically reviews the latest research developments in Vehicle Routing Problems(VRP).It examines classical VRP models and their classifications across different dimensions,including load capacity,operational characteristics,optimization objectives,vehicle types,and time constraints.Based on literature retrieval results from the Web of Science database,the paper analyzes the current state and trends in VRP research,providing detailed explanations of VRP models and algorithms applied to various scenarios in recent years.Additionally,the article discusses limitations in existing research and provides perspectives on future development trends in VRP research.This review offers researchers in the VRP field a comprehensive overview while identifying future research directions.
文摘This paper proposes an efficient strategy for resource utilization in Elastic Optical Networks (EONs) to minimize spectrum fragmentation and reduce connection blocking probability during Routing and Spectrum Allocation (RSA). The proposed method, Dynamic Threshold-Based Routing and Spectrum Allocation with Fragmentation Awareness (DT-RSAF), integrates rerouting and spectrum defragmentation as needed. By leveraging Yen’s shortest path algorithm, DT-RSAF enhances resource utilization while ensuring improved service continuity. A dynamic threshold mechanism enables the algorithm to adapt to varying network conditions, while its fragmentation awareness effectively mitigates spectrum fragmentation. Simulation results on NSFNET and COST 239 topologies demonstrate that DT-RSAF significantly outperforms methods such as K-Shortest Path Routing and Spectrum Allocation (KSP-RSA), Load Balanced and Fragmentation-Aware (LBFA), and the Invasive Weed Optimization-based RSA (IWO-RSA). Under heavy traffic, DT-RSAF reduces the blocking probability by up to 15% and achieves lower Bandwidth Fragmentation Ratios (BFR), ranging from 74% to 75%, compared to 77% - 80% for KSP-RSA, 75% - 77% for LBFA, and approximately 76% for IWO-RSA. DT-RSAF also demonstrated reasonable computation times compared to KSP-RSA, LBFA, and IWO-RSA. On a small-sized network, its computation time was 8710 times faster than that of Integer Linear Programming (ILP) on the same network topology. Additionally, it achieved a similar execution time to LBFA and outperformed IWO-RSA in terms of efficiency. These results highlight DT-RSAF’s capability to maintain large contiguous frequency blocks, making it highly effective for accommodating high-bandwidth requests in EONs while maintaining reasonable execution times.
文摘As commercial drone delivery becomes increasingly popular,the extension of the vehicle routing problem with drones(VRPD)is emerging as an optimization problem of inter-ests.This paper studies a variant of VRPD in multi-trip and multi-drop(VRP-mmD).The problem aims at making schedules for the trucks and drones such that the total travel time is minimized.This paper formulate the problem with a mixed integer program-ming model and propose a two-phase algorithm,i.e.,a parallel route construction heuristic(PRCH)for the first phase and an adaptive neighbor searching heuristic(ANSH)for the second phase.The PRCH generates an initial solution by con-currently assigning as many nodes as possible to the truck–drone pair to progressively reduce the waiting time at the rendezvous node in the first phase.Then the ANSH improves the initial solution by adaptively exploring the neighborhoods in the second phase.Numerical tests on some benchmark data are conducted to verify the performance of the algorithm.The results show that the proposed algorithm can found better solu-tions than some state-of-the-art methods for all instances.More-over,an extensive analysis highlights the stability of the pro-posed algorithm.
基金funded by the National Natural Science Foundation of China,grant numbers(62272007,62001007)the Natural Science Foundation of Beijing,grant numbers(4234083,4212018)The authors also extend their appreciation to King Khalid University for funding this work through the Large Group Project under grant number RGP.2/373/45.
文摘Border Gateway Protocol(BGP),as the standard inter-domain routing protocol,is a distance-vector dynamic routing protocol used for exchanging routing information between distributed Autonomous Systems(AS).BGP nodes,communicating in a distributed dynamic environment,face several security challenges,with trust being one of the most important issues in inter-domain routing.Existing research,which performs trust evaluation when exchanging routing information to suppress malicious routing behavior,cannot meet the scalability requirements of BGP nodes.In this paper,we propose a blockchain-based trust model for inter-domain routing.Our model achieves scalability by allowing the master node of an AS alliance to transmit the trust evaluation data of its member nodes to the blockchain.The BGP nodes can expedite the trust evaluation process by accessing a global view of other BGP nodes through the master node of their respective alliance.We incorporate security service evaluation before direct evaluation and indirect recommendations to assess the security services that BGP nodes provide for themselves and prioritize to guarantee their security of routing service.We forward the trust evaluation for neighbor discovery and prioritize the nodes with high trust as neighbor nodes to reduce the malicious exchange routing behavior.We use simulation software to simulate a real BGP environments and employ a comparative experimental research approach to demonstrate the performance evaluation of our trust model.Compared with the classical trust model,our trust model not only saves more storage overhead,but also provides higher security,especially reducing the impact of collusion attacks.
文摘The Internet of Things (IoT) integrates diverse devices into the Internet infrastructure, including sensors, meters, and wearable devices. Designing efficient IoT networks with these heterogeneous devices requires the selection of appropriate routing protocols, which is crucial for maintaining high Quality of Service (QoS). The Internet Engineering Task Force’s Routing Over Low Power and Lossy Networks (IETF ROLL) working group developed the IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) to meet these needs. While the initial RPL standard focused on single-metric route selection, ongoing research explores enhancing RPL by incorporating multiple routing metrics and developing new Objective Functions (OFs). This paper introduces a novel Objective Function (OF), the Reliable and Secure Objective Function (RSOF), designed to enhance the reliability and trustworthiness of parent selection at both the node and link levels within IoT and RPL routing protocols. The RSOF employs an adaptive parent node selection mechanism that incorporates multiple metrics, including Residual Energy (RE), Expected Transmission Count (ETX), Extended RPL Node Trustworthiness (ERNT), and a novel metric that measures node failure rate (NFR). In this mechanism, nodes with a high NFR are excluded from the parent selection process to improve network reliability and stability. The proposed RSOF was evaluated using random and grid topologies in the Cooja Simulator, with tests conducted across small, medium, and large-scale networks to examine the impact of varying node densities. The simulation results indicate a significant improvement in network performance, particularly in terms of average latency, packet acknowledgment ratio (PAR), packet delivery ratio (PDR), and Control Message Overhead (CMO), compared to the standard Minimum Rank with Hysteresis Objective Function (MRHOF).
基金funded by National Natural Science Foundation of China(No.61741303)Guangxi Natural Science Foundation(No.2017GXNSFAA198161)the Foundation Project of Guangxi Key Laboratory of Spatial Information and Mapping(No.21-238-21-16).
文摘In large-scaleWireless Rechargeable SensorNetworks(WRSN),traditional forward routingmechanisms often lead to reduced energy efficiency.To address this issue,this paper proposes a WRSN node energy optimization algorithm based on regional partitioning and inter-layer routing.The algorithm employs a dynamic clustering radius method and the K-means clustering algorithm to dynamically partition the WRSN area.Then,the cluster head nodes in the outermost layer select an appropriate layer from the next relay routing region and designate it as the relay layer for data transmission.Relay nodes are selected layer by layer,starting from the outermost cluster heads.Finally,the inter-layer routing mechanism is integrated with regional partitioning and clustering methods to develop the WRSN energy optimization algorithm.To further optimize the algorithm’s performance,we conduct parameter optimization experiments on the relay routing selection function,cluster head rotation energy threshold,and inter-layer relay structure selection,ensuring the best configurations for energy efficiency and network lifespan.Based on these optimizations,simulation results demonstrate that the proposed algorithm outperforms traditional forward routing,K-CHRA,and K-CLP algorithms in terms of node mortality rate and energy consumption,extending the number of rounds to 50%node death by 11.9%,19.3%,and 8.3%in a 500-node network,respectively.
文摘Underwater Wireless Sensor Networks(UWSNs)are gaining popularity because of their potential uses in oceanography,seismic activity monitoring,environmental preservation,and underwater mapping.Yet,these networks are faced with challenges such as self-interference,long propagation delays,limited bandwidth,and changing network topologies.These challenges are coped with by designing advanced routing protocols.In this work,we present Under Water Fuzzy-Routing Protocol for Low power and Lossy networks(UWF-RPL),an enhanced fuzzy-based protocol that improves decision-making during path selection and traffic distribution over different network nodes.Our method extends RPL with the aid of fuzzy logic to optimize depth,energy,Received Signal Strength Indicator(RSSI)to Expected Transmission Count(ETX)ratio,and latency.Theproposed protocol outperforms other techniques in that it offersmore energy efficiency,better packet delivery,lowdelay,and no queue overflow.It also exhibits better scalability and reliability in dynamic underwater networks,which is of very high importance in maintaining the network operations efficiency and the lifetime of UWSNs optimized.Compared to other recent methods,it offers improved network convergence time(10%–23%),energy efficiency(15%),packet delivery(17%),and delay(24%).
文摘Subarea Tree Routing (STR), a new routing protocol for multi-hop wireless ad hoc networks, is proposed. The novelty of the STR protocol is to divide the whole network into many subareas constructed as a result of establishing subarea trees. Its main idea is to identify root nodes by manual configuration or auto-discovery process firstly, then the root nodes originate the process of establishing subarea trees, and finally each node either joins in a subarea tree or become an interconnect node. STR belongs to hierarchical routing protocol and does not attempt to consistently maintain routing information in every node. Furthermore, through the use of tree’s intrinsic routing function, the STR protocol exhibits hybrid behavior of proactive and on-demand routing protocols. We prove the correctness of STR, and our simulation results show that the pro-posed scheme achieves lower route discovery delays, lower route discovery load and better performance of normalized routing load in large, mobile, ad hoc networks as compared with AODV.
