Considerations on Novel Network Routing Mechanism

Routing is the cornerstone of network architecture, and a new routing mechanism is a requisite for constructing new network architecture. The current routing mechanism of the Internet layer is basically the single next-hop routing mechanism, which is the root of transmission congestion in the network. To solve this congestion problem, a fundamental measure is to change the route selection mode of current routing mechanism to allow parallel transmission over multiple routes. Currently, Border Gateway Protocol (BGP) is the only inter-domain routing protocol used in the Internet, but the routing system using BGP suffers scalability problem. To solve the scalability issue of the current inter-domain routing system, a new hierarchical routing system, i.e. Scalable Inter-Domain Routing Architecture (s-idra), is suggested. In addition to scalability, the current routing system is facing other challenges including security, Quality of Service (QoS), multicasting, mobility and dynamic network topology. Therefore, the research on routing protocols, especially the protocol for the new network architecture, is still a tough task and has a long way to go.

An Ant Colony Algorithm Based on Cross-Layer Design for Routing and Wavelength Assignment in Optical Satellite Networks

This paper introduces an ant colony routing and wavelength assignment algorithm based on cross-layer design(CL-ACRWA),which can overcome the adverse effects of Doppler wavelength shift on data transmission in optical satellite networks. Firstly, a cross-layer optimization model is built, which considers the Doppler wavelength shift, the transmission delay as well as wavelength-continuity constraint. Then an ant colony algorithm is utilized to solve the cross-layer optimization model, resulting in finding an optimal light path satisfying the above constraints for every connection request. The performance of CL-ACRWA is measured by the communication success probability, the convergence property and the transmission delay. Simulation results show that CL-ACRWA performs well in communication success probability and has good global search ability as well as fast convergence speed. Meanwhile, the transmission delay can meet the basic requirement of real-time transmission of business.

Multi-Gradient Routing Protocol for Wireless Sensor Networks

Sensor networks tend to support different traffic patterns since more and more emerging applications have diverse needs. We present MGRP, a Multi-Gradient Routing Protocol for wireless sensor networks, which is fully distributed and efficiently supports endto-end, one-to-many and many-to-one traffic patterns by effectively construct and maintain a gradient vector for each node. We further combine neighbor link estimation with routing information to reduce packet exchange on network dynamics and node failures. We have implemented MGRP on Tiny OS and evaluated its performance on real-world testbeds. The result shows MGRP achieves lower end-to-end packet delay in different traffic patterns compared to the state of the art routing protocols while still remains high packet delivery ratio.

Energy optimal routing for long chain-type wireless sensor networks in underground mines

Wireless sensor networks are useful complements to existing monitoring systems in underground mines. They play an important role of enhancing and improving coverage and flexibility of safety monitoring systems.Regions prone to danger and environments after disasters in underground mines require saving and balancing energy consumption of nodes to prolong the lifespan of networks.Based on the structure of a tunnel,we present a Long Chain-type Wireless Sensor Network（LC-WSN）to monitor the safety of underground mine tunnels.We define the optimal transmission distance and the range of the key region and present an Energy Optimal Routing（EOR）algorithm for LC-WSN to balance the energy consumption of nodes and maximize the lifespan of networks.EOR constructs routing paths based on an optimal transmission distance and uses an energy balancing strategy in the key region.Simulation results show that the EOR algorithm extends the lifespan of a network,balances the energy consumption of nodes in the key region and effectively limits the length of routing paths,compared with similar algorithms.

A Survivability Routing Mechanism in SDN Enabled Wireless Mesh Networks:Design and Evaluation

In software-defined networking,the separation of control plane from forwarding plane introduces new challenges to network reliability.This paper proposes a fault-tolerant routing mechanism to improve survivability by converting the survivability problem into two sub-problems:constructing an elastic-aware routing tree and controller selection.Based on the shortest path tree,this scheme continuously attempts to prune the routing tree to enhance network survivability.After a certain number of iterations,elastic-aware routing continues to improve network resiliency by increasing the number of edges in this tree.Simulation results demonstrate this fault-tolerant mechanism performs better than the traditional method in terms of the number of protected nodes and network fragility indicator.

Cooperative Layer-2 Based Routing Approach for Hybrid Wireless Mesh Networks

In a Wireless Mesh Network(WMN),the convenience of a routing strategy strongly depends on the mobility of the intermediate nodes that compose the paths.Taking this behaviour into account,this paper presents a routing scheme that works differently accordingly to the node mobility.In this sense,a proactive routing scheme is restricted to the backbone to promote the use of stable routes.Conversely,the reactive protocol is used for searching routes to or from a mobile destination.Both approaches are simultaneously implemented in the mesh nodes so that the routing protocols share routing information that optimises the network performance.Aimed at guaranteeing the IP compatibility,the combination of the two protocols in the core routers is carried out in the Medium Access Control(MAC)layer.In contrast to the operation in the IP layer where two routing protocols cannot work concurrently,the transfer of the routing tasks to the MAC layer enables the use of multiple independent forwarding tables.Simulation results show the advantage of the proposal in terms of packet losses and data delay.

Location-Based Routing Algorithms for Wireless Sensor Network

Routing algorithms based on geographical location is an important research subject in the Wireless Sensor Network(WSN).They use location information to guide routing discovery and maintenance as well as packet forwarding,thus enabling the best routing to be selected,reducing energy consumption and optimizing the whole network.Through three aspects involving the flooding restriction scheme,the virtual area partition scheme and the best routing choice scheme,the importance of location information is seen in the routing algorithm.

Energy Based Random Repeat Trust Computation in Delay Tolerant Network

As the use of mobile devices continues to rise,trust administration will significantly improve security in routing the guaranteed quality of service(QoS)supply in Mobile Ad Hoc Networks(MANET)due to the mobility of the nodes.There is no continuance of network communication between nodes in a delay-tolerant network(DTN).DTN is designed to complete recurring connections between nodes.This approach proposes a dynamic source routing protocol(DSR)based on a feed-forward neural network(FFNN)and energybased random repetition trust calculation in DTN.If another node is looking for a node that swerved off of its path in this situation,routing will fail since it won’t recognize it.However,in the suggested strategy,nodes do not stray from their pathways for routing.It is only likely that the message will reach the destination node if the nodes encounter their destination or an appropriate transitional node on their default mobility route,based on their pattern of mobility.The EBRRTC-DTN algorithm(Energy based random repeat trust computation)is based on the time that has passed since nodes last encountered the destination node.Compared to other existing techniques,simulation results show that this process makes the best decision and expertly determines the best and most appropriate route to send messages to the destination node,which improves routing performance,increases the number of delivered messages,and decreases delivery delay.Therefore,the suggested method is better at providing better QoS(Quality of Service)and increasing network lifetime,tolerating network system latency.

Dynamic routing and wavelength assignment algorithm of optical satellite networks based on cross-layer design

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.

Unweighted Voting Method to Detect Sinkhole Attack in RPL-Based Internet of Things Networks

The Internet of Things(IoT)consists of interconnected smart devices communicating and collecting data.The Routing Protocol for Low-Power and Lossy Networks(RPL)is the standard protocol for Internet Protocol Version 6(IPv6)in the IoT.However,RPL is vulnerable to various attacks,including the sinkhole attack,which disrupts the network by manipulating routing information.This paper proposes the Unweighted Voting Method(UVM)for sinkhole node identification,utilizing three key behavioral indicators:DODAG Information Object(DIO)Transaction Frequency,Rank Harmony,and Power Consumption.These indicators have been carefully selected based on their contribution to sinkhole attack detection and other relevant features used in previous research.The UVM method employs an unweighted voting mechanism,where each voter or rule holds equal weight in detecting the presence of a sinkhole attack based on the proposed indicators.The effectiveness of the UVM method is evaluated using the COOJA simulator and compared with existing approaches.Notably,the proposed approach fulfills power consumption requirements for constrained nodes without increasing consumption due to the deployment design.In terms of detection accuracy,simulation results demonstrate a high detection rate ranging from 90%to 100%,with a low false-positive rate of 0%to 0.2%.Consequently,the proposed approach surpasses Ensemble Learning Intrusion Detection Systems by leveraging three indicators and three supporting rules.

Anycast service model and its QoS routing algorithm

In the Internet, a group of replicated servers is commonly used in order to improve the scalability of network service. Anycast service is a new network service that can improve network load distribution and simplify certain applications. In this paper, the authors described a simple anycast service model in the Internet without significant affecting the routing and protocol processing infrastructure that was already in place, and proposed an anycast QoS routing algorithm for this model. The algorithm used randomized method to balance network load and improve its performance. Several new techniques are proposed in the algorithm, first, theminimum hops for each node are used in the algorithm, which are used as metric for computing the probability of possible out links. The metric is pre computed for each node in the network, which can simplify the network complexity and provide the routing process with useful information. Second, randomness is used at the link level and depends dynamically on the routing configuration. This provides great flexibility for the routing process, prevents the routing process from overusing certain fixed routing paths, and adequately balances the delay of the routing path. the authors assess the quality of QoS algorithm in terms of the acceptance ratio on anycast QoS requests, and the simulation results on a variety of network topologies and on various parameters show that the algorithm has good performances and can balance network load effectively.

Analysis of the Chinese air route network as a complex network

The air route network, which supports all the flight activities of the civil aviation, is the most fundamental infrastructure of air traffic management system. In this paper, we study the Chinese air route network （CARN） within the framework of complex networks. We find that CARN is a geographical network possessing exponential degree distribution, low clustering coefficient, large shortest path length and exponential spatial distance distribution that is obviously different from that of the Chinese airport network （CAN）. Besides, via investigating the flight data from 2002 to 2010, we demonstrate that the topology structure of CARN is homogeneous, howbeit the distribution of flight flow on CARN is rather heterogeneous. In addition, the traffic on CARN keeps growing in an exponential form and the increasing speed of west China is remarkably larger than that of east China. Our work will be helpful to better understand Chinese air traffic systems.

Optimization of Air Route Network Nodes to Avoid ″Three Areas″ Based on An Adaptive Ant Colony Algorithm

Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.

Air Route Network Generation Based on Traffic Assignment

Air route network is the carrier of air traffic flow,and traffic assignment is a method to verify the rationality of air route network structure.Therefore,air route network generation based on traffic assignment has been becoming the research focus of airspace programming technology.Based on link prediction technology and optimization theory,a bi-level programming model is established in the paper.The model includes an upper level of air route network generation model and a lower level of traffic assignment model.The air route network structure generation incorporates network topology generation algorithm based on link prediction technology and optimal path search algorithm based on preference,and the traffic assignment adopts NSGA-Ⅲalgorithm.Based on the Python platform NetworkX complex network analysis library,a network of 57 airports,383 nodes,and 635 segments within China Airspace Beijing and Shanghai Flight Information Regions and 187975 sorties of traffic are used to simulate the bilevel model.Compared with the existing air route network,the proposed air route network can decrease the cost by 50.624%,lower the flight conflict coefficient by 33.564%,and reduce dynamic non-linear coefficient by 7.830%.

Multicast routing algorithm of multiple QoS based on widest-bandwidth

A multicast routing algorithm of multiple QoS constraints based on widest-bandwidth （MRQW） which takes available bandwidth as the prime metric, considering the constraints of the surplus energy of the node, delay and delay jitter, is presented. The process of routing based on MRQW is provided for as well. Correctness proof and the complexity analysis of the MRQW are also given in the paper. Simulation results show that the MRQW has a good performance in creating multicast trees. It not only satisfys multiple QoS constraints but also makes multicast links have larger available bandwidth

An energy efficiency clustering routing protocol for WSNs in confined area

Wireless sensor networks (WSNs) are important application for safety monitoring in underground coal mines, which are difficult to monitor due to natural conditions. Based on the characteristic of limited energy for WSNs in confined underground area such as coal face and laneway, we presents an energy- efficient clustering routing protocol based on weight (ECRPW) to prolong the lifetime of networks. ECRPW takes into consideration the nodes' residual energy during the election process of cluster heads. The constraint of distance threshold is used to optimize cluster scheme. Furthermore, the protocol also sets up a routing tree based on cluster heads' weight. The results show that ECRPW had better perfor- mance in energy consumption, death ratio of node and network lifetime.

An Improved FN Algorithm for Community Division of Air Route Network

Community division is an important method to study the characteristics of complex networks.The widely used fast-Newman(FN)algorithm only considers the topology division of the network at the static layer,and dynamic traffic flow demand is ignored.The result of the division is only structurally optimal.To improve the accuracy of community division,based on the static topology of air route network,the concept of network traffic contribution degree is put forward.The concept of operational research is introduced to optimize the network adjacency matrix to form an improved community division algorithm.The air route network in East China is selected as the object of algorithm comparison experiment,including 352 waypoints and 928 segments.The results show that the improved algorithm has a more ideal effect on the division of the community structure.The proportion of the number of nodes included in the large community has increased by 21.3%,and the modularity value has increased from 0.756 to 0.806,in which the modularity value is in the range of[-0.5,1).The research results can provide theoretical and technical support for the optimization of flight schedules and the rational use of air route resources.

Intelligent Space All-Optical Network Technology

Microwave transmission in a space network is greatly restricted due to precious radio spectrum resources. To meet the demand for large-bandwidth, global seamless coverage and on-demanding access, the Space All-Optical Network(SAON) becomes a promising paradigm. In this paper, the related space optical communications and network programs around the world are first briefly introduced. Then the intelligent Space All-Optical Network(i-SAON), which can be deemed as an advanced SAON, is illustrated, with the emphasis on its features of high survivability, sensing and reconfiguration intelligence, and large capacity for all optical load and switching. Moreover, some key technologies for i-SAON are described, including the rapid adjustment and control of the laser beam direction, the deep learning-based multi-path anti-fault routing, the intelligent multi-fault diagnosis and switching selection mechanism, and the artificial intelligence-based spectrum sensing and situational forecasting.

Security in Wireless Mesh Neworks: Challenges and Solutions

Wireless mesh network is a new emerging field with its potential applications in extremely unpredictable and dynamic environments.However,it is particularly vulnerable due to its features of open medium,dynamic changing topology, cooperative routing algorithms.The article surveys the state of the art in security for wireless mesh networks.Firstly,we analyze various possible threats to security in wireless mesh networks.Secondly,we introduce some representative solutions to these threats,including solutions to the problems of key management,secure network routing,and intrusion detection.We also provide a comparison and discussion of their respective merits and drawbacks,and propose some improvements for these drawbacks.Finally,we also discuss the remaining challenges in the area.

Effective local dynamic routing strategy for air route networks

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.