Airborne networks（ANs） are special types of ad hoc networks that can be used to enhance situational awareness, flight coordination and flight efficiency in civil and military aviation.Compared to ground networks, AN...Airborne networks（ANs） are special types of ad hoc networks that can be used to enhance situational awareness, flight coordination and flight efficiency in civil and military aviation.Compared to ground networks, ANs have some unique attributes including high node mobility, frequent topology changes, mechanical and aerodynamic constrains, strict safety requirements and harsh communication environment.Thus, the performance of conventional transmission control protocol（TCP） will be dramatically degraded in ANs.Aircraft commonly have two or more heterogeneous network interfaces which offer an opportunity to form multiple communication paths between any two nodes in ANs.To satisfy the communication requirements in ANs, we propose aeronautical multipath transport protocol（Aero MTP） for ANs, which effectively utilizes the available bandwidth and diversity provided by heterogeneous wireless paths.Aero MTP uses fountain codes as forward error correction（FEC） codes to recover from data loss and deploys a TCP-friendly rate-based congestion control mechanism for each path.Moreover, we design a packet allocation algorithm based on optimization to minimize the delivery time of blocks.The performance of Aero MTP is evaluated through OMNe T＋＋ simulations under a variety of test scenarios.Simulations demonstrate that Aero MTP is of great potential to be applied to ANs.展开更多
Based on the algebraic graph theory, the networked multi-agent continuous systems are investigated. Firstly, the digraph （directed graph） represents the topology of a networked system, and then a consensus convergen...Based on the algebraic graph theory, the networked multi-agent continuous systems are investigated. Firstly, the digraph （directed graph） represents the topology of a networked system, and then a consensus convergence criterion of system is proposed. Secondly, the issue of stability of multi-agent systems and the consensus convergence problem of information states are all analysed. Furthermore, the consensus equilibrium point of system is proved to be global and asymptotically reach the convex combination of initial states. Finally, two examples are taken to show the effectiveness of the results obtained in this paper.展开更多
This paper deals with the consensus problem for heterogeneous multi-agent systems. Different from most existing consensus protocols, we consider the consensus seeking of two types of agents, namely, active agents and ...This paper deals with the consensus problem for heterogeneous multi-agent systems. Different from most existing consensus protocols, we consider the consensus seeking of two types of agents, namely, active agents and passive agents. The objective is to directly control the active agents such that the states of all the agents would achieve consensus. In order to obtain a computational approach, we subtly introduce an appropriate Markov chain to cast the heterogeneous systems into a unified framework. Such a framework is helpful for tackling the constraints from passive agents. Furthermore, a sufficient and necessary condition is established to guarantee the consensus in heterogeneous multi-agent systems. Finally, simulation results are provided to verify the theoretical analysis and the effectiveness of the proposed protocol.展开更多
We report on the verification of a multi-party contract signing protocol described by Baum-Waidner and Waidner （BW）. Based on Paulson＇s inductive approach, we give the protocol model that includes infinitely many s...We report on the verification of a multi-party contract signing protocol described by Baum-Waidner and Waidner （BW）. Based on Paulson＇s inductive approach, we give the protocol model that includes infinitely many signatories and contract texts signing simuhaneously. We consider composite attacks of the dishonest signatory and the external intruder, formalize cryptographic primitives and protocol arithmetic including attack model, show formal description of key distribution, and prove signature key secrecy theorems and fairness property theorems of the BW protocol using the interactive theorem prover Isabelle/HOL.展开更多
The inception of Wireless Sensor Networks (WSN) has brought convenience into many lives with uninterrupted wireless network. The nodes that transmit data consist of heterogeneous and battery equipped sensor nodes (SNs...The inception of Wireless Sensor Networks (WSN) has brought convenience into many lives with uninterrupted wireless network. The nodes that transmit data consist of heterogeneous and battery equipped sensor nodes (SNs) that are deployed randomly for network surveillance. To manage the random deployment of nodes, clustering algorithms are used with efficient routing protocols. This results in aggregation and dropping of redundant data packets that enables flawless data transmission from cluster nodes to Base Station (BS) via Cluster Heads (CHs). In this paper, a dynamic and multi-hop clustering and routing protocol for thorough behavior analysis is proposed, taking distance and energy into consideration. This forms a smooth routing path from the cluster nodes, CHs, Sub-CHs to the BS. On comparing proposed process with the existing system, experimental analysis shows a significant enhancement in the performance of network lifetime, with improved data aggregation, throughput, as the protocol showing deterministic behavior while traversing the network for data transmission, we name this protocol as Multi-hop Deterministic energy efficient Routing protocol (MDR).展开更多
A new method for multi-protocol label switching is presented in this study, whose core idea is to construct model for simulating process of accommodating network online loads and then adopt genetic algorithm to optimi...A new method for multi-protocol label switching is presented in this study, whose core idea is to construct model for simulating process of accommodating network online loads and then adopt genetic algorithm to optimize the model. Due to the heuristic property of evolutional method, the new method is efficient and effective, which is verified by the experiments.展开更多
To study multi-radio multi-channel （MR-MC） Ad Hoc networks based on 802.11, an efficient cross-layer routing protocol with the function of joint channel assignment, called joint channel assignment and cross-layer ro...To study multi-radio multi-channel （MR-MC） Ad Hoc networks based on 802.11, an efficient cross-layer routing protocol with the function of joint channel assignment, called joint channel assignment and cross-layer routing （JCACR）, is presented. Firstly, this paper introduces a new concept called channel utilization percentage （CUP）, which is for measuring the contention level of different channels in a node’s neighborhood, and deduces its optimal value for determining whether a channel is overloaded or not. Then, a metric parameter named channel selection metric （CSM） is designed, which actually reffects not only the channel status but also corresponding node’s capacity to seize it. JCACR evaluates channel assignment by CSM, performs a local optimization by assigning each node a channel with the smaller CSM value, and changes the working channel dynamically when the channel is overloaded. Therefore, the network load balancing can be achieved. In addition, simulation shows that, when compared with the protocol of weighted cumulative expected transfer time （WCETT）, the new protocol can improve the network throughput and reduce the end-to-end average delay with fewer overheads.展开更多
Nonlinear consensus protocols for dynamic directed networks of multi-agent systems with fixed and switching topologies are investigated separately in this paper. Based on the centre manifold reduction technique, nonli...Nonlinear consensus protocols for dynamic directed networks of multi-agent systems with fixed and switching topologies are investigated separately in this paper. Based on the centre manifold reduction technique, nonlinear consensus protocols are presented. We prove that a group of agents can reach a β-consensus, the value of which is the group decision value varying from the minimum and the maximum values of the initial states of the agents. Moreover, we derive the conditions to guarantee that all the agents reach a β-consensus on a desired group decision value. Finally, a simulation study concerning the vertical alignment manoeuvere of a team of unmanned air vehicles is performed. Simulation results show that the nonlinear consensus protocols proposed are more effective than the linear protocols for the formation control of the agents and they are an improvement over existing protocols.展开更多
This paper investigates the fnite-time consensus problem of multi-agent systems with single and double integrator dynamics,respectively.Some novel nonlinear protocols are constructed for frst-order and second-order le...This paper investigates the fnite-time consensus problem of multi-agent systems with single and double integrator dynamics,respectively.Some novel nonlinear protocols are constructed for frst-order and second-order leader-follower multi-agent systems,respectively.Based on the fnite-time control technique,the graph theory and Lyapunov direct method,some theoretical results are proposed to ensure that the states of all the follower agents can converge to its leader agent s state in fnite time.Finally,some simulation results are presented to illustrate the efectiveness of our theoretical results.展开更多
Improving capacity and reducing delay are the most challenging topics in wireless ad hoc networks. Nodes that equip multiple radios working on different channels simultaneously permit ef-fective utility of frequency s...Improving capacity and reducing delay are the most challenging topics in wireless ad hoc networks. Nodes that equip multiple radios working on different channels simultaneously permit ef-fective utility of frequency spectrum and can also reduce interference. In this paper, after analyzing several current protocols in Multi-Radio Multi-Channel (MR-MC) ad hoc networks, a new multi-channel routing metric called Integrative Route Metric (IRM) is designed. It takes channel load, inter-flow, and intra-flow interference into consideration. In addition, an MR-MC routing protocol based on Interference-Aware and Channel-Load (MR-IACL) is also presented. The MR-IACL can assign channels and routings for nodes according to channel load and interference degree of links, and optimize channel distribution dynamically to satisfy the features of topology changing and traffic frequent fluctuation during network running. The simulation results show that the new protocol outperforms others in terms of network throughput, end-to-end delay, routing overhead, and network lifetime.展开更多
文摘Airborne networks（ANs） are special types of ad hoc networks that can be used to enhance situational awareness, flight coordination and flight efficiency in civil and military aviation.Compared to ground networks, ANs have some unique attributes including high node mobility, frequent topology changes, mechanical and aerodynamic constrains, strict safety requirements and harsh communication environment.Thus, the performance of conventional transmission control protocol（TCP） will be dramatically degraded in ANs.Aircraft commonly have two or more heterogeneous network interfaces which offer an opportunity to form multiple communication paths between any two nodes in ANs.To satisfy the communication requirements in ANs, we propose aeronautical multipath transport protocol（Aero MTP） for ANs, which effectively utilizes the available bandwidth and diversity provided by heterogeneous wireless paths.Aero MTP uses fountain codes as forward error correction（FEC） codes to recover from data loss and deploys a TCP-friendly rate-based congestion control mechanism for each path.Moreover, we design a packet allocation algorithm based on optimization to minimize the delivery time of blocks.The performance of Aero MTP is evaluated through OMNe T＋＋ simulations under a variety of test scenarios.Simulations demonstrate that Aero MTP is of great potential to be applied to ANs.
基金Project supported by the National Science Fund for distinguished Young Scholars of China (Grant No 60525303)the Specialized Research Fund for the Doctoral Program of High Education of China (Grant No 20050216001)
文摘Based on the algebraic graph theory, the networked multi-agent continuous systems are investigated. Firstly, the digraph （directed graph） represents the topology of a networked system, and then a consensus convergence criterion of system is proposed. Secondly, the issue of stability of multi-agent systems and the consensus convergence problem of information states are all analysed. Furthermore, the consensus equilibrium point of system is proved to be global and asymptotically reach the convex combination of initial states. Finally, two examples are taken to show the effectiveness of the results obtained in this paper.
基金Project supported by the National Basic Research Program of China (Grant No. 2010CB731803)the National Natural Science Foundation of China (Grant Nos. 60934003, 60974123, 61172064, and 61273181)+1 种基金the Science and Technology Commission of Shanghai Municipality, China (Grant No. 11511501202)the Chenguang Program, China (Grant No. 09CG06)
文摘This paper deals with the consensus problem for heterogeneous multi-agent systems. Different from most existing consensus protocols, we consider the consensus seeking of two types of agents, namely, active agents and passive agents. The objective is to directly control the active agents such that the states of all the agents would achieve consensus. In order to obtain a computational approach, we subtly introduce an appropriate Markov chain to cast the heterogeneous systems into a unified framework. Such a framework is helpful for tackling the constraints from passive agents. Furthermore, a sufficient and necessary condition is established to guarantee the consensus in heterogeneous multi-agent systems. Finally, simulation results are provided to verify the theoretical analysis and the effectiveness of the proposed protocol.
基金Supported by the National Natural Science Foun-dation of China (60373068)
文摘We report on the verification of a multi-party contract signing protocol described by Baum-Waidner and Waidner （BW）. Based on Paulson＇s inductive approach, we give the protocol model that includes infinitely many signatories and contract texts signing simuhaneously. We consider composite attacks of the dishonest signatory and the external intruder, formalize cryptographic primitives and protocol arithmetic including attack model, show formal description of key distribution, and prove signature key secrecy theorems and fairness property theorems of the BW protocol using the interactive theorem prover Isabelle/HOL.
文摘The inception of Wireless Sensor Networks (WSN) has brought convenience into many lives with uninterrupted wireless network. The nodes that transmit data consist of heterogeneous and battery equipped sensor nodes (SNs) that are deployed randomly for network surveillance. To manage the random deployment of nodes, clustering algorithms are used with efficient routing protocols. This results in aggregation and dropping of redundant data packets that enables flawless data transmission from cluster nodes to Base Station (BS) via Cluster Heads (CHs). In this paper, a dynamic and multi-hop clustering and routing protocol for thorough behavior analysis is proposed, taking distance and energy into consideration. This forms a smooth routing path from the cluster nodes, CHs, Sub-CHs to the BS. On comparing proposed process with the existing system, experimental analysis shows a significant enhancement in the performance of network lifetime, with improved data aggregation, throughput, as the protocol showing deterministic behavior while traversing the network for data transmission, we name this protocol as Multi-hop Deterministic energy efficient Routing protocol (MDR).
基金This work was supported by the National Natural Science Foundation of China (No10371097)Open Project of Com-putational Key Laboratory in Yunnan Provice
文摘A new method for multi-protocol label switching is presented in this study, whose core idea is to construct model for simulating process of accommodating network online loads and then adopt genetic algorithm to optimize the model. Due to the heuristic property of evolutional method, the new method is efficient and effective, which is verified by the experiments.
基金supported by the National Natural Science Foundationof China (60873195 61070220)+3 种基金the Natural Science Foundation of Anhui Province (070412049)the Outstanding Young Teacher Foundation of Anhui Higher Education Institutions of China (2009SQRZ167)the Natural Science Foundation of Anhui Higher Education Institutions of China (KJ2009B114)the Open Project Program of Engineering Research Center of Safety Critical Industry Measure and Control Technology (SCIMCT0802)
文摘To study multi-radio multi-channel （MR-MC） Ad Hoc networks based on 802.11, an efficient cross-layer routing protocol with the function of joint channel assignment, called joint channel assignment and cross-layer routing （JCACR）, is presented. Firstly, this paper introduces a new concept called channel utilization percentage （CUP）, which is for measuring the contention level of different channels in a node’s neighborhood, and deduces its optimal value for determining whether a channel is overloaded or not. Then, a metric parameter named channel selection metric （CSM） is designed, which actually reffects not only the channel status but also corresponding node’s capacity to seize it. JCACR evaluates channel assignment by CSM, performs a local optimization by assigning each node a channel with the smaller CSM value, and changes the working channel dynamically when the channel is overloaded. Therefore, the network load balancing can be achieved. In addition, simulation shows that, when compared with the protocol of weighted cumulative expected transfer time （WCETT）, the new protocol can improve the network throughput and reduce the end-to-end average delay with fewer overheads.
基金supported by the National Natural Science Foundation of China (Grant No 60525303)the Natural Science Foundation of Hebei Province,China (Grant No 2006000270)
文摘Nonlinear consensus protocols for dynamic directed networks of multi-agent systems with fixed and switching topologies are investigated separately in this paper. Based on the centre manifold reduction technique, nonlinear consensus protocols are presented. We prove that a group of agents can reach a β-consensus, the value of which is the group decision value varying from the minimum and the maximum values of the initial states of the agents. Moreover, we derive the conditions to guarantee that all the agents reach a β-consensus on a desired group decision value. Finally, a simulation study concerning the vertical alignment manoeuvere of a team of unmanned air vehicles is performed. Simulation results show that the nonlinear consensus protocols proposed are more effective than the linear protocols for the formation control of the agents and they are an improvement over existing protocols.
基金supported by National Basic Research Program of China (973 Program) (No.2010CB731800)National Natural Science Foundation of China (Nos.60934003 and 61074065)Natural Science Foundation of Hebei Province (No.F2012203119)
文摘This paper investigates the fnite-time consensus problem of multi-agent systems with single and double integrator dynamics,respectively.Some novel nonlinear protocols are constructed for frst-order and second-order leader-follower multi-agent systems,respectively.Based on the fnite-time control technique,the graph theory and Lyapunov direct method,some theoretical results are proposed to ensure that the states of all the follower agents can converge to its leader agent s state in fnite time.Finally,some simulation results are presented to illustrate the efectiveness of our theoretical results.
基金Supported by the National Natural Science Foundation of China (No. 60873195, No. 61070220)the Research Fund for the Doctoral Program of Higher Education of China (No. 20090111110002)
文摘Improving capacity and reducing delay are the most challenging topics in wireless ad hoc networks. Nodes that equip multiple radios working on different channels simultaneously permit ef-fective utility of frequency spectrum and can also reduce interference. In this paper, after analyzing several current protocols in Multi-Radio Multi-Channel (MR-MC) ad hoc networks, a new multi-channel routing metric called Integrative Route Metric (IRM) is designed. It takes channel load, inter-flow, and intra-flow interference into consideration. In addition, an MR-MC routing protocol based on Interference-Aware and Channel-Load (MR-IACL) is also presented. The MR-IACL can assign channels and routings for nodes according to channel load and interference degree of links, and optimize channel distribution dynamically to satisfy the features of topology changing and traffic frequent fluctuation during network running. The simulation results show that the new protocol outperforms others in terms of network throughput, end-to-end delay, routing overhead, and network lifetime.
