scholarly journals Multicast Optimization And Recovery In Multihoming Environment

2021 ◽  
Author(s):  
Frank Levstek
Keyword(s):  
Steiner Tree ◽  
Multicast Tree ◽  
Link Failure ◽  
Recovery Model ◽  
Point Model ◽  
Rendezvous Point ◽  
Simulation Results ◽  
Conventional Optimization ◽  
Link Congestion ◽  
Novel Algorithm

Reliability of multicasting is increasingly becoming an important issue as the number of end users continues to grow, their demand for reliable service increases. This thesis proposes a novel algorithm for creating a recovery model while optimizing both inter and intra domain bandwidth. This is achieved by creating a centralized rendezvous point within the intra domain topology. The rendezvous point will create a static multicast tree and it will avoid link congestion during inter-domain link failure. This algorithm also reduces link congestion surrounding the border routers. This is achieved by shifting the root of the multicast tree from the border router to the rendezvous point. This rendezvous point is then selected based on an optimization algorithm to reduce bandwidth congestion. A Steiner tree was used to optimize the intra domain links. The simulation results indicate up to 30% increase over conventional optimization algorithms which do not consider a rendezvous point model.

scholarly journals Multicast Optimization And Recovery In Multihoming Environment

2021 ◽  
Author(s):  
Frank Levstek
Keyword(s):  
Steiner Tree ◽  
Multicast Tree ◽  
Link Failure ◽  
Recovery Model ◽  
Point Model ◽  
Rendezvous Point ◽  
Simulation Results ◽  
Conventional Optimization ◽  
Link Congestion ◽  
Novel Algorithm

Reliability of multicasting is increasingly becoming an important issue as the number of end users continues to grow, their demand for reliable service increases. This thesis proposes a novel algorithm for creating a recovery model while optimizing both inter and intra domain bandwidth. This is achieved by creating a centralized rendezvous point within the intra domain topology. The rendezvous point will create a static multicast tree and it will avoid link congestion during inter-domain link failure. This algorithm also reduces link congestion surrounding the border routers. This is achieved by shifting the root of the multicast tree from the border router to the rendezvous point. This rendezvous point is then selected based on an optimization algorithm to reduce bandwidth congestion. A Steiner tree was used to optimize the intra domain links. The simulation results indicate up to 30% increase over conventional optimization algorithms which do not consider a rendezvous point model.

A Novel Algorithm to Improve Network Lifetime of Wireless Sensor Networks

2013 ◽  
Vol 433-435 ◽  
pp. 599-602
Author(s):  
Rui Ma ◽  
Yan Cheng Liu ◽  
Chuan Wang
Keyword(s):  
Network Lifetime ◽  
Search Strategy ◽  
Hybrid Genetic Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Wireless Sensor Nodes ◽  
Sensor Cover ◽  
Simulation Results ◽  
Local Search Strategy ◽  
Novel Algorithm

One approach to extend the network lifetime is to divide the deployed sensors into disjoint subsets of sensors, or sensor covers, such that each sensor cover can cover all targets and work by turns. The more sensor covers can be found, the longer sensor network lifetime can be prolonged.This study propose a novel hybrid genetic algorithm (NHGA) comprising both basic generic operations with a fitness-improving local-search strategy to divide all wireless sensor nodes into a maximum number of disjoint set covers (DSCs). The simulation results show that NHGA outperforms the existing methods by generating more disjoint set covers and prolongs network lifetime.

scholarly journals On the Minimum Density Interconnection Tree Problem

VLSI Design ◽  
1994 ◽  
Vol 2 (2) ◽  
pp. 157-169 ◽  
Author(s):  
C. J. Alpert ◽  
J. Cong ◽  
A. B. Kahng ◽  
G. Robins ◽  
M. Sarrafzadeh
Keyword(s):  
Steiner Tree ◽  
Spanning Trees ◽  
Problem Instance ◽  
Low Density ◽  
Minimum Area ◽  
Solution Quality ◽  
Extensive Simulation ◽  
Minimum Density ◽  
Proof Techniques ◽  
Simulation Results

We discuss a new minimum density objective for spanning and Steiner tree constructions. This formulation is motivated by the minimum-area layout objective, which is best achieved through balancing the usage of horizontal and vertical routing resources. We present two efficient heuristics for constructing low-density spanning trees and prove that their outputs are on average within small constants of optimal with respect to both tree cost and density. Our proof techniques suggest a non-uniform lower bound schema which can afford tighter estimates of solution quality for a given problem instance. Furthermore, the minimum density objective can be transparently combined with a number of previous interconnection objectives (e.g., minimizing tree radius or skew) without affecting solution quality with respect to these previous metrics. Extensive simulation results suggest that applications to VLSI global routing are promising.

scholarly journals Fast Path Planning for On-Water Automatic Rescue Intelligent Robot Based on Constant Thrust Artificial Fluid Method

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Yongqiang Qi ◽  
Yi Ke
Keyword(s):  
Path Planning ◽  
Ant Colony Algorithm ◽  
Interpolation Method ◽  
Three Dimensional ◽  
Intelligent Robot ◽  
Perturbation Matrix ◽  
Fluid Field ◽  
Environment Model ◽  
Simulation Results ◽  
Novel Algorithm

In this paper, fast path planning of on-water automatic rescue intelligent robot is studied based on the constant thrust artificial fluid method. First, a three-dimensional environment model is established, and then the kinematics equation of the robot is given. The constant thrust artificial fluid method based on the isochronous interpolation method is proposed, and a novel algorithm of constant thrust fitting is researched through the impulse compensation. The effect of obstacles on original fluid field is quantified by the perturbation matrix, and the streamlines can be regarded as the planned path. Simulation results demonstrate the effectiveness of this method by comparing with A-star algorithm and ant colony algorithm. It is proved that the planned path can avoid all obstacles smoothly and swiftly and reach the destination eventually.

scholarly journals A Doorway Detection and Direction (3Ds) System for Social Robots via a Monocular Camera

Sensors ◽  
2020 ◽  
Vol 20 (9) ◽  
pp. 2477 ◽  
Author(s):  
Kamal M. Othman ◽  
Ahmad B. Rad
Keyword(s):  
Neural Network ◽  
Convolutional Neural Network ◽  
Navigation System ◽  
Social Robot ◽  
Indoor Navigation ◽  
Indoor Environments ◽  
Robotic Navigation ◽  
Monocular Camera ◽  
Simulation Results ◽  
Novel Algorithm

In this paper, we propose a novel algorithm to detect a door and its orientation in indoor settings from the view of a social robot equipped with only a monocular camera. The challenge is to achieve this goal with only a 2D image from a monocular camera. The proposed system is designed through the integration of several modules, each of which serves a special purpose. The detection of the door is addressed by training a convolutional neural network (CNN) model on a new dataset for Social Robot Indoor Navigation (SRIN). The direction of the door (from the robot’s observation) is achieved by three other modules: Depth module, Pixel-Selection module, and Pixel2Angle module, respectively. We include simulation results and real-time experiments to demonstrate the performance of the algorithm. The outcome of this study could be beneficial in any robotic navigation system for indoor environments.

Design and Implementation of an Adaptable Trickle Algorithm for Amelioration of RPL Usage in Internet of Things Networks

2021 ◽  
Vol 18 (4) ◽  
pp. 1186-1193
Author(s):  
J. N. V. R. Swarup Kumar ◽  
D. Suresh
Keyword(s):  
Internet Of Things ◽  
Low Power ◽  
Lossy Networks ◽  
Message Routing ◽  
Design And Implementation ◽  
Different Types ◽  
Simulation Results ◽  
Two Parameters ◽  
Novel Algorithm

The efficient message routing is highly challenging in terms of low power and lossy networks (loT) for transmission of data with overhead and delay. The protocols used for routing need to be designed such that they should be working efficiently. Efficiency in calculated in terms of energy and delivery of packets. RPL protocol is also designed with the aim of making these two parameters efficient. Even then it contains drawbacks. Trickle algorithm is designed with a goal to reduce the drawbacks in RPL. Trickle algorithm is used in RPL protocols for creation of routes between nodes in the network with different intervals. Unfortunately, there exists some more downsides for the trickle algorithm, which made design of several algorithms inorder to analyse different drawbacks. In this paper, on analysing different types of trickle algorithms and locating the drawback in every algorithm, a novel algorithm is designed which helps in reduction of the drawbacks that are found. The description of this algorithm along with the simulation results done using Cooja 3.0 simulator is also discussed in this paper. The Simulation of the algorithm that is newly designed is done by assuming a network with different count of nodes and comparing the results with the previously introduced Trickle algorithms.

An Energy-Saving Anti-Collision Algorithm for the Active RFID Systems by Decreasing the Overhearing Slots

2014 ◽  
Vol 1049-1050 ◽  
pp. 1722-1725
Author(s):  
Chu Liu ◽  
Jian Cheng Li ◽  
Li Ming Zheng ◽  
Qing Yang
Keyword(s):  
Energy Saving ◽  
Random Selection ◽  
System Delay ◽  
Active Rfid ◽  
Rfid Systems ◽  
Rfid System ◽  
Simulation Results ◽  
Novel Algorithm

Anti-collision algorithms for active RFID system which are based on the ALOHA always have a serious overhearing problem because of the random selection in the system. Although the active tag can avoid the overhearing problem to some extent by applying the tree-based deterministic anti-collision algorithm, the system will using more time on account of more reader queries. We propose a novel algorithm which based on the superiorities in the recalled protocols. Simulation results show that the algorithm effectively reduce excessive inventory listening and system delay.

scholarly journals MULTICAST STATE DISTRIBUTION BY JOINS USING MULTIPLE SHORTEST PATHS

2005 ◽  
Vol 06 (02) ◽  
pp. 115-129
Author(s):  
DAMIEN MAGONI ◽  
PASCAL LORENZ
Keyword(s):  
Routing Protocol ◽  
Shortest Paths ◽  
Multicast Tree ◽  
Tree Size ◽  
Crucial Issue ◽  
State Distribution ◽  
State Information ◽  
Multicast Protocols ◽  
Unicast Routing ◽  
Simulation Results

The lack of resources in routers will become a crucial issue with the deployment of state storing protocols. In particular, single or any source multicast protocols will most probably take over large amounts of resources for maintaining multicast tree information. The aim of this paper is to study the possibility and benefit of using multiple shortest paths in order for a new member to reach a multicast tree. Such a mechanism would not reduce the overall amount of state information in the network but it would distribute this amount more evenly among all routers. The idea is to use alternate shortest paths provided by the underlying unicast routing protocol to avoid saturated routers, that is, routers that can not or do not want to store any more multicast state information. As the simulation results are very sensitive to the topology, we have used subgraphs of an Internet map. We have then simulated our multipath join mechanism and have found that depending on the tree size, the use of our mechanism can increase successful join attempts by up to 55% when the network is half saturated.

Multiset Canonical Correlation Analysis Using for Blind Source Separation

2012 ◽  
Vol 195-196 ◽  
pp. 104-108 ◽  
Author(s):  
Hua Gang Yu ◽  
Gao Ming Huang ◽  
Jun Gao
Keyword(s):  
Correlation Analysis ◽  
Blind Source Separation ◽  
Canonical Correlation Analysis ◽  
Statistical Characteristic ◽  
Canonical Correlation ◽  
Temporal Structure ◽  
Source Separation ◽  
Simulation Results ◽  
Source Signals ◽  
Novel Algorithm

To solve the problem of blind source separation, a novel algorithm based on multiset canonical correlation analysis is presented by exploiting the different temporal structure of uncorrelated source signals. In contrast to higher order cumulant techniques, this algorithm is based on second order statistical characteristic of observation signals, can blind separate super-Gaussian and sub-Gaussian signals successfully at the same time with relatively light computation burden. Simulation results confirm that the algorithm is efficient and feasible.

Sign in / Sign up

Export Citation Format

Share Document