scholarly journals Multiobjective Multicast DSR Algorithm for Routing in Mobile Networks with Cost, Delay, and Hop Count

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Hamdy H. El-Sayed ◽  
A. Younes ◽  
Fahad A. Alghamdi
Keyword(s):  
Mobile Networks ◽  
Communication Systems ◽  
Multicast Routing ◽  
Multicast Tree ◽  
Total Weight ◽  
Hop Count ◽  
Routing Problem ◽  
Evaluation Algorithm ◽  
Wireless Mobile Communication ◽  
Communication Needs

Tremendous evaluation of wireless mobile communication needs more efficient algorithms for communication systems. The use of conventional single-objective optimization algorithms may be unsuitable for real applications, because they act to the detriment of the rest of the performance parameters like lifetime network, delay, cost, and hop count; for this reason, multiobjective is needed. This paper presents performance evaluation and compares between the Multicast MDSR and MAODV with MACO. The proposed MDSR is concerned with change of the route discovery phase, where the route selection is based on the shortest path of route reply packets on the route with calculating the number of hop counts. Also, this article compares our MDSR modification with the evaluation algorithm based on Ant Colony Optimization (ACO), which finds the best path and multicast tree optimizes total weight (cost, delay, and hop count) of the multicast tree using multiobjective. Experimental results proved that the proposed MDSR algorithm is more efficient than MAODV and MACO in the total weight (cost, delay, and hop count), respectively. Moreover, the MACO outperforms MAODV for multicast routing problem.

A Multiple Constrained QoS Routing Algorithm for the Wireless Sensor Networks

2013 ◽  
Vol 347-350 ◽  
pp. 553-558
Author(s):  
Ze Shun Zhou ◽  
Yi Xu ◽  
Jun Jie Yan ◽  
Zhong Wei Nie ◽  
La Yuan Li
Keyword(s):  
Multicast Routing ◽  
Routing Algorithm ◽  
Qos Routing ◽  
Multicast Tree ◽  
Global Network ◽  
Wireless Sensor ◽  
Hop Count ◽  
Routing Problem ◽  
Multiple Qos Constraints ◽  
Multiple Qos

Routing problem is one of the most important issues to a wireless sensor network (WSN). It is the key problem to find an efficient energy strategy for prolonging network's lifetime because power supply might be impossible. This paper discusses the multicast routing problem of WSN with multiple QoS constraints, which may deal with the delay, bandwidth, hop count and packet reception rat and surplus energy metrics, and finds a minimum resource consumption path while satisfying multiple constraints optimization conditions, and describes a network model for researching the multicast routing problem. It presents a dynamic multicast routing algorithm with multiple QoS constraints (MCQoSRA). The MCQoSRA successfully solves the QoS routing problems when multicast nodes change dynamically in the networks. The MCQoSRA only requires the local state information of the link (or node), but does not require any global network sate to be maintained. In MCQoSRA, a multicast group member can join or leave the multicast session dynamically. The MCQoSRA can effectively decrease the overhead for constructing a multicast tree and the delay of the nodes, and improve the success ratio of seeking links. Simulation results show that the MCQoSRA provides an available means to implement multicast routing, and adapt to all kinds of the topology networks, and have better expansibility.

scholarly journals Multicast Utility Maximization with Load Balanc-ing in Private Cloud Environment

2018 ◽  
Vol 7 (2.19) ◽  
pp. 12
Author(s):  
N Senthamarai ◽  
M Vijayalakshmi
Keyword(s):  
Cloud Computing ◽  
Utility Maximization ◽  
Multicast Routing ◽  
Multicast Tree ◽  
Cloud Environment ◽  
Selection Algorithm ◽  
Private Cloud ◽  
Queuing Delay ◽  
Routing Problem ◽  
Transmission Overhead

Multicast is a technique for one-to-many communication over the network. It plays important role in cloud computing and reduces the transmission overhead in the private cloud environment. In this paper, build an efficient multicast tree for the multicast routing problem in which a network consists of different categories of nodes, where each category can have one or more nodes of the same characteristic which is different from the characteristics of nodes from other categories. So it is used to reduce the message traffic in such a network, to build a multicast tree and minimize the queuing delay using multicast selection algorithm.

A Multicast Routing Algorithm with Cost, Delay and Bandwidth Constraints

2013 ◽  
Vol 756-759 ◽  
pp. 1850-1854
Author(s):  
Yuan Chen Li ◽  
Guo Fang Kuang
Keyword(s):  
Communication Networks ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Multicast Tree ◽  
Routing Problem ◽  
Qos Parameters ◽  
The Cost ◽  
Multicast Routing Algorithm ◽  
Multiple Qos

Quality of service (QoS) generally assumes more than one QoS measure which implies that routing can be categorized as an instance of routing subject to multiple constraints: such as cost, delay, bandwidth, etc. The problem of constructing multicast trees is studied to meet the QoS requirements where it is necessary to provide bounded constraints among the source and all destinations while keeping the cost of the multicast tree low. So, a kind of source-destination QoS multicast routing problem is addressed about communication networks. The algorithm we presented takes bandwidth, delay and loss rate as premise, constructs routing selected function based on shortest path, modifies selected path according to the function above so as to fit multi-QoS parameters. Simulation results show that the algorithm has both lower delay and better performance and can be extended to cases of multiple QoS parameters conveniently.

scholarly journals Solving the Delay-Constrained Least-Cost routing problem using Tabu Search with Edge Betweenness

2021 ◽  
Vol 229 ◽  
pp. 01009
Author(s):  
Amina Boudjelida ◽  
Ali Lemouari
Keyword(s):  
Tabu Search ◽  
Computer Network ◽  
Multicast Routing ◽  
Current Approach ◽  
Multicast Tree ◽  
Steiner Tree Problem ◽  
Routing Problem ◽  
Edge Betweenness ◽  
Tabu Search Method ◽  
Minimal Steiner Tree

Multicast routing consists of concurrently sending the same information from a source to a subset of all possible destinations in a computer network thus becomes an important technology communication. To solve the problem, a current approach for efficiently supporting a multicast session in a network consists of establishing a multicast tree that covers the source and all terminal nodes. This problem can be reduced to a minimal Steiner tree problem (MST) which aims to look for a tree that covers a set of nodes with a minimum total cost, the problem is NP-hard. In this paper, we investigate metaheuristics approaches for the Delay-Constrained Least-Cost (DCLC) problem, we propose a novel algorithm based on Tabu Search procedure with the Edge Betweenness (EB). The EB heuristic used first to improve KMB heuristic, able to measure the edge value to being included in a given path. The obtained solution improved using the tabu search method. The performance of the proposed algorithm is evaluated by experiments on a number of benchmark instances from the Steiner library. Experimental results show that the proposed metaheuristic gives competitive results in terms of cost and delay compared to the optimal results in Steiner library and other existing algorithms in the literature.

Tabu Search for Low-Cost Dynamic Multicast Tree Generation with Quality of Service Guarantees

2015 ◽  
Vol 24 (4) ◽  
pp. 479-489
Author(s):  
Muhammad Atif Tahir ◽  
Asif Jamshed ◽  
Habib-ur Rehman ◽  
Yassine Daadaa
Keyword(s):  
Quality Of Service ◽  
Tabu Search ◽  
Multicast Routing ◽  
Low Cost ◽  
Multicast Tree ◽  
Source Node ◽  
Delay Constraint ◽  
Routing Problem ◽  
Dynamic Multicast

AbstractIn a communication network with a source node, a multicast tree is defined as a tree rooted at the source node and all its leaves being recipients of the multicast originating at the source. The tree or bandwidth cost is normally measured by its utilization of tree links along with the quality of service (QoS) measures such as delay constraint and end-to-end delay. However, if nodes are allowed to join or leave the multicast group at any time during the lifetime of the multicast connection, then the problem is known as dynamic multicast routing problem. In this article, we combine a greedy approach with static multicast routing using Tabu Search to find a low-cost dynamic multicast tree with desirable QoS parameters. The proposed algorithm is then compared with several static multicast routing algorithms. The simulation results show that, on a large number of events, i.e., where nodes are leaving or joining, the proposed algorithm is able to find multicast trees of lower cost and more desirable QoS properties.

An Improved Chaotic Binary Bat Algorithm for QoS Multicast Routing

2016 ◽  
Vol 25 (04) ◽  
pp. 1650025 ◽  
Author(s):  
Yassine Meraihi ◽  
Dalila Acheli ◽  
Amar Ramdane-Cherif
Keyword(s):  
Particle Swarm Optimization ◽  
Communication Networks ◽  
Heuristic Algorithms ◽  
Multicast Routing ◽  
Logistic Map ◽  
Particle Swarm ◽  
Bat Algorithm ◽  
Multicast Tree ◽  
Swarm Optimization ◽  
Routing Problem

The quality of service (QoS) multicast routing problem is one of the main issues for transmission in communication networks. It is known to be an NP-hard problem, so many heuristic algorithms have been employed to solve the multicast routing problem and find the optimal multicast tree which satisfies the requirements of multiple QoS constraints such as delay, delay jitter, bandwidth and packet loss rate. In this paper, we propose an improved chaotic binary bat algorithm to solve the QoS multicast routing problem. We introduce two modification methods into the binary bat algorithm. First, we use the two most representative chaotic maps, namely the logistic map and the tent map, to determine the parameter [Formula: see text] of the pulse frequency [Formula: see text]. Second, we use a dynamic formulation to update the parameter α of the loudness [Formula: see text]. The aim of these modifications is to enhance the performance and the robustness of the binary bat algorithm and ensure the diversity of the solutions. The simulation results reveal the superiority, effectiveness and efficiency of our proposed algorithms compared with some well-known algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Jumping Particle Swarm Optimization (JPSO), and Binary Bat Algorithm (BBA).

Research on QoS Multicast Tree Based on Ant Colony Algorithm

2014 ◽  
Vol 635-637 ◽  
pp. 1734-1737 ◽  
Author(s):  
Yong Huang
Keyword(s):  
Data Transmission ◽  
Ant Colony Algorithm ◽  
Multicast Routing ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Multicast Tree ◽  
Ant Colony ◽  
Shortest Path Algorithm ◽  
Routing Problem ◽  
Delay Constraints

Ant colony algorithm is a stochastic search algorithm, evolutionary algorithm with other models, like the evolution of the composition of the population by the candidate solutions to find the optimal solution, this paper proposes a new ant colony algorithm to solve by bandwidth and QoS multicast routing problem delay constraints, k shortest path algorithm by means of genetic algorithm we propose obtained, and then use the ant colony algorithm to construct optimal multicast tree for data transmission.

scholarly journals Toward Building Video Multicast Tree with Congestion Avoidance Capability in Software-Defined Networks

2019 ◽  
Vol 17 (2) ◽  
pp. 162-169
Author(s):  
Huifen Huang ◽  
Zhihong Wu ◽  
Jin Ge ◽  
Lu Wang
Keyword(s):  
Network Topology ◽  
Multicast Routing ◽  
Multicast Tree ◽  
Congestion Avoidance ◽  
Delay Constraint ◽  
Routing Problem ◽  
Video Multicast ◽  
Available Bandwidth ◽  
Qos Guarantee ◽  
Congestion Cost

Network congestion is an obstacle to a Quality of Service (QoS) guarantee for online video applications, because it leads to a high packet loss rate and long transmission delay. In the Software-Defined Network (SDN), the controller can conveniently obtain the network topology and link bandwidth use situation. Based on the above advantages, an SDN-based video multicast routing solution, called Congestion Avoidance Video Multicast (CAVM), is proposed in this paper. CAVM obtains overall network topology, monitors available bandwidth resource and measures the link delays based on the OpenFlow, a popular SDN southbound interface. We introduce a novel multicast routing problem, named the Delay-Constrained and Minimum Congestion-Cost Multicast Routing (DCMCCMR) problem, which finds the multicast tree with the lowest congestion cost and a source-destination delay constraint in the SDN environment. The DCMCCMR problem is NP-hard. CAVM uses an algorithm to solve it in polynomial time. Our experimental results confirm that the proposed algorithm can build multicast trees with good congestion avoidance capability

Delay and Delay-Variation Constrained Multicast Routing Algorithm Based on Core Selection

2013 ◽  
Vol 373-375 ◽  
pp. 1182-1187
Author(s):  
Yuan Chen Li ◽  
Wei Qun Liu
Keyword(s):  
Real Time ◽  
Multicast Routing ◽  
Cost Minimization ◽  
Minimum Cost ◽  
Multicast Tree ◽  
Destination Node ◽  
Selection Methods ◽  
Routing Problem ◽  
Core Selection ◽  
Delay Variation

With the development of multimedia network, more and more real-time multimedia applications require a network capable of satisfying QoS constraints such as delay and delay-variation bound so that the messages reach each destination node at almost the same time within a certain specified time limit, and certain application also demand that different streams for each different destination node should reach with minimum cost under the constraints. Therefore, the delay and delay-variation constraint multicast routing problem is studied and a new strategy in core selection methods is proposed. The algorithm we propose guarantees that the delay from the source to any destination does not exceed a real-time constraint satisfying the delay-variation constraint under cost minimization. In addition, this core selection methods achieve a balance of optimizing cost and delay of the multicast tree. Simulation results show that the algorithm has low complexity and balances between the computational complexity and performance, it can also meet the requirements of real-time network communication.

Thoughts on Grammar Intervention in AAC

2008 ◽  
Vol 17 (2) ◽  
pp. 43-49 ◽  
Author(s):  
Marc Fey
Keyword(s):  
Language Impairment ◽  
Specific Language Impairment ◽  
Augmentative And Alternative Communication ◽  
Communication Systems ◽  
Target Language ◽  
Alternative Communication ◽  
Physical Limitations ◽  
Communication Needs ◽  
Communication Interventions ◽  
Planning Intervention

Abstract In this article, I propose that, for several reasons, grammar should be an early focus of communication interventions for young children using augmentative and alternative communication (AAC) systems. The basic goals for such programs should be to facilitate the child's comprehension of the language of the community, or the target language, thus leading the way to literacy, and to foster the child's use of symbol combinations that mirror the grammatical patterns of speaking children acquiring the target language, even if they cannot be fully grammatically complete. I introduce five principles that underlie most successful approaches to grammar interventions with children with specific language impairment. My initial attempts to apply these principles to interventions with children with complex communication needs indicate that they may be of considerable value to clinicians planning intervention programs. On the other hand, the challenges posed by the intellectual and physical limitations of many AAC users and their communication systems make it necessary to modify at least Principle 5 if the basic goals of intervention are to be met.

Sign in / Sign up

Export Citation Format

Share Document