We refer to the problem of constructing broadcast trees with cost and delay constraints in the networks as a delay-constrained minimum spanning tree problem in directed networks. Hence it is necessary determining a spanning tree of minimal cost to connect the source node to all nodes subject to delay constraints on broadcast routing. In this paper, we proposed a genetic algorithm for solving broadcast routing by finding the low-cost broadcast tree with minimum cost and delay constraints. In this research we present a genetic algorithm to find the broadcast routing tree of a given network in terms of its links. The algorithm uses the connection matrix of the given network to find the spanning trees and considers the weights of the links to obtain the minimum spanning tree. Our proposed algorithm is able to find a better solution, fast convergence speed and high reliability. The scalability and the performance of the algorithm with increasing number of network nodes are also encouraging.
A DELAY – CONSTRAINED IN MULTICAST ROUTING USING JIA ALGORITHMIJCI JOURNAL
The Distributed multicast routing protocol under delay constraints, is one of the software, which requires simultaneous transmission of message from a source to a group of destinations within specified time delay. For example. Video Conferencing system. Multicast routing is to find a routing tree which is routed from the source and contains all the destinations. The principle goal of multicast routing is to minimize the network cost. A tree with minimal overall cost is called a Steiner tree. Finding such tree is the principle of the NP complete.
Many inexpensive heuristic algorithms have been proposed for the Steiner tree problem. However, most of the proposed algorithms are centralized in nature. Centralized algorithm requires a central node to be responsible for computing the tree and this central node must have full knowledge about the global network. But, this is not practical in large networks. Therefore, existing algorithms suffer from the drawback such as heavy communication cost, long connection setup time and poor quality of produced routing trees. So far, a little work has been done on finding delay bounded Steiner tree in a distributed manner. An effort is made in this paper to this effect. The Study reveals that the drawbacks mentioned
above has been sufficiently reduced. This paper gives complete guidelines for authors submitting papers for the AIRCC Journals.
Performance Analysis of Bfsk Multi-Hop Communication Systems Over K-μ Fading ...ijwmn
Multi-hop communication systems gained popularity in wireless communications; they can be used to
extend the coverage of the network and reduce the transmitted power. The transmission of data from the
source node to the destination node in multi-hop communications undergoes through intermediate relay
nodes. In this paper, we study the performance of multi-hop communication systems, in terms of average bit
error rate (BER) with Binary frequency shift keying assuming the κ-µ fading channel model. Due to the
difficulty in finding the probability density function (PDF) of the end-to-end signal to noise ratio (SNR) and
hence for the performance metrics, we use Gaussian Mixture (GM) approximation technique to
approximate the PDF of the end to end SNR assuming the κ-µ fading models as weighted sums of Gaussian
distributions. Numerical results are provided for the BER of binary frequency shift keying (BFSK) of
amplify and forward (AF) multi-hop communication systems assuming different values for the fading
parameters (, ) and for different number of hops. Numerical results are validated by comparing them
with simulation results.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...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.
Wireless Mesh Network rose as a promising innovation for providing quick and productive communication for which numerous algorithms have been proposed in networking infrastructure. For routing there are various performance parameters such as throughput, network congestion, resiliency, fairness, robustness, network jitter, delay, stability, optimality, simplicity, completeness etc. Robustness provides the capability to deal with all the failures that come across during the connection in the network to increase the network performance. In this paper we have studied and analyzed three algorithms namely on robustness parameter Resilient multicasting [2], Resilient Opportunistic Mesh Routing for Wireless Mesh Network (ROMER) [3], and Buffer Based Routing (BBR) [4], in Wireless Mesh Networks. Analysis through various parameters such as network congestion, network throughput and resiliency [5], shows network performance of BBR is better.
Vitality productivity Multipath Routing for Wireless Sensor Networks: A Genet...dbpublications
Abstract-The two factors included for deployment of any Wireless Sensor Network, those factors are efficient energy and fault tolerance. An efficient solution for fault tolerance is the Multipath routing in WSNs. Genetic Algorithm is based on the meta-heuristic search technique. Base station (BS) already prepared routing schedule in its routing table, all the nodes share it with the entire network. In proposed algorithm various parameters are used for efficient fitness function such as distance between sender and receiver nodes, distance between BS to hop node and on the number of hop to send data from next hop node to the BS. Simulation and evaluation are tested with various performance metrics in the proposed algorithm.
A DELAY – CONSTRAINED IN MULTICAST ROUTING USING JIA ALGORITHMIJCI JOURNAL
The Distributed multicast routing protocol under delay constraints, is one of the software, which requires simultaneous transmission of message from a source to a group of destinations within specified time delay. For example. Video Conferencing system. Multicast routing is to find a routing tree which is routed from the source and contains all the destinations. The principle goal of multicast routing is to minimize the network cost. A tree with minimal overall cost is called a Steiner tree. Finding such tree is the principle of the NP complete.
Many inexpensive heuristic algorithms have been proposed for the Steiner tree problem. However, most of the proposed algorithms are centralized in nature. Centralized algorithm requires a central node to be responsible for computing the tree and this central node must have full knowledge about the global network. But, this is not practical in large networks. Therefore, existing algorithms suffer from the drawback such as heavy communication cost, long connection setup time and poor quality of produced routing trees. So far, a little work has been done on finding delay bounded Steiner tree in a distributed manner. An effort is made in this paper to this effect. The Study reveals that the drawbacks mentioned
above has been sufficiently reduced. This paper gives complete guidelines for authors submitting papers for the AIRCC Journals.
Performance Analysis of Bfsk Multi-Hop Communication Systems Over K-μ Fading ...ijwmn
Multi-hop communication systems gained popularity in wireless communications; they can be used to
extend the coverage of the network and reduce the transmitted power. The transmission of data from the
source node to the destination node in multi-hop communications undergoes through intermediate relay
nodes. In this paper, we study the performance of multi-hop communication systems, in terms of average bit
error rate (BER) with Binary frequency shift keying assuming the κ-µ fading channel model. Due to the
difficulty in finding the probability density function (PDF) of the end-to-end signal to noise ratio (SNR) and
hence for the performance metrics, we use Gaussian Mixture (GM) approximation technique to
approximate the PDF of the end to end SNR assuming the κ-µ fading models as weighted sums of Gaussian
distributions. Numerical results are provided for the BER of binary frequency shift keying (BFSK) of
amplify and forward (AF) multi-hop communication systems assuming different values for the fading
parameters (, ) and for different number of hops. Numerical results are validated by comparing them
with simulation results.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...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.
Wireless Mesh Network rose as a promising innovation for providing quick and productive communication for which numerous algorithms have been proposed in networking infrastructure. For routing there are various performance parameters such as throughput, network congestion, resiliency, fairness, robustness, network jitter, delay, stability, optimality, simplicity, completeness etc. Robustness provides the capability to deal with all the failures that come across during the connection in the network to increase the network performance. In this paper we have studied and analyzed three algorithms namely on robustness parameter Resilient multicasting [2], Resilient Opportunistic Mesh Routing for Wireless Mesh Network (ROMER) [3], and Buffer Based Routing (BBR) [4], in Wireless Mesh Networks. Analysis through various parameters such as network congestion, network throughput and resiliency [5], shows network performance of BBR is better.
Vitality productivity Multipath Routing for Wireless Sensor Networks: A Genet...dbpublications
Abstract-The two factors included for deployment of any Wireless Sensor Network, those factors are efficient energy and fault tolerance. An efficient solution for fault tolerance is the Multipath routing in WSNs. Genetic Algorithm is based on the meta-heuristic search technique. Base station (BS) already prepared routing schedule in its routing table, all the nodes share it with the entire network. In proposed algorithm various parameters are used for efficient fitness function such as distance between sender and receiver nodes, distance between BS to hop node and on the number of hop to send data from next hop node to the BS. Simulation and evaluation are tested with various performance metrics in the proposed algorithm.
A SIMULATION-BASED PERFORMANCE COMPARISON OF MANETS CDS CREATION ALGORITHMS U...csandit
Mobile Ad Hoc networks (MANETs) are gaining increased interest due to their wide range of
potential applications in civilian and military sectors. The self-control, self-organization,
topology dynamism, and bandwidth limitation of the wireless communication channel make
implementation of MANETs a challenging task. The Connected Dominating Set (CDS) has been
proposed to facilitate MANETs realization. Minimizing the CDS size has several advantages;
however, this minimization is NP complete problem; therefore, approximation algorithms are
used to tackle this problem. The fastest CDS creation algorithm is Wu and Li algorithm;
however, it generates a relatively high signaling overhead. Utilizing the location information of
network members reduces the signaling overhead of Wu and Li algorithm. In this paper, we
compare the performance of Wu and Li algorithm with its Location-Information-Based version
under two types of Medium Access Control protocols, and several network sizes. The MAC
protocols used are: a virtual ideal MAC protocol, and the IEEE 802.11 MAC protocol. The use
of a virtual ideal MAC enables us to investigate how the real-world performance of these
algorithms deviates from their ideal-conditions counterpart. The simulator used in this research
is the ns-2 network simulator.
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (22n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
Improving the Proactive Routing Protocol using Depth First Iterative Deepenin...Yayah Zakaria
Owing to the wireless and mobility nature, nodes in a mobile ad hoc network are not within the transmission range. It needs to transfer data through the multi-intermediate nodes. Opportunistic data forwarding is an assuring solution to make use of the broadcast environment of wireless communication links. Due to absence of source routing capability with efficient proactive routing protocol, it is not widely used. To rectify the
problem, we proposed memory and routing efficient proactive routing protocol using Depth-First Iterative-Deepening and hello messaging scheme. This protocol can conserve the topology information in every node in the network. In experimental analysis and discussion, we implemented the proposed work using NS2 simulator tool and proved that the proposed technique is performed well in terms of average delay, buffer and throughput.
AN INVERTED LIST BASED APPROACH TO GENERATE OPTIMISED PATH IN DSR IN MANETS –...Editor IJCATR
In this paper, we design and formulate the inverted list based approach for providing safer path and effective
communication in DSR protocol.Some nodes in network can participate in network more frequenctly whereas some nodes are not
participating. Because of this there is the requirement of such an approach that will take an intelligent decision regarding the sharing of
bandwidth or the resource to a node or the node group. Dynamic source routing protocol (DSR) is an on-demand, source routing
protocol , whereby all the routing information is maintained (continually updated) at mobile nodes.
Energy Efficient Wireless Sensor Network Using Network Coding Based Multipath...IJERA Editor
Network Coding is most promising aspect of WSN. This Network Coding method is combined with multipath routing protocol to form NCMR protocol.(network coding based multipath routing protocol).This protocol is used to obtain energy efficient wireless sensor network.. These protocol leads to decrease the number of constrain routes & the total time of transmission. This protocol is applied on unicast and multicast network separately. And comparison is done with traditional multipath routing protocol for same unicast and multicast network. Simulation result shows energy consumption of NCMR multicast is lower than NCMR unicast and also than TMR unicast as well as multicast. This work is proved by the simulation analysis results. The used multipath model is based on braided multipath routing, and the network coding method is random linear network coding (practical network coding). In braided network multiple paths to the sink nodes are created for each source node, and the packets encoded at source nodes are transmitted through the braided multipath network model. Then, intermediate nodes re-encode these received packets and transfer these new packets to next cluster. Finally, the multiple sink nodes decode the packets received from different paths and recover the original data. Results of the analysis show that multicast NCMR provides more reliability. We compare multicast NCMR routing protocol with NCMR unicast & also with traditional multipath routing protocol for unicast and multicast networks, in terms of the packet loss, energy consumption, successful delivery ratio & end to end delay when a packet is transmitted Some special simulations are carried out specially for NCMR multicast i.e. effect of number of nodes on energy consumption, packet loss & end to end delay.
Connected Dominating Set Construction Algorithm for Wireless Sensor Networks ...ijsrd.com
Energy efficiency plays an important role in wireless sensor networks. All nodes in sensor networks are energy constrained. Clustering is one kind of energy efficient algorithm. To organize the nodes in better way a virtual backbone can be used. There is no physical backbone infrastructure, but a virtual backbone can be formed by constructing a Connected Dominating Set (CDS). CDS has a significant impact on an energy efficient design of routing algorithms in WSN. CDS should first and foremost be small. It should have robustness to node failures. In this paper, we present a general classification of CDS construction algorithms. This survey gives different CDS formation algorithms for WSNs.
Cross layer design for power control and linkIJCNCJournal
Frequent changes in network topology due to mobility and limited battery power of the mobile devices are the key challenges in the adhoc networks. The depletion of power source may cause early unavailability of nodes and thus links in the network. The mobility of nodes causes frequent routes breaks and adversely affects the required performance of the applications. We propose a cross layer design for the dynamic power control protocol and link prediction (DPCPLP) that provides a combined solution for power conservation as well as link availability. This combines the effect of optimum transmit power and received signal strength based link availability estimation with AODV routing protocol using cross layer approach.
This method proposes to use optimum transmit power for transmitting the packets to a neighboring node to
increase the battery life of adhoc nodes and received signal strength based link prediction to increase the
availability of the links. In this paper, the transmit power and received signal strength of the packets are
cross-layer interaction parameters to provide the combined solution for power conservation and reliable
route formation with increased availability of links and thus the routes amongst sources and destinations. Further, this increases network and nodes’ lifetime and capacity. It improves throughput and packet delivery ratio by spatial reuse, prior prediction of link breaks and initiating the route repair. It also reduces
end-to-end delay and power consumption by use of optimum transmit power. Through simulations, we have
shown that our proposed protocol shows better performance.
Extending network lifetime of wireless sensorIJCNCJournal
One critical issue in designing and managing a wireless sensor network is how to save the energy consumption
of the sensors in order to maximize network lifetime under the constraint of full coverage of the monitored
targets. In this paper, we adopt the common approach of creating disjoint sensor covers to prolong network
lifetime. The typical goal used in the literature is to maximize the number of covers without consideration of
the energy levels of the sensors. We argue that the network lifetime can be extended by maximizing the total
bottleneck energy of the created covers. We formally define the problem of maximizing the total bottleneck
energy of the covers, present for the first time an integer programming formulation of the problem, and develop
two algorithms to solve large problem instances. Extensive experimental tests show that the use of the goal of
maximizing the total bottleneck energy of the covers creates covers with substantially longer network lifetime
than the lifetime of the covers created with the goal of maximizing solely the number of covers.
MODELING, IMPLEMENTATION AND PERFORMANCE ANALYSIS OF MOBILITY LOAD BALANCING ...IJCNCJournal
We propose in this paper a simulation implementation of Self-Organizing Networks (SON) optimization
related to mobility load balancing (MLB) for LTE systems using ns-3 [1]. The implementation is achieved
toward two MLB algorithms dynamically adjusting handover (HO) parameters based on the Reference
Signal Received Power (RSRP) measurements. Such adjustments are done with respect to loads of both an
overloaded cell and its cells’ neighbours having enough available resources enabling to achieve load
balancing. Numerical investigations through selected key performance indicators (KPIs) of the proposed
MLB algorithms when compared with another HO algorithm (already implemented in ns-3) based on A3
event [2] highlight the significant MLB gains provided in terms global network throughput, packet loss rate
and the number of successful HO without incurring significant overhead.
MODELING AND DESIGNING RESOURCE EFFICIENT DISTRIBUTED MANET MANAGEMENT SYSTEM...IJCNCJournal
Traditional network management systems use spoofing of resources to collect statistical data such as resource usage and performance. This data is exchanged with other resources through management protocols. The amount of data can be extremely high and the bandwidth for overhead management functions increases significantly. Also, the data storage requirements in each network resource for
management functions increases and become inefficient as it increases the power usage for processing. In
this paper, we propose a distributed network management system where each network resource maintains a
set of Management Information Base (MIB) elements and stores resource activities in their abstraction in
terms of counters, flag and threshold values. The abstract data is exchanged between different management
agents residing in different resources on a need-to-know basis and each agent logically executes management functions locally to develop understanding of the behavior of all network resources to ensure that user protocols can function smoothly. Our proposed architecture can be implemented in any network, but is highly important to be considered in power and bandwidth constrained networks such as Mobile Ad Hoc Networks (MANET). In this research, we use cross layer models to demonstrate simplified way of efficiently managing the overall performance of individual network resources (nodes) and the network itself which is critical for not only monitoring the traffic, but also dynamically controlling the end-to-end Quality of Service (QoS) for multi-service applications.
The article looks into the current state of the art of dynamic routing protocols with respect to their
possibilities to react to changes in the Quality of Service when selecting the best route towards a
destination network. New options that could leverage information about the ever changing QoS parameters
for data communication are analysed and a Cisco Performance Routing solution is described more in
detail. The practical part of this work focuses on a design and implementation of a test bed that provides a
scalable laboratory architecture to manipulate QoS parameters of different data communications flowing
through it. The test bed is used in various use cases that were used to evaluate Cisco Performance Routing
optimization capabilities in different scenarios.
Energy efficiency cross layer protocol for wireless mesh networkIJCNCJournal
Wireless mesh network (WMN) is a novel emerging tec
hnology that will change the world more effectively
and efficiently. It is regarded as a highly promisi
ng technology being increasingly important in mobil
e
wireless networks of the future generation. In this
paper, we consider energy management for wireless
mesh networks from a point of view that started rec
ently to attract the attention means the conservati
on of
energy for operational and the environment reasons
which is known as the Green Networking. This paper
discusses different routing protocols to establish
a protocol which considers energy efficiency. The e
xisting
protocols are compared using the basic functions of
routing and the suggest protocol is designed to
overcome some of their shortcomings. We are focusin
g on the conception of the cross-layer routing
protocol that is implemented in TDMA (Time Division
Multiple Access) wireless mesh networks based
MAC protocol.
GPS SYSTEMS LITERATURE: INACCURACY FACTORS AND EFFECTIVE SOLUTIONS IJCNCJournal
Today, Global Positioning System (GPS) is widely used in almost every aspect of our daily life. Commonly,
users utilize the technology to track the position of a vehicle or an object of interest. They also use it to
safely navigate to the destination of their choice. As a result, there are countless number of GPS based
tracking application that has been developed. But, a main recurring issue that exists among these
applications are the inaccuracy of the tracking faced by users and this issue has become a rising concern.
Most existing research have examined the effects that the inaccuracy of GPS have on users while others
identified suitable methods to improve the accuracy of GPS based on one or two factors. The objective of
this survey paper is to identify the common factors that affects the accuracy of GPS and identify an effective
method which could mitigate or overcome most of those factors. As part of our research, we conducted a
thorough examination of the existing factors for GPS inaccuracies. According to an initial survey that we
have collected, most of the respondents has faced some form of GPS inaccuracy. Among the common issues
faced are inaccurate object tracking and disconnection of GPS signal while using an application. As such,
most of the respondents agree that it is necessary to improve the accuracy of GPS. This leads to another
objective of this paper, which is to examine and evaluate existing methods as well as to identify the most
effective method that could improve the accuracy of GPS.
A SIMULATION-BASED PERFORMANCE COMPARISON OF MANETS CDS CREATION ALGORITHMS U...csandit
Mobile Ad Hoc networks (MANETs) are gaining increased interest due to their wide range of
potential applications in civilian and military sectors. The self-control, self-organization,
topology dynamism, and bandwidth limitation of the wireless communication channel make
implementation of MANETs a challenging task. The Connected Dominating Set (CDS) has been
proposed to facilitate MANETs realization. Minimizing the CDS size has several advantages;
however, this minimization is NP complete problem; therefore, approximation algorithms are
used to tackle this problem. The fastest CDS creation algorithm is Wu and Li algorithm;
however, it generates a relatively high signaling overhead. Utilizing the location information of
network members reduces the signaling overhead of Wu and Li algorithm. In this paper, we
compare the performance of Wu and Li algorithm with its Location-Information-Based version
under two types of Medium Access Control protocols, and several network sizes. The MAC
protocols used are: a virtual ideal MAC protocol, and the IEEE 802.11 MAC protocol. The use
of a virtual ideal MAC enables us to investigate how the real-world performance of these
algorithms deviates from their ideal-conditions counterpart. The simulator used in this research
is the ns-2 network simulator.
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (22n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
Improving the Proactive Routing Protocol using Depth First Iterative Deepenin...Yayah Zakaria
Owing to the wireless and mobility nature, nodes in a mobile ad hoc network are not within the transmission range. It needs to transfer data through the multi-intermediate nodes. Opportunistic data forwarding is an assuring solution to make use of the broadcast environment of wireless communication links. Due to absence of source routing capability with efficient proactive routing protocol, it is not widely used. To rectify the
problem, we proposed memory and routing efficient proactive routing protocol using Depth-First Iterative-Deepening and hello messaging scheme. This protocol can conserve the topology information in every node in the network. In experimental analysis and discussion, we implemented the proposed work using NS2 simulator tool and proved that the proposed technique is performed well in terms of average delay, buffer and throughput.
AN INVERTED LIST BASED APPROACH TO GENERATE OPTIMISED PATH IN DSR IN MANETS –...Editor IJCATR
In this paper, we design and formulate the inverted list based approach for providing safer path and effective
communication in DSR protocol.Some nodes in network can participate in network more frequenctly whereas some nodes are not
participating. Because of this there is the requirement of such an approach that will take an intelligent decision regarding the sharing of
bandwidth or the resource to a node or the node group. Dynamic source routing protocol (DSR) is an on-demand, source routing
protocol , whereby all the routing information is maintained (continually updated) at mobile nodes.
Energy Efficient Wireless Sensor Network Using Network Coding Based Multipath...IJERA Editor
Network Coding is most promising aspect of WSN. This Network Coding method is combined with multipath routing protocol to form NCMR protocol.(network coding based multipath routing protocol).This protocol is used to obtain energy efficient wireless sensor network.. These protocol leads to decrease the number of constrain routes & the total time of transmission. This protocol is applied on unicast and multicast network separately. And comparison is done with traditional multipath routing protocol for same unicast and multicast network. Simulation result shows energy consumption of NCMR multicast is lower than NCMR unicast and also than TMR unicast as well as multicast. This work is proved by the simulation analysis results. The used multipath model is based on braided multipath routing, and the network coding method is random linear network coding (practical network coding). In braided network multiple paths to the sink nodes are created for each source node, and the packets encoded at source nodes are transmitted through the braided multipath network model. Then, intermediate nodes re-encode these received packets and transfer these new packets to next cluster. Finally, the multiple sink nodes decode the packets received from different paths and recover the original data. Results of the analysis show that multicast NCMR provides more reliability. We compare multicast NCMR routing protocol with NCMR unicast & also with traditional multipath routing protocol for unicast and multicast networks, in terms of the packet loss, energy consumption, successful delivery ratio & end to end delay when a packet is transmitted Some special simulations are carried out specially for NCMR multicast i.e. effect of number of nodes on energy consumption, packet loss & end to end delay.
Connected Dominating Set Construction Algorithm for Wireless Sensor Networks ...ijsrd.com
Energy efficiency plays an important role in wireless sensor networks. All nodes in sensor networks are energy constrained. Clustering is one kind of energy efficient algorithm. To organize the nodes in better way a virtual backbone can be used. There is no physical backbone infrastructure, but a virtual backbone can be formed by constructing a Connected Dominating Set (CDS). CDS has a significant impact on an energy efficient design of routing algorithms in WSN. CDS should first and foremost be small. It should have robustness to node failures. In this paper, we present a general classification of CDS construction algorithms. This survey gives different CDS formation algorithms for WSNs.
Cross layer design for power control and linkIJCNCJournal
Frequent changes in network topology due to mobility and limited battery power of the mobile devices are the key challenges in the adhoc networks. The depletion of power source may cause early unavailability of nodes and thus links in the network. The mobility of nodes causes frequent routes breaks and adversely affects the required performance of the applications. We propose a cross layer design for the dynamic power control protocol and link prediction (DPCPLP) that provides a combined solution for power conservation as well as link availability. This combines the effect of optimum transmit power and received signal strength based link availability estimation with AODV routing protocol using cross layer approach.
This method proposes to use optimum transmit power for transmitting the packets to a neighboring node to
increase the battery life of adhoc nodes and received signal strength based link prediction to increase the
availability of the links. In this paper, the transmit power and received signal strength of the packets are
cross-layer interaction parameters to provide the combined solution for power conservation and reliable
route formation with increased availability of links and thus the routes amongst sources and destinations. Further, this increases network and nodes’ lifetime and capacity. It improves throughput and packet delivery ratio by spatial reuse, prior prediction of link breaks and initiating the route repair. It also reduces
end-to-end delay and power consumption by use of optimum transmit power. Through simulations, we have
shown that our proposed protocol shows better performance.
Extending network lifetime of wireless sensorIJCNCJournal
One critical issue in designing and managing a wireless sensor network is how to save the energy consumption
of the sensors in order to maximize network lifetime under the constraint of full coverage of the monitored
targets. In this paper, we adopt the common approach of creating disjoint sensor covers to prolong network
lifetime. The typical goal used in the literature is to maximize the number of covers without consideration of
the energy levels of the sensors. We argue that the network lifetime can be extended by maximizing the total
bottleneck energy of the created covers. We formally define the problem of maximizing the total bottleneck
energy of the covers, present for the first time an integer programming formulation of the problem, and develop
two algorithms to solve large problem instances. Extensive experimental tests show that the use of the goal of
maximizing the total bottleneck energy of the covers creates covers with substantially longer network lifetime
than the lifetime of the covers created with the goal of maximizing solely the number of covers.
MODELING, IMPLEMENTATION AND PERFORMANCE ANALYSIS OF MOBILITY LOAD BALANCING ...IJCNCJournal
We propose in this paper a simulation implementation of Self-Organizing Networks (SON) optimization
related to mobility load balancing (MLB) for LTE systems using ns-3 [1]. The implementation is achieved
toward two MLB algorithms dynamically adjusting handover (HO) parameters based on the Reference
Signal Received Power (RSRP) measurements. Such adjustments are done with respect to loads of both an
overloaded cell and its cells’ neighbours having enough available resources enabling to achieve load
balancing. Numerical investigations through selected key performance indicators (KPIs) of the proposed
MLB algorithms when compared with another HO algorithm (already implemented in ns-3) based on A3
event [2] highlight the significant MLB gains provided in terms global network throughput, packet loss rate
and the number of successful HO without incurring significant overhead.
MODELING AND DESIGNING RESOURCE EFFICIENT DISTRIBUTED MANET MANAGEMENT SYSTEM...IJCNCJournal
Traditional network management systems use spoofing of resources to collect statistical data such as resource usage and performance. This data is exchanged with other resources through management protocols. The amount of data can be extremely high and the bandwidth for overhead management functions increases significantly. Also, the data storage requirements in each network resource for
management functions increases and become inefficient as it increases the power usage for processing. In
this paper, we propose a distributed network management system where each network resource maintains a
set of Management Information Base (MIB) elements and stores resource activities in their abstraction in
terms of counters, flag and threshold values. The abstract data is exchanged between different management
agents residing in different resources on a need-to-know basis and each agent logically executes management functions locally to develop understanding of the behavior of all network resources to ensure that user protocols can function smoothly. Our proposed architecture can be implemented in any network, but is highly important to be considered in power and bandwidth constrained networks such as Mobile Ad Hoc Networks (MANET). In this research, we use cross layer models to demonstrate simplified way of efficiently managing the overall performance of individual network resources (nodes) and the network itself which is critical for not only monitoring the traffic, but also dynamically controlling the end-to-end Quality of Service (QoS) for multi-service applications.
The article looks into the current state of the art of dynamic routing protocols with respect to their
possibilities to react to changes in the Quality of Service when selecting the best route towards a
destination network. New options that could leverage information about the ever changing QoS parameters
for data communication are analysed and a Cisco Performance Routing solution is described more in
detail. The practical part of this work focuses on a design and implementation of a test bed that provides a
scalable laboratory architecture to manipulate QoS parameters of different data communications flowing
through it. The test bed is used in various use cases that were used to evaluate Cisco Performance Routing
optimization capabilities in different scenarios.
Energy efficiency cross layer protocol for wireless mesh networkIJCNCJournal
Wireless mesh network (WMN) is a novel emerging tec
hnology that will change the world more effectively
and efficiently. It is regarded as a highly promisi
ng technology being increasingly important in mobil
e
wireless networks of the future generation. In this
paper, we consider energy management for wireless
mesh networks from a point of view that started rec
ently to attract the attention means the conservati
on of
energy for operational and the environment reasons
which is known as the Green Networking. This paper
discusses different routing protocols to establish
a protocol which considers energy efficiency. The e
xisting
protocols are compared using the basic functions of
routing and the suggest protocol is designed to
overcome some of their shortcomings. We are focusin
g on the conception of the cross-layer routing
protocol that is implemented in TDMA (Time Division
Multiple Access) wireless mesh networks based
MAC protocol.
GPS SYSTEMS LITERATURE: INACCURACY FACTORS AND EFFECTIVE SOLUTIONS IJCNCJournal
Today, Global Positioning System (GPS) is widely used in almost every aspect of our daily life. Commonly,
users utilize the technology to track the position of a vehicle or an object of interest. They also use it to
safely navigate to the destination of their choice. As a result, there are countless number of GPS based
tracking application that has been developed. But, a main recurring issue that exists among these
applications are the inaccuracy of the tracking faced by users and this issue has become a rising concern.
Most existing research have examined the effects that the inaccuracy of GPS have on users while others
identified suitable methods to improve the accuracy of GPS based on one or two factors. The objective of
this survey paper is to identify the common factors that affects the accuracy of GPS and identify an effective
method which could mitigate or overcome most of those factors. As part of our research, we conducted a
thorough examination of the existing factors for GPS inaccuracies. According to an initial survey that we
have collected, most of the respondents has faced some form of GPS inaccuracy. Among the common issues
faced are inaccurate object tracking and disconnection of GPS signal while using an application. As such,
most of the respondents agree that it is necessary to improve the accuracy of GPS. This leads to another
objective of this paper, which is to examine and evaluate existing methods as well as to identify the most
effective method that could improve the accuracy of GPS.
Correlating objective factors with videoIJCNCJournal
To succeed in providing services, the quality of services should meet users’ satisfaction. This is a motivation to study the relationship between the service quality and the real perceived quality of users, which is commonly referred to as the quality of experience (QoE). However, most of existing QoE studies that focus on video-on-demand or IPTV services analyze only the influence of network behaviors to video quality. This paper focuses on P2P video streaming services, which are becoming a significant portion of Internet traffic, and pays attention to the change of users’ perception with the adjustment of objective
factors as well as network behaviors. We propose to use mean opinion score and peak signal to noise ratio
methods as QoE evaluations to consider the effect of the chunk loss ratio, the group-of-picture size, and the
chunk size. The experimental results provide a convincing reference to build the complete relationship
between objective factors and QoE. We believe that this assessment will contribute to study a new service
quality evaluation mechanism based on users’ satisfaction in the future.
Computer network is becoming more popular and common, the need to use the broadband connection services (e-learning - online training, video conferencing - online conference, IPTV - digital TV ...) of organizations and individuals is increasing. Multicast is an effective mechanism for the transmission of information and data to many recipients simultaneously. Multicast is a routing problem from a source node to a receiver node set, also known as the routing from one point to multipoint. The advances in technology and multimedia applications emerge quickly has provided great motivation for the application of new real-time multi-point. Many multi-point applications will not function properly if the QoS (quality of service) can not be guaranteed. Therefore, multi-point algorithms must be able to meet the QoS constraints (cost, reliability, bandwidth, jitter, delay...). The objective of multicast routing algorithms guarantee QoS is to provide routing algorithms have the ability to recognize the tree to satisfy the maximum of traffic streams with QoS requirements. Most multicast algorithms on MPLS (MultiProtocol Label Switching) considered the unique QoS constraint as bandwidth. The other QoS constraints can be converted into bandwidth efficiency. Starting from this reality, this paper research multicast routing algorithms guarantee bandwidth and propose new algorithm compares with existing ones.
Impact of network quality deterioration on user’s perceived operability and l...IJCNCJournal
The remote desktop environment (Virtual Desktop Infrastructure) is attracting interest as a way to
strengthen security and support mobile access ortelework. To realize the remote desktop environments, a remote desktop protocol is required to transfer information via a network about the user’s operations made on the keyboard and mouse on a terminal to the remote server. The growing popularity of remote desktop environments makes it important to determine the factors that govern the user’s perceived operability with a remote desktop protocol. It is also necessary important to find out the conditions for a wide- area live migration of virtual machines, to use resources efficiently in the remote desktop environments.
This paper examines the impact of network quality deterioration (long network delay, high packet loss,
small downlink bandwidth) on a user’s perceived operability in remote desktop environments, assuming
RDP, PCoIP and ICA as remote desktop protocol. Next, this paper studies the impact of network quality on
the performance of a live-migration of virtual machines in remote desktop environments.
PERFORMANCE EVALUATION OF MOBILE WIMAX IEEE 802.16E FOR HARD HANDOVERIJCNCJournal
Seamless handover in wireless networks is to guarantee both service continuity and service quality. In
WiMAX, providing scalability and quality of service for multimedia services during handover is a main
challenge because of high latency and packet loss. In this paper, we created four scenarios using Qualnet
5.2 Network Simulator to analyze the hard handover functionality of WiMAX under different conditions.
The scenarios such as Flag with 5 and 10 sec UCD and DCD interval values, Random mobility scenario
and DEM scenario using 6 WiMAX Cells have been considered. This study is performed over the real
urban area of JNU where we have used JNU map for scenarios 1, 2 and 3 but for scenario 4, the JNU
terrain data has been used. Further, each BS of 6 WiMAX cell is connected to four nodes. All nodes of each
scenario are fixed except Node 1. Node 1 is moving and performing the handover between the different BSs
while sending and receiving real time traffics. Flag mobility model is used in Scenario 1, 2 and 4 to model
the movement of the Node 1 while we use random mobility model in sceanrio3. 5 seconds time interval is
used for Scenarios 1, 3, and 4 while 10 seconds time interval is used for scenario 2 to study the effect of
management messages load on handover. Further, the statistical measures of handover performance of
WiMAX in terms of number of handover performed, throughput, end-to-end delay, jitter, and packets
dropped are observed and evaluated.
Privacy, especially in a cellphone, is an important thing and should be protected. Steganography is a
method used to protect a sensitive information. The issue tried to be discussed in this study is the issue on
inserting technique in a text through a simple method of White Space Steganography on android. The
inserted message has been compressed through a double compression method by using LZW and Huffman
so that the size of message to be inserted can be minimized while the capacity of the inserted message can
be minimized. The compression shows that the compression ratio much depends on the type of text input to
the text to be sent; the more the repetition or duplication found on the message, the smaller the
compression ratio will be. The compression process using Android based smartphone is relatively fast with
the average duration of 0.045 seconds, either for the insertion or extraction.
ENERGY CONSUMPTION IMPROVEMENT OF TRADITIONAL CLUSTERING METHOD IN WIRELESS S...IJCNCJournal
In the traditional clustering routing protocol of wireless sensor network, LEACH protocol (Low Energy
Adaptive Clustering Hierarchy) is considered to have many outstanding advantages in the implementation
of the hierarchy according to low energy adaptive cluster to collect and distribute the data to the base
station. The main objective of LEACH is: To prolong life time of the network, reduce the energy
consumption by each node, using the data concentration to reduce bulletins in the network. However, in the
case of large network, the distance from the nodes to the base station is very different. Therefore, the
energy consumption when becoming the host node is very different but LEACH is not based on the
remaining energy to choose the host node, which is based on the number of times to become the host node
in the previous rounds. This makes the nodes far away from the base station lose power sooner.
In this paper, we give a new routing protocol based on the LEACH protocol in order to improve operating
time of sensor network by considering energy issues and distance in selecting the cluster-head (CH), at that
time the nodes with high energy and near the base station (BS) will have a greater probability of becoming
the cluster-head than the those in far and with lower energy.
During route discovery of mobile ad hoc network, broadcasting of route request and route reply packets
are the essential operations for finding the path between two ends. In such situations, intermediate node
which may or may not belongs will participate in route discovery process, update routing table and
rebroadcast the route discovery packets again to its neighboring nodes. Finally optimal path is found with
minimum hops. This simply upsurges overhead and deteriorates the performance of routing. The proposed
Petal Ant Routing (PAR) algorithm offers a low overhead by optimizing FANT and BANT transmissions in
route discover process. The algorithm is an improved version of SARA and has features extracted from
petal routing. The algorithm is simulated on NS2, compared with ACO frame work called SARA and
classical routing protocols such as AODV and AOMDV. The simulation results shows that PAR further
reduces overhead by eliminating redundant FANT transmission compared to other routing algorithm.
HANDOVER OPTIMIZATION BASED ON MEDIA INDEPENDENT HANDOVER IN NEW NETWORKS NGWN IJCNCJournal
One of the challenging issues in Next Generation Wireless Network (NGWN) is achieving seamless Vertical
Handover (VHO) while roaming between different technologies such as Wireless Fidelity (Wi- Fi),
Worldwide Interoperability for Microwave Access (WiMAX), Universal Mobile Telecommunications
System (UMTS) and Long Term Evolution (LTE). F or that the telecommunication operators will be
required to develop a strategy for interoperability of these different types of existing network to give the
best connection anywhere anytime for the Mobile Users (MUs).
To full these requirements we propose a new VHO approach that based on loose coupling internetworking
in conjunction with Mobile IPv4 ( MIPv4) under Media Independent Handover (MIH). Our objective is
develop a strategy for interoperability of different technologies and optimized the VHO decision. Our
proposed approach provides more exhaustive, high accurate and better performance compared with the
approaches proposed in the literature.
DIA-TORUS:A NOVEL TOPOLOGY FOR NETWORK ON CHIP DESIGNIJCNCJournal
The shortcomings of conventional bus architectures are in terms of scalability and the ever increasing
demand of more bandwidth. And also the feature size of sub-micron domain is decreasing making it
difficult for bus architectures to fulfill the requirements of modern System on Chip (SoC) systems. Network
on chip (NoC) architectures presents a solution to the earlier mentioned shortcomings by employing a
packet based network for inter IP communications. A pivotal feature of NoC systems is the topology in
which the system is arranged. Several parameters which are topology dependent like hop count, path
diversity, degree and other various parameters affect the system performance. We propose a novel
topology forNoC architecture which has been thoroughly compared with the existing topologies on the
basis of different network parameters.
A MASS BALANCING THEOREM FOR THE ECONOMICAL NETWORK FLOW MAXIMISATIONIJCNCJournal
A mass balancing theorem (MBT) was recently introduced, concerning the role of 'unbalanced nodes' in the optimization of network flow. The MBT discovers and proves a flow-balancing property, which can be exploited in the design of network flow algorithms. Subsequently a number of such applications of the MBT have been explored for various types of flow-networks. These have included, in particular, single and
multiple commodity networks with additional equipment of separators, which are present in various real world scenarios including the oil and gas industry. In this paper, the mass balancing theorem is revisited,and further developed to consider new network examples with embedded cycles. In doing so, algorithms based on the mass balancing method are extended to remove any undesirably saturated edges in the
network, consequently reducing economic costs for flow-maximization in such networks.
One of the most attractive field for research for researchers and authors so the Wireless adhoc networks.
So, this paper will describe the background and basic features of Open Short Path First (OSPF) routing
protocol due to multi-access networks. Explaining and practice on the OSPF configuration commands.
Describe, modify and calculate the metric (Cost) used by OSPF due to adhoc networks. Illustrating the
Election parameters made by DR/BDR (Designated and Back Designated) Routers used in multi-access
wireless networks. This paper will use OSPF routing protocol because of its average administrative
distance with all routing protocols.
A MIDDLEWARE FOR THE INTERNET OF THINGSIJCNCJournal
The Internet of Things (IoT) connects everyday objects including a vast array of sensors, actuators, and smart devices, referred to as “things” to the Internet, in an intelligent and pervasive fashion. This connectivity gives rise to the possibility of using the tracking capabilities of things to impinge on the location privacy of users. Most of the existing management and location privacy protection solutions do not consider the low-cost and low-power requirements of things; or, they do not account for the heterogeneity, scalability, or autonomy of communications supported in the IoT. Moreover, these traditional solutions do not consider the case where a user wishes to control the granularity of the disclosed information based on
the context of their use (e.g. based on the time or the current location of the user). To fill this gap, a middleware, referred to as the Internet of Things Management Platform (IoT-MP) is proposed in this paper.
Constructing Minimum Connected Dominating Set in Mobile Ad Hoc NetworksGiselleginaGloria
One of the most important challenges of a Mobile Ad Hoc Network (MANET) is to ensure efficient routing among its nodes. A Connected Dominating Set (CDS) is a widely used concept by many protocols for broadcasting and routing in MANETs. Those existing protocols require significant message overhead in construction of CDS. In this paper, we propose a simple, inexpensive and novel algorithm of computing a minimum CDS. The proposed algorithm saves time and message overhead in forming a CDS while supporting node mobility efficiently. Simulation results show that the proposed algorithm is efficient in terms of both message complexity and the size of the CDS.
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (2
2n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
Analysis of Genetic Algorithm for Effective power Delivery and with Best Upsurgeijeei-iaes
Wireless network is ready for hundreds or thousands of nodes, where each node is connected to one or sometimes more sensors. WSN sensor integrated circuits, embedded systems, networks, modems, wireless communication and dissemination of information. The sensor may be an obligation to technology and science. Recent developments underway to miniaturization and low power consumption. They act as a gateway, and prospective clients, I usually have the data on the server WSN. Other components separate routing network routers, called calculating and distributing routing tables. Discussed the routing of wireless energy balance. Optimization solutions, we have created a genetic algorithm. Before selecting an algorithm proposed for the construction of the center console. In this study, the algorithms proposed model simulated results based on "parameters depending dead nodes, the number of bits transmitted to a base station, where the number of units sent to the heads of fuel consumption compared to replay and show that the proposed algorithm has a network of a relative.
K dag based lifetime aware data collection in wireless sensor networksijwmn
Wireless Sensor Networks need to be organized for efficient data collection and lifetime maximization. In
this paper, we propose a novel routing structure, namely k-DAG, to balance the load of the base station's
neighbours while providing the worst-case latency guarantee for data collection, and a distributed
algorithm for construction a k-DAG based on a SPD (Shortest Path DAG). In a k-DAG, the lengths of the
longest path and the shortest path of each sensor node to the base station differ by at most k. By adding
sibling edges to a SPD, our distributed algorithm allows critical nodes to have more routing choices. The
simulation results show that our approach significantly outperforms the SPD-based data collection
approach in both network lifetime and load balance.
Enhancing the Network Life Using Reliable Energy Efficient Routing in Wireles...IJEACS
Energy is one of the main network resources that is used in mobile devices. We proposed an energy efficient routing techniques called reliable minimum energy cost routing (RMECR) and comparing with reliable minimum energy routing (RMER) which are used by the nodes in the most efficient manner. RMER and RMECR works on the basis of balancing the energy of the nodes so that the nodes with maximum energy can do the work and the nodes with less than certain threshold energy required to do a certain amount of work will not do any work. Thereby we try to raise the network reliability and lifetime of communication in a network of mobile devices. The proposed RMECR protocol is also used to decrease the cost of communication in a wireless networking environment.
k fault tolerance Mobile Adhoc Network under Cost Constraintsugandhasinghhooda
A network topology is a K-FT topology if it can endure K number of link failures, however to find a reliable hardware topology for a set of nodes keeping the total cost of the links within a predefined budget, is a challenging task, especially when the topology is subjective to constraints that the topological network can tolerate K link failures keeping total cost of network within budget. This problem has been addressed in this paper where in a novel algorithm is proposed that uses N X N matrix to represent the cost between the participating nodes, and uses K-FT topology to tackle the fault tolerant problem of Mobile Adhoc Networks. Intention is to achieve optimal resource utilization and fairness among competing end to end flows. A network topology is said to be K-FT if and only if every pair of node is reachable from all other nodes for K link failures. The algorithm has been tested for wide range of node sets and the result obtained there of suggest that the proposed algorithm finds better solutions in comparison to Genetic Algorithm.
Energy saving in cooperative transmission using opportunistic protocol in MANETIOSR Journals
Abstract : In this thesis, we study the joint problems of cooperative link and diversity in A Mobile Ad-Hoc Network (MANET) with variable wireless channels. In MANET the wireless nodes are in group and infrastructure less in nature. The major problems faced by wireless communication in real time environment are that of interference and un-reliable communication links. Much research work has been done to overcome this by using various techniques. Cooperative communication and transmission side diversity in the network are the two of the techniques that help in reducing interference and communication link failures. We have also proposed a new technique to find the optimum route as a joint problem of the transmission power at the physical layer and the link selection at the network layer that incurs the minimum cost in terms of energy, no. of hops, available bandwidth and link quality (SNR), outage probability. Analytical results show that our cooperative transmission schemes (OMCTSP) achieves average energy saving of more than 80% than direct transmission. Keywords: cooperative transmission, , channel gain, diversity, , linkcost minimum energy routing, outage diversity, Variable wireless channels.
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.
Fuzzy Optimized Metric for Adaptive Network RoutingCSCJournals
Network routing algorithms used today calculate least cost (shortest) paths between nodes. The cost of a path is the sum of the cost of all links on that path. The use of a single metric for adaptive routing is insufficient to reflect the actual state of the link. In general, there is a limitation on the accuracy of the link state information obtained by the routing protocol. Hence it becomes useful if two or more metrics can be associated to produce a single metric that can describe the state of the link more accurately. In this paper, a fuzzy inference rule base is implemented to generate the fuzzy cost of each candidate path to be used in routing the incoming calls. This fuzzy cost is based on the crisp values of the different metrics; a fuzzy membership function is defined. The parameters of these membership functions reflect dynamically the requirement of the incoming traffic service as well as the current state of the links in the path. And this paper investigates how three metrics, the mean link bandwidth, queue utilization and the mean link delay, can be related using a simple fuzzy logic algorithm to produce a optimized cost of the link for a certain interval that is more „precise‟ than either of the single metric, to solve routing problem .
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.
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.
Multicast routing strategy for SDN-cluster based MANET IJECEIAES
The energy limitation and frequent movement of the mobile Ad hoc network (MANET) nodes (i.e., devices) make the routing process very difficult. The multicast routing problem is one of the NP-complete problems. Therefore, the need for a new power-aware approach to select an optimum multicast path with minimum power consumption that can enhance the performance and increase the lifetime of MANET has become urgent. Software defined network (SDN) is a new technique that can solve many problems of the traditional networks by dividing the architecture into data part and control part. This paper presents three power-aware multicast routing strategies for MANET. First one called a Reactive Multicast routing strategy for Cluster based MANET by using SDN (RMCMS), second one called Proactive Multicast routing strategy for Cluster based MANET by using SDN (PMCMS) and third one represents Modification of PMCMS called M-PMCMS. Moreover, it produces a new mathematical model to build a multicast tree with minimum power consumption and takes into account the remaining power in each node. All proposed multicast strategies operate based on this mathematical model and aim to maximize the MANET lifetime by exploiting the advantages of SDN and clustering concepts. They consider the multicast tree with minimum power consumption as an optimal one. The simulation results illustrated that RMCMS is better than PMCMS, M-PMCMS, and MAODV in terms of power consumption and network overhead while M-PMCMS is the best one in terms of dropped packets ratio (DPR) and average end to end (E2E) delay.
IMPLEMENTING PACKET BROADCASTING ALGORITHM OF MIMO BASED MOBILE AD-HOC NETWOR...IJNSA Journal
With the rapid growth of wireless communication infras,,tructure over the recent few years, new challenges has been posed on the system and analysis on wireless adhoc networking. Implementation of MIMO communication in such type of network is enhancing the packet transmission capabilities. There are different techniques for cooperative transmission and broadcasting packet in MIMO equipped Mobile Adhoc Network. We have employed a model network in the OPNET environment and propose a new scheduling algorithm based on investigating the different broadcasting algorithm. The new broadcasting algorithm improves the packet transmission rate of the network based on energy performance of the network and minimizes the BER for different transmission mode which is illustrated in this paper. The simulations are done in MATLAB and OPNET environment and the simulated result for the packet transmission rate are collected and shown in the tabular form. Also simulate the network for generating a comparative statement for each mobile node. And performance analysis is also done for the model network. The main focus is to minimize BER and improve information efficiency of the network.
An Optimal RPC Based Approach to Increase Fault Tolerance in Wireless AD-HOC ...pijans
In wireless network, fault tolerant topology control is an important and a challenging task. The wireless
nodes and links could experience frequent failures since Wireless networks are usually deployed under
extreme environments. Therefore, fault tolerance must be considered for many applications. In wireless
network Topology control has been proved effective in saving node power. The main idea of topology
control is that instead of using its maximal transmission power, each node sets its power to a certain level
such that the global topology satisfies a certain constraint. To increase fault tolerance, nodes in the
network will consume more power. Here we need to give the optimum distance between the nodes of the
wireless network in order to reduce the consumption of the power of each node.
This paper deals with the approach for the finding the minimum distance between the nodes of the wireless
network by the use of mat lab coding through the graph theory considering the minimum weight based
algorithm.
ENERGY EFFICIENT ROUTING ALGORITHM FOR MAXIMIZING THE MINIMUM LIFETIME OF WIR...ijasuc
In wireless sensor network, devices or nodes are generally battery powered devices. These nodes have
limited amount of initial energy that are consumed at different rates, depending on the power level. The
lifetime of the network is defined as the time until the first node fails (or runs out of battery). In this paper
different type of energy efficient routing algorithms are discussed and approach of these algorithms is to
maximize the minimum lifetime of wireless sensor network. Special attention has been devoted for
algorithms formulate the routing problem as a linear programming problem, which uses the optimal flow
path for data transmission and gives the optimum results. Advantages, limitations as well as comparative
study of these algorithms are also discussed in this paper.
Similar to A genetic algorithm for constructing broadcast trees with cost and delay constraints in computer networks (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.
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!
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
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.
A genetic algorithm for constructing broadcast trees with cost and delay constraints in computer networks
1. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.1, January 2015
DOI : 10.5121/ijcnc.2015.7103 35
A GENETIC ALGORITHM FOR CONSTRUCTING
BROADCAST TREES WITH COST AND DELAY
CONSTRAINTS IN COMPUTER NETWORKS
Ahmed Y. Hamed1
and Ghazi Al-Naymat2
1
College of Applied Studies and Community Services, University of Dammam, KSA
2
Deanship of Information & Communication Technology,University of Dammam, KSA
ABSTRACT
We refer to the problem of constructing broadcast trees with cost and delay constraints in the networks as a
delay-constrained minimum spanning tree problem in directed networks. Hence it is necessary determining
a spanning tree of minimal cost to connect the source node to all nodes subject to delay constraints on
broadcast routing. In this paper, we proposed a genetic algorithm for solving broadcast routing by finding
the low-cost broadcast tree with minimum cost and delay constraints. In this research we present a genetic
algorithm to find the broadcast routing tree of a given network in terms of its links. The algorithm uses the
connection matrix of the given network to find the spanning trees and considers the weights of the links to
obtain the minimum spanning tree. Our proposed algorithm is able to find a better solution, fast
convergence speed and high reliability. The scalability and the performance of the algorithm with
increasing number of network nodes are also encouraging.
KEYWORDS
Computer Networks, Broadcast Trees,Genetic Algorithm
1. INTRODUCTION
In computer networks, broadcasting refers to transmitting a packet that will be received by every
device in the network [1]. In practice, the scope of the broadcast is limited to a broadcast domain.
Broadcasting a message is in contrast to unicast addressing in which a host sends datagrams to
another single host identified by a unique IP address.
Broadcast is a communication function that a node, called the source, sends messages to all the
other nodes in the networks. Broadcast is an important function in applications of ad-hoc
networks, such as in cooperative operations, group discussions, and so on. Broadcast routing is
finding a broadcast tree, which is rooted from the source and contains all the nodes in the
network. The cost of a broadcast is defined as the sum of cost of all the links that transmit the
broadcast message in the broadcast tree.
The spanning tree is defined as a connected sub-graph of that contains all its nodes and
nocycles[2][3]. A simple approach is to use elementary tree-transformation which is based on the
addition of a chord and deletion of an appropriate branch from a spanning tree. Thus, starting
from any spanning tree of the graph with n nodes, one can generate all spanning trees by
successive cyclic exchange[2]. This straightforward approach is difficult to computerize. So,
2. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.1, January 2015
36
Aggarwal[4] presented another algorithm, uses Cartesian products of (n-1) vertex cut sets whose
elements are the branches connected to any of the (n-1) nodes of the graph.
In this paper, we present a genetic algorithm to find the broadcast routing tree of a given network
in terms of its links. The algorithm uses the connection matrix of a given network to find the
spanning trees, and then it considers the weights of the links to obtain the minimum spanning
tree.
The paper is organized as follows: Section 2takes account of the related work. In Section 3, we
define the problem that we are aiming to solve. Section 4 highlights some facts about the
spanning tree structure. Section 5 discusses our proposed algorithm and all its steps. In Section 6,
we provide our experiments that demonstrate our technique’s findings. Finally, we provide our
conclusions in Section 7. The table below lists most of the used notations in this paper.
Notations
G
N
E
xij
d(e)
c(e)
M
MT
Ti
C(T)
D(T)
IN
Ri
Ci
RC
RD
A network graph.
The number ofnodesinG.
The number oflinks inG.
A link between node i and node jin G.
Thedelayof a link.
The cost of a link.
Theconnectionmatrix ofthe given network.
Theconnectionmatrixofthespanningtree.
The spanningtree-i.
The total cost of a spanning tree.
Thedelayofaspanningtree.
An initiallynumbers of the spanningtrees.
A rowiin a matrix.
A columniin a matrix.
The require cost.
The require delay.
2. RELATED WORK
The minimum spanning tree problem (MSTP, Busacker[5] has been well studied in this
framework, and efficient algorithms are widely known to solve this problem[6][7]. With minor
changes, the same algorithms can be used to find the maximum spanning tree as well.
Younes[8] presented an algorithm to find the spanning trees of the computer network in terms of
its links for using it in computing the network reliability.
Young[3]discussed these problems and described the first distributed algorithm for constructing
minimal spanning trees. The algorithm and the principles and techniques underlying its design
find application in large communication networks and large multiprocessor computer systems.
Chekuri [9] focused on scheduling to minimize two related objectives: the maximum response
time and maximum delay factor.
3. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.1, January 2015
37
Fard [10] demonstrated how the spanning trees of a network can be utilized to determine a node
pair across which a link should be added in order to achieve the maximum all-terminal reliability
improvement in a network.
Yamada [11] formulated the spanning tree detection problem, and developed heuristic as well as
exact algorithms to solve the problem. With these algorithms, problems with up to 1000 nodes
have been solved within a few seconds. The algorithms have been extended to list up all the
spanning trees of an arbitrary specified weight.
Kardan[12] presented the complete version of DBMST that regards packet loss and dynamism of
the network topology and provides reliable communication. The proposed method decreases the
power consumption of reliable broadcasting up to 15% in comparison with the basic version. In
DBMST, network structure adapts to topology variations quickly while it takes several hours for
other methods to find out variations in network.
Salama [13] formulated the problem of constructing broadcast trees for real-time traffic with
delay constraints in networks with asymmetric link loads as a delay-constrained minimum
spanning tree (DCMST) problem in directed networks.
The Delay-Constrained Capacitated Minimum Spanning Tree (DC-CMST) is a recently proposed
problem which arises in the design of the topology of communications networks. The DC-CMST
proposes the joint optimization of the network topology in terms of the traffic capacity and its
mean time delay[14]. He presented an evolutionary algorithm which uses Dandelion-encoding is
proposed to solve the problem.
Younes[15] presented the broadcast routing algorithms that aim to minimize the cost of the
routing path.
Sameh [16]presented an algorithm to manipulate the problem of minimizing the mean completion
delay in wireless broadcast for instantly decodable network coding.
Salama [17] formulated the problem of constructing broadcast trees for real-time traffic with
delay constraints in networks with asymmetric link loads as a delay-constrained minimum
spanning tree (DCMST) problem in directed networks. They proved that this problem is NP-
complete, and they proposed an efficient heuristic to solve the problem based on Prim’s algorithm
for the unconstrained minimum spanning tree problem. This is the first heuristic designed
specifically for solving the DCMST problem.
3. PROBLEM DESCRIPTION
Given a network in which each link has a fixed cost and delay, find a broadcast tree such that the
cost of the broadcast tree is minimized and delay is constrained. Thus, we present a genetic
algorithm to find the broadcast routing tree of a given network in terms of its links which will
solve our problem. The algorithm uses the connection matrix of a given network to find the
spanning trees, and also is based on the weights of the links to obtain the minimum spanning tree.
The proposed algorithm goal is able to find a better solution, fast convergence speed and high
reliability when obtaining the spanning trees. Extensive simulations have been conducted and the
results have demonstrated the efficiency of the proposed algorithms
The definition of the problems as follows:
4. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.1, January 2015
38
A network is usually represented as a weighted directed graph where N denotes the
set of nodes and E denotes the set of communication links connecting the nodes.
and denote the number of nodes and links in the network respectively.
Any link e E has a cost and a delay associated with it. and may take any
positive real values.
A spanning tree is rooted at a source node and contains exactly one path from
s to any node – . The total cost of a tree is simply:
A path is the set of tree links connecting s to The cost of the path
is:
And the delay of that path is:
Thus the maximum delay of a spanning tree is:
Our problem in directed networks is: constructs the spanning tree T(s) rooted at s that has
minimum total cost among all possible spanning trees rooted at s which have a maximum delay
less than or equal to a given delay constraint D.
The problem can be expressed as: Given a directed network , a positive
for each e , a source , a positive delay constraint RD and a positive cost RC, find a
spanning tree T(s) that satisfy:
Where RC is the require cost.
Where RD id the require delay.
5. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.1, January 2015
39
4. THE SPANNING TREE
A tree T is considered as a spanning tree of graph G if T is a connected sub graph of G and
contains all nodes of G. A link in T is called a branch of T, while a link of G that is not in T is
called chord. For a connected graph of N nodes and E links, the spanning tree has (N-1) branches
and (E-N+1) chords.
I.e., the characterization of the spanning tree as:
Contains(N-1)edges.
ContainsallnodesofG.
Isa connectedsubgraphofG.
The following subsections detail the above three characterizations of the spanning tree.
4.1. TheSpanningTreeContainingallNodes
In our proposed algorithm, one of the main steps is to validate that the spanning tree contains all
nodes of the given network.To illustrate that, we consider a network of 8 nodes and 13 edges as
shown in figure1.
Figure 1asamplenetwork
The edges 1-2, 1-3, 1-6, 2-4, 3-5, 6-7, 7-8 of the above figure represent a spanning tree T as
shown in Figure 2. The tree T contains 7 edges (N-1 edges) this satisfies the first feature of the
spanning tree (it contains N-1 edges).The tree also contains all nodes of the above figure and this
is the second feature. Finally,the tree forms a connected graph which means that all of its nodes
are connected and this is the third feature of the spanning tree.
6. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.1, January 2015
40
Figure 2A spanning tree of Figure 1.
The connection matrix M describes all direct connections between the nodes of a graph. The
weighted connection matrix is a square matrix of dimension n x n. Entries of M are defined such
that the entry Mij at the intersection of row i and column j, represents a connection from node i to
node j. The rules that define a weighted connection matrix are as follows:
That is, the connection matrix of the Figure 1is:
Figure 3Theconnectionmatrixof tree inFigure 1
The spanning tree T contains all nodes of the given network, if all rows and columns ofMT are
non-zero elements (MT is the connection matrix of T, which is created using Equation (7)).
For example, if we consider the above spanning tree (Figure 2), the connection matrix MT is in
the following form:
Figure 4Theconnectionmatrixofthe above spanningtree in Figure 2
7. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.1, January 2015
41
In Figure 4, we notice that the matrix does not contain any row or column that all its elements are
zeros. Hence, the spanning tree of Figure 2 contains all the nodes of the given network (Figure 1).
4.2. The Spanning Tree is a Connected Sub Graph.
In the proposed algorithm, we prove that the spanning tree is a connected sub graph as follows: A
graph G is connected if there is at least one path between every pair of nodes i and j, which
minimally requires a spanning tree with edges.
The sub graph is connected if all its nodes are connected. To confirm if a spanning tree T is a
connected sub graph or not, we can repeat the union between the elements of both R1 and Rj in
the matrix MT where Rj is a list of all indexes of the none zero elements in R1 and it. On other
hand, we can use the following relation (8) which was used by Younes[8]:
Do
{
.
Figure 5Example to check the sub routine in Equation (8)
We use the example in Figure 5 to illustrate our method in checking the connectivity of
the sub graph. Below you see the steps the union operations are performed between R1
and Rj and how R1 is updated in each iteration.
8. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.1, January 2015
42
If there exists one zero element in R1, this mean the spanning tree Ti is not aconnected sub graph.
Hence, the spanning tree (1 0 1 0 1 1 1 0) is a connected sub graph.To the best of knowledge, this
technique is a unique one and not previously used to validate whether the tree is connected or not.
5. THE PROPOSED GENETIC ALGORITHM (GA)
In the proposed GA, each spanning tree is represented by a binary string that can be used as a
chromosome. Each element of the chromosome represents a link in the network topology. So, for
a network of N nodes and E edges, there are E string components in each candidate solution x.
Each chromosome must contains N-1 none zero elements. For example, the spanning tree of
Figure 2is represented as a chromosome as shown in Figure 6.
1-2 1-3 1-6 2-3 2-4 3-5 3-6 4-5 4-8 5-7 5-8 6-7 7-8
1 1 1 0 1 1 0 0 0 0 0 1 1
Figure 6Thechromosome form
5.1. Initial Population
The initial population is generated according to the following steps:
1. Achromosomex intheinitialpopulationcanbe generatedas shownin Figure 6.
2. ThechromosomemustcontainonlyN-1nonezeroelements
3. Repeatsteps1 to2 to generatepop_size(population size), numberofchromosomes.
5.2. Fitness Function
The fitness function is used in each iteration of the genetic algorithm to evaluate the quality of all
proposed solutions to the problem in the current population. Hence; the fitness function is used as
a filter function to eliminate all non-candidate solutions. The fitness function used to verify the
solution is as follow:
The chromosome must contain all nodes of the network.
The chromosome must be a connected sub graph using Equation (8).
5.3. Genetic Crossover Operation
The crossover operation is used to breed a child from two parents by one cut point. The crossover
operation will perform if the crossover ratio (Pc=0.90) is verified. The cut point israndomly
selected. The crossover operation is performed as follows:
Randomly selecttwochromosomesfromthecurrentpopulation.
Randomlyselectthecutpoint
Fillthecomponentsofthechromosome
a. Bytakingthecomponentsofthefirstchromosome(fromthefirst genetothecut
point)andfill uptothechild.
b. Also, tacking the components of the second chromosome (from the cut point+1 to
the last gene) and fill up to the child.
9. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.1, January 2015
43
The offspring generated by crossover operation is shown in Figure 7.
Cut point
Parent 1 1 1 0 1 1 0 0 0 0 0 1 1
Child 1 1 1 0 1 1 0 1 0 1 0 1 0
1 0 1 0 0 1 0 1 0 1 0 1 0
Figure 7 Example of the crossover operation
5.4. Genetic Mutation Operation
The mutation operation is performed on bit-by-bit basis. In the proposed approach, the mutation
operation will be performed if the mutation ratio (Pm) is verified. The Pm in this approach is
chosen experimentally to be 0.02. The point to be mutated is selected randomly. The offspring
generated by mutation is shown in Figure 8.
1 1 1 0 1 1 0 1 0 0 0 1 0
1 1 1 0 1 1 1 1 0 0 0 1 0
Figure 8 Example of the mutation operation.
5.5. The Algorithm
The following pseudocodeillustrates the use of our assumptions and proposed functions to find
the minimum spanning tree.
Algorithm Find Minimum Spanning Tree
Input : Set the parameters: pop_size, max_gen, RC,RD, Pm,Pc
Output : Minimum Spanning Tree
1. Generatetheinitialpopulationaccording to the steps in Section5.1.
2. gen←1.
3. While(gen< =max_gen)do {
4. P ←1
5. While(P<=pop_size)do {
6. Geneticoperations
a. Obtainchromosomesofthe newpopulation.
b. Selecttwochromosomesfromthepopulationrandomly,
c. Applycrossoveraccordingto Pcparameter(Pc>=0.90),
10. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.1, January 2015
44
d. Mutatethe newchildaccordingtoPmparameter(Pm<=0.02),
e. Compute the fitness function according to section 5.2
f. If the result of fitness function is false then discard the child and go to step 6.b.
7. Computethe totalcostofthenewchild C(x)accordingtoEquation (1).
8. Find all the paths from the source node to all the nodes in the child (
9. Compute the delay of each path in the child ( according to Equation
(3).
10. Compute the maximum delay of the child ( according to Equation (4).
11. If the C(x)<=RC and then stop
12. Savethischildasa candidatesolution.
13. P← P+1.
14. }
15. Setgen=gen+ 1
16. if gen >max_gen then stop
17. }
6. EXPERIMENTAL RESULTS
The proposed algorithm is implemented using Borland C++ Ver. 5.5 and the initial values of the
parameters are: population size (pop-size=20), maximum generation (max-gen=250), Pc=0.90,
Pm=0.02. We have applied our proposed technique more than 20 cases from 4 nodes until 20
nodes. The technique reads the connection matrix of the given network and the cost and delay of
each link of that network. Then it generates the connection matrix, cost and delay of each link of
other networks. Two scenarios are used to test and validate the proposed technique. The
subsections below demonstrate that.
6.1. Scenario One
The algorithmwas applied on two cases of known data (read the connection matrix of the given
network, the cost and delay of each link). The first case is a network with 8 nodes and 13 links
and the second case is a network with 16 nodes and 28 links.
6.1.1. Case 1:
We consider the given network as shown in Figure 1 (8 nodes and 13 links), the connection
matrix as shown in Figure 2, and the cost and delay for each link are shown in Table 1.
Table 1 the cost and delay of the links
Link Cost Delay
1-2 16 1
1-3 12 2
1-6 28 3
2-3 15 3
2-4 22 1
3-5 10 2
11. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.1, January 2015
45
3-6 17 1
4-5 14 2
4-8 24 3
5-7 20 2
5-8 23 1
6-7 18 3
7-8 21 2
The required cost and delay of the minimum spanning tree are: RC<=110 and RD<=7.
1) Theminimumspanningtree of the first caseis shown in Figure 9.
Figure 9 The minimum spanning tree of the network with 8 nodes and 13 links.
2) All paths of the minimum spanning treeP(T(s),v) are shown in the Table 2.
Table 2 All the paths of the minimum spanning tree
No. P(T(s),v)
1 1 3 2 27 5
2 1 3 12 2
3 1 3 5 4 36 6
4 1 3 5 22 4
5 1 3 6 29 3
6 1 3 6 7 47 6
7 1 3 5 8 45 5
3) The cost and maximum delay of the minimum spanning tree are:
=109 and =6.
4) The path of maximum delay is shown in Figure 10.
12. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.1, January 2015
46
Figure 10 The path of maximum delay
6.1.2. Case 2
In this case, the algorithmwas applied on a network with 16 nodes and 28 links as shown in
Figure 11. The cost and delay for each link are shown in the Table 3.
Figure 111 A network with 16 nodes and 28 links
Table 3 the cost and delay of the links
# Link Cost Delay # Link Cost Delay
1 1-2 10 1 15 7-11 24 3
2 1-3 12 2 16 8-12 25 2
3 1-4 15 3 17 9-10 21 3
4 2-3 13 3 18 9-13 10 2
5 2-5 14 2 19 10-11 9 1
6 3-4 18 1 20 10-13 18 2
7 3-7 23 2 21 11-12 17 3
8 4-8 16 2 22 11-14 16 1
9 5-6 19 2 23 12-15 22 1
10 5-9 21 1 24 13-14 11 1
11 5-10 13 3 25 13-16 12 3
12 6-7 19 2 26 14-15 13 2
13 7-8 18 1 27 14-16 22 1
14 7-10 20 4 28 15-16 18 2
The required cost and delay of the case 2 are: (RC<=220 and RD<=15).
1) The minimum spanning tree is shown in Figure 12.
13. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.1, January 2015
47
Figure 12 The minimum spanning tree of the Figure 11
2) All the paths of the minimum spanning tree are sown in the Table 4
Table 4 All the paths of the minimum spanning tree
No. P(T(s),v)
1 1 2 10 1
2 1 2 3 23 4
3 1 4 15 3
4 1 2 5 24 3
5 1 2 5 6 43 5
6 1 2 5 6 7 62 7
7 1 4 8 31 11
8 1 2 5 10 11 14 13 9 85 6
9 1 2 5 10 37 6
10 1 2 5 10 11 48 7
11 1 4 8 12 56 7
12 1 2 5 10 11 14 13 75 9
13 1 2 5 10 11 14 45 6
14 1 2 5 10 11 14 15 58 8
15 1 2 5 10 11 14 13 16 87 12
1) The cost and maximum delay of the minimum spanning tree are:
=215 and =12.
2) The path of the maximum delay is shown in Figure 13
14. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.1, January 2015
48
Figure 13 The path of the maximum delay
6.2. Scenario Two
The system is applied on 6 other cases (networks of size 5, 7, 10, 12, 14, and 20 nodes). In these
cases the system generated the connection matrix, the cost and the delay for each link of the
generated cases. The following table shows the results of these cases:
Table 5 The results of the generated cases in Scenario Two
No. Nodes (T(s)) Max-Delay (T(s))
1 5 27 19 8
2 7 12 42 11
3 10 36 57 14
4 12 22 62 15
5 14 29 84 12
6 20 47 137 19
7. CONCLUSIONS
In this paper we presented a Genetic Algorithm (GA) to find the broadcast routing tree of a given
network in terms of its links such that the cost of the broadcast tree is minimized and the delay is
constrained. The algorithm used the connection matrix of a given network to find the spanning
trees, and also is based on the weight of the links to obtain the minimum broadcast routing tree.
The proposed GA is very useful and can be used in the large networks. The completeness and
correctness of the proposed algorithm have been tested. This has proven that our proposed
technique enabled us to obtain results faster, leading to save time and effort. In other words, the
use of GA has played a major role in reducing the search space generated by the problem. In
summary, our experimental results indicate that the algorithm is more efficiently than other
heuristics. To the best of our knowledge, the structure and design of our method is designed for
the first time to report a broadcast tree from a given network. This has made it very hard to find
common features with other previous methods for comparison reasons.
ACKNOWLEDGEMENTS
The authors would like to thank the anonymous IJCNC reviewers for their insightful
comments.This Project was funded by the Deanship of Scientific Research at the University of
Dammam, KSA.
15. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.1, January 2015
49
REFERENCES
[1] A. Tanenboum and D. Wetherall, Computer Networks, Cloth: Prentice Hall, 2010.
[2] N. Deo, Graph theory with application to engineering and computer science, Englewood Cliffs, NJ:
Prentice- Hall, 1974.
[3] H. Young, “A method for computing complex system reliability,” IEEE Transaction on Reliability,
vol. 21, no. 4, pp. 215-219, 1972.
[4] K. Aggarwal, “Reliability evaluation in computer communication networks,” IEEE Transaction on
Reliability, vol. 30, no. 1, pp. 32-35, 1981.
[5] R. Busacker, Finite graphs and networks: an introduction with applications, New York: McGraw-Hill,
1965.
[6] T. L. M. J. B. O. Ravindra K. Ahuja, Network Flows: Theory, Algorithms, and Applications, 1993.
[7] J. Joseph B. Kruskal, “On the shortest spanning subtree of a graph and the travelingsalesman
problem,” in Proceedings of the American Mathematical Society, 1956.
[8] A. Younes, “The spanning trees and computer networks reliability,” Egyptian informatics journa, vol.
7, no. 2, 2006.
[9] C. Chekuri, “ Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling,”
Lecture Notes in Computer Science, vol. 5757, pp. 444-455, 2009.
[10] N. Fard, “Spanning tree in all terminal network reliability expansion,” Computer Communications,
vol. 24, pp. 1348-1353, 2001.
[11] T. Yamada, “Heuristic and exact algorithms for the spanning tree detection problem,” Computer &
Operation Research, vol. 32, pp. 239-255, 2005.
[12] A. Kardan and M. Kajbaf, “Distributed Broadcast Minimum Spanning Tree,” in The 3rd International
Conference on Intelligent Sensors, Sensor Networks and Information, Melbourne, Qld, 2007.
[13] H. Salama, D. Reeves and Y. Viniotis, “The delay-constrained minimum spanning tree problem,” in
Proceedings of the Second IEEE Symposium on Computers and Communications, Alexandria, 1997.
[14] M. Angel, “Solving the Delay-Constrained Capacitated Minimum Spanning Tree Problem Using a
Dandelion-Encoded Evolutionary Algorithm,” Simulated Evolution and Learning, vol. 5361, pp. 151-
160, 2008.
[15] A. Younes, “Minimizing the broadcast routing in the computer networks,” International Journal of
Computer Engineering Science, vol. 2, no. 3, pp. 62-68, 2012.
[16] S. Sorour, E. S. R. Sr. and S. Valaee, “On Minimizing Broadcast Completion Delay for Instantly
Decodable Network Coding,” in IEEE International Conference on Communications, Cape Town,
2010.
[17] H. F. D. S. R. Salama and Y. Viniotis, “An Efficient Delay-Constrained Minimum Spanning Tree
Heuristic,” in Proceedings of the 5th International Conference on Computer Communications and
Networks, 1996.
[18] K. Y. Dalal, “A Distributed Algorithm for Constructing Minimal Spanning Trees,” IEEE Transaction
on Software Engineering, vol. 13, no. 3, pp. 398 - 405, 1987.
16. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.1, January 2015
50
Authors
Ahmed Younes Hamedreceived his PhD degree in Sept.1996 from South Valley University,
Egypt. His research interests include Artificial Intelligence and genetic algorithms; specifically
in the area of computer networks. Recently, he has started conducting a research in the area of
Image Processing. Currently, he works as an Associate Professor in University of Dammam,
KSA. Younes always publishes the outcome of his research in international journals and conferences.
Ghazi Al-Naymat received his PhD degree in May 2009 from the school of Information
Technologies at The University of Sydney, Australia. His research interests include data
mining and knowledge discovery; specifically in the area of spatial, spatio-temporal and time
series applications. Recently, he has started conducting a research in the area of Cloud
Computing and Big data analytics. Currently, he works as an Assistant Professor in
University of Dammam, KSA. Al-Naymat always publishes the outcome of his research in international
journals and conferences.