This document describes a fault tolerant routing algorithm for an octagon-cell interconnected network. The network can be modeled as an undirected graph with processors as vertices and communication links as edges. The algorithm handles faulty nodes or link failures along the optimal routing path between a source and destination node. It works by having each node store the status of its three consecutive nodes/links on the original path. If a fault is detected, the algorithm dynamically finds an alternate fault-free path around the failure while still routing the message from the source to destination. Pseudocode is provided outlining the specific steps and logic used for horizontal routing under different fault scenarios.
Vertex covering has important applications for wireless sensor networks such as monitoring link failures,
facility location, clustering, and data aggregation. In this study, we designed three algorithms for
constructing vertex cover in wireless sensor networks. The first algorithm, which is an adaption of the
Parnas & Ron’s algorithm, is a greedy approach that finds a vertex cover by using the degrees of the
nodes. The second algorithm finds a vertex cover from graph matching where Hoepman’s weighted
matching algorithm is used. The third algorithm firstly forms a breadth-first search tree and then
constructs a vertex cover by selecting nodes with predefined levels from breadth-first tree. We show the
operation of the designed algorithms, analyze them, and provide the simulation results in the TOSSIM
environment. Finally we have implemented, compared and assessed all these approaches. The transmitted
message count of the first algorithm is smallest among other algorithms where the third algorithm has
turned out to be presenting the best results in vertex cover approximation ratio.
ANGLE ROUTING:A FULLY ADAPTIVE PACKET ROUTING FOR NOCijcsa
The performance of network-on-chip largely depends on the underlying routing techniques. In this paper a
novel fully adaptive deadlock-free packet routing algorithm for network on chip is proposed. This method which is called angle routing (AR) determines a path based on minimizing the angle between the candidate
neighbouring switch, current switch and destination. Simulation results under different traffic patterns
show that, as the volume traffic of the network on chip increases, our new algorithm achieves significant
better average latency compared to some other deterministic and partially adaptive routing algorithms.
A NEW INTERCONNECTION TOPOLOGY FOR NETWORK ON CHIPIJCNCJournal
The architecture of networks on chip (NOC) highly affects the overall performance of the system on chip (SOC). A new topology for chip interconnection called Torus connected Rings is proposed. Due to the presence of multiple disjoint paths between any source and destination pair, this topology exhibits high fault tolerance capability. The proposed routing method can tolerate faults adaptively. TCR is simple in design and highly scalable. The detailed design and topological parameters are compared with alternate topologies.
A New Approach to Linear Estimation Problem in Multiuser Massive MIMO SystemsRadita Apriana
A novel approach for solving linear estimation problem in multi-user massive MIMO systems is
proposed. In this approach, the difficulty of matrix inversion is attributed to the incomplete definition of the
dot product. The general definition of dot product implies that the columns of channel matrix are always
orthogonal whereas, in practice, they may be not. If the latter information can be incorporated into dot
product, then the unknowns can be directly computed from projections without inverting the channel
matrix. By doing so, the proposed method is able to achieve an exact solution with a 25% reduction in
computational complexity as compared to the QR method. Proposed method is stable, offers an extra
flexibility of computing any single unknown, and can be implemented in just twelve lines of code.
Derivative threshold actuation for single phase wormhole detection with reduc...ijdpsjournal
Communication in mobile Ad hoc networks is completed via multi
-
hop ways. Owing to the distributed
specification and restricted resource of nodes, MANET is a lot prone
to wormhole attacks i.e. wormhole
attacks place severe threats to each Ad hoc routing protocol and a few security enhancements. Thus,
so as
to discover wormholes, totally different techniques are in use. In all those techniques fixation of
threshold
is mer
ely by trial & error methodology or by random manner. Conjointly wormhole detection is in twin
part by putting the nodes that is higher than the edge in a suspicious set, however predicting the n
ode as a
wormhole by using some other algorithms. Our aim in
this paper is to deduce the traffic threshold level by
derivational approach for identifying wormholes in a very single phase in relay network having dissi
milar
characteristics.
Multistage interconnection networks (MIN) are among the most efficient switching architectures for the number of switching Element (SE). Optical crosstalk in optical multistage interconnection network on the omega network topology Switches are arranged in multiple stages. These switches also referred to as switching element (SEs) have two input and two output ports, interconnected to the neighboring stages in a shuffle exchange connected pattern message routing in such a network is determined by the interstate connection pattern.
Optical Multistage interconnection networks (OMIN) are advanced version of MINs. The main Problem with OMIN is crosstalk. The main purpose of this paper is to Present crosstalk free modified omega network, which is based on time domain approach. This paper presents the source and destination based Algorithm (SDBA) .SDBA does the scheduling for source and their respective destination addresses for the message routing. SDBA is compared with the crosstalk modified omega network (CFMON).CFMON also Minimizes the crosstalk. This paper is the modified form of the omega network.
Vertex covering has important applications for wireless sensor networks such as monitoring link failures,
facility location, clustering, and data aggregation. In this study, we designed three algorithms for
constructing vertex cover in wireless sensor networks. The first algorithm, which is an adaption of the
Parnas & Ron’s algorithm, is a greedy approach that finds a vertex cover by using the degrees of the
nodes. The second algorithm finds a vertex cover from graph matching where Hoepman’s weighted
matching algorithm is used. The third algorithm firstly forms a breadth-first search tree and then
constructs a vertex cover by selecting nodes with predefined levels from breadth-first tree. We show the
operation of the designed algorithms, analyze them, and provide the simulation results in the TOSSIM
environment. Finally we have implemented, compared and assessed all these approaches. The transmitted
message count of the first algorithm is smallest among other algorithms where the third algorithm has
turned out to be presenting the best results in vertex cover approximation ratio.
ANGLE ROUTING:A FULLY ADAPTIVE PACKET ROUTING FOR NOCijcsa
The performance of network-on-chip largely depends on the underlying routing techniques. In this paper a
novel fully adaptive deadlock-free packet routing algorithm for network on chip is proposed. This method which is called angle routing (AR) determines a path based on minimizing the angle between the candidate
neighbouring switch, current switch and destination. Simulation results under different traffic patterns
show that, as the volume traffic of the network on chip increases, our new algorithm achieves significant
better average latency compared to some other deterministic and partially adaptive routing algorithms.
A NEW INTERCONNECTION TOPOLOGY FOR NETWORK ON CHIPIJCNCJournal
The architecture of networks on chip (NOC) highly affects the overall performance of the system on chip (SOC). A new topology for chip interconnection called Torus connected Rings is proposed. Due to the presence of multiple disjoint paths between any source and destination pair, this topology exhibits high fault tolerance capability. The proposed routing method can tolerate faults adaptively. TCR is simple in design and highly scalable. The detailed design and topological parameters are compared with alternate topologies.
A New Approach to Linear Estimation Problem in Multiuser Massive MIMO SystemsRadita Apriana
A novel approach for solving linear estimation problem in multi-user massive MIMO systems is
proposed. In this approach, the difficulty of matrix inversion is attributed to the incomplete definition of the
dot product. The general definition of dot product implies that the columns of channel matrix are always
orthogonal whereas, in practice, they may be not. If the latter information can be incorporated into dot
product, then the unknowns can be directly computed from projections without inverting the channel
matrix. By doing so, the proposed method is able to achieve an exact solution with a 25% reduction in
computational complexity as compared to the QR method. Proposed method is stable, offers an extra
flexibility of computing any single unknown, and can be implemented in just twelve lines of code.
Derivative threshold actuation for single phase wormhole detection with reduc...ijdpsjournal
Communication in mobile Ad hoc networks is completed via multi
-
hop ways. Owing to the distributed
specification and restricted resource of nodes, MANET is a lot prone
to wormhole attacks i.e. wormhole
attacks place severe threats to each Ad hoc routing protocol and a few security enhancements. Thus,
so as
to discover wormholes, totally different techniques are in use. In all those techniques fixation of
threshold
is mer
ely by trial & error methodology or by random manner. Conjointly wormhole detection is in twin
part by putting the nodes that is higher than the edge in a suspicious set, however predicting the n
ode as a
wormhole by using some other algorithms. Our aim in
this paper is to deduce the traffic threshold level by
derivational approach for identifying wormholes in a very single phase in relay network having dissi
milar
characteristics.
Multistage interconnection networks (MIN) are among the most efficient switching architectures for the number of switching Element (SE). Optical crosstalk in optical multistage interconnection network on the omega network topology Switches are arranged in multiple stages. These switches also referred to as switching element (SEs) have two input and two output ports, interconnected to the neighboring stages in a shuffle exchange connected pattern message routing in such a network is determined by the interstate connection pattern.
Optical Multistage interconnection networks (OMIN) are advanced version of MINs. The main Problem with OMIN is crosstalk. The main purpose of this paper is to Present crosstalk free modified omega network, which is based on time domain approach. This paper presents the source and destination based Algorithm (SDBA) .SDBA does the scheduling for source and their respective destination addresses for the message routing. SDBA is compared with the crosstalk modified omega network (CFMON).CFMON also Minimizes the crosstalk. This paper is the modified form of the omega network.
FAULT-TOLERANT MULTIPATH ROUTING SCHEME FOR ENERGY EFFICIENT WIRELESS SENSOR ...ijwmn
Themain challengein wireless sensor network is to improve the fault tolerance of each
node and also provide an energy efficient fast data routing service. In this paper we propose an
energyefficient node fault diagnosis and recovery for wireless sensor networks referred as fault tolerant
multipath routing scheme for energy efficientwireless sensor network (FTMRS).The FTMRSis based on
multipath data routing scheme. One shortest path is use for main data routing in FTMRS technique and
other two backup paths are used as alternative path for faulty network and to handle the overloaded
traffic on main channel.Shortest path data routing ensures energy efficient data routing. The
performance analysis of FTMRSshows better results compared to other popular fault tolerant techniques
in wireless sensor networks.
Determination of Fault Location and Type in Distribution Systems using Clark ...IJAPEJOURNAL
In this paper, an accurate method for determination of fault location and fault type in power distribution systems by neural network is proposed. This method uses neural network to classify and locate normal and composite types of faults as phase to earth, two phases to earth, phase to phase. Also this method can distinguish three phase short circuit from normal network position. In the presented method, neural network is trained by αβ space vector parameters. These parameters are obtained using clarke transformation. Simulation results are presented in the MATLAB software. Two neural networks (MLP and RBF) are investigated and their results are compared with each other. The accuracy and benefit of the proposed method for determination of fault type and location in distribution power systems has been shown in simulation results.
Section based hex cell routing algorithm (sbhcr)IJCNCJournal
A Hex-Cell network topology can be constructed using units of hexagon cells. It has been introduced in the literature as interconnection network suitable for large parallel computers, which can connect large number of nodes with three links per node. Although this topology exhibits attractive characteristics such as embeddability, symmetry, regularity, strong resilience, and simple routing, the previously suggested routing algorithms suffer from the high number of logical operations and the need for readdressing of nodes every time a new level is add to the network. This negatively impacts the performance of the network as it increases the execution time of these algorithms. In this paper we propose an improved optimal point to point routing algorithm for Hex-Cell network. The algorithm is based on dividing the Hex-Cell topology into six divisions, hence the name Section Based Hex-Cell Routing (SBHCR). The SBHCR algorithm is simple and preserves the advantage of the addressing scheme proposed for the Hex-Cell network. It does not depend on the depth of the network topology which leads to overcome the issue of readdressing of nodes every time a new level is added. Evaluation against two previously suggested routing algorithms has shown the superiority of SBHCR in term of less logical operations.
An Efficient Clustering Method for Aggregation on Data FragmentsIJMER
Clustering is an important step in the process of data analysis with applications to numerous fields. Clustering ensembles, has emerged as a powerful technique for combining different clustering results to obtain a quality cluster. Existing clustering aggregation algorithms are applied directly to large number of data points. The algorithms are inefficient if the number of data points is large. This project defines an efficient approach for clustering aggregation based on data fragments. In fragment-based approach, a data fragment is any subset of the data. To increase the efficiency of the proposed approach, the clustering aggregation can be performed directly on data fragments under comparison measure and normalized mutual information measures for clustering aggregation, enhanced clustering aggregation algorithms are described. To show the minimal computational complexity. (Agglomerative, Furthest, and Local Search); nevertheless, which increases the accuracy.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A Survey on Topology Control and Maintenance in Wireless Sensor Networksijeei-iaes
Wireless Sensor Networks (WSNs) consist of devices equipped with radio transceivers that cooperate to form and maintain a fully connected network of sensor nodes. WSNs do not have a fixed infrastructure and do not use centralized methods for organization. This flexibility enables them to be used whenever a fixed infrastructure is unfeasible or inconvenient, hence making them attractive for numerous applications ranging from military, civil, industrial or health. Because of their unique structure, and limited energy storage, computational and memory resources, many of the existing protocols and algorithms designed for wired or wireless ad hoc networks cannot be directly used in WSNs. Beside this, they offer a flexible low cost solution to the problem of event monitoring, especially in places with limited accessibility or that represent danger to humans. Applications of large scale WSNs are becoming a reality example are being a Smart Grid, Machine to Machine communication networks and smart environment. It is expected that a topology control techniques will play an important role in managing the complexity of such highly complicated and distributed systems through self-organization capabilities. WSNs are made of resource constrained wireless devices, which require energy efficient mechanisms, algorithm/protocol. Control on topology is very important for efficient utilization of networks and is composed of two mechanisms, Topology Construction (TC) and Topology Maintenance (TM). By using these mechanism various protocols/algorithm have came into existence, like: A3, A3-Coverage (A3-Cov), Simple Tree, Just Tree, etc. This paper provides a full view of the studies of above mentioned algorithms and also provides an analysis of their merits and demerits.
Minimization of Localization Error using Connectivity based Geometrical Metho...Dr. Amarjeet Singh
Many localization schemes are designed for finding
the geographical coordinates of the unlocalized node in the
network. Still, it is a difficult problem to find accurate and
efficient localization schemes in the Wireless Sensor Networks
(WSNs). We proposed a new method, connectivity based WSN
node localization using one of the geometrical method namely
centroid of a triangle. By developing the centroid of a triangle
from the WSN network model in terms of localization
requirements. The simulation outcomes have shown that the
modified centroid (centroid_T) performs marginally better
than the existing centroid method with a marginally increase
in the computation process. We also observe the variation of
localization error with various anchor nodes, radio range, and
network size.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
A novel scheme for reliable multipath routing through node independent direct...eSAT Journals
Abstract Multipath routing is essential in the wake of voice over IP, multimedia streaming for efficient data transmission. The growing usage of such network requirements also demands fast recovery from network failures. Multipath routing is one of the promising routing schemes to accommodate the diverse requirements of the network with provision such as load balancing and improved bandwidth. Cho et al. introduced a resilient multipath routing scheme known as directed acyclic graphs. These graphs enable multipath routing with all possible edges while ensuring guaranteed recovery from single point of failures. We also built a prototype application that demonstrates the efficiency of the scheme. The simulation results revealed that the scheme is useful and can be used in real world network applications.
Index Terms – Multipath routing, failure recovery, directed acyclic graphs
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Manets: Increasing N-Messages Delivery Probability Using Two-Hop Relay with E...ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
In this video from the 2015 HPC User Forum in Broomfield, Barry Bolding from Cray presents: HPC + D + A = HPDA?
"The flexible, multi-use Cray Urika-XA extreme analytics platform addresses perhaps the most critical obstacle in data analytics today — limitation. Analytics problems are getting more varied and complex but the available solution technologies have significant constraints. Traditional analytics appliances lock you into a single approach and building a custom solution in-house is so difficult and time consuming that the business value derived from analytics fails to materialize. In contrast, the Urika-XA platform is open, high performing and cost effective, serving a wide range of analytics tools with varying computing demands in a single environment. Pre-integrated with the Hadoop and Spark frameworks, the Urika-XA system combines the benefits of a turnkey analytics appliance with a flexible, open platform that you can modify for future analytics workloads. This single-platform consolidation of workloads reduces your analytics footprint and total cost of ownership."
Learn more: http://www.cray.com/products/analytics/urika-xa
Watch the video presentation: http://wp.me/p3RLEV-3yR
Sign up for our insideBIGDATA Newsletter: http://insidebigdata.com/newsletter
Performance Evaluation of DV-HOP and Amorphous Algorithms based on Localizati...TELKOMNIKA JOURNAL
In the field of high-risk observation, the nodes in Wireless Sensor Network (WSN) are distributed
randomly. The result from sensing becomes meaningless if it is not known from where the originating node
is. Therefore, a sensor node positioning scheme, known as the localization scheme, is required. The
localization scheme consists of distance estimation and position computing. Thus, this research used
connectivity as distance estimation within range free algorithm DV-Hop and Amorphous, and then trilateral
algorithm for computing the position. Besides that, distance estimation using the connectivity between
nodes is not needed for the additional hardware ranging as required by a range-based localization
scheme. In this research compared the localization algorithm based on range free localization, which are
DV-Hop algorithm and Amorphous algorithm. The simulation result shows that the amorphous alg orithm
have achieved 13.60% and 24.538% lower than dv-hop algorithm for each parameter error localization and
energy consumption. On node density variations, dv-hop algorithm gained a localization error that is
26.95% lower than amorphous algorithm, but for energy consumption parameter, amorphous gained
14.227% lower than dv-hop algorithm. In the communication range variation scenario, dv-hop algorithm
gained a localization error that is50.282% lower than amorphous. However, for energy consumption
parameter, amorphous algorithm gained 12.35%. lower than dv-hop algorithm.
Redundant Actor Based Multi-Hole Healing System for Mobile Sensor NetworksEditor IJCATR
In recent years, the Mobile Wireless Sensor Network
is the emerging solution for monitoring of a specified region of
interest. Several anomalies can occur in WSNs that impair their
desired functionalities resulting in the formation of different
kinds of holes, namely: coverage holes, routing holes. Our
ultimate aim is to cover total area without coverage hole in
wireless sensor networks. We propose a comprehensive solution,
called holes detection and healing. We divided our proposed
work into two phases. The first phase consists of three sub- tasks;
Hole-identification, Hole-discovery and border detection. The
second phase treats the Hole-healing with novel concept, hole
healing area. It consists of two sub-tasks; Hole healing area
determination and node relocation.
International Refereed Journal of Engineering and Science (IRJES)irjes
International Refereed Journal of Engineering and Science (IRJES) is a leading international journal for publication of new ideas, the state of the art research results and fundamental advances in all aspects of Engineering and Science. IRJES is a open access, peer reviewed international journal with a primary objective to provide the academic community and industry for the submission of half of original research and applications.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
CORRELATION AND REGRESSION ANALYSIS FOR NODE BETWEENNESS CENTRALITYijfcstjournal
In this paper, we seek to find a computationally light centrality metric that could serve as an alternate for the computationally heavy betweenness centrality (BWC) metric. In this pursuit, in the first half of the paper, we evaluate the correlation coefficient between BWC and the other commonly used centrality metrics such as Degree Centrality (DEG), Closeness Centrality (CLC), Farness Centrality (FRC),Clustering Coefficient Centrality (CCC) and Eigenvector Centrality (EVC). We observe BWC to be highly correlated with DEG for synthetic networks generated based on the Erdos-Renyi model (for randomnetworks) and Watts-Strogatz model (for small-world networks). In the second half of the paper, weconduct a regression analysis for BWC with that of a recently proposed centrality metric called thelocalized clustering coefficient complement-based degree centrality (LCC'DC) for a suite of 47 real-world networks. The R-Squared metric and Correlation coefficient for the LCC'DC-BWC regression has been observed to be appreciably greater than those observed for the DEG-BWC regression. We also bserve the LCC'DC-BWC regression to incur relatively a lower value for the standard error of residuals for a majority of the real-world networks.
As pioneers in Outdoor Advertising we recognize and understand the intrinsic value of our Clients and their Products. We believe our continued success stems from a passion for creating value for our Customers, employees and the community of large.
FAULT-TOLERANT MULTIPATH ROUTING SCHEME FOR ENERGY EFFICIENT WIRELESS SENSOR ...ijwmn
Themain challengein wireless sensor network is to improve the fault tolerance of each
node and also provide an energy efficient fast data routing service. In this paper we propose an
energyefficient node fault diagnosis and recovery for wireless sensor networks referred as fault tolerant
multipath routing scheme for energy efficientwireless sensor network (FTMRS).The FTMRSis based on
multipath data routing scheme. One shortest path is use for main data routing in FTMRS technique and
other two backup paths are used as alternative path for faulty network and to handle the overloaded
traffic on main channel.Shortest path data routing ensures energy efficient data routing. The
performance analysis of FTMRSshows better results compared to other popular fault tolerant techniques
in wireless sensor networks.
Determination of Fault Location and Type in Distribution Systems using Clark ...IJAPEJOURNAL
In this paper, an accurate method for determination of fault location and fault type in power distribution systems by neural network is proposed. This method uses neural network to classify and locate normal and composite types of faults as phase to earth, two phases to earth, phase to phase. Also this method can distinguish three phase short circuit from normal network position. In the presented method, neural network is trained by αβ space vector parameters. These parameters are obtained using clarke transformation. Simulation results are presented in the MATLAB software. Two neural networks (MLP and RBF) are investigated and their results are compared with each other. The accuracy and benefit of the proposed method for determination of fault type and location in distribution power systems has been shown in simulation results.
Section based hex cell routing algorithm (sbhcr)IJCNCJournal
A Hex-Cell network topology can be constructed using units of hexagon cells. It has been introduced in the literature as interconnection network suitable for large parallel computers, which can connect large number of nodes with three links per node. Although this topology exhibits attractive characteristics such as embeddability, symmetry, regularity, strong resilience, and simple routing, the previously suggested routing algorithms suffer from the high number of logical operations and the need for readdressing of nodes every time a new level is add to the network. This negatively impacts the performance of the network as it increases the execution time of these algorithms. In this paper we propose an improved optimal point to point routing algorithm for Hex-Cell network. The algorithm is based on dividing the Hex-Cell topology into six divisions, hence the name Section Based Hex-Cell Routing (SBHCR). The SBHCR algorithm is simple and preserves the advantage of the addressing scheme proposed for the Hex-Cell network. It does not depend on the depth of the network topology which leads to overcome the issue of readdressing of nodes every time a new level is added. Evaluation against two previously suggested routing algorithms has shown the superiority of SBHCR in term of less logical operations.
An Efficient Clustering Method for Aggregation on Data FragmentsIJMER
Clustering is an important step in the process of data analysis with applications to numerous fields. Clustering ensembles, has emerged as a powerful technique for combining different clustering results to obtain a quality cluster. Existing clustering aggregation algorithms are applied directly to large number of data points. The algorithms are inefficient if the number of data points is large. This project defines an efficient approach for clustering aggregation based on data fragments. In fragment-based approach, a data fragment is any subset of the data. To increase the efficiency of the proposed approach, the clustering aggregation can be performed directly on data fragments under comparison measure and normalized mutual information measures for clustering aggregation, enhanced clustering aggregation algorithms are described. To show the minimal computational complexity. (Agglomerative, Furthest, and Local Search); nevertheless, which increases the accuracy.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A Survey on Topology Control and Maintenance in Wireless Sensor Networksijeei-iaes
Wireless Sensor Networks (WSNs) consist of devices equipped with radio transceivers that cooperate to form and maintain a fully connected network of sensor nodes. WSNs do not have a fixed infrastructure and do not use centralized methods for organization. This flexibility enables them to be used whenever a fixed infrastructure is unfeasible or inconvenient, hence making them attractive for numerous applications ranging from military, civil, industrial or health. Because of their unique structure, and limited energy storage, computational and memory resources, many of the existing protocols and algorithms designed for wired or wireless ad hoc networks cannot be directly used in WSNs. Beside this, they offer a flexible low cost solution to the problem of event monitoring, especially in places with limited accessibility or that represent danger to humans. Applications of large scale WSNs are becoming a reality example are being a Smart Grid, Machine to Machine communication networks and smart environment. It is expected that a topology control techniques will play an important role in managing the complexity of such highly complicated and distributed systems through self-organization capabilities. WSNs are made of resource constrained wireless devices, which require energy efficient mechanisms, algorithm/protocol. Control on topology is very important for efficient utilization of networks and is composed of two mechanisms, Topology Construction (TC) and Topology Maintenance (TM). By using these mechanism various protocols/algorithm have came into existence, like: A3, A3-Coverage (A3-Cov), Simple Tree, Just Tree, etc. This paper provides a full view of the studies of above mentioned algorithms and also provides an analysis of their merits and demerits.
Minimization of Localization Error using Connectivity based Geometrical Metho...Dr. Amarjeet Singh
Many localization schemes are designed for finding
the geographical coordinates of the unlocalized node in the
network. Still, it is a difficult problem to find accurate and
efficient localization schemes in the Wireless Sensor Networks
(WSNs). We proposed a new method, connectivity based WSN
node localization using one of the geometrical method namely
centroid of a triangle. By developing the centroid of a triangle
from the WSN network model in terms of localization
requirements. The simulation outcomes have shown that the
modified centroid (centroid_T) performs marginally better
than the existing centroid method with a marginally increase
in the computation process. We also observe the variation of
localization error with various anchor nodes, radio range, and
network size.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
A novel scheme for reliable multipath routing through node independent direct...eSAT Journals
Abstract Multipath routing is essential in the wake of voice over IP, multimedia streaming for efficient data transmission. The growing usage of such network requirements also demands fast recovery from network failures. Multipath routing is one of the promising routing schemes to accommodate the diverse requirements of the network with provision such as load balancing and improved bandwidth. Cho et al. introduced a resilient multipath routing scheme known as directed acyclic graphs. These graphs enable multipath routing with all possible edges while ensuring guaranteed recovery from single point of failures. We also built a prototype application that demonstrates the efficiency of the scheme. The simulation results revealed that the scheme is useful and can be used in real world network applications.
Index Terms – Multipath routing, failure recovery, directed acyclic graphs
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Manets: Increasing N-Messages Delivery Probability Using Two-Hop Relay with E...ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
In this video from the 2015 HPC User Forum in Broomfield, Barry Bolding from Cray presents: HPC + D + A = HPDA?
"The flexible, multi-use Cray Urika-XA extreme analytics platform addresses perhaps the most critical obstacle in data analytics today — limitation. Analytics problems are getting more varied and complex but the available solution technologies have significant constraints. Traditional analytics appliances lock you into a single approach and building a custom solution in-house is so difficult and time consuming that the business value derived from analytics fails to materialize. In contrast, the Urika-XA platform is open, high performing and cost effective, serving a wide range of analytics tools with varying computing demands in a single environment. Pre-integrated with the Hadoop and Spark frameworks, the Urika-XA system combines the benefits of a turnkey analytics appliance with a flexible, open platform that you can modify for future analytics workloads. This single-platform consolidation of workloads reduces your analytics footprint and total cost of ownership."
Learn more: http://www.cray.com/products/analytics/urika-xa
Watch the video presentation: http://wp.me/p3RLEV-3yR
Sign up for our insideBIGDATA Newsletter: http://insidebigdata.com/newsletter
Performance Evaluation of DV-HOP and Amorphous Algorithms based on Localizati...TELKOMNIKA JOURNAL
In the field of high-risk observation, the nodes in Wireless Sensor Network (WSN) are distributed
randomly. The result from sensing becomes meaningless if it is not known from where the originating node
is. Therefore, a sensor node positioning scheme, known as the localization scheme, is required. The
localization scheme consists of distance estimation and position computing. Thus, this research used
connectivity as distance estimation within range free algorithm DV-Hop and Amorphous, and then trilateral
algorithm for computing the position. Besides that, distance estimation using the connectivity between
nodes is not needed for the additional hardware ranging as required by a range-based localization
scheme. In this research compared the localization algorithm based on range free localization, which are
DV-Hop algorithm and Amorphous algorithm. The simulation result shows that the amorphous alg orithm
have achieved 13.60% and 24.538% lower than dv-hop algorithm for each parameter error localization and
energy consumption. On node density variations, dv-hop algorithm gained a localization error that is
26.95% lower than amorphous algorithm, but for energy consumption parameter, amorphous gained
14.227% lower than dv-hop algorithm. In the communication range variation scenario, dv-hop algorithm
gained a localization error that is50.282% lower than amorphous. However, for energy consumption
parameter, amorphous algorithm gained 12.35%. lower than dv-hop algorithm.
Redundant Actor Based Multi-Hole Healing System for Mobile Sensor NetworksEditor IJCATR
In recent years, the Mobile Wireless Sensor Network
is the emerging solution for monitoring of a specified region of
interest. Several anomalies can occur in WSNs that impair their
desired functionalities resulting in the formation of different
kinds of holes, namely: coverage holes, routing holes. Our
ultimate aim is to cover total area without coverage hole in
wireless sensor networks. We propose a comprehensive solution,
called holes detection and healing. We divided our proposed
work into two phases. The first phase consists of three sub- tasks;
Hole-identification, Hole-discovery and border detection. The
second phase treats the Hole-healing with novel concept, hole
healing area. It consists of two sub-tasks; Hole healing area
determination and node relocation.
International Refereed Journal of Engineering and Science (IRJES)irjes
International Refereed Journal of Engineering and Science (IRJES) is a leading international journal for publication of new ideas, the state of the art research results and fundamental advances in all aspects of Engineering and Science. IRJES is a open access, peer reviewed international journal with a primary objective to provide the academic community and industry for the submission of half of original research and applications.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
CORRELATION AND REGRESSION ANALYSIS FOR NODE BETWEENNESS CENTRALITYijfcstjournal
In this paper, we seek to find a computationally light centrality metric that could serve as an alternate for the computationally heavy betweenness centrality (BWC) metric. In this pursuit, in the first half of the paper, we evaluate the correlation coefficient between BWC and the other commonly used centrality metrics such as Degree Centrality (DEG), Closeness Centrality (CLC), Farness Centrality (FRC),Clustering Coefficient Centrality (CCC) and Eigenvector Centrality (EVC). We observe BWC to be highly correlated with DEG for synthetic networks generated based on the Erdos-Renyi model (for randomnetworks) and Watts-Strogatz model (for small-world networks). In the second half of the paper, weconduct a regression analysis for BWC with that of a recently proposed centrality metric called thelocalized clustering coefficient complement-based degree centrality (LCC'DC) for a suite of 47 real-world networks. The R-Squared metric and Correlation coefficient for the LCC'DC-BWC regression has been observed to be appreciably greater than those observed for the DEG-BWC regression. We also bserve the LCC'DC-BWC regression to incur relatively a lower value for the standard error of residuals for a majority of the real-world networks.
As pioneers in Outdoor Advertising we recognize and understand the intrinsic value of our Clients and their Products. We believe our continued success stems from a passion for creating value for our Customers, employees and the community of large.
ON FINDING MINIMUM AND MAXIMUM PATH LENGTH IN GRID-BASED WIRELESS NETWORKSijwmn
In this paper, we obtain the minimum and maximum hop counts between any pair of cells in the 3D gridbased wireless networks. We start by determining the minimum path length between any two points in a 2D grid coordinate system. We establish that the minimum path length is the maximum difference between the
corresponding coordinates of the two points. We then extend the result to derive the minimum and maximum hop counts for the 3D grid-based wireless networks. We establish that the maximum path length is the sum of the differences between the corresponding coordinates of the two cells. Whilst the minimum path length depends on the positions of the two cells; it does not exceed the maximum difference between the corresponding coordinates of the two cells.
Fault tolerant routing scheme based onIJCNCJournal
Most routing protocols designed for wireless sensor networks used the unit disk graph model (UGD) to
represent the physical layer. This model does not take into account fluctuations of the radio signal. Therefore, these protocols must be improved to be adapted to a non-ideal environment. In this paper, we used the lognormal shadowing (LNS) model to represent a non-ideal environment. In this model, the probability of successful reception is calculated according to the link quality. We evaluated LEACH’s performance with LNS model to illustrate the effects of radio signal. Unfortunately, our findings showed that the fluctuations of signal radio have a significant impact on protocol performance. Thereby, we
proposed a Fault-Tolerant LEACH-based Routing scheme (FTLR scheme) to improve the performance of LEACH in a non-ideal environment. Simulation results proved that our contribution provides good performance over the ideal model in terms packet loss rate and energy consumption.
Distance protection scheme for transmission line using back propagation neura...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
A NOVEL ANT COLONY ALGORITHM FOR MULTICAST ROUTING IN WIRELESS AD HOC NETWORKS cscpconf
The Steiner tree is the underlying model for multicast communication. This paper presents a
novel ant colony algorithm guided by problem relaxation for unconstrained Steiner tree in static
wireless ad hoc networks. The framework of the proposed algorithm is based on ant colony
system (ACS). In the first step, the ants probabilistically construct the path from the source tothe terminal nodes. These paths are then merged together to generate a Steiner tree rooted at the source. The problem is relaxed to incorporate the structural information into the heuristic value for the selection of nodes. The effectiveness of the algorithm is tested on the benchmark problems of the OR-library. Simulation results show that our algorithm can find optimal Steiner tree with high success rate.
In a network, one-to-all broadcasting is the process of disseminating messages from a source node to all the nodes existing in the network through successive data transmissions between pairs of nodes. Broadcasting is the most primary communication process in a network. In this paper, we study on multiport wormhole-routed multicomputers where nodes are able to send multiple messages into the network at a
time. We propose efficient broadcast algorithms in multi-port wormhole-routed multicomputers which are characterized by 3D mesh topology. The proposed algorithm Three-Dimension Broadcast Layers (3-DBl) is designed such that can send messages to destinations within two start-up communication phases for each 2-D mesh. The second proposed algorithm Three-Dimension Broadcast Surfaces (3-DBS) is designed such that can send messages to destinations within six start-up communication phases. The performance study in
this paper clearly shows the advantage of the proposed algorithm.
A new secure localization approach of wireless sensor nodes in the presence o...ijcseit
This paper proposes a new algorithm to find and isolate the nodes which lies about their position in a
Wireless Sensor Network (WSN). Also the proposed method enables the sensor nodes to find their location
in presence of liar nodes. In the proposed method, a given number of neighbors for all sensors is
determined wherethe number of liars is below a predefined threshold value. The proposed method is
evaluated in finding the liars and also the correct location of each node. The minimum error rate on the
determination of liars and the location of sensors proves the ability of the algorithm for localization of
sensors in the WSNs.
A NEW SECURE LOCALIZATION APPROACH OF WIRELESS SENSOR NODES INTHE PRESENCE OF...ijcseit
This paper proposes a new algorithm to find and isolate the nodes which lies about their position in a
Wireless Sensor Network (WSN). Also the proposed method enables the sensor nodes to find their location
in presence of liar nodes. In the proposed method, a given number of neighbors for all sensors is
determined wherethe number of liars is below a predefined threshold value. The proposed method is
evaluated in finding the liars and also the correct location of each node. The minimum error rate on the
determination of liars and the location of sensors proves the ability of the algorithm for localization of
sensors in the WSNs
Anew approach to broadcast in wormhole routed three-dimensional networks is proposed. One of the most important process in communication and parallel computer is broadcast approach.. The approach of this case of Broadcasting is to send the message from one source to all destinations in the network which corresponds to one-to-all communication. Wormhole routing is a fundamental routing mechanism in modern parallel computers which is characterized with low communication latency. We show how to apply this approach to 3-D meshes. Wormhole routing is divided the packets into set of FLITS (flow control digits). The first Flit of the packet (Header Flit) is containing the destination address and all subsets flits will follow the routing way of the header Flit. In this paper, we consider an efficient algorithm for broadcasting on an all-port wormhole-routed 3D mesh with arbitrary size. We introduce an efficient algorithm, Y-Hamiltonian Layers Broadcast(Y-HLB). In this paper the behaviors of this algorithm were compared to the previous results, our paradigm reduces broadcast latency and is simpler. In this paper our simulation results show the average of our proposed algorithm over the other algorithms that presented.
Routing for Sensors with Parameters as used in Agricultural FieldIDES Editor
Transmission of data from the source to the sink
occurs as soon as the path is established and data transfer is
scheduled. Routes could go down for various reasons some
could be due to loss in energy, broken link, faulty nodes etc.
This paper tries to enhance the network life by finding an
energy efficient path so that the path once established is alive
for long and avoiding path failure due to depletion of energy.
The parameters used for the simulation is as used in
agricultural field.
Performance evaluation of least disruptive topology repair algorithm (ledir) ...ijwmn
In wireless sensor networks, sensor nodes fail either when some critical event occurs at the node or when
the battery of the nodes is completely drained. If the remaining nodes in the sensor network are not aware
of the node failure, the network might under undergo significant broadcast delay and path loss. An alarm
packet has to be broadcast throughout the network when any critical event occurs and the transmission
path must be recovered to achieve better quality of service in the sensor network. This paper utilizes least
disruptive topology repair (LeDir) algorithm to minimize the power consumption and to handle such
critical events. LeDir algorithm is used to recover the transmission path and to ensure that the quality of
service issues in the network is met. The variations in the throughput, roundtrip time, broadcast delays and
packet delivery ratio of the network are observed by performing multiple NS-2 simulations. It is observed
that the throughput of the network could be quickly regained when the transmission path is recovered by
node replacement.
Mathematics Research Paper - Mathematics of Computer Networking - Final DraftAlexanderCominsky
This Research Paper goes into the mathematics of computer networking hardware as well as encryption methods used to ensure data can safely and securely be transmitted from one point to another across a computer network and the web.
Performance evaluation of decode and forward cooperative diversity systems ov...IJECEIAES
Incremental relaying (IR) was developed to overcome the problems facing regular cooperative relaying methods. Out of the regular methods there is fixed relaying, in which, the relay transmits the source’s signal to the destination without considering the state of the channel. On the contrary, adaptive relaying techniques, including IR, are becoming popular among researchers nowadays; since they efficiently utilize the channel. In this paper, we studied the performance of a two-hop IR system that has decode and forward (DF) relays. Moreover, this system was analyzed over Nakagami-m fading channels, with the presence of various interferers positioned near the destination. As a result, the system suffered from co-channel interference. Remarkably, in this work, formulas were driven for the outage probability (OP) and the bit error rate (BER), and the assumptions were checked numerically.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Anew approach to broadcast in wormhole routed three-dimensional networks is proposed. One of the most
important process in communication and parallel computer is broadcast approach.. The approach of this
case of Broadcasting is to send the message from one source to all destinations in the network which
corresponds to one-to-all communication. Wormhole routing is a fundamental routing mechanism in
modern parallel computers which is characterized with low communication latency. We show how to apply
this approach to 3-D meshes. Wormhole routing is divided the packets into set of FLITS (flow control
digits). The first Flit of the packet (Header Flit) is containing the destination address and all subsets flits
will follow the routing way of the header Flit. In this paper, we consider an efficient algorithm for
broadcasting on an all-port wormhole-routed 3D mesh with arbitrary size. We introduce an efficient
algorithm, Y-Hamiltonian Layers Broadcast(Y-HLB). In this paper the behaviors of this algorithm were
compared to the previous results, our paradigm reduces broadcast latency and is simpler. In this paper our
simulation results show the average of our proposed algorithm over the other algorithms that presented.
Anew approach to broadcast in wormhole routed three-dimensional networks is proposed. One of the most
important process in communication and parallel computer is broadcast approach.. The approach of this
case of Broadcasting is to send the message from one source to all destinations in the network which corresponds to one-to-all communication. Wormhole routing is a fundamental routing mechanism in modern parallel computers which is characterized with low communication latency. We show how to apply
this approach to 3-D meshes. Wormhole routing is divided the packets into set of FLITS (flow control digits). The first Flit of the packet (Header Flit) is containing the destination address and all subsets flits will follow the routing way of the header Flit. In this paper, we consider an efficient algorithm for broadcasting on an all-port wormhole-routed 3D mesh with arbitrary size. We introduce an efficient algorithm, Y-Hamiltonian Layers Broadcast(Y-HLB). In this paper the behaviors of this algorithm were compared to the previous results, our paradigm reduces broadcast latency and is simpler. In this paper our
simulation results show the average of our proposed algorithm over the other algorithms that presented.
Using spectral radius ratio for node degreeIJCNCJournal
In this paper, we show that the spectral radius ratio for node degree could be used to analyze the variation of node degree during the evolution of complex networks. We focus on three commonly studied models of complex networks: random networks, scale-free networks and small-world networks. The spectral radius ratio for node degree is defined as the ratio of the principal (largest) eigenvalue of the adjacency matrix of a network graph to that of the average node degree. During the evolution of each of the above three categories of networks (using the appropriate evolution model for each category), we observe the spectral radius ratio for node degree to exhibit high-very high positive correlation (0.75 or above) to that of the
coefficient of variation of node degree (ratio of the standard deviation of node degree and average node degree). We show that the spectral radius ratio for node degree could be used as the basis to tune the operating parameters of the evolution models for each of the three categories of complex networks as well as analyze the impact of specific operating parameters for each model.
Similar to FAULT TOLERANT ROUTING ALGORITHM IN OCTAGON-CELL INTERCONNECTED NETWORK FOR HORIZONTAL MOVING MESSAGES (20)
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
FAULT TOLERANT ROUTING ALGORITHM IN OCTAGON-CELL INTERCONNECTED NETWORK FOR HORIZONTAL MOVING MESSAGES
1. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
DOI: 10.5121/ijcnc.2017.9103 23
FAULT TOLERANT ROUTING ALGORITHM IN
OCTAGON-CELL INTERCONNECTED NETWORK
FOR HORIZONTAL MOVING MESSAGES
Sanjukta Mohanty1
and Prafulla Ku. Behera2
1
North Orissa University, Sriram Chandra Vihar, Takatpur, Baripada, Odisha, India
2
Utkal University, Vani Vihar, Bhubaneswar, Odisha, India
ABSTRACT
Octagon-Cell interconnected network can be viewed as an undirected graph, in which vertices and edges
can be compared with processors and bidirectional communication links respectively between the
processing elements. It has attractive features like small diameter and better bisection width and constant
node degree. It is analyzed to arrive at fault-tolerant communication. A fault tolerant communication
scheme for this network is described in this paper. Here an efficient routing scheme has been described
which routes the horizontal moving messages from source node to the destination node in presence of faulty
nodes / link failure along the path. In this algorithm when a message is received by an intermediate node, it
will consider itself a new source node.
KEYWORDS
Interconnected networks, Octagon-cell, Routing Algorithm, Network services
1. INTRODUCTION AND RELATED WORK
In an interconnection network, a fault tolerance scheme means the ability to continue operating in
presence of faulty nodes / link failures [3]-[14]. If the number of interconnected processors rises,
the probability of having faulty nodes increases and for successful transmission it is very much
essential to find another fault free path [15], [22]-[24].
In parallel processing systems it is very necessary to select optimal paths for efficient inter
process communication. In this system, if each and every processor has the status of all
processors then an optimal routing can be possible. In a system it may be possible for each
component suffers from hardware or software problem. If the system can’t handle the faulty
problem, that is unreliable, inefficient [15]-[21].
A fault tolerant scheme has been proposed in hexagonal arrays [25]. It has been described that the
routing scheme makes the reconstructed array transparent to the various algorithms utilizing the
hexagonal array.
A mesh embedded interconnected hypercube network has been analyzed to arrive at fault tolerant
communication. An efficient routing algorithm has been proposed that can route a message from
2. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
24
a source node to the destination in presence of fault free or single/multiple faulty nodes in mesh
embedded hypercube interconnection networks [3].
A fault tolerant routing algorithm has been described for star interconnection network in the
presence of faults [26]. A new fault tolerance algorithm has been described in hex-cell
interconnection network and the algorithm guarantees the delivery of messages even with the
presence of component failure [15].
In our paper a routing scheme has been introduced for interconnected processors, which
communicates messages in a faulty octagon-cell. We have described the optimal routing
algorithm for octagon-cell interconnected network along with its attractive features in [1]. Here
we have derived the fault tolerant algorithm for horizontal moving messages in the network. An
octagon-cell interconnected network has many attractive features such as constant node degree,
desirable diameter, bisection width [1].
2. OCTAGON-CELL NETWORK TOPOLOGY
An octagon-cell has eight nodes. It has d levels numbered from 1 to d with depth d. Level 1
represents one octagon-cell. Level 2 represents eight octagon-cells surrounding the octagon-cell at
level 1. Level 3 represents sixteen octagon-cells surrounding the eight octagon-cells at level 2 and
so on [1].
Figure 1: Addressing nodes in Octagon-Cell with level-1
(X, Y represents line no-X with node no-Y)
Figure 2: Addressing nodes in Octagon-Cell with level- 2
(X, Y represents line no-X with node no-Y)
1,1 1,2
2,1 2,2
3,1 3,2
4,1 4,2
1,1 1,2 1,3 1,4 1,5 1,6
2,1 2,2 2,3 2,4
3,1 3,2 3,3 3,4
4,1 4,2 4,3 4,4 4,5 4,6
3. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
25
We have described the optimal routing algorithm for octagon-cell network in [1]. Due to its
recursive structure routing can be done easily. The level numbering scheme is used in the above
algorithm. Each node in octagon-cell is identified by a pair (X, Y), Where X denotes the line
number in which the node exists and Y denotes serial number of the node in that line. A node
with the address (1, 1) is the first node in first line. A node with the address (1, 2) is the second
node in first line and so on.
There are four cases for optimal routing for horizontal moving messages. In this paper we have
derived the fault tolerant scheme for the following cases.
Case: 1 Fault tolerant routing algorithm for horizontal move for lines m mod 3 = 1
[Move from left to right, if (Xs = Xd && Ys < Yd)]
Case: 2 Fault tolerant routing algorithm for horizontal move for lines m mod 3 = 1
[Move from right to left, if (Xs = Xd && Ys > Yd)]
Case: 3 Fault tolerant routing algorithm for horizontal move for lines m mod 3 ≠ 1
[Move from left to right, if (Xs = Xd && Ys < Yd)]
Case: 4 Fault tolerant routing algorithm for horizontal move for lines m mod 3 ≠ 1
[Move from right to left, if (Xs = Xd && Ys > Yd)]
3. FAULT TOLERANT ROUTING ALGORITHM
3.1. Description of Model
We have derived the fault tolerance routing algorithm for octagon-cell interconnected network for
horizontal moving messages. Here it is assumed that each node has information about its three
consecutive nodes on the original optimal path in which it could have gone if there won’t be any
faulty nodes, link failures and dead end state. Each node say ‘A’ checks its three consecutive
nodes and links simultaneously along its original path. If any error occurs in one of three
consecutive links or nodes, then the algorithm will work with respect to the address of source
node at ‘A’.
When a signal passes from a source node to a destination, it is very much essential to find a path
of non-faulty nodes. For this purpose, each node can store the information about its three
consecutive nodes and links along the original path. There are three possible cases for a node in
an octagon-cell network. That is:
a) There are fault free nodes / links along the original path. This is called normal
state.
b) If any faulty node or link occurs in the original path, this situation is called faulty
state. This situation can be handled by the nodes along the path, because each
node in the path has the status of its three consecutive nodes and links. So the
original path will be changed by using the algorithm.
c) One link has two nodes. If two nodes of a link are faulty, then this situation is
called dead end state.
4. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
26
NOTE:
1. Since we have derived the fault tolerant scheme for the presence of faulty node or faulty
link along the optimal path, so in all cases the link failure conditions have not been
mentioned, because the algorithm for link failure case is equivalent to the node failure
along the optimal path. That is if the link (xs, ys) → (xs
*
, ys
*
) is failed along the optimal
path, then this situation is equivalent to the left node failure of this link. If the right node
is failed, then this is equivalent to the link failed connecting to (xs
*
, ys
*
) and (xs
**
, ys
**
).
2. The symbol “d” represents depth of the network and the word we have used in our
algorithm “w.r.t” represents “with respect to”.
3.2. Description of the Fault Tolerant Scheme
When a message is to be sent from a source node to a destination node, the algorithm first finds
the optimal path [1]. The message moves on that optimal path. In that path each and every node
has the status about three consecutive nodes / links. If ‘B’ be the faulty node and ‘A’ be another
fault free node on that path, then before reaching at ‘B’, the message first reaches at ‘A’. ‘A’ has
the status about next three consecutive nodes / links. ‘B’ is the node amongst the three
consecutive nodes. So at that situation, the message suddenly goes away from that original
optimum path [1] and finds another fault free path with respect to node ‘A’. Else dead end may
occur for which the message fails to reach at the destination. Let the optimal path be
A→B→C→D→E→F, where the source node is ‘A’ and the destination node is ‘F’. If ‘F’ is
faulty then dead end occurs. If ‘B’ or ‘C’ or ‘D’ is faulty, then the algorithm will work with
respect to the node ‘A’. If ‘E’ is faulty, then the algorithm will work with respect to the node ‘B’.
If the optimal path be A→B→C→D, where the source and destination nodes are ‘A’ and ‘D’
respectively and if faulty node is ‘B’ or ‘C’, then in this case the algorithm will work w.r.t the
source node ‘A’.
3.3. Fault Tolerant Algorithm
The fault tolerant algorithm is based on the optimal routing scheme in octagon-cell network [1].
Here four main cases have been derived for fault tolerant scheme.
Case-1 Fault tolerant routing algorithm for horizontal move for lines m,
Where m mod 3 = 1 [move from left to right, if (Xs = Xd && Ys < Yd)]
If (Xs < [(d*5) + (d-2)])
Sub case: 1-A1
If [(the original source node ys is odd) && [faulty node at (xs, ys+1) || (faulty node occurs in
line xs+1) || at (xs, ys+2)) with respect to original source node || Failure of any of 3 consecutive
links]]
Step-1 Move Vertical Top to Bottom till (xs = xs+3, ys)
Step-2 If yd is even
Move Horizontal Right till (ys = yd)
Move Vertical Top till (xs = xd)
Else if yd is odd
Move Horizontal Right till (ys = yd – 1)
Move (xs- 1, ys/2 + 1, xd, yd)
Move (xs- 1, ys, xd, yd)
5. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
27
Move (xs- 1, 2ys-1, xd, yd)
Sub case: 1-B1
Else if (Original source node ys is even) && (faulty node is any of 3 consecutive
neighbors of original source node)
Step-1 Move Horizontal Left till (ys = ys-1) && Go to Step-1 and Step-2 of Sub case
1-A1
Sub case: 1-C1
Else if (faulty node = xs+1 w.r.t the node (xs, ys), where (xs,ys) is any node on the path other
than the original source node) && (faulty node is not the neighbor of (xd, yd))
Step-1 Move Vertical to Bottom till (xs = xs +1)
Step-2 Move (xs+1, 2ys – 1, xd, yd)
Step-3 Go to Step-2 of Sub case 1-A1
Sub case 1-D1
Else if faulty node (xs = xd && ys is odd or even w.r.t their respective nodes)
Step-1 Go to Sub case-1-A1
Sub case 1-E1
Else if (yd is even) && (faulty node is neighbor of (xd, yd) i.e. at the line xd) && (faulty node
is w.r.t the node which is other than the original source node)
Step-1 Move (xs+1, ys, xd, yd)
Step-2 Move Vertical Bottom till (xs = xs+3)
Step-3 Move Horizontal Right till (ys = yd)
Step-4 Move Vertical Top till (xs = xs+3)
Sub case 1-F1
Else if (yd is odd) && (faulty node is neighbor of yd i.e. at the line xd+1) && (faulty node is
w.r.t the node which is other than the original source node)
Step-1 Move (xs+1, ys, xd, yd)
Step-2 Move (xs+1, 2ys-1, xd, yd)
Step-3 Move Horizontal Right till (ys = yd+1)
Step-4 Move Vertical Top till (xs = xs-3)
Step-5 Move Horizontal Left till (ys = ys-1)
Else if (Xs = [(d*5) + (d-2)])
Sub case: 1-A2
If (the original source node ys is odd) && [faulty node at (xs, ys+1) || faulty node occurs in line
(xs-1) || at (xs, ys+2) with respect to original source node) || Failure of any of 3 consecutive links]
Step-1 Move Vertical Top till (xs = xs-3, ys)
Step-2 If yd is even
6. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
28
Move Horizontal Right till (ys = yd)
Move Vertical Bottom till (xs = xd)
Else if yd is odd
Move Horizontal Right till (ys = yd – 1)
Move (xs+ 1, ys/2 + 1, xd, yd)
Move (xs+ 1, ys, xd, yd)
Move (xs+ 1, 2ys-1, xd, yd)
Sub case 1-B2
Else if (Original source node ys is even) && (faulty node is any of 3 consecutive neighbors of
original source node)
Step-1 Move Horizontal Left till (ys = ys-1)
Step-2 Go to Step -2 of Sub case 1-A2
Sub case: 1-C2
Else if (faulty node = xd-1 w.r.t the node (xs, ys), where (xs, ys) is any node on the path other
than the original source node) && (faulty node is not the neighbor of (xd, yd))
Step-1 Move (xs-1, ys, xd, yd)
Step-2 Move (xs-1, 2ys-1, xd, yd)
Step-3 Go to Step-2 of Sub case 1-A2
Sub case 1-D2
Else if faulty node (xs = xd && ys is odd or even w.r.t their respective nodes)
Step-1 Go to Sub case-1-A2
Sub case 1-E2
Else if (yd is even) && (faulty node is neighbor of (xd, yd) i.e. at the line xd) && (faulty node
is w.r.t the node which is other than the original source node)
Step-1 Move Vertical Top till (xs = xs-3)
Step-2 Move Horizontal Right till (ys = yd)
Step-3 Move Vertical Bottom till (xs= xs+3)
Sub case 1-F2
Else if (yd is odd) && (faulty node is neighbor of yd i.e. at the line xd -1) && (faulty node is
w.r.t the node which is other than the original source node)
Step-1 Move (xs+1, ys, xd, yd)
Step-2 Move (xs+1, 2ys-1, xd, yd)
Step-3 Move Horizontal Right till (ys = yd+1)
Step-4 Move Vertical Bottom till (xs = xs+3)
Step-5 Move Horizontal Left till (ys = ys-1)
NOTE: We have explained the optimal routing schemes in all directions in [1]. So the
Horizontal moves and Vertical moves follow the algorithms in [1].
7. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
29
Example: Let (Xs, Ys) = (1, 3), (Xd, Yd) = (1, 8) and the faulty node at (1,4).
Using the algorithm of Horizontal moves [1], We have the optimal path to reach the destination
is : (1,3) →(1,4) →(2,3) →(1,5) →(1,6) → (2,4) →(1,7) →(1,8). The shortest path length is 7.
Now using the above algorithm we have the following fault free path.
(1,3) →(2,2) →(3,2) →(4,3) →(4,4)→(5,3) →(4,5) →(4,6) → (5,4) →(4,7) →(4,8)→(3,5)
→(2,5) →(1,8). The path length is 13.
Figure 3: [we have drawn only first 7 lines of the Octagon-Cell network of depth 4, which shows the fault
free path]
Case: 2 Fault tolerant routing algorithm for horizontal move for lines m,
Where m mod 3 = 1 [Move from right to left, if (Xs = Xd && Ys > Yd )]
If (Xs < [(d*5) + (d-2)])
Sub case 2-A1
If [(the original source node ys is even) && ((faulty node at (xs,ys-1) || faulty node occurs in
line xs+1|| at (xs, ys-2)) with respect to original source node || failure of any of 3
consecutive links]
Step-1 Move Vertical Bottom till (xs= xs +3)
Step-2 If yd is even
Move Horizontal Left till (ys = yd -1)
Move (xs-1, ys/2 +1, xd, yd)
Move (xs-1, ys, xd, yd )
Move (xs-1, 2ys-1, xd, yd )
Move (xs, ys + 1, xd, yd)
Else if yd is odd
Move Horizontal Left till (ys = yd)
Move Vertical Top till (xs = xd)
Sub case: 2-B1
Else if (Original source node ys is odd) && (faulty node is any of 3 consecutive neighbors of
original source node)
Step-1 Move (xs, ys+1, xd, yd )
Go to Sub case: 2-A1
8. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
30
Sub case: 2-C1
Else if (faulty node = xs+1 w.r.t the node (xs, ys), where (xs, ys) is any node on the path other
than the original source node)
Step-1 Move Vertical Bottom till (xs = xs +1)
Step-2 Move (xs+1, 2ys – 2, xd, yd )
Step-3 Go to step-2 of sub case: 2-A1
Sub case 2-D1
Else if faulty node (xs = xd) && (ys is odd or even w.r.t their respective nodes)
Step-1 Go to Sub case-2-A1
Sub case 2-E1
Else if (yd is even) && (faulty node is neighbor of yd i.e. at the line xd +1) && (faulty node is
w.r.t the node which is other than the original source node)
Step-1 Move (xs+1, ys, xd, yd)
Step-2 Move (xs+1, 2ys-2, xd, yd)
Step-3 Move Horizontal to Left till (ys = yd -1)
Step-4 Move Vertical Top till (xs = xs – 3)
Step-5 Move Horizontal right till (ys = ys +1)
Sub case 2-F1
Else if (yd is odd) && (faulty node is neighbor of yd i.e. at the line xd) && (faulty node is w.r.t
the node which is other than the original source node) && (faulty node is w.r.t the node which is
other than the original source node)
Step-1 Move Vertical Bottom till (xs = xs+3)
Step-2 Move Horizontal Left till (ys = yd)
Step-3 Move Vertical Top till (xs = xs- 3)
Else if (Xs = [(d*5) + (d-2)])
Sub case 2-A2
If [(the original source node ys is even) && (faulty node at (xs, ys-1) || faulty node occurs in
line (xs-1) || at (xs, ys-2) with respect to original source node)]
Step-1 Move Vertical Top till (xs= xs-3, ys)
Step-2 If yd is even
Move Horizontal Left till (ys = yd - 1)
Move (xs+1, ys/2 +1, xd, yd)
Move (xs+1, ys, xd, yd)
Move (xs+1, 2ys-1, xd, yd)
Move Horizontal Left till (ys = yd)
Else if (yd is odd)
Move Horizontal Left till (ys = yd)
Move Vertical Bottom till (xs = xd)
9. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
31
Sub case 2 –B2
Else if (Original source node ys is odd) && (faulty node is any of 3 consecutive neighbors of
original source node)
Step-1 Move Horizontal Right till (ys = ys+1)
Step-2 Go to Sub case 2-A2
Sub case 2-C2
Else if (faulty node = xs-1 w.r.t the node (xs, ys), where (xs, ys) is any node on the path other
than the original source node)
Step-1 Move Vertical Top till (xs = xs-1)
Step-2 Move (xs-1, 2ys – 2, xd, yd)
Step-3 Move step 2 of Sub case 2-A2
Sub case 2-D2
Else if faulty node (xs = xd) && (ys is odd or even w.r.t their respective nodes)
Step-1 Go to Sub case-2-A2
Sub case 2-E2
Else if (yd is even) && (faulty node is neighbor of yd i.e. at the line xd-1) && (faulty node is
w.r.t the node which is other than the original source node)
Step-1 Move (xs-1, ys, xd, yd)
Step-2 Move (xs-1, 2ys-2, xd, yd)
Step-3 Move Horizontal Left till (ys = yd -1)
Step-4 Move Vertical Bottom till (xs = xd)
Step-5 Move Horizontal Right till (ys = yd)
Sub case 2-F2
Else if (yd is odd) && (faulty node is neighbor of yd i.e. at the line xd) && (faulty node is w.r.t
the node which is other than the original source node)
Step-1 Move Vertical Top till (xs = xs-3)
Step-2 Move Horizontal Left till (ys = yd)
Step-3 Move Vertical Bottom till (xs = xs+3)
Example: Let (Xs, Ys) = (4, 8), (Xd, Yd) = (4, 2) and the faulty node at (5,3) with depth 5.
Using the algorithm of Horizontal moves in [1], If all the nodes are fault free, then we have the
optimal path to reach the destination is : (4,8) →(4,7) →(5,4) →(4,6) →(4,5) → (5,3) →(4,4)
→(4,3) →(5,2) →(4,2). The shortest path length is 9.
Now using the above algorithm we have the following fault free path.
(4,8) →(4,7) →(5,4) →(6,4)→(7,6) →(7,5) →(8,3) →(7,4) →(7,3) →(8,2)→(7,2) →(7,1)
→(6,1) →(5,1) →(4,1) →(4,2). The path length is 15.
10. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
32
Figure 4: [we have drawn only first 10 lines of the Octagon-Cell network of depth 5, which shows the fault
free path]
Case: 3 Fault tolerant routing algorithm for horizontal move for lines m,
Where m mod 3 ≠ 1 [Move from left to right, if (Xs = Xd && Ys < Yd)]
Sub case-3A1
If (faulty node is any two consecutive node of original source node)
If (xs mod 3 = 2) {
Step-1 Move (xs + 1, ys, xd, yd)
Step-2 Move Horizontal Right till (ys = yd)
Step-3 Move Vertical Top till (xs = xd)}
Else If (xs = 3n) {
Step-1 Move (xs - 1, ys, xd, yd)
Step-2 Move Horizontal Right till (ys = yd)
Step-3 Move Vertical Bottom till (xs = xd)}
Sub case-3B1
If (faulty node is along the original source node) || (faulty node is the 3rd
consecutive w.r.t original
source node)
If (xs mod 3=2) && (original source node xs =2)
{
Go to Subcase-3A1 (If case)
Else If (xs > 2)
Step-1 Move (xs - 1, 2ys-1, xd, yd)
Step-2 Move (xs, ys+1, xd, yd)
Step-3 Move (xs -1, ys/2 +1, xd, yd)
Step-4 Move (xs + 1, 2ys-1, xd, yd)
Step-5 Move (xs, ys+1, xd, yd)
Step-6 Move (xs +1, ys/2 +1, xd, yd)
Else If (xs = xd) && (ys = yd)
Destination reached.
Else Move Horizontal Right till destination reached
}
Else If (xs = 3n)
{
If (xs< [(d*5) + (d-2)]-1)
11. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
33
{
Step-1 Move (xs+1, 2ys-1, xd, yd)
Step-2 Move (xs. ys+1, xd, yd)
Step-3 Move (xs+1, ys/2+1, xd, yd)
Step-4 Move (xs-1, 2ys-1, xd, yd)
Step-5 Move (xs, ys+1, xd, yd,)
Step-6 Move (xs-1, ys/2+1, xd, yd)
Else If (xs = xd) && (ys = yd)
Destination reached
Else Move Horizontal Move to Right till (ys = yd) && (xs = xd)
}
Else If (xs = [(d*5) + (d-2)]-1)
{
Step-1 Move (xs-1, ys, xd, yd)
Step-2 Move Horizontal Right till (ys = yd)
Step-3 Move Vertical Bottom till (xs = xd)
}
}
Sub case-3C1
If (xs mod 3 = 2) && (faulty node is at xs-1, where xs is original source node) && (faulty
node is w.r.t the node which is other than the original source node)
{
If (faulty node ys is even)
Step-1 Move (xs+1, ys/2+1, xd, yd,)
Go to Subcase-3A1 (If case)
Else If (faulty node ys is odd)
Step-1 Move (xs, ys+1, xd, yd)
Go to Subcase-3C1 (If case)
}
Else If (xs = 3n) && (faulty node xs is on the line xs+1) && (faulty node is w.r.t the node
which is other than the original source node)
{
If (faulty node ys is even)
Step-1 Move (xs-1, ys/2 +1, xd, yd)
Go to Subcase-3A1 (Else case)
Else If (faulty node ys is odd)
Step-1 Move (xs, ys+1, xd, yd)
Go to above case (for ys even)
}
Sub case-3D1
If (faulty node is neighbor of (xd, yd) || neighbor of neighbor of (xd, yd)) && (faulty node is w.r.t
the node which is other than the original source node)
If (xs mod 3=2)
Go to Subcase-3C1 (for xs mod 3 = 2)
12. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
34
Else If (xs = 3n)
Go to Subcase-3C1 (for xs = 3n)
Example: Let (Xs, Ys) = (2, 3), (Xd, Yd) = (2, 8) and the faulty node at (1, 10) with depth 4.
Using the algorithm of Horizontal moves [1], We have the optimal path to reach the destination
is : (2,3) →(1,5) →(1,6) →(2,4) →(1,7) → (1,8) →(2,5) →(1,9) →(1,10) →(2,6) →(1,11)
→(1,12) →(2,7) → (1,13) →(1,14) →(2,8) The shortest path length is 15.
Now using the above algorithm we have the following fault free paths.
(2,3) →(1,5) →(1,6) →(2,4) →(1,7) → (1,8) →(2,5) →(3,5) →(4,9) →(4,10) →(3,6) →(4,11)
→(4,12) → (3,7) →(4,13) →(4,14) →(3,8) →(2,8). The path length is 17.
Figure 5: [we have drawn only first 7 lines of the Octagon-Cell network of depth 4, which shows the fault
free path]
Case: 4 Fault tolerant routing algorithm for horizontal move for lines m,
Where m mod 3 ≠ 1 [Move from right to left, if (Xs = Xd && Ys > Yd)]
Sub case-4A1
If (faulty node is any of two consecutive nodes of original source node)
If (xs mod 3 = 2) {
Step-1 Move (xs + 1, ys, xd, yd)
Step-2 Move Horizontal Left till (ys = yd)
Step-3 Move Vertical Top till (xs = xd) }
Else {
If (xs = 3n)
Step-1 Move (xs - 1, ys, xd, yd)
Step-2 Move Horizontal Left till (ys = yd)
Step-3 Move Vertical Bottom till (xs = xd)}
Subcase-4B1
If (faulty node is along the line on original source node) || (faulty node is 3rd
consecutive
node w.r.t original source node)
If (xs mod 3=2) && (original source node xs =2) {
Go to Subcase-4A1 (If case)
Else
13. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
35
If (xs > 2)
Step-1 Move (xs - 1, 2ys-2, xd, yd)
Step-2 Move (xs, ys-1, xd, yd)
Step-3 Move (xs -1, ys/2 +1, xd, yd)
Step-4 Move (xs + 1, 2ys-2, xd, yd)
Step-5 Move (xs, ys-1, xd, yd)
Step-6 Move (xs +1, ys/2 +1, xd, yd)
Else If (xs = xd) && (ys = yd)
Destination reached.
Else Move Horizontal Left till destination reached}
Else If (xs = 3n)
{ If (xs< [(d*5) + (d-2)]-1)
{
Step-1 Move (xs+1, 2ys-2, xd, yd)
Step-2 Move (xs, ys-1, xd, yd)
Step-3 Move (xs+1, ys/2+1, xd, yd)
Step-4 Move (xs-1, 2ys-2, xd, yd)
Step-5 Move (xs, ys-1, xd, yd)
Step-6 Move (xs-1, ys/2+1, xd, yd)
Else If (xs = xd) && (ys = yd)
Destination reached
Else Move Horizontal Left till (ys = yd)
}
Else If (xs = [(d*5) + (d-2)]-1)
{
Step-1 Move (xs - 1, ys, xd, yd)
Move Horizontal Left till (ys = yd)
Move Vertical Bottom till (xs = xd)
}
}
Sub case-4C1
If (xs mod 3 = 2) && (Faulty node is at xs-1, xs is original source node) && (faulty node is
w.r.t the node which is other than the original source node)
{
If (faulty node ys is odd) {
Step-1 Move (xs+1, ys/2+1, xd, yd)
Go to Sub case - 4A1 (If case)}
Else If (faulty node ys is even) {
Step-1 Move (xs, ys-1, xd, yd)
Go to Subcase-4C1 (If case i.e. odd condition)}
}
Else If (xs =3n) && (Faulty node xs is on the line xs+1) && (faulty node is w.r.t the node
which is other than the original source node)
{
If (faulty node ys is odd) {
Step-1 Move (xs-1, ys/2 +1, xd, yd)
14. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
36
Go to Sub case - 4A1 (Else case)}
Else If (faulty node ys is even) {
Step-1 Move (xs, ys-1, xd, yd)
Go to Sub case - 4C1 (for xs =3n, ys is odd)
}
Sub case-4D1
If (faulty node is neighbor of (xd, yd)) || (neighbor of neighbor of (xd, yd))
{
If (xs mod 3=2)
Go to Subcase-4C1 (for xs mod 3 = 2)
Else If (Xs = 3n)
Go to Subcase-4C1 (for xs = 3n)
}
Example: Let (Xs, Ys) = (5, 9), (Xd, Yd) = (5, 6) and with link failure at (5, 7) → (4,12) with depth
4. This case is same with when the faulty node is (5, 7). The algorithm will work w.r.t the node
(5, 8).
Using the algorithm of Horizontal moves [1], We have the optimal path to reach the destination
is : (5,9) →(4,16) →(4,15) →(5,8) →(4,14) → (4,13) →(5,7) →(4,12) →(4,11) →(5,6). The
shortest path length is 9.
Now using the above algorithm w.r.t the node (5, 8) we have the following fault free paths.
(5,9) →(4,16) →(4,15) →(5,8) →(4,14) → (4,13) →(3,7) →(4,12) →(4,11) →(5,6). The path
length is 9.
Figure 6: [we have drawn only first 7 lines of the Octagon-Cell network of depth 5, which shows the fault
free path]
4. CONCLUSION
Octagon-Cell interconnected network has attractive features like small network diameter, better
bisection width and constant node degree etc. This paper introduces a fault tolerant routing
algorithm for horizontal moving messages in the Octagon-Cell interconnected network topology.
If any system can’t solve the faulty problem, it is considered as unreliable and inefficient. We
have already described the algorithm in [1], to find optimal path in any direction from source
node to destination node in Octagon-Cell network. In our fault tolerant scheme, the optimal path
is calculated from source to destination node for horizontal moving messages. If any fault occurs
15. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
37
along the path, the algorithm will find the alternative fault free path. This can be utilized in
mobile networks and different wide range networks.
REFERENCES
[1] Sanjukta Mohanty and Prafulla Ku. Behera, (2011) “Optimal Routing Algorithm in a Octagon-Cell
Network” International Journal of Advanced Research in Computer Science, Vol. 2, No.5 pp.625-
637.
[2] Ahmad Sharieh, Mohammad Qatawneh, Wesam Almobaideen, Azzam Sleit, (2008) “Hex-Cell:
Modeling, Topological Properties and Routing Algorithm”, European Journal of Scientific Research,
Vol.22, No.2, pp. 457-468.
[3] N. Gopalakrishna Kini, M. sathish Kumar and Mruthyunjaya H.S.,(2009) “An Optimal Data Routing
Scheme for Mesh Embedded Hypercube Interconnection network with Multiple Faulty Nodes”,
International Journal of Computer Science and Engineering , 3:1 , pp.26-30.
[4] Ahmed Louri and Hongki Sung, (April 1994) “An Optical Multi-Mesh Hypercube: A Scalable
Optical interconnection Network for Massively Parallel Computing”, Journal of Lightwave
Technology, Vol.12, No.4, pp. 704-716.
[5] Tze Chiang Lee and John P.Hayes, (Oct 1992) “A Fault-Tolerant Communication Scheme for
Hypercube Computers”, IEEE Transactions on Computers, Vol.41, No.10, pp. 1242-1256.
[6] Sandeep Sharma, P.K.Bansal,(2002) “ A New Fault Tolerant Multistage Interconnection Networks”,
IEEE TENCON’ 02, Vol.1, pp.347-350.
[7] Shih-Chang Wang and Sy-Yen Kuo, (Dec. 1994) “Fault Tolerance in Hyperbus and Hypercube
Multiprocessors Using Partitioning Scheme”, IEEE International Conference on Parallel and
Distributed Systems, pp. 340-347.
[8] D. Nassimi and S. Sahni, Jan. (1980) “ An Optimal Routing Algorithm for Mesh Connected Parallel
Computers”, Journal of the ACM, Vol.27, pp.6-29.
[9] Shen. J.P.,(1982) ” Fault Tolerance Analysis of Several Interconnection Networks”, Proceedings of
International Conference on Parallel Processing, pp.102-112.
[10] Jehoshua Bruck, Member, IEEE, Robert Cypher, and Danny Soroker, (May 1992) “Tolerating Faults
in Hypercubes Using Subcube Partitioning”, IEEE Trasactions on Computers, Vol.41, No.5, pp.599-
605.
[11] K.V. Arya, R.K. Ghosh. (2005) “Designing a New Class of Fault Tolerant Multistage
Interconneconnection Networks”, Journal of Interconneconnection Network, Vol.6, No.4, pp.361-
382.
[12] Kuo-Hsuan Chen and Ge-Ming Chiu, (1998) “Fault-Tolerant Routing Algorithm for Meshes”,
Journal of Information Science and Engineering, Vol.14, pp.765-783.
[13] Jianer Chen, Iyad A. Kanj and Guojun Wang, (2002) “ Hypercube Network Fault Tolerance: A
Probabilistic Approach”, Proceedings of the IEEE International Conference on Parallel Processing.
[14] M.J. Serrano and B. Parhami, (Oct. 1993) “Optimal Architectures and Algorithms for Mesh-
Connected Parallel Computers with Separable Row/Column Buses”, IEEE Trasactions on Parallel
and Distributed Systems, Vol.4, No.10, pp.1073-1080.
[15] Mohammad Qatawneh, Bdour Hamed, Wesam AlMobaideen, Azzam Sleit, Amal Qudat, Wala’a
Qutechat, Roba Al-Soub, (Dec. 2009) “ FTRH: Fault Tolerance Routing Algorithm for Hex-Cell
Networks”, International Journal of Computer Science and Network Security, Vol.9, No.12, pp. 268-
274.
[16] K. Day, K.S. Harous, A. Al-Ayyoub, (2000) “A Fault Tolerant Routing Scheme for Hypercubes”,
Telecommunication Systems, Vol-13, No.1, pp. 29-44.
[17] Catherine Decayeux, David Seme, (2005) “3D Hexagonal Network: Modeling, Topological
Properties, Addressing Scheme and Optimal Routing Algorithm”, IEEE Trasactions on parallel and
systems, Vol-16, No.9, pp.875-884.
[18] Qatawneh Mohammad (2006) “Adaptive Fault Tolerant Routing Algorithm for Tree-Hypercube
Multicomputer”, Journal of Computer Science, Vol.2, No.2, pp. 124-126.
[19] Suresh Chalasani, Rajendra V. Boppana, (1994) “Fault-Tolerant Wormhole Routing in Tori”,
International Conference on Supercompuing, , pp.146-155.
16. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
38
[20] Mahmoud Al-Omari, Mohammed Mahafzah, (1999) “Fault-Tolerant Routing in hypercubes using
masked interval Routing Scheme”, Proceedings of the 1999 ACM symposium on Applied Computing,
pp.481-485.
[21] Jipeng Zhou and Francis C.M. Lau, (2004) “Multi-Phase Minimal Fault-Tolerant Wormwhole
Routing in Meshes”, Parallel Computing, Vol.30, No.3, pp. 423-442.
[22] Jong-Hoon Youn, Bella Bose, Seungjin Park, (2006) “Fault-Tolerant Routing Algorithm in Meshes
with solid faults”, Journal of Supercomputing, 37, pp. 161-177.
[23] Flaviu Cristian, Bob Dancey, Jon Dehn, (1996) “Fault-Tolerance in Air Traffic Control Systems”,
Trasaction on Computer Systems (TOCS), Vol.14, No.3, pp. 256-286.
[24] Dajin Wang, (2001) “A Low Cost Fault-Tolerant Structure for Hypercube”, Journal of
Supercomputing, 20, pp. 203-216.
[25] Dan Gordon, Israel Koren, Gabriel M. Silberman, (1987) “Reconstructing Hexagonal Arrays of
Processors in the Presence of Faults”, Journal of VLSI and Computer Systems, Vol.2, pp. 23-35.
[26] Mostafa Rezazad, Hamid Sarbazi-Azad, (2003) “A Routing Algorithm for Star Interconnection
Network in the Presence of Faults”, The CSI Journal on Computer Science and Engineering, Vol.1,
No. 4(b), pp. 11-18
Authors
Sanjukta Mohanty has received her Master in Computer Application from North
Orissa University of Odisha, India, M.Sc in Mathematics from Fakir Mohan
University of Odisha, India, M.Tech (Comp.Sc & Engg) from North Orissa University
of Odisha, India in 2013 and Continuing Ph.D in Computer Science & IT in North
Orissa University Sriram Chandra Vihar, Baripada of Odisha, India. Her research
interests include on the study of routing algorithms in interconnected networks.
Dr. Prafulla Ku. Behera has received his Ph.D in Computer Science from Utkal
University of Odisha, India in 2007. His research interests include on the study of
Mobile Ad-hoc Networks. He is the faculty member of Department of Computer
Science & Application, Utkal University, Vani Vihar, Bhubaneswar of Odisha, India.