To improve the robustness of the Low Earth Orbit(LEO) satellites networks and realise load balancing, a Cross-layer design and Ant-colony optimization based Load-balancing routing algorithm for LEO Satellite Networks(...To improve the robustness of the Low Earth Orbit(LEO) satellites networks and realise load balancing, a Cross-layer design and Ant-colony optimization based Load-balancing routing algorithm for LEO Satellite Networks(CAL-LSN) is proposed in this paper. In CALLSN, mobile agents are used to gather routing information actively. CAL-LSN can utilise the information of the physical layer to make routing decision during the route construction phase. In order to achieve load balancing, CALLSN makes use of a multi-objective optimization model. Meanwhile, how to take the value of some key parameters is discussed while designing the algorithm so as to improve the reliability. The performance is measured by the packet delivery rate, the end-to-end delay, the link utilization and delay jitter. Simulation results show that CAL-LSN performs well in balancing traffic load and increasing the packet delivery rate. Meanwhile, the end-to-end delay and delay jitter performance can meet the requirement of video transmission.展开更多
In order to improve safety,economy efficiency and design automation degree of air route in terminal airspace,Three-dimensional(3D)planning of routes network is investigated.A waypoint probability search method is prop...In order to improve safety,economy efficiency and design automation degree of air route in terminal airspace,Three-dimensional(3D)planning of routes network is investigated.A waypoint probability search method is proposed to optimize individual flight path.Through updating horizontal pheromones by negative feedback factors,an antcolony algorithm of path searching in 3Dterminal airspace is implemented.The principle of optimization sequence of arrival and departure routes is analyzed.Each route is optimized successively,and the overall optimization of the whole route network is finally achieved.A case study shows that it takes about 63 sto optimize 8arrival and departure routes,and the operation efficiency can be significantly improved with desirable safety and economy.展开更多
In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Antcolony algorithm, this paper proposes the wireless sensor network routing ...In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Antcolony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime.展开更多
This research presents an approach based upon ant-colony optimization to address the system reliability problem. For each component of a system, the number of units in parallel needs to be chosen to maximize the relia...This research presents an approach based upon ant-colony optimization to address the system reliability problem. For each component of a system, the number of units in parallel needs to be chosen to maximize the reliability for the entire system. As more parallel units are selected, costs increase in a proportional fashion. For this effort, quantity discounts for additional parallel units are considered, and the budget for purchase of parallel units is limited. Ant colony optimization methodology is employed to find an optimal system reliability that satisfies the budget constraint. The methodology is employed for several test problems, and near-optimal solutions are found.展开更多
In order to periodically reassess the status of the alternate path route(APR)set and to improve the efficiency of alternate path construction existing in most current alter-nate path routing protocols,we present a cro...In order to periodically reassess the status of the alternate path route(APR)set and to improve the efficiency of alternate path construction existing in most current alter-nate path routing protocols,we present a cross-layer design and ant-colony optimization based load-balancing routing protocol for ad-hoc networks(CALRA)in this paper.In CALRA,the APR set maintained in nodes is aged and reas-sessed by the inherent mechanism of pheromone evaporation of ant-colony optimization algorithm,and load balance of network is achieved by ant-colony optimization combining with cross-layer synthetic optimization.The efficiency of APR set construction is improved by bidirectional and hop-by-hop routing update during routing discovery and routing maintenance process.Moreover,ants in CALRA deposit simulated pheromones as a function of multiple parameters corresponding to the information collected by each layer of each node visited,such as the distance from their source node,the congestion degree of the visited nodes,the current pheromones the nodes possess,the velocity of the nodes,and so on,and provide the information to the visiting nodes to update their pheromone tables by endowing the different parameters corresponding to different information and different weight values,which provides a new method to improve the congestion problem,the shortcut problem,the convergence rate and the heavy overheads commonly existed in existing ant-based routing protocols for ad-hoc networks.The performance of the algorithm is measured by the packet delivery rate,good-put ratio(routing overhead),and end-to-end delay.Simulation results show that CALRA performs well in decreasing the route overheads,balancing traffic load,as well as increasing the packet delivery rate,etc.展开更多
基金supported by the National Natural Science Foundation of China under Grant No.61271281the National High Technology Research and Development Program of China (863 Program) under Grant No.SS2013AA010503
文摘To improve the robustness of the Low Earth Orbit(LEO) satellites networks and realise load balancing, a Cross-layer design and Ant-colony optimization based Load-balancing routing algorithm for LEO Satellite Networks(CAL-LSN) is proposed in this paper. In CALLSN, mobile agents are used to gather routing information actively. CAL-LSN can utilise the information of the physical layer to make routing decision during the route construction phase. In order to achieve load balancing, CALLSN makes use of a multi-objective optimization model. Meanwhile, how to take the value of some key parameters is discussed while designing the algorithm so as to improve the reliability. The performance is measured by the packet delivery rate, the end-to-end delay, the link utilization and delay jitter. Simulation results show that CAL-LSN performs well in balancing traffic load and increasing the packet delivery rate. Meanwhile, the end-to-end delay and delay jitter performance can meet the requirement of video transmission.
基金supported by the National Natural Science Foundation of China(No.61039001)the State Technology Supporting Plan(No.2011BAH24B08)the Fundamental Research Funds for the Central Universities (No.ZXH2011A002)
文摘In order to improve safety,economy efficiency and design automation degree of air route in terminal airspace,Three-dimensional(3D)planning of routes network is investigated.A waypoint probability search method is proposed to optimize individual flight path.Through updating horizontal pheromones by negative feedback factors,an antcolony algorithm of path searching in 3Dterminal airspace is implemented.The principle of optimization sequence of arrival and departure routes is analyzed.Each route is optimized successively,and the overall optimization of the whole route network is finally achieved.A case study shows that it takes about 63 sto optimize 8arrival and departure routes,and the operation efficiency can be significantly improved with desirable safety and economy.
基金Acknowledgements Supported by the Fundamental Research Funds for the Central Universities（72104988）, The National High Technology Research and Development Program of China （ 2009AA01 Z204, 2007AA01Z429, 2007AA01Z405）, The post doctor science foundation of China （20090451495, 20090461415） The National Natural science foundation of China （60874085, 60633020, 60803151 ）, The Natural Science Basic Research Plan in Shaanxi Province of China （Program No. SJ08F13）, The Aviation Sci- ence Foundation of China （2007ZD31003, 2008ZD31001 ）
文摘In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Antcolony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime.
文摘This research presents an approach based upon ant-colony optimization to address the system reliability problem. For each component of a system, the number of units in parallel needs to be chosen to maximize the reliability for the entire system. As more parallel units are selected, costs increase in a proportional fashion. For this effort, quantity discounts for additional parallel units are considered, and the budget for purchase of parallel units is limited. Ant colony optimization methodology is employed to find an optimal system reliability that satisfies the budget constraint. The methodology is employed for several test problems, and near-optimal solutions are found.
基金supported by the National Natural Science Foundation of China(Grant No.60472052 and 10577007)the Fund of the National Key Laboratory of Communication Program of University of Electronic Science and Technology of China(No.51434020105ZS04)the Fund of the Key Laboratory of Mobile Communication Program of Chongqing University of Posts and Telecommunications.
文摘In order to periodically reassess the status of the alternate path route(APR)set and to improve the efficiency of alternate path construction existing in most current alter-nate path routing protocols,we present a cross-layer design and ant-colony optimization based load-balancing routing protocol for ad-hoc networks(CALRA)in this paper.In CALRA,the APR set maintained in nodes is aged and reas-sessed by the inherent mechanism of pheromone evaporation of ant-colony optimization algorithm,and load balance of network is achieved by ant-colony optimization combining with cross-layer synthetic optimization.The efficiency of APR set construction is improved by bidirectional and hop-by-hop routing update during routing discovery and routing maintenance process.Moreover,ants in CALRA deposit simulated pheromones as a function of multiple parameters corresponding to the information collected by each layer of each node visited,such as the distance from their source node,the congestion degree of the visited nodes,the current pheromones the nodes possess,the velocity of the nodes,and so on,and provide the information to the visiting nodes to update their pheromone tables by endowing the different parameters corresponding to different information and different weight values,which provides a new method to improve the congestion problem,the shortcut problem,the convergence rate and the heavy overheads commonly existed in existing ant-based routing protocols for ad-hoc networks.The performance of the algorithm is measured by the packet delivery rate,good-put ratio(routing overhead),and end-to-end delay.Simulation results show that CALRA performs well in decreasing the route overheads,balancing traffic load,as well as increasing the packet delivery rate,etc.
