Routing algorithms in satellite constellation networks usually make use of the local state information to adapt to the topology and traffic dynamics,since it’s difficult to obtain the global states in time due to the...Routing algorithms in satellite constellation networks usually make use of the local state information to adapt to the topology and traffic dynamics,since it’s difficult to obtain the global states in time due to the spatial large-scale feature of constellation networks.Furthermore,they use different range of local states and give these states distinct weights.However,the behind design criterion is ambiguous and often based on experience.This paper discusses the problem from the perspective of complex network.A universal local-state routing model with tunable parameters is presented to generalize the common characteristics of local-state routing algorithms for satellite constellation networks.Based on this,the impacts of localstate routing algorithms on performance and the correlation between routing and traffic dynamics are analyzed in detail.Among them,the tunable parameters,the congestion propagation process,the critical packet sending rate,and the network robustness are discussed respectively.Experimental results show that routing algorithms can achieve a satisfactory performance by maintaining a limited state awareness capability and obtaining the states in a range below the average path length.This provides a valuable design basis for routing algorithms in satellite constellation networks.展开更多
A novel scheme is presented to integrate mobile ad hoc networks (MANETs) with the lnternet and support mobility across wireless local area networks (WLANs) and MANETs. The mobile nodes, connected as a MANET, emplo...A novel scheme is presented to integrate mobile ad hoc networks (MANETs) with the lnternet and support mobility across wireless local area networks (WLANs) and MANETs. The mobile nodes, connected as a MANET, employ the optimize d link state routing (OLSR) protocol for routing within the MANET. Mobility management across WLANs and MANETs is achieved through the hierarchical mobile IPv6 (HMIPv6) protocol. The performance is evaluated on a HMIPv6 based test-bed composed of WLANs and MANETs. The efficiency gain obtained from using HMIPv6 in such a hybrid network is investigated. The investigation result shows that the use of HMIPv6 can achieve up to 27% gain on reducing the handoff latency when a mobile roams within a domain. Concerning the reduction of the signaling load on the lnternet, the use of HMIPv6 can achieve at least a 54% gain and converges to 69%.展开更多
An operational backbone network is connected with many routers and other devices. Identifying faults in the network is very difficult, so a fault localization mechanism is necessary to identify fault and alleviate it ...An operational backbone network is connected with many routers and other devices. Identifying faults in the network is very difficult, so a fault localization mechanism is necessary to identify fault and alleviate it and correct the faults in order to reduce the network performance degradation. A risk model needs to be devised based on the dynamic database by creating alternate path and the network is reconfigured by identifying dynamic paths. In this paper, an on-demand link state routing approach is used for handling failures in IP backbone networks and a localization algorithm is used to improve QOS parameters based on threshold value of gateway. It is proved that on-demand link state routing guarantees loop-free forwarding to reachable destinations regardless of the number of failures in the network, and in case of localization algorithm using modification process packet loss is avoided based on threshold value of gateway. Heuristic algorithm is also used for reconfiguration of dynamic path for effective fault localization. In this paper, in order to change the traffic condition, reconfiguration strategic is dynamically used. Dijikstra’s shortest path algorithm has been used to determine the shortest path between node pairs. Using risk modeling mechanism, a small set of candidate faults is identified. The concept of Fault Localization is used to minimize the fault occurring in the node and sends original path to node pairs. The localization algorithm based on MODIFICATION PROCESS, packet loss is avoided in the network by checking threshold value of gateway. If the threshold value is maximum, router directly forwards the packet to destination through gateway and if the threshold value is minimum, router compresses the packet and forwards the packet to destination with notification via gateway.展开更多
Quantum multi-hop teleportation is important in the field of quantum communication. In this study, we propose a quantum multi-hop communication model and a quantum routing protocol with multi- hop teleportation for wi...Quantum multi-hop teleportation is important in the field of quantum communication. In this study, we propose a quantum multi-hop communication model and a quantum routing protocol with multi- hop teleportation for wireless mesh backbone networks. Based on an analysis of quantum multi-hop protocols, a partially entangled Greenberger-Horne-Zeilinger (GHZ) state is selected as the quantum channel for the proposed protocol. Both quantum and classical wireless channels exist between two neighboring nodes along the route. With the proposed routing protocol, quantum information can be transmitted hop by hop from the source node to the destination node. Based on multi-hop telepor- tation based on the partially entangled GHZ state, a quantum route established with the minimum number of hops. The difference between our routing protocol and the classical one is that in the for- mer, the processes used to find a quantum route and establish quantum channel entanglement occur simultaneously. The Bell state measurement results of each hop are piggybacked to quantum route finding information. This method reduces the total number of packets and the magnitude of air inter- face delay. The deduction of the establishment of a quantum channel between source and destination is also presented here. The final success probability of quantum multi-hop teleportation in wireless mesh backbone networks was simulated and analyzed. Our research shows that quantum multi-hop teleportation in wireless mesh backbone networks through a partially entangled GHZ state is feasible.展开更多
There is a lack of appropriate guidelines for realistic user traces, mobility models, routing protocols, considerations of real-life challenges, etc. for general-purpose mobile ad hoc networks (MANET). In this paper...There is a lack of appropriate guidelines for realistic user traces, mobility models, routing protocols, considerations of real-life challenges, etc. for general-purpose mobile ad hoc networks (MANET). In this paper, four laptops are used in an open field environment in four scenarios to evaluate the performances of Internet control message protocol (ICMP) based ping and transmission control protocol (TCP) based streaming video applications using optimised link state routing (OLSR) implementation in an IEEE 802.11g wireless network. Corresponding simulations are developed in Network Simulator ns-2 by setting simulation parameters according to the real experiments. Difficulties faced to regenerate real-life scenarios have been discussed and the gaps between reality and simulation are identified. A setup guideline to produce realistic simulation results has been established.展开更多
基金supported in part by the National Natural Science Foundation of China under Grant 62171466and the National Natural Science Foundation of China under Grant 61971440+1 种基金the National Key R&D Program of China under Grant 2018YFB1801103the Natural Science Foundation on Frontier Leading Technology Basic Research Project of Jiangsu under Grant BK20192002。
文摘Routing algorithms in satellite constellation networks usually make use of the local state information to adapt to the topology and traffic dynamics,since it’s difficult to obtain the global states in time due to the spatial large-scale feature of constellation networks.Furthermore,they use different range of local states and give these states distinct weights.However,the behind design criterion is ambiguous and often based on experience.This paper discusses the problem from the perspective of complex network.A universal local-state routing model with tunable parameters is presented to generalize the common characteristics of local-state routing algorithms for satellite constellation networks.Based on this,the impacts of localstate routing algorithms on performance and the correlation between routing and traffic dynamics are analyzed in detail.Among them,the tunable parameters,the congestion propagation process,the critical packet sending rate,and the network robustness are discussed respectively.Experimental results show that routing algorithms can achieve a satisfactory performance by maintaining a limited state awareness capability and obtaining the states in a range below the average path length.This provides a valuable design basis for routing algorithms in satellite constellation networks.
文摘A novel scheme is presented to integrate mobile ad hoc networks (MANETs) with the lnternet and support mobility across wireless local area networks (WLANs) and MANETs. The mobile nodes, connected as a MANET, employ the optimize d link state routing (OLSR) protocol for routing within the MANET. Mobility management across WLANs and MANETs is achieved through the hierarchical mobile IPv6 (HMIPv6) protocol. The performance is evaluated on a HMIPv6 based test-bed composed of WLANs and MANETs. The efficiency gain obtained from using HMIPv6 in such a hybrid network is investigated. The investigation result shows that the use of HMIPv6 can achieve up to 27% gain on reducing the handoff latency when a mobile roams within a domain. Concerning the reduction of the signaling load on the lnternet, the use of HMIPv6 can achieve at least a 54% gain and converges to 69%.
文摘An operational backbone network is connected with many routers and other devices. Identifying faults in the network is very difficult, so a fault localization mechanism is necessary to identify fault and alleviate it and correct the faults in order to reduce the network performance degradation. A risk model needs to be devised based on the dynamic database by creating alternate path and the network is reconfigured by identifying dynamic paths. In this paper, an on-demand link state routing approach is used for handling failures in IP backbone networks and a localization algorithm is used to improve QOS parameters based on threshold value of gateway. It is proved that on-demand link state routing guarantees loop-free forwarding to reachable destinations regardless of the number of failures in the network, and in case of localization algorithm using modification process packet loss is avoided based on threshold value of gateway. Heuristic algorithm is also used for reconfiguration of dynamic path for effective fault localization. In this paper, in order to change the traffic condition, reconfiguration strategic is dynamically used. Dijikstra’s shortest path algorithm has been used to determine the shortest path between node pairs. Using risk modeling mechanism, a small set of candidate faults is identified. The concept of Fault Localization is used to minimize the fault occurring in the node and sends original path to node pairs. The localization algorithm based on MODIFICATION PROCESS, packet loss is avoided in the network by checking threshold value of gateway. If the threshold value is maximum, router directly forwards the packet to destination through gateway and if the threshold value is minimum, router compresses the packet and forwards the packet to destination with notification via gateway.
基金This project was supported by the Na- tional Natural Science Foundation of China (Grant No. 6157110 and No. 61601120), the Prospective Future Network Project of the Jiangsu Province, China (Grant No. BY2013095-1-18), and the In- dependent Project of State Key Laboratory of Millimeter Waves (Grant No. Z201504).
文摘Quantum multi-hop teleportation is important in the field of quantum communication. In this study, we propose a quantum multi-hop communication model and a quantum routing protocol with multi- hop teleportation for wireless mesh backbone networks. Based on an analysis of quantum multi-hop protocols, a partially entangled Greenberger-Horne-Zeilinger (GHZ) state is selected as the quantum channel for the proposed protocol. Both quantum and classical wireless channels exist between two neighboring nodes along the route. With the proposed routing protocol, quantum information can be transmitted hop by hop from the source node to the destination node. Based on multi-hop telepor- tation based on the partially entangled GHZ state, a quantum route established with the minimum number of hops. The difference between our routing protocol and the classical one is that in the for- mer, the processes used to find a quantum route and establish quantum channel entanglement occur simultaneously. The Bell state measurement results of each hop are piggybacked to quantum route finding information. This method reduces the total number of packets and the magnitude of air inter- face delay. The deduction of the establishment of a quantum channel between source and destination is also presented here. The final success probability of quantum multi-hop teleportation in wireless mesh backbone networks was simulated and analyzed. Our research shows that quantum multi-hop teleportation in wireless mesh backbone networks through a partially entangled GHZ state is feasible.
文摘There is a lack of appropriate guidelines for realistic user traces, mobility models, routing protocols, considerations of real-life challenges, etc. for general-purpose mobile ad hoc networks (MANET). In this paper, four laptops are used in an open field environment in four scenarios to evaluate the performances of Internet control message protocol (ICMP) based ping and transmission control protocol (TCP) based streaming video applications using optimised link state routing (OLSR) implementation in an IEEE 802.11g wireless network. Corresponding simulations are developed in Network Simulator ns-2 by setting simulation parameters according to the real experiments. Difficulties faced to regenerate real-life scenarios have been discussed and the gaps between reality and simulation are identified. A setup guideline to produce realistic simulation results has been established.