The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In communication networks, the multi-constraint multicast communication is an important way to improve the efficiency of network operation and quality of service. Some heuristic algorithms are applied in solving multicast routing problem under multiple constraints, such as simulated annealing, genetic algorithm, ant colony algorithm and particle swarm optimization algorithm. However, these algorithms...
Computer network technology has been growing explosively and the multicast technology has become a hot Internet research topic. The main goal of multicast routing algorithm is seeking a minimum cost multicast tree in a given network, also known as the Steiner tree problem, which is a classical NP-Complete problem. We measure the multicast capability of each node through the degree-constraint for each...
Recent advances in network coding have shown great potential for efficient information multicasting in communication networks, in terms of both network throughput and network management. In this paper, the problem of flow control at end-systems for network-coding-based multicast flows is addressed. Optimization-based models are formulated for network resource allocation, based on which two sets of...
Although possible security threats were taken into consideration when IPv6 was formulated, attacks, especially distributed denial-of-service (DDoS), still exist in IPv6 network. This makes IP trace back schemes very relevant to the security of IPv6 network. As many current IP trace back schemes are designed according to IPv4, they can not be directly used in IPv6 network. A modified Deterministic...
In wireless ad hoc networks, multiple descriptions (MD) coding of video can effectively improve the quality of transmission, but there is a problem that how to choose the optimal path. In order to solve the problem, particle swarm optimization algorithm with adaptive mutation (AMPSO) is presented in this paper, which is used to choose transport path of MD video. This method can find the optimal solution...
This paper presents a self-adaptive evolutionary network coding algorithm (SA-ENCA) that minimizes the resources of network coding while achieving the target throughput of multicast. The idea is to adaptively engage infeasible solutions as well in searching for better solutions. This is achieved by assigning fitness to the infeasible solutions by balancing corresponding objective function values against...
In order to solve the problem of slow convergence speed of adaptive genetic algorithm (AGA) in the early stage of evolution, an improved adaptive genetic algorithm (IAGA) was presented. With the introduction of an indicator evaluating the degree of population diversity, the new algorithm can adaptively adjust the probabilities of crossover. Furthermore, the IAGA was applied to vehicle routing problem...
Owing to the availability of low-cost and low-power CMOS cameras, wireless video sensor networks (WVSN) has recently become a reality. However video encoding is still a costly process for energy and capacity constrained sensor nodes and its optimal joint control with the communication protocols has a direct impact on the network lifetime. In this paper we propose a distributed quality-lifetime control...
We address the problem of routing mobile agent with fusion cost in WSN under two scenarios: all source nodes, and a part of source nodes to be visited, respectively. Two objective functions in terms of minimizing transmission and fusion energy expenditure in the two scenarios are formulated, and proved to be NP-complete. Furthermore, we propose a two-level encoding based genetic algorithm (GA) to...
Optimized solvers for the Boolean satisfiability problem have many applications in areas such as FPGA routing, planning, and so forth. In the context of FPGA routing where routing resources are fixed, Boolean formulation methods can prove the unroutability of a given circuit, which is a clear advantage over classical net-at-a-time approaches. This paper introduces a new and efficient hybrid routing...
Pipe route design (PRD) is to design an appropriate route meeting various constraints and objectives from various candidates, which is a time-consuming and difficult task even to a skilled designer. This paper proposes a new method for PRD based on the grid method and particle swarm optimization (PSO). First, a modified particle swarm optimization (MPSO) is proposed to improve the performance of PSO...
Three applications in wireless networks where model-free stochastic learning is applicable, are discussed. The learning based optimization problems are formulated and simulation results are presented. Some open issues are also discussed.
Internet Relay Chat (IRC) is a critical application in military networks for maintaining situational awareness and conducting battle management at all echelons. But these networks are often subject to frequent disconnections, limited bandwidth, and long delays, especially when using satellite services and field radios. Such conditions are inhospitable to TCP, and thus the standard IRC protocol, which...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.