In order to save the energy and reduce the latency of the end-to-end transmission in mobile ad hoc networks an adaptive and distance-driven power control ADPC scheme is proposed by means of distance research in random...In order to save the energy and reduce the latency of the end-to-end transmission in mobile ad hoc networks an adaptive and distance-driven power control ADPC scheme is proposed by means of distance research in random geometrics. Through mathematical proof the optimal number of relay nodes and the optimal location of each node for data transmission can be obtained when a distance is given.In the ADPC first the source node computes the optimal number and the sites of the relay nodes between the source and the destination nodes.Then it searches feasible relay nodes around the optimal virtual relay-sites and selects one link with the minimal total transmission energy consumption for data transmission.Simulation results show that the ADPC can reduce both the energy dissipation and the end-to-end latency of the transmission.展开更多
MANET routing is critical and routing decision should be made sooner before the node leaves the network.Fast decisions always compensate network performance.In addition,most MANET routing protocols assume a friendly a...MANET routing is critical and routing decision should be made sooner before the node leaves the network.Fast decisions always compensate network performance.In addition,most MANET routing protocols assume a friendly and cooperative environment,and hence are vulnerable to various attacks.Trust and Reputation would serve as a major solution to these problems.Learning the network characteristics and choosing right routing decisions at right times would be a significant solution.In this work,we have done an extensive survey of fault tolerant protocols and ant colony algorithms applied to routing in MANETs.We propose a QoS constrained fault tolerant ant lookahead routing algorithm which attempts to identify valid route and look-ahead route pairs which might help in choosing the alternate path in case of valid route failure.The results prove that the proposed algorithm takes better routing decisions with 20-30 percent improvement compared with existing ant colony algorithms.展开更多
Frequent inter-satellite link(ISL)handovers will induce service interruption in large-scale space information networks,since traditional distributed/centralized routing strategy-based route convergence/update will con...Frequent inter-satellite link(ISL)handovers will induce service interruption in large-scale space information networks,since traditional distributed/centralized routing strategy-based route convergence/update will consume considerable time(compared with ground networks)derived from long ISL delay and flooding between hundreds or even thousands of satellites.During the network convergence/update stage,the lack of up-to-date forwarding information may cause severe packet loss.Considering the fact that ISL handovers for close-to-earth constellation are predictable and all the ISL handover information could be stored in each satellite during the network initialization,we propose a self-update routing scheme based on open shortest path first(OSPF-SUR)to address the slow route convergence problem caused by frequent ISL handovers.First,for predictable ISL handovers,forwarding tables are updated according to locally stored ISL handover information without link state advertisement(LSA)flooding.Second,for unexpected ISL failures,flooding could be triggered to complete route convergence.In this manner,network convergence time is radically descended by avoiding unnecessary LSA flooding for predictable ISL handovers.Simulation results show that the average packet loss rate caused by ISL handovers is reduced by 90.5%and 61.3%compared with standard OSPF(with three Hello packets confirmation)and OSPF based on interface state(without three Hello packets confirmation),respectively,during a period of topology handover.And the average endto-end delay is also decreased by 47.6%,9.6%,respectively.The packet loss rate of the proposed OSPF-SUR does not change along with the increase of the frequency of topology handovers.展开更多
Mobile Ad hoc Networks(MANETs) play an important role in emergency communications where network needs to be constructed temporarily and quickly.Since the nodes move randomly,routing protocols must be highly effective ...Mobile Ad hoc Networks(MANETs) play an important role in emergency communications where network needs to be constructed temporarily and quickly.Since the nodes move randomly,routing protocols must be highly effective and reliable to guarantee successful packet delivery.Based on the data delivery structure,most of the existing multicast routing protocols can be classified into two folders:tree-based and mesh-based.We observe that tree-based ones have high forwarding efficiency and low consumptions of bandwidth,and they may have poor robustness because only one link exists between two nodes.As a treebased multicast routing protocol,MAODV(Multicast Ad hoc On-demand Vector) shows an excellent performance in lightweight ad hoc networks.As the load of network increases,QoS(Quality of Service) is degraded obviously.In this paper,we analyze the impact of network load on MAODV protocol,and propose an optimized protocol MAODV-BB(Multicast Ad hoc On-demand Vector with Backup Branches),which improves robustness of the MAODV protocol by combining advantages of the tree structure and the mesh structure.It not only can update shorter tree branches but also construct a multicast tree with backup branches.Mathematical analysis and simulation results both demonstrate that the MAODV-BB protocol improves the network performance over conventional MAODV in heavy load ad hoc networks.展开更多
Optical Orthogonal Frequency Division Multiplexing (OOFDM) has been proposed as a highly spectrum-efficient modulation technique, which can provide flexible spectrum assignment with fine granularity. In OOFDM-based fl...Optical Orthogonal Frequency Division Multiplexing (OOFDM) has been proposed as a highly spectrum-efficient modulation technique, which can provide flexible spectrum assignment with fine granularity. In OOFDM-based flexible optical networks, Routing and Spectrum Assignment (RSA) has become a key problem. However, widely used dynamic RSA schemes, such as Fixed Routing (FR) and K-shortest Paths (KSP) routing schemes, are not able to realize route computation based on the link state information, thus leading to poor blocking performance and inefficient resource utilization. To solve this problem, Adaptive Routing (AR) schemes, e.g., the Entire Path Searching (EPS) scheme, have been proposed recently. These schemes have low blocking probability; however, since their computational complexities are factorial, they are not suitable for use in real networks. In this paper, we propose a novel Spectrum-Scan Routing (SSR) scheme in dynamic flexible optical networks. To the best of our knowledge, SSR is the first polynomial-time AR scheme that can realize adaptive shortest-route computation. Simulation results show that our proposed SSR scheme has lower blocking probability and higher resource utilization compared with FR and EPS. Moreover, the worst-case computational complexity of SSR increases linearly with the network scale of the torus topologies, making it applicable to real networks.展开更多
In CNC machining, two essential components decide the accuracy and machining time for a sculptured surface: one is the step-size interval, the other is the tool-path interval. Due to the limitation of the conventional...In CNC machining, two essential components decide the accuracy and machining time for a sculptured surface: one is the step-size interval, the other is the tool-path interval. Due to the limitation of the conventional method for calculating the tool-path interval, it cannot satisfy the machining requirement for high-speed and high-resolution machining. Accordingly, for high-speed and high-resolution machining, the current study proposes a new tool-path interval algorithm, plus a variable step-size algorithm for NURBS. Furthermore, a new type cutter, which can improve the cutting efficiency, is investigated in the paper. The transversal equation of the torus cutter onto the flat plan is given in this paper. The tool-path interval is calculated with the transversal equation and the proposed algorithm. The illustrated example shows that the redundant tool paths can be reduced because an accurate tool-path interval could be calculated.展开更多
A graph is called claw-free if it does not contain a claw as its induced subgraph.In this paper, we prove the following results:1)If G is a 2-connected claw-free graph on n vertices,then for any vertex v and any two d...A graph is called claw-free if it does not contain a claw as its induced subgraph.In this paper, we prove the following results:1)If G is a 2-connected claw-free graph on n vertices,then for any vertex v and any two distinct vertices x and y in V(G)-{v},G has a path containing v and all neighbors of v and connecting x and y;2) Let C be the longest cycle in a 3-connected claw-free graph G and H a component of G-C,and if H is connected but not 2-connected,then there exist nonadjacent vertices u and v in H such that |V(C)|≥(3(d(u)+)d(v))-2.展开更多
A self-adapting and reconfigurable routing mechanism is proposed according to the average moving speed of the nodes in mobile ad hoc network （MANET）. This mechanism is based on the perception of moving speed and a p...A self-adapting and reconfigurable routing mechanism is proposed according to the average moving speed of the nodes in mobile ad hoc network （MANET）. This mechanism is based on the perception of moving speed and a predesigned selection metric to choose the optimal routing protocol. The routing evaluation and selection metric is derived by OPNET simulations. AODV and OLSR are used as the example to show the process of this mechanism with the moving speed varying. The routing protocol can be configured without central configuration and human management. Besides, the overhead of the mechanism is reasonable and doesnot affect the quality of service （QoS） of the traffic in the network. Results show that the optimal routing protocol can be configured adaptively according to the speed so that better performance than end-to-end delay and packet delivery ratio. a specific protocol can be obtained in terms of展开更多
As a country with the strongest economic strength and the largest land area in Central Asia, Kazakhstan is also the advocacy and ＂core nation＂ of the SCO with China. Taking full advantage of the existing SCO economi...As a country with the strongest economic strength and the largest land area in Central Asia, Kazakhstan is also the advocacy and ＂core nation＂ of the SCO with China. Taking full advantage of the existing SCO economic cooperation mechanism and using Kazakhstan as the starting point to speed up the coordinated development of the Silk Road Economic Belt and regional trade is an important measure to speed up the implementation of the strategy of China＇s free trade agreement and to co-ordinate the overall new pattern of opening up. The strategic concept of ＂One Belt and One Road＂ is of great significance for promoting the development of trade liberalization in China and Central Asia and for enhancing China＇s strategic position in the global trade pattern.展开更多
To solve the routing and wavelength assignment problem in the optical network, this paper put forward the metric model with sparse wavelength conversion and routing algorithm with pruning （RAP） in order to efficient...To solve the routing and wavelength assignment problem in the optical network, this paper put forward the metric model with sparse wavelength conversion and routing algorithm with pruning （RAP） in order to efficiently realize the resource management in the unified way. Related methods with dynamic and adaptation characters considered the link state conditions and certain heuristic information. They can be applied to current network environments. In particular, the simulation was made according to the selfsimilar traffic and the results showed that the corresponding methods not only provided service differentiation but also reduced the overall average blocking Drobabilitv.展开更多
基金The National Basic Research Program of China(973 Program)(No.2009CB320501)the National Natural Science Foundation of China(No.61370209,61272532)the Natural Science Foundation of Jiangsu Province(No.BK2010414,BK2011335)
文摘In order to save the energy and reduce the latency of the end-to-end transmission in mobile ad hoc networks an adaptive and distance-driven power control ADPC scheme is proposed by means of distance research in random geometrics. Through mathematical proof the optimal number of relay nodes and the optimal location of each node for data transmission can be obtained when a distance is given.In the ADPC first the source node computes the optimal number and the sites of the relay nodes between the source and the destination nodes.Then it searches feasible relay nodes around the optimal virtual relay-sites and selects one link with the minimal total transmission energy consumption for data transmission.Simulation results show that the ADPC can reduce both the energy dissipation and the end-to-end latency of the transmission.
文摘MANET routing is critical and routing decision should be made sooner before the node leaves the network.Fast decisions always compensate network performance.In addition,most MANET routing protocols assume a friendly and cooperative environment,and hence are vulnerable to various attacks.Trust and Reputation would serve as a major solution to these problems.Learning the network characteristics and choosing right routing decisions at right times would be a significant solution.In this work,we have done an extensive survey of fault tolerant protocols and ant colony algorithms applied to routing in MANETs.We propose a QoS constrained fault tolerant ant lookahead routing algorithm which attempts to identify valid route and look-ahead route pairs which might help in choosing the alternate path in case of valid route failure.The results prove that the proposed algorithm takes better routing decisions with 20-30 percent improvement compared with existing ant colony algorithms.
基金the National Natural Science Foundations of China(Nos.61771074,62171059)。
文摘Frequent inter-satellite link(ISL)handovers will induce service interruption in large-scale space information networks,since traditional distributed/centralized routing strategy-based route convergence/update will consume considerable time(compared with ground networks)derived from long ISL delay and flooding between hundreds or even thousands of satellites.During the network convergence/update stage,the lack of up-to-date forwarding information may cause severe packet loss.Considering the fact that ISL handovers for close-to-earth constellation are predictable and all the ISL handover information could be stored in each satellite during the network initialization,we propose a self-update routing scheme based on open shortest path first(OSPF-SUR)to address the slow route convergence problem caused by frequent ISL handovers.First,for predictable ISL handovers,forwarding tables are updated according to locally stored ISL handover information without link state advertisement(LSA)flooding.Second,for unexpected ISL failures,flooding could be triggered to complete route convergence.In this manner,network convergence time is radically descended by avoiding unnecessary LSA flooding for predictable ISL handovers.Simulation results show that the average packet loss rate caused by ISL handovers is reduced by 90.5%and 61.3%compared with standard OSPF(with three Hello packets confirmation)and OSPF based on interface state(without three Hello packets confirmation),respectively,during a period of topology handover.And the average endto-end delay is also decreased by 47.6%,9.6%,respectively.The packet loss rate of the proposed OSPF-SUR does not change along with the increase of the frequency of topology handovers.
基金This work is supported by the NSFC （National Natural Science Foundation of China） No. 61371068 and No. 61172130, the National 863 program No.2011AA11A102-04-02 and Shenzhen Technology Research and Development Program No. CXZZ20120830100839333.
文摘Mobile Ad hoc Networks(MANETs) play an important role in emergency communications where network needs to be constructed temporarily and quickly.Since the nodes move randomly,routing protocols must be highly effective and reliable to guarantee successful packet delivery.Based on the data delivery structure,most of the existing multicast routing protocols can be classified into two folders:tree-based and mesh-based.We observe that tree-based ones have high forwarding efficiency and low consumptions of bandwidth,and they may have poor robustness because only one link exists between two nodes.As a treebased multicast routing protocol,MAODV(Multicast Ad hoc On-demand Vector) shows an excellent performance in lightweight ad hoc networks.As the load of network increases,QoS(Quality of Service) is degraded obviously.In this paper,we analyze the impact of network load on MAODV protocol,and propose an optimized protocol MAODV-BB(Multicast Ad hoc On-demand Vector with Backup Branches),which improves robustness of the MAODV protocol by combining advantages of the tree structure and the mesh structure.It not only can update shorter tree branches but also construct a multicast tree with backup branches.Mathematical analysis and simulation results both demonstrate that the MAODV-BB protocol improves the network performance over conventional MAODV in heavy load ad hoc networks.
基金supported in part by projects of National 863 Program under Grant No.2012AA011301National 973 Program under Grants No. 2010CB328203, No. 2010CB328205National Natural Science Foundation of China under Grant No. 61201188
文摘Optical Orthogonal Frequency Division Multiplexing (OOFDM) has been proposed as a highly spectrum-efficient modulation technique, which can provide flexible spectrum assignment with fine granularity. In OOFDM-based flexible optical networks, Routing and Spectrum Assignment (RSA) has become a key problem. However, widely used dynamic RSA schemes, such as Fixed Routing (FR) and K-shortest Paths (KSP) routing schemes, are not able to realize route computation based on the link state information, thus leading to poor blocking performance and inefficient resource utilization. To solve this problem, Adaptive Routing (AR) schemes, e.g., the Entire Path Searching (EPS) scheme, have been proposed recently. These schemes have low blocking probability; however, since their computational complexities are factorial, they are not suitable for use in real networks. In this paper, we propose a novel Spectrum-Scan Routing (SSR) scheme in dynamic flexible optical networks. To the best of our knowledge, SSR is the first polynomial-time AR scheme that can realize adaptive shortest-route computation. Simulation results show that our proposed SSR scheme has lower blocking probability and higher resource utilization compared with FR and EPS. Moreover, the worst-case computational complexity of SSR increases linearly with the network scale of the torus topologies, making it applicable to real networks.
文摘In CNC machining, two essential components decide the accuracy and machining time for a sculptured surface: one is the step-size interval, the other is the tool-path interval. Due to the limitation of the conventional method for calculating the tool-path interval, it cannot satisfy the machining requirement for high-speed and high-resolution machining. Accordingly, for high-speed and high-resolution machining, the current study proposes a new tool-path interval algorithm, plus a variable step-size algorithm for NURBS. Furthermore, a new type cutter, which can improve the cutting efficiency, is investigated in the paper. The transversal equation of the torus cutter onto the flat plan is given in this paper. The tool-path interval is calculated with the transversal equation and the proposed algorithm. The illustrated example shows that the redundant tool paths can be reduced because an accurate tool-path interval could be calculated.
文摘A graph is called claw-free if it does not contain a claw as its induced subgraph.In this paper, we prove the following results:1)If G is a 2-connected claw-free graph on n vertices,then for any vertex v and any two distinct vertices x and y in V(G)-{v},G has a path containing v and all neighbors of v and connecting x and y;2) Let C be the longest cycle in a 3-connected claw-free graph G and H a component of G-C,and if H is connected but not 2-connected,then there exist nonadjacent vertices u and v in H such that |V(C)|≥(3(d(u)+)d(v))-2.
文摘A self-adapting and reconfigurable routing mechanism is proposed according to the average moving speed of the nodes in mobile ad hoc network （MANET）. This mechanism is based on the perception of moving speed and a predesigned selection metric to choose the optimal routing protocol. The routing evaluation and selection metric is derived by OPNET simulations. AODV and OLSR are used as the example to show the process of this mechanism with the moving speed varying. The routing protocol can be configured without central configuration and human management. Besides, the overhead of the mechanism is reasonable and doesnot affect the quality of service （QoS） of the traffic in the network. Results show that the optimal routing protocol can be configured adaptively according to the speed so that better performance than end-to-end delay and packet delivery ratio. a specific protocol can be obtained in terms of
文摘As a country with the strongest economic strength and the largest land area in Central Asia, Kazakhstan is also the advocacy and ＂core nation＂ of the SCO with China. Taking full advantage of the existing SCO economic cooperation mechanism and using Kazakhstan as the starting point to speed up the coordinated development of the Silk Road Economic Belt and regional trade is an important measure to speed up the implementation of the strategy of China＇s free trade agreement and to co-ordinate the overall new pattern of opening up. The strategic concept of ＂One Belt and One Road＂ is of great significance for promoting the development of trade liberalization in China and Central Asia and for enhancing China＇s strategic position in the global trade pattern.
文摘To solve the routing and wavelength assignment problem in the optical network, this paper put forward the metric model with sparse wavelength conversion and routing algorithm with pruning （RAP） in order to efficiently realize the resource management in the unified way. Related methods with dynamic and adaptation characters considered the link state conditions and certain heuristic information. They can be applied to current network environments. In particular, the simulation was made according to the selfsimilar traffic and the results showed that the corresponding methods not only provided service differentiation but also reduced the overall average blocking Drobabilitv.
