Most recent satellite network research has focused on providing routing services without considering security. In this paper, for the sake of better global coverage, we introduce a novel triple-layered satellite netwo...Most recent satellite network research has focused on providing routing services without considering security. In this paper, for the sake of better global coverage, we introduce a novel triple-layered satellite network architecture including Geostationary Earth Orbit (GEO), Highly Elliptical Orbit (HEO), and Low Earth Orbit (LEO) satellite layers, which provides the near-global coverage with 24 hour uninterrupted over the areas varying from 75° S to 90° N. On the basis of the hierarchical architecture, we propose a QoS-guaranteed secure multicast routing protocol (QGSMRP) for satellite IP networks using the logical location concept to isolate the mobility of LEO and HEO satellites. In QGSMRP, we employ the asymmetric cryptography to secure the control messages via the pairwise key pre-distribution, and present a least cost tree (LCT) strategy to construct the multicast tree under the condition that the QoS constraints are guaranteed, aiming to minimize the tree cost. Simulation results show that the performance benefits of the proposed QGSMRP in terms of the end-to-end tree delay, the tree cost, and the failure ratio of multicasting connections by comparison with the conventional shortest path tree (SPT) strategy.展开更多
In recent years,Software Defined Networking(SDN)has become an important candidate for communication infrastructure in smart cities.It produces a drastic increase in the need for delivery of video services that are of ...In recent years,Software Defined Networking(SDN)has become an important candidate for communication infrastructure in smart cities.It produces a drastic increase in the need for delivery of video services that are of high resolution,multiview,and large-scale in nature.However,this entity gets easily influenced by heterogeneous behaviour of the user’s wireless link features that might reduce the quality of video stream for few or all clients.The development of SDN allows the emergence of new possibilities for complicated controlling of video conferences.Besides,multicast routing protocol with multiple constraints in terms of Quality of Service(QoS)is a Nondeterministic Polynomial time(NP)hard problem which can be solved only with the help of metaheuristic optimization algorithms.With this motivation,the current research paper presents a new Improved BlackWidow Optimization with Levy Distribution model(IBWO-LD)-based multicast routing protocol for smart cities.The presented IBWO-LD model aims at minimizing the energy consumption and bandwidth utilization while at the same time accomplish improved quality of video streams that the clients receive.Besides,a priority-based scheduling and classifier model is designed to allocate multicast request based on the type of applications and deadline constraints.A detailed experimental analysis was carried out to ensure the outcomes improved under different aspects.The results from comprehensive comparative analysis highlighted the superiority of the proposed IBWO-LD model over other compared methods.展开更多
A distributed QoS (quality of service) -aware source-specific multicast routing protocol—DQSSMR is proposed to increase the successful join ratio and lower the overhead of the control message in QoS required multicas...A distributed QoS (quality of service) -aware source-specific multicast routing protocol—DQSSMR is proposed to increase the successful join ratio and lower the overhead of the control message in QoS required multicast routing. By an improved searching strategy, the cost of message control is reduced and the successful join ratio is increased. The network load is balanced due to the distributed routing operation and the scalability is enhanced further because of the usage of SSM (source- specific multicast) service model in DQSSMR. The analysis results indicate that DQSSMR performs as expected.展开更多
A heuristic theoretical optimal routing algorithm （TORA） is presented to achieve the data-gathering structure of location-aided quality of service （QoS） in wireless sensor networks （WSNs）. The construction of TO...A heuristic theoretical optimal routing algorithm （TORA） is presented to achieve the data-gathering structure of location-aided quality of service （QoS） in wireless sensor networks （WSNs）. The construction of TORA is based on a kind of swarm intelligence （SI） mechanism, i. e. , ant colony optimization. Firstly, the ener- gy-efficient weight is designed based on flow distribution to divide WSNs into different functional regions, so the routing selection can self-adapt asymmetric power configurations with lower latency. Then, the designs of the novel heuristic factor and the pheromone updating rule can endow ant-like agents with the ability of detecting the local networks energy status and approaching the theoretical optimal tree, thus improving the adaptability and en- ergy-efficiency in route building. Simulation results show that compared with some classic routing algorithms, TORA can further minimize the total communication energy cost and enhance the QoS performance with low-de- lay effect under the data-gathering condition.展开更多
The concept of network centric warfare （NCW） and the distributed equal-node network architecture in NCW are introduced in this paper. The data flow requirement model in NCW is presented. Based on synthetic analysis ...The concept of network centric warfare （NCW） and the distributed equal-node network architecture in NCW are introduced in this paper. The data flow requirement model in NCW is presented. Based on synthetic analysis of network resource, the QOS （Quality of Service） parameters and their characters, the high requirement of real-time synchronization in NCW, the single QOS routing constraint, and the network latency between the detector and weapon control station, are presented. To take an example for 3-node brigade （regiment） level NCW demonstration platform, the algorithm of end-to-end network latency and path information in NCW are presented. The algorithm program based on Server/Client architecture is developed. The optimal path is the link whose latency between the detector and weapon control station is the smallest. This paper solves the key issue and satisfies the needs on network latency in NCW. The study results can be widely applied in the decision of the optimal path which is based on multiple service provision points.展开更多
In the distributed networks,many applications send information from a source node to multiple destination nodes.To support these applications requirements,the paper presents a multi-objective algorithm based on ant co...In the distributed networks,many applications send information from a source node to multiple destination nodes.To support these applications requirements,the paper presents a multi-objective algorithm based on ant colonies to construct a multicast tree for data transmission in a computer network.The proposed algorithm simultaneously optimizes total weight(cost,delay and hop)of the multicast tree.Experimental results prove the proposed algorithm outperforms a recently published Multi-objective Multicast Algorithm specially designed for solving the multicast routing problem.Also,it is able to find a better solution with fast convergence speed and high reliability.展开更多
Data transmission among multicast trees is an efficient routing method in mobile ad hoc networks(MANETs). Genetic algorithms(GAs) have found widespread applications in designing multicast trees. This paper proposes a ...Data transmission among multicast trees is an efficient routing method in mobile ad hoc networks(MANETs). Genetic algorithms(GAs) have found widespread applications in designing multicast trees. This paper proposes a stable quality-of-service(QoS) multicast model for MANETs. The new model ensures the duration time of a link in a multicast tree is always longer than the delay time from the source node. A novel GA is designed to solve our QoS multicast model by introducing a new crossover mechanism called leaf crossover(LC), which outperforms the existing crossover mechanisms in requiring neither global network link information, additional encoding/decoding nor repair procedures. Experimental results confirm the effectiveness of the proposed model and the efficiency of the involved GA. Specifically, the simulation study indicates that our algorithm can obtain a better QoS route with a considerable reduction of execution time as compared with existing GAs.展开更多
The optimal solution of the multi-constrained QoS multicast routing problem is a tree-like hierarchical structure in the topology graph. This multicast route contains a feasible path from the source node to each of th...The optimal solution of the multi-constrained QoS multicast routing problem is a tree-like hierarchical structure in the topology graph. This multicast route contains a feasible path from the source node to each of the destinations with respect to a set of QoS constraints while minimizing a cost function. Often, it is a tree. In other cases, the hierarchies can return several times to nodes and links of the topology graph. Similarly to Steiner problem, finding such a structure is an NP-hard problem. The usual tree and topology enumeration algorithms applied for the Steiner problem cannot be used to solve the addressed problem. In this paper, we propose an exact algorithm based on the Branch and Bound principle and improved by the Lookahead technique. We show relevant properties of the optimum hierarchy permitting efficient pruning of the search space. To our knowledge, our paper is the first to propose an exact algorithm for this non-trivial multi-constrained optimal multicast route computation. Simulations illustrate the efficiency of the proposed pruning operations. The analysis of the execution time shows that in simple topologies and with tight QoS constraints the exact algorithm requires relatively little execution time. With loose constraints the computation time cannot be tolerated even for off-line route computation. In these cases, the solution is close to a Steiner tree and heuristics can be applied. These results can serve as basis for the design of efficient, polynomial-time routing algorithms.展开更多
In order to share multimedia transmissions in mesh networks and optimize the utilization of network resources, this paper presents a Two-stage Evolutionary Algorithm (TEA), i.e., unicast routing evolution and multicas...In order to share multimedia transmissions in mesh networks and optimize the utilization of network resources, this paper presents a Two-stage Evolutionary Algorithm (TEA), i.e., unicast routing evolution and multicast path composition, for dynamic multicast routing. The TEA uses a novel link-duplicate-degree encoding, which can encode a multicast path in the link-duplicate-degree and decode the path as a link vector easily. A dynamic algorithm for adding nodes to or removing nodes from a multicast group and a repairing algorithm are also covered in this paper. As the TEA is based on global evaluation, the quality of the multicast path remains stabilized without degradation when multicast members change over time. Therefore, it is not necessary to rearrange the multicast path during the life cycle of the multicast sessions. Simulation results show that the TEA is efficient and convergent.展开更多
Quality of service (QoS) multicast routing has continued to be a very important research topic in the Internet. A method of multicast routing is proposed to simultaneously optimize several parameters based on multiobj...Quality of service (QoS) multicast routing has continued to be a very important research topic in the Internet. A method of multicast routing is proposed to simultaneously optimize several parameters based on multiobjective genetic algorithm, after the related work is reviewed. The contribution lies on that the selection process of such routing is treated with multiobjective optimization. Different quality criterions in IP network are taken into account for multicast communications. A set of routing trees is generated to approximate the Pareto front of multicast problem. Multiple trees can be selected from the final set of nondominated solutions, and applied to obtain a good overall link cost and balance traffic distribution according to some simulation results.展开更多
In this paper, we made a detail analysis for the ESAMPH algorithm, and proposed ESAMPH_D algorithm according to the insufficient of ESAMPH algorithm. The ESAMPH_D algorithm does not consider those paths that do not sa...In this paper, we made a detail analysis for the ESAMPH algorithm, and proposed ESAMPH_D algorithm according to the insufficient of ESAMPH algorithm. The ESAMPH_D algorithm does not consider those paths that do not satisfy the delay constraint, so we can ensure that all paths be taken into account will meet the limit of delay constraint, then we find the least costly path in order to build a minimum cost multicast tree. Simulation results show that the algorithm is better than ESAMPH algorithm in performance.展开更多
Most of the existing security Mobicast routing protocols are not suitable for the monitoring applications with higher quality of service （QoS） requirement. A QoS dynamic clustering secure multicast scheme （QoS-DCSM...Most of the existing security Mobicast routing protocols are not suitable for the monitoring applications with higher quality of service （QoS） requirement. A QoS dynamic clustering secure multicast scheme （QoS-DCSMS） based on Mobicast and multi-level IxTESLA protocol for large-scale tracking sensornets is presented in this paper. The multicast clusters are dynamically formed according to the real-time status of nodes, and the cluster-head node is responsible for status review and certificating management of cluster nodes to ensure the most optimized QoS and security of multicast in this scheme. Another contribution of this paper is the optimal QoS security authentication algorithm, which analyzes the relationship between the QoS and the level Mofmulti-level oTESLA. Based on the analysis and simulation results, it shows that the influence to the network survival cycle （＇NSC） and real-time communication caused by energy consumption and latency in authentication is acceptable when the optimal QoS security authentication algorithm is satisfied.展开更多
传统网络中的服务质量(quality of service,QoS)路由协议很难直接有效地应用到无线传感器网络中,因此人们针对无线传感器网络提出了一些新的QoS路由协议。首先探讨了无线传感器网络中QoS路由协议的一些特点,分析了设计QoS路由协议所面...传统网络中的服务质量(quality of service,QoS)路由协议很难直接有效地应用到无线传感器网络中,因此人们针对无线传感器网络提出了一些新的QoS路由协议。首先探讨了无线传感器网络中QoS路由协议的一些特点,分析了设计QoS路由协议所面临的挑战;然后着重分析了当前提出的一些QoS路由协议的QoS机制、特点以及优缺点,并对这些路由协议进行了分类和比较;最后总结了QoS路由协议未来的研究策略和发展趋势。展开更多
文摘Most recent satellite network research has focused on providing routing services without considering security. In this paper, for the sake of better global coverage, we introduce a novel triple-layered satellite network architecture including Geostationary Earth Orbit (GEO), Highly Elliptical Orbit (HEO), and Low Earth Orbit (LEO) satellite layers, which provides the near-global coverage with 24 hour uninterrupted over the areas varying from 75° S to 90° N. On the basis of the hierarchical architecture, we propose a QoS-guaranteed secure multicast routing protocol (QGSMRP) for satellite IP networks using the logical location concept to isolate the mobility of LEO and HEO satellites. In QGSMRP, we employ the asymmetric cryptography to secure the control messages via the pairwise key pre-distribution, and present a least cost tree (LCT) strategy to construct the multicast tree under the condition that the QoS constraints are guaranteed, aiming to minimize the tree cost. Simulation results show that the performance benefits of the proposed QGSMRP in terms of the end-to-end tree delay, the tree cost, and the failure ratio of multicasting connections by comparison with the conventional shortest path tree (SPT) strategy.
基金The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work under Grant Number(RGP.1/282/42)Princess Nourah bint Abdulrahman University Researchers Supporting Project Number(PNURSP2022R191),Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.
文摘In recent years,Software Defined Networking(SDN)has become an important candidate for communication infrastructure in smart cities.It produces a drastic increase in the need for delivery of video services that are of high resolution,multiview,and large-scale in nature.However,this entity gets easily influenced by heterogeneous behaviour of the user’s wireless link features that might reduce the quality of video stream for few or all clients.The development of SDN allows the emergence of new possibilities for complicated controlling of video conferences.Besides,multicast routing protocol with multiple constraints in terms of Quality of Service(QoS)is a Nondeterministic Polynomial time(NP)hard problem which can be solved only with the help of metaheuristic optimization algorithms.With this motivation,the current research paper presents a new Improved BlackWidow Optimization with Levy Distribution model(IBWO-LD)-based multicast routing protocol for smart cities.The presented IBWO-LD model aims at minimizing the energy consumption and bandwidth utilization while at the same time accomplish improved quality of video streams that the clients receive.Besides,a priority-based scheduling and classifier model is designed to allocate multicast request based on the type of applications and deadline constraints.A detailed experimental analysis was carried out to ensure the outcomes improved under different aspects.The results from comprehensive comparative analysis highlighted the superiority of the proposed IBWO-LD model over other compared methods.
文摘A distributed QoS (quality of service) -aware source-specific multicast routing protocol—DQSSMR is proposed to increase the successful join ratio and lower the overhead of the control message in QoS required multicast routing. By an improved searching strategy, the cost of message control is reduced and the successful join ratio is increased. The network load is balanced due to the distributed routing operation and the scalability is enhanced further because of the usage of SSM (source- specific multicast) service model in DQSSMR. The analysis results indicate that DQSSMR performs as expected.
基金Supported by the Foundation of National Natural Science of China(60802005,50803016)the Science Foundation for the Excellent Youth Scholars in East China University of Science and Technology(YH0157127)the Undergraduate Innovational Experimentation Program in East China University of Science andTechnology(X1033)~~
文摘A heuristic theoretical optimal routing algorithm （TORA） is presented to achieve the data-gathering structure of location-aided quality of service （QoS） in wireless sensor networks （WSNs）. The construction of TORA is based on a kind of swarm intelligence （SI） mechanism, i. e. , ant colony optimization. Firstly, the ener- gy-efficient weight is designed based on flow distribution to divide WSNs into different functional regions, so the routing selection can self-adapt asymmetric power configurations with lower latency. Then, the designs of the novel heuristic factor and the pheromone updating rule can endow ant-like agents with the ability of detecting the local networks energy status and approaching the theoretical optimal tree, thus improving the adaptability and en- ergy-efficiency in route building. Simulation results show that compared with some classic routing algorithms, TORA can further minimize the total communication energy cost and enhance the QoS performance with low-de- lay effect under the data-gathering condition.
文摘The concept of network centric warfare （NCW） and the distributed equal-node network architecture in NCW are introduced in this paper. The data flow requirement model in NCW is presented. Based on synthetic analysis of network resource, the QOS （Quality of Service） parameters and their characters, the high requirement of real-time synchronization in NCW, the single QOS routing constraint, and the network latency between the detector and weapon control station, are presented. To take an example for 3-node brigade （regiment） level NCW demonstration platform, the algorithm of end-to-end network latency and path information in NCW are presented. The algorithm program based on Server/Client architecture is developed. The optimal path is the link whose latency between the detector and weapon control station is the smallest. This paper solves the key issue and satisfies the needs on network latency in NCW. The study results can be widely applied in the decision of the optimal path which is based on multiple service provision points.
文摘In the distributed networks,many applications send information from a source node to multiple destination nodes.To support these applications requirements,the paper presents a multi-objective algorithm based on ant colonies to construct a multicast tree for data transmission in a computer network.The proposed algorithm simultaneously optimizes total weight(cost,delay and hop)of the multicast tree.Experimental results prove the proposed algorithm outperforms a recently published Multi-objective Multicast Algorithm specially designed for solving the multicast routing problem.Also,it is able to find a better solution with fast convergence speed and high reliability.
基金supported in part by Supported by the National Natural Science Foundation of China (Grant No. 61370227)Research Foundation of Education Bureau of Hunan Province, China (Grant No. 17A070)
文摘Data transmission among multicast trees is an efficient routing method in mobile ad hoc networks(MANETs). Genetic algorithms(GAs) have found widespread applications in designing multicast trees. This paper proposes a stable quality-of-service(QoS) multicast model for MANETs. The new model ensures the duration time of a link in a multicast tree is always longer than the delay time from the source node. A novel GA is designed to solve our QoS multicast model by introducing a new crossover mechanism called leaf crossover(LC), which outperforms the existing crossover mechanisms in requiring neither global network link information, additional encoding/decoding nor repair procedures. Experimental results confirm the effectiveness of the proposed model and the efficiency of the involved GA. Specifically, the simulation study indicates that our algorithm can obtain a better QoS route with a considerable reduction of execution time as compared with existing GAs.
文摘The optimal solution of the multi-constrained QoS multicast routing problem is a tree-like hierarchical structure in the topology graph. This multicast route contains a feasible path from the source node to each of the destinations with respect to a set of QoS constraints while minimizing a cost function. Often, it is a tree. In other cases, the hierarchies can return several times to nodes and links of the topology graph. Similarly to Steiner problem, finding such a structure is an NP-hard problem. The usual tree and topology enumeration algorithms applied for the Steiner problem cannot be used to solve the addressed problem. In this paper, we propose an exact algorithm based on the Branch and Bound principle and improved by the Lookahead technique. We show relevant properties of the optimum hierarchy permitting efficient pruning of the search space. To our knowledge, our paper is the first to propose an exact algorithm for this non-trivial multi-constrained optimal multicast route computation. Simulations illustrate the efficiency of the proposed pruning operations. The analysis of the execution time shows that in simple topologies and with tight QoS constraints the exact algorithm requires relatively little execution time. With loose constraints the computation time cannot be tolerated even for off-line route computation. In these cases, the solution is close to a Steiner tree and heuristics can be applied. These results can serve as basis for the design of efficient, polynomial-time routing algorithms.
文摘In order to share multimedia transmissions in mesh networks and optimize the utilization of network resources, this paper presents a Two-stage Evolutionary Algorithm (TEA), i.e., unicast routing evolution and multicast path composition, for dynamic multicast routing. The TEA uses a novel link-duplicate-degree encoding, which can encode a multicast path in the link-duplicate-degree and decode the path as a link vector easily. A dynamic algorithm for adding nodes to or removing nodes from a multicast group and a repairing algorithm are also covered in this paper. As the TEA is based on global evaluation, the quality of the multicast path remains stabilized without degradation when multicast members change over time. Therefore, it is not necessary to rearrange the multicast path during the life cycle of the multicast sessions. Simulation results show that the TEA is efficient and convergent.
文摘Quality of service (QoS) multicast routing has continued to be a very important research topic in the Internet. A method of multicast routing is proposed to simultaneously optimize several parameters based on multiobjective genetic algorithm, after the related work is reviewed. The contribution lies on that the selection process of such routing is treated with multiobjective optimization. Different quality criterions in IP network are taken into account for multicast communications. A set of routing trees is generated to approximate the Pareto front of multicast problem. Multiple trees can be selected from the final set of nondominated solutions, and applied to obtain a good overall link cost and balance traffic distribution according to some simulation results.
文摘In this paper, we made a detail analysis for the ESAMPH algorithm, and proposed ESAMPH_D algorithm according to the insufficient of ESAMPH algorithm. The ESAMPH_D algorithm does not consider those paths that do not satisfy the delay constraint, so we can ensure that all paths be taken into account will meet the limit of delay constraint, then we find the least costly path in order to build a minimum cost multicast tree. Simulation results show that the algorithm is better than ESAMPH algorithm in performance.
基金Supported by the National Natural Science Foundation of China （No. 60903157）
文摘Most of the existing security Mobicast routing protocols are not suitable for the monitoring applications with higher quality of service （QoS） requirement. A QoS dynamic clustering secure multicast scheme （QoS-DCSMS） based on Mobicast and multi-level IxTESLA protocol for large-scale tracking sensornets is presented in this paper. The multicast clusters are dynamically formed according to the real-time status of nodes, and the cluster-head node is responsible for status review and certificating management of cluster nodes to ensure the most optimized QoS and security of multicast in this scheme. Another contribution of this paper is the optimal QoS security authentication algorithm, which analyzes the relationship between the QoS and the level Mofmulti-level oTESLA. Based on the analysis and simulation results, it shows that the influence to the network survival cycle （＇NSC） and real-time communication caused by energy consumption and latency in authentication is acceptable when the optimal QoS security authentication algorithm is satisfied.
文摘传统网络中的服务质量(quality of service,QoS)路由协议很难直接有效地应用到无线传感器网络中,因此人们针对无线传感器网络提出了一些新的QoS路由协议。首先探讨了无线传感器网络中QoS路由协议的一些特点,分析了设计QoS路由协议所面临的挑战;然后着重分析了当前提出的一些QoS路由协议的QoS机制、特点以及优缺点,并对这些路由协议进行了分类和比较;最后总结了QoS路由协议未来的研究策略和发展趋势。
