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.

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.

Research of Multiple Constrained Qos Routing Based on Improved Ant Colony Algorithm

2014 ◽  
Vol 513-517 ◽  
pp. 994-998 ◽  
Author(s):  
Yue Gong ◽  
Jia Nan Wang
Keyword(s):  
Maximum Degree ◽  
Ant Colony Algorithm ◽  
Routing Algorithm ◽  
Qos Routing ◽  
Ant Colony ◽  
Multiple Constraints ◽  
Simulation Experiments ◽  
Qos Routing Algorithm ◽  
Multiple Qos Constraints ◽  
Multiple Qos

This paper mainly discusses the Multiple Constrained Qos Routing Algorithm, in the analysis of the basic on the basis of mathematical model of Qos routing. It has proposed a routing model with an objective function, integrated optimization of multiple Qos constraints. Finally, the optimization of ant colony algorithm applied to solve the problem of multiple constraints Qos. Through simulation experiments proved that the algorithm to find the path to maximum degree meets Qos requirements.

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.

Dynamic Routing Algorithm Based on HIP Multicast Model

2012 ◽  
Vol 424-425 ◽  
pp. 607-611
Author(s):  
Xue Zhen Shen ◽  
Xin Guo Tang
Keyword(s):  
Loss Rate ◽  
Multicast Routing ◽  
Search Algorithm ◽  
Routing Algorithm ◽  
Simulation Experiments ◽  
Delay Jitter ◽  
Result Show ◽  
Dynamic Multicast ◽  
Multicast Routing Algorithm ◽  
Multiple Qos

A HIP multicast mode; based dynamic multicast routing algorithm (HIPDMR) was brought out and network model was established to describe and simplify problem to be researched. HIPDMR used Bellman-Ford as routing search algorithm, which can determine dynamic multicast routing with minimum hop number and overhead while meet constraints of bandwidth, delay, jitter and packet loss rate. Simulation experiments result show that HIPDMR can build dynamic multicast routing under constraints of multiple QoS comparing with algorithms that not considering QoS assuming network node output link capacity be equal

Multicast Routing Algorithm with QoS Constraints in Mobile Ad Hoc Networks

2014 ◽  
Vol 602-605 ◽  
pp. 3169-3172 ◽  
Author(s):  
Yue Li ◽  
Yin Hui Liu ◽  
Zhong Bao Luo
Keyword(s):  
Ad Hoc ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Estimation Algorithm ◽  
Bandwidth Estimation ◽  
Routing Problem ◽  
Network Bandwidth ◽  
Hoc Networks ◽  
Multicast Routing Algorithm ◽  
Select Function

Through the study of MANET's QoS multicast routing problem, we propose a heuristic-demand multicast routing algorithm. Algorithm combines the MANET network bandwidth estimation algorithm, redefined the select function, restrictions request packets of flooding algorithm, to ensure fair treatment delay and bandwidth. Simulation results show that the algorithm has the advantage of fewer routing overhead, high success rate.

scholarly journals An Integrated Routing Mechanism on Homogenous Wireless Sensor Networks using Genetic Algorithm

2021 ◽  
Author(s):  
Ramin Danehchin
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Hop Count ◽  
Routing Problem ◽  
Cluster Heads

Abstract Data collection on Wireless Sensor Networks (WSNs) is a significant challenge to satisfy the requirements of various applications. Providing an energy-efficient routing technique is the primary step in data collection over WSNs. The existing data collection techniques in the WSNs field struggle with the imbalance load distribution and the short lifetime of the network. This paper proposes a novel mechanism to select cluster-heads, cluster the wireless sensor nodes, and determine the optimal route from source nodes to the sink. We employ the genetic algorithm to solve the routing problem considering the hop-count of the cluster-heads to the sink, the number of each cluster member, residual energy of cluster-heads, and the number of cluster-heads connected to the sink as the fitness criteria. Our proposed mechanism uses a greedy approach to calculate the hop-count of each cluster-head to the sink for integrating the clustering and routing process on WSNs. The simulation results demonstrate that our proposed mechanism improves the energy consumption, the number of live nodes, and the lifetime of the network compared to other data collection approaches on WSNs.

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.

Sign in / Sign up

Export Citation Format

Share Document