This document proposes a cross-layered model for congestion prediction and management in mobile ad hoc networks that aims to efficiently distribute network resources. The model incorporates two algorithms: Group-level Congestion Prediction (GCP) that predicts congestion levels at relay nodes with high accuracy, and Group-level Egress Permanence (GEP) that works sequentially with GCP for congestion detection and management. The document discusses related work on multicast routing protocols and energy-efficient multicasting. It then describes the proposed congestion control mechanism under constrained energy utilization and outlines the proposed model with relevant notations before focusing on the GCP and GEP algorithms.
ENERGY EFFICIENT MULTICAST ROUTING IN MANET ijac journal
In this paper, we have presented the Modified Multicasting through Time Reservation using Adaptive
Control for Excellent Energy efficiency (MMC-TRACE). It is a real time multicasting architecture for
Mobile Ad-Hoc networks to make their work an energy efficient one .MMC-TRACE is a cross layer design
where the network layer and medium access control layer functionality are done in a single integrated
layer design. The basic design of the architecture is to establish and maintain an active multicast tree
surrounded by a passive mesh within a mobile ad hoc network. Energy efficiency is maximized by enabling
the particular node from sleep to awake mode while the remaining nodes of the same path are maintained
at sleep mode. Energy efficiency too achieved by eliminating most of the redundant data receptions across
nodes. The performance of MMC-TRACE are evaluated with the help of ns-2 simulations and comparisons
are made with its predecessor such as MC-TRACE. The results show that the MMC-TRACE provides
superior energy efficiency, competitive QoS performance and bandwidth efficiency.
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
Improvement at Network Planning using Heuristic Algorithm to Minimize Cost of...Yayah Zakaria
Wireless Mesh Networks (WMN) consists of wireless stations that are connected with each other in a semi-static configuration. Depending on the configuration of a WMN, different paths between nodes offer different levels of efficiency. One areas of research with regard to WMN is cost minimization. A Modified Binary Particle Swarm Optimization (MBPSO) approach was used to optimize cost. However, minimized cost does not
guarantee network performance. This paper thus, modified the minimization function to take into consideration the distance between the different nodes so as to enable better performance while maintaining cost balance. The results were positive with the PDR showing an approximate increase of 17.83% whereas the E2E delay saw an approximate decrease of 8.33%.
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...graphhoc
There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and connectivity aware constraints. Cluster head selection is proposed using adaptive learning in neural networks followed by coverage and connectivity aware routing with data transmission. The proposed scheme is compared with existing schemes with respect to the parameters such as number of alive nodes, packet delivery fraction, and node residual energy. The simulation results show that the proposed scheme can be used in wide area of applications in WSNs.
Performance Analysis for Parallel MRA in Heterogeneous Wireless NetworksEditor IJCATR
This paper analysis a different methods to find optimal path for services and power allocation to heterogeneous wireless network. Under heterogeneous wireless networks, a user can send data through a single or multi RATs (Radio Access Technology) simultaneously. The objective of this paper is to choose the optimal path for the services and power allocation to that bandwidth (BW) distributed joint allocation algorithm using Newton and modified Newton are adopted and the total system capacity compared. The analysis is done in Matlab and simulation results are compared. The numerical result shows that compare to Newton method, modified Newton method maximize the total system capacity.
ENERGY EFFICIENT MULTICAST ROUTING IN MANET ijac journal
In this paper, we have presented the Modified Multicasting through Time Reservation using Adaptive
Control for Excellent Energy efficiency (MMC-TRACE). It is a real time multicasting architecture for
Mobile Ad-Hoc networks to make their work an energy efficient one .MMC-TRACE is a cross layer design
where the network layer and medium access control layer functionality are done in a single integrated
layer design. The basic design of the architecture is to establish and maintain an active multicast tree
surrounded by a passive mesh within a mobile ad hoc network. Energy efficiency is maximized by enabling
the particular node from sleep to awake mode while the remaining nodes of the same path are maintained
at sleep mode. Energy efficiency too achieved by eliminating most of the redundant data receptions across
nodes. The performance of MMC-TRACE are evaluated with the help of ns-2 simulations and comparisons
are made with its predecessor such as MC-TRACE. The results show that the MMC-TRACE provides
superior energy efficiency, competitive QoS performance and bandwidth efficiency.
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
Improvement at Network Planning using Heuristic Algorithm to Minimize Cost of...Yayah Zakaria
Wireless Mesh Networks (WMN) consists of wireless stations that are connected with each other in a semi-static configuration. Depending on the configuration of a WMN, different paths between nodes offer different levels of efficiency. One areas of research with regard to WMN is cost minimization. A Modified Binary Particle Swarm Optimization (MBPSO) approach was used to optimize cost. However, minimized cost does not
guarantee network performance. This paper thus, modified the minimization function to take into consideration the distance between the different nodes so as to enable better performance while maintaining cost balance. The results were positive with the PDR showing an approximate increase of 17.83% whereas the E2E delay saw an approximate decrease of 8.33%.
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...graphhoc
There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and connectivity aware constraints. Cluster head selection is proposed using adaptive learning in neural networks followed by coverage and connectivity aware routing with data transmission. The proposed scheme is compared with existing schemes with respect to the parameters such as number of alive nodes, packet delivery fraction, and node residual energy. The simulation results show that the proposed scheme can be used in wide area of applications in WSNs.
Performance Analysis for Parallel MRA in Heterogeneous Wireless NetworksEditor IJCATR
This paper analysis a different methods to find optimal path for services and power allocation to heterogeneous wireless network. Under heterogeneous wireless networks, a user can send data through a single or multi RATs (Radio Access Technology) simultaneously. The objective of this paper is to choose the optimal path for the services and power allocation to that bandwidth (BW) distributed joint allocation algorithm using Newton and modified Newton are adopted and the total system capacity compared. The analysis is done in Matlab and simulation results are compared. The numerical result shows that compare to Newton method, modified Newton method maximize the total system capacity.
MESSAGE ROUTING IN WIRELESS AND MOBILE NETWORKS USING TDMA TECHNOLOGYijwmn
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellite, cell phone as well as other wireless or mobile networks. Most 2G
cellular systems as well as some 3G are TDMA based. In order to transmit data in such systems we need
to cluster them in packages. To achieve a faster transmission we are allowed to preempt the transmission of
any packet in order to resume at a later time. Preemption can be used to reduce idleness of some stations.
Such preemptions though come with a reconfiguration cost in order to setup for the next transmission. In
this paper we propose two algorithms which yield improved transmission scheduling. These two algorithms
we call MGA and IMGA (Improved MGA). We have proven an approximation ratio for MGA and ran
experiments to establish that it works even better in practice. In order to conclude that MGA will be a very
helpful tool in constructing an improved schedule for packet routing using preemtion with a setup cost, we
compare its results to two other efficient algorithms designed by researchers in the past: A-PBS(d+1) and
GWA. To establish the efficiency of IMGA we ran experiments in comparison to MGA as well as APBS(d+1)
and GWA. IMGA has proven to produce the most efficient schedule on all counts.
A new clustering technique based on replication for MANET routing protocolsTELKOMNIKA JOURNAL
The cluster head nodes in most mobile ad hoc networks (MANET) clustering protocols take on an extraordinary role in managing routing information. The reliability, efficiency and scalability of the clustering in MANET will ultimately be dramatically impacted. In this work we establish a new approach to form the clusters in MANET called the square cluster-based routing protocol (SCBRP). That protocol is based on the theory of replication. The goal of the protocol is to achieve reliability, availability and scalability with in the MANET. The proposed protocol is evaluated by caring the performance analysis using the NS-3 simulator. The performance shows 50% improvementin data delivering ratio in large network size, also shows an improvement in network stability and availability which is reflected in energy consumption measurements and increase in the system lifetime to 20%.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
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.
Ieee transactions 2018 on wireless communications Title and Abstracttsysglobalsolutions
Final year BE, B.Tech, ME, M.Tech projects along with our professionals for developing Real Time Applications in Emerging Technologies.
We can support to your final year projects in all domains with latest technologies and simulation tool like NS2, NS3, Glomosim, Opnet, Matlab, IDL, Sumo, Gridsim, Bonita tool & Cloud deployments (Cloudsim, Google App Engine, Amazon Deployment, and Real time Cloud Deployment)also we are support for JOURNAL and CONFERENCE Preparation.
?
TSYS Research and Development.
20/9 Sardar Patel Road, Janaki Complex,
4th Floor, Adyar, Chennai - 20?
Tel : 91 44 42607879, 98411 03123.
Website : http://www.tsysglobalsolutions.com/
http://tsysphdsupport.com/
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
Mobile elements scheduling for periodic sensor applicationsijwmn
In this paper, we investigate the problem of designing the mobile elements tours such that the length of each tour is below a per-determined length and the depth of the multi-hop routing trees bounded by k. The path of the mobile element is designed to visit subset of the nodes (cache points). These cache points store other nodes data. To address this problem, we propose two heuristic-based solutions. Our solutions take into consideration the distribution of the nodes during the establishment of the tour. The results of our experiments indicate that our schemes significantly outperforms the best comparable scheme in the literature.
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).
ENERGY-EFFICIENT MULTI-HOP ROUTING WITH UNEQUAL CLUSTERING APPROACH FOR WIREL...IJCNCJournal
The development of an energy-efficient routing protocol, capable of extending the life of the network, is one of the main constraints of wireless sensor networks (WSN). Research studies on WSN routing prove that clustering offers an effective approach to prolong the lifetime of a WSN, particularly when it is combined with multi-hop communication that can reduces energy costs by minimizing the distance between transmitter and receiver. Most clustering algorithms using multi-hop in data transmission encounter the hotspot problem. In this work, an Energy-efficient Multi-hop routing with Unequal Clustering approach (EMUC) is proposed, to create clusters of different sizes, which depend on the distance between the sensor node and the base station. Equilibrate the energy dissipation between the cluster heads is the purpose of this approach by adopting multi-hop communication to relay data to the base station. The implementation of multi-hop mode to transmit data to the base station reduces the energy cost of transmission over long distances. The effectiveness of this approach is validated through performed simulations, which prove that EMUC balances energy consumption between sensor nodes, mitigates the hotspots problem, saves more energy and significantly extends the network lifetime.
To increase the network capacity, there is
need to minimize the interference among nodes and
optimum control of topology in the foundation of
network. Recently, technological development helps to
build of mobile ad-hoc networks (MANETs) in order to
improve the quality of service (QoS) in terms of delay. In
contradictory to the objective of minimizing interference,
it is important to concern topology control in delay
constrained environment. The present research work
attempts to control the delay-constrained topology with
jointly considering delay and interference concept.
Additionally, the study proposed an interference oriented
topology control algorithm for delay-constrained
MANETs by taking account of both the interference
constraint and the delay constraint under the specific
condition of transmission delay, contention delay and the
queuing delay. Further, the study investigated the impact
of node mobility on the interference oriented topology
control algorithm. Finally, the results of the present
study shows that the proposed algorithm controls the
topology to convince the interference constraint, and
increases the transmit range to congregate the delay
requirement. Also, the study conclude that the algorithm
could effectively reduce the delay protocol and improve
the performance effectively in delay-constrained mobile
ad hoc networks.
A comparative analysis on qos multicast routing protocols in MANETsIOSR Journals
Abstract: Simultaneous transmission of data from one sender to multiple receivers is called multicasting.
Several widely used applications require multicasting at least at the logical level. Examples include audio video
teleconferencing, real time video streaming and the maintenance of distributed databases. In many cases it is
advantageous to implement multicasting at the level of the routing algorithm (other approaches would be oneto-all
unicast or the implementation of multicasting at the application layer). In this paper we are presenting a
comparative analysis on various multicast routing protocols in adhoc networks.
Keywords: multicasting, multicast protocols,dynamic core, performance evaluation,Qos Parameters
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
MESSAGE ROUTING IN WIRELESS AND MOBILE NETWORKS USING TDMA TECHNOLOGYijwmn
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellite, cell phone as well as other wireless or mobile networks. Most 2G
cellular systems as well as some 3G are TDMA based. In order to transmit data in such systems we need
to cluster them in packages. To achieve a faster transmission we are allowed to preempt the transmission of
any packet in order to resume at a later time. Preemption can be used to reduce idleness of some stations.
Such preemptions though come with a reconfiguration cost in order to setup for the next transmission. In
this paper we propose two algorithms which yield improved transmission scheduling. These two algorithms
we call MGA and IMGA (Improved MGA). We have proven an approximation ratio for MGA and ran
experiments to establish that it works even better in practice. In order to conclude that MGA will be a very
helpful tool in constructing an improved schedule for packet routing using preemtion with a setup cost, we
compare its results to two other efficient algorithms designed by researchers in the past: A-PBS(d+1) and
GWA. To establish the efficiency of IMGA we ran experiments in comparison to MGA as well as APBS(d+1)
and GWA. IMGA has proven to produce the most efficient schedule on all counts.
A new clustering technique based on replication for MANET routing protocolsTELKOMNIKA JOURNAL
The cluster head nodes in most mobile ad hoc networks (MANET) clustering protocols take on an extraordinary role in managing routing information. The reliability, efficiency and scalability of the clustering in MANET will ultimately be dramatically impacted. In this work we establish a new approach to form the clusters in MANET called the square cluster-based routing protocol (SCBRP). That protocol is based on the theory of replication. The goal of the protocol is to achieve reliability, availability and scalability with in the MANET. The proposed protocol is evaluated by caring the performance analysis using the NS-3 simulator. The performance shows 50% improvementin data delivering ratio in large network size, also shows an improvement in network stability and availability which is reflected in energy consumption measurements and increase in the system lifetime to 20%.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
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.
Ieee transactions 2018 on wireless communications Title and Abstracttsysglobalsolutions
Final year BE, B.Tech, ME, M.Tech projects along with our professionals for developing Real Time Applications in Emerging Technologies.
We can support to your final year projects in all domains with latest technologies and simulation tool like NS2, NS3, Glomosim, Opnet, Matlab, IDL, Sumo, Gridsim, Bonita tool & Cloud deployments (Cloudsim, Google App Engine, Amazon Deployment, and Real time Cloud Deployment)also we are support for JOURNAL and CONFERENCE Preparation.
?
TSYS Research and Development.
20/9 Sardar Patel Road, Janaki Complex,
4th Floor, Adyar, Chennai - 20?
Tel : 91 44 42607879, 98411 03123.
Website : http://www.tsysglobalsolutions.com/
http://tsysphdsupport.com/
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
Mobile elements scheduling for periodic sensor applicationsijwmn
In this paper, we investigate the problem of designing the mobile elements tours such that the length of each tour is below a per-determined length and the depth of the multi-hop routing trees bounded by k. The path of the mobile element is designed to visit subset of the nodes (cache points). These cache points store other nodes data. To address this problem, we propose two heuristic-based solutions. Our solutions take into consideration the distribution of the nodes during the establishment of the tour. The results of our experiments indicate that our schemes significantly outperforms the best comparable scheme in the literature.
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).
ENERGY-EFFICIENT MULTI-HOP ROUTING WITH UNEQUAL CLUSTERING APPROACH FOR WIREL...IJCNCJournal
The development of an energy-efficient routing protocol, capable of extending the life of the network, is one of the main constraints of wireless sensor networks (WSN). Research studies on WSN routing prove that clustering offers an effective approach to prolong the lifetime of a WSN, particularly when it is combined with multi-hop communication that can reduces energy costs by minimizing the distance between transmitter and receiver. Most clustering algorithms using multi-hop in data transmission encounter the hotspot problem. In this work, an Energy-efficient Multi-hop routing with Unequal Clustering approach (EMUC) is proposed, to create clusters of different sizes, which depend on the distance between the sensor node and the base station. Equilibrate the energy dissipation between the cluster heads is the purpose of this approach by adopting multi-hop communication to relay data to the base station. The implementation of multi-hop mode to transmit data to the base station reduces the energy cost of transmission over long distances. The effectiveness of this approach is validated through performed simulations, which prove that EMUC balances energy consumption between sensor nodes, mitigates the hotspots problem, saves more energy and significantly extends the network lifetime.
To increase the network capacity, there is
need to minimize the interference among nodes and
optimum control of topology in the foundation of
network. Recently, technological development helps to
build of mobile ad-hoc networks (MANETs) in order to
improve the quality of service (QoS) in terms of delay. In
contradictory to the objective of minimizing interference,
it is important to concern topology control in delay
constrained environment. The present research work
attempts to control the delay-constrained topology with
jointly considering delay and interference concept.
Additionally, the study proposed an interference oriented
topology control algorithm for delay-constrained
MANETs by taking account of both the interference
constraint and the delay constraint under the specific
condition of transmission delay, contention delay and the
queuing delay. Further, the study investigated the impact
of node mobility on the interference oriented topology
control algorithm. Finally, the results of the present
study shows that the proposed algorithm controls the
topology to convince the interference constraint, and
increases the transmit range to congregate the delay
requirement. Also, the study conclude that the algorithm
could effectively reduce the delay protocol and improve
the performance effectively in delay-constrained mobile
ad hoc networks.
A comparative analysis on qos multicast routing protocols in MANETsIOSR Journals
Abstract: Simultaneous transmission of data from one sender to multiple receivers is called multicasting.
Several widely used applications require multicasting at least at the logical level. Examples include audio video
teleconferencing, real time video streaming and the maintenance of distributed databases. In many cases it is
advantageous to implement multicasting at the level of the routing algorithm (other approaches would be oneto-all
unicast or the implementation of multicasting at the application layer). In this paper we are presenting a
comparative analysis on various multicast routing protocols in adhoc networks.
Keywords: multicasting, multicast protocols,dynamic core, performance evaluation,Qos Parameters
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
IOSR Journal of Electrical and Electronics Engineering(IOSR-JEEE) is an open access international journal that provides rapid publication (within a month) of articles in all areas of electrical and electronics engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electrical and electronics engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
This is the ultimate Tattoos Designs Gallery, giving you the following information:
- The history of tattoos - including the origin of tattoos
- Info on tattoo aftercare and tattoo health risks
- An introduction to different types of tattoo, and a large example tattoo designs gallery
IOSR Journal of Applied Physics (IOSR-JAP) is an open access international journal that provides rapid publication (within a month) of articles in all areas of physics and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in applied physics. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
IOSR Journal of Applied Chemistry (IOSR-JAC) is an open access international journal that provides rapid publication (within a month) of articles in all areas of applied chemistry and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in Chemical Science. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
IOSR Journal of Humanities and Social Science is an International Journal edited by International Organization of Scientific Research (IOSR).The Journal provides a common forum where all aspects of humanities and social sciences are presented. IOSR-JHSS publishes original papers, review papers, conceptual framework, analytical and simulation models, case studies, empirical research, technical notes etc.
Image Processing for Automated Flaw Detection and CMYK model for Color Image ...
Similar to Multicast Routing Protocol with Group-Level Congestion Prediction and Permanence under Constrained Energy Utilization for Mobile Ad Hoc Networks
A Professional QoS Provisioning in the Intra Cluster Packet Level Resource Al...GiselleginaGloria
Wireless mesh networking has transpired as a gifted technology for potential broadband wireless access. In a communication network, wireless mesh network plays a vital role in transmission and are structured in a mesh topology. The coordination of mesh routers and mesh clients forms the wireless mesh networks which are routed through the gateways. Wireless mesh networks uses IEEE 802.11 standards and has its wide applications broadband home networking and enterprise networking deployment such as Microsoft wireless mesh and MIT etc. A professional Qos provisioning in intra cluster packet level resource allocation for WMN approach takes power allocation, sub carrier allocation and packet scheduling. This approach combines the merits of a Karush-Kuhn-Tucker (KKT) algorithm and a genetic algorithm (GA) based approach. The KKT algorithm uses uniform power allocation over all the subcarriers, based on the optimal allocation criterion. The genetic algorithm is used to generate useful solutions to optimization and search problems and it is also used for search problems. By combining the intrinsic worth of both the approaches, it facilitates effective QOS provisioning at the packet level. It is concluded that, this approach achieves a preferred stability between system implementation and computational convolution.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and
packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which
ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer
from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of
sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads
in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption
and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer
and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers
reduces the energy consumption and increases the throughput of the wireless sensor networks.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and
packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which
ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer
from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of
sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads
in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption
and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer
and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers
reduces the energy consumption and increases the throughput of the wireless sensor networks.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
GPS Enabled Energy Efficient Routing for ManetCSCJournals
In this paper, we propose an energy aware reactive approach by introducing energy and distance based threshold criteria. Cross Layer interaction is exploited the performance of physical layer which leads to significant improvement in the energy efficiency of a network.
AN OPTIMUM ENERGY CONSUMPTION HYBRID ALGORITHM FOR XLN STRATEGIC DESIGN IN WSN’SIJCNCJournal
In this paper, X-Layer protocol is originated which executes mobility error prediction (MEP) algorithm to calculate the remaining energy level of each node. This X-Layer protocol structure employs the mobility aware protocol that senses the mobility concerned to each node with the utilization of Ad-hoc On-Demand Distance Vector (AODV), which shares the information or data specific to the distance among individual nodes. With the help of this theory, the neighbour list will be updated only to those nodes which are mobile resulting in less energy consumption when compared to all (static/mobile) other nodes in the network. Apart from the MEP algorithm, clustering head (CH) election algorithm has also been specified to identify the relevant clusters whether they exists within the network region or not. Also clustering multi-hop routing (CMHR) algorithm was implemented in which the node can identify the cluster to which it belongs depending upon the distance from each cluster surrounding the node. Finally comprising the AODV routing protocol with the Two-Ray Ground method, we implement X-Layer protocol structure by considering MAC protocol in accordance to IEEE 802.15.4 to obtain the best results in energy consumption and also by reducing the energy wastage with respect to each node. The effective results had been illustrated through Network Simulator-II platform.
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.
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
Improving Power Efficiency in Cooperative Diversity and MIMO Systems by Using...IJERA Editor
In this paper, we propose a new simple relaying strategy based on bit-interleaved convolutionally coded starquadrature amplitude modulation (QAM) along with coherent/ noncoherent detection. Exploiting this property, a hard limiter is used to enhance power amplifier (PA) efficiency at the relay. Here we are using the higher order modulation for improving relay communication, and also employ the accurate relay technique. Moreover, we show that the proposed approach retains differential detectability, which results in a significant reduction of receiver complexity with robustness against phase ambiguity, by analyzing our proposed method in terms of asymptotic pairwise error probability (PEP), Furthermore, the effectiveness of the proposed scheme in terms of PA efficiency is confirmed by comparing the statistical distributions of the corresponding instantaneous signal power. And also implement the PEP in MIMO systems for improving the powerefficiency. All the theoretical results agree with those obtained by computer simulations.
M-EPAR to Improve the Quality of the MANETsIJERA Editor
In MANET, power aware is important challenge issue to improve the communication energy efficiency at individual nodes. We propose modified efficient power aware routing (M-EPAR), a new power aware routing protocol that increases the network lifetime of MANET. Designing a power aware routing algorithm or technique is one of the most important point considered in Mobile Ad Hoc Networks. These nodes are driven by reactive protocols where broadcasting is mandatory to form a path between two nodes. So in case of death of the node resulting out of less battery calls for re-routing. Since many existing techniques focuses on energy aware routing this paper presents combination of energy aware routing merged with link quality determined by packet drop rate. The proposed scheme has outperformed the existing technique in terms of packet delivery ratio, throughput and energy consumption.
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
CFMS: A CLUSTER-BASED CONVERGECAST FRAMEWORK FOR DENSE MULTI-SINK WIRELESS SE...ijwmn
Convergecast is one of the most challenging tasks in Wireless Sensor Networks (WSNs). Indeed, this data
collection process must be conducted while copying with packet collisions, nodes’ congestion or data
redundancy. These issues always result in energy waste which is detrimental to network efficiency and
lifetime. This paper is aimed to address these problems in large-scale multi-sink WSNs. Inspired by our
previous work MSCP, we designed a lightweight protocol stack that seamlessly combines clustering, pathvector routing, sinks’ duty cycling, data aggregation and transmission scheduling in order to minimise
message overhead and packet losses. Simulation results show that this solution can mitigate delay while
significantly increasing packet delivery and network lifetime.
CFMS: A CLUSTER-BASED CONVERGECAST FRAMEWORK FOR DENSE MULTI-SINK WIRELESS SE...ijwmn
Convergecast is one of the most challenging tasks in Wireless Sensor Networks (WSNs). Indeed, this data
collection process must be conducted while copying with packet collisions, nodes’ congestion or data
redundancy. These issues always result in energy waste which is detrimental to network efficiency and
lifetime. This paper is aimed to address these problems in large-scale multi-sink WSNs. Inspired by our
previous work MSCP, we designed a lightweight protocol stack that seamlessly combines clustering, pathvector routing, sinks’ duty cycling, data aggregation and transmission scheduling in order to minimise
message overhead and packet losses. Simulation results show that this solution can mitigate delay while
significantly increasing packet delivery and network lifetime.
CFMS: A Cluster-based Convergecast Framework for Dense Multi-Sink Wireless Se...ijwmn
Convergecast is one of the most challenging tasks in Wireless Sensor Networks (WSNs). Indeed, this data
collection process must be conducted while copying with packet collisions, nodes’ congestion or data
redundancy. These issues always result in energy waste which is detrimental to network efficiency and
lifetime. This paper is aimed to address these problems in large-scale multi-sink WSNs. Inspired by our
previous work MSCP, we designed a lightweight protocol stack that seamlessly combines clustering, pathvector routing, sinks’ duty cycling, data aggregation and transmission scheduling in order to minimise
message overhead and packet losses. Simulation results show that this solution can mitigate delay while
significantly increasing packet delivery and network lifetime.
Improving the network lifetime of mane ts through cooperative mac protocol de...Pvrtechnologies Nellore
Improving the network lifetime of mane ts through cooperative mac protocol design
Similar to Multicast Routing Protocol with Group-Level Congestion Prediction and Permanence under Constrained Energy Utilization for Mobile Ad Hoc Networks (20)
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
"Impact of front-end architecture on development cost", Viktor TurskyiFwdays
I have heard many times that architecture is not important for the front-end. Also, many times I have seen how developers implement features on the front-end just following the standard rules for a framework and think that this is enough to successfully launch the project, and then the project fails. How to prevent this and what approach to choose? I have launched dozens of complex projects and during the talk we will analyze which approaches have worked for me and which have not.
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.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Leading Change strategies and insights for effective change management pdf 1.pdf
Multicast Routing Protocol with Group-Level Congestion Prediction and Permanence under Constrained Energy Utilization for Mobile Ad Hoc Networks
1. IOSR Journal of Computer Engineering (IOSRJCE)
ISSN: 2278-0661, ISBN: 2278-8727 Volume 6, Issue 3 (Sep-Oct. 2012), PP 42-51
www.iosrjournals.org
www.iosrjournals.org 42 | Page
Multicast Routing Protocol with Group-Level Congestion
Prediction and Permanence under Constrained Energy
Utilization for Mobile Ad Hoc Networks
K.Himabindu1
, R.Sumalatha2
1
(MTech. Student, Department of Cs/IT, Srichaitanya College of Engineering, Karimnagar, AP, India)
2
(Senior Assistant Professor, Department of Cs/IT, Srichaitanya College of Engineering, Karimnagar, AP,
India)
Abstract: Here during this document A MAC layer stage overloading detection system has been foreseeable.
The planned model aims to share out associate degree energy competent mechanism to calculate the degree of
congestion at victim node with maximal accuracy. This block detection tool is incorporated with a sequence
Crosslayered obstruction management Routing Topology. The projected model involves hard of congestion in 2
steps with effectual energy capable congestion detection and most favorable consumption of possessions. Packet
loss in network routing is principally because of link failure and congestion. Most of the procurable congestion
manages solutions don't have the flexibility to differentiate between packet loss owing to association collapse
and packet loss unpaid to congestion. As a consequence these explanations aim towards exploiting against
packet drop owing to link breaks down that could be a redundant endeavor and may turn out in defeat of
resources. The opposite aspect within the majority of the simple to urge to resolve is that the consumption of
power and resources to tell the apart jamming state, the amount of congestion and alert the premise node
concerning congestion in routing path. Here during this document we tend to propose a cross lined model of
congestion recognition and manage mechanism that contain power economical congestion discovery, Group-
level Congestion Prediction (GCP) and Group-level Egress Permanence(GEP) algorithms that could work in
sequence for congestion detection and manage model. This paper includes explorations and simulation results
that demonstrate the increased store consumption, power potency in congestion discovery and congestion
management is probable by the projected topology.
Keywords: quality of service, cross-layer protocols, multimedia communication, Low-power design, multicast
routing
I. Introduction
The primary aim of a multicast topology is to transmit packets from a source node to the associates of a
multicast group by means of a suitable quality of service (QoS) [2], [3]. QoS is the performance level of a
service offered by the network, in general [1]. Specifically, QoS requires to maintain a high adequate packet
delivery ratio (PDR), maintain the low packet drop and diminish the jitter in packet arrival times. Thus, the
objective in QoS provisioning is to attain a further advanced network [1].
In fact, flooding, which is the easiest group message algorithm, is fine to attain elevated PDR subjected to the
data transfer and(or) node density is not excessive in order that the network is not crammed. Conversely,
flooding usually is not favored as a multicast routing topology because of its extreme make use of the obtainable
bandwidth.
Therefore, the second aim of a multicast routing topology is to make use of the bandwidth competently,
which is directly connected with the amount of repeated relay transmissions required to carry data packets to all
associate nodes of a multicast group with an adequate PDR. The third aim of a multicast topology is to diminish
the energy indulgence of the network.
Even though balancing the process of a wireless communication system by incorporating cross-layer
design is a tempting choice, quite a lot of research work attempted to claim that such a cross-layer proposal is
not the best option in the elongated usage since it may give up modularity and can lead to accidental cross-layer
communications [6], [19]. Yet, by severely sticking on to a usual layering model, we may fail to notice on
performance developments that be able to obtain in the course of the utilization of the less constrained cross-
layer design gap [19], [20], [21]. Consequently, in this paper, we put forward a multicasting model based on
cross-layer design while working out the extreme concern to ignore accidental cross layer communications.
Even though there are a lot of multicasting topologies for MANETs [4], [5], [7], [8], [9], it is clear from the
most frequently cited literature, no topology is addressing together of QoS, spatial reuse efficiency, and overall
energy indulgence. In this regard, here we propose a Multicast ad hoc routing that controls the congestion
through a cross layered model that is based on the hierarchical egress normalizing approach.
2. Multicast Routing Protocol With Group-Level Congestion Predection And Permanence Under
www.iosrjournals.org 43 | Page
The paper is organized in various sections as follows: In section 2 we discuss the developments in multicast
routing protocols for MANETs. In Section 3 we discuss the proposed congestion control under constrained
energy utilization for multicast routing. In section 4 we describe the proposed model with requisite notations. In
section 5 we give the model for Group level Congestion Prediction, and in section 6 we present the Group level
Egress Permanence algorithm. Finally, we conclude with simulations and discussion of results in section 7.
II. Related Work
There are numerous multicast routing protocols intended for mobile ad hoc networks [8], [13], [15],
[24], [29], and they can be classified into two extensive groups [13]: tree-based and mesh-based topologies.
Tree-based topologies generate trees starting at the source node and coming to an end at multicast group
associates by means of an intention of diminishing a cost utility. A multicast topology for ad hoc wireless
networks (AMRIS) [4] builds a common distributed tree fixed at one of the nodes, with IDs rising as they give
off from the starting node. Intra route renovation is made potential owed to this feature of the IDs, thus,
reducing the route finding time and as well as controlling route restoring operating cost to the immediacy of the
link breakdown.
Mesh-based multicasting is best suited to extremely dynamic topologies, merely owing to the
redundancy related to this approach [5], [7]. In mesh-based approaches, there's over one path between the
supply and also the multicast cluster members (i.e., a redundant multicast tree). One such mesh-based multicast
topology, On-Demand Multicast Routing Protocol (ODMRP) [5], relies on periodic flooding of the network by
the supply node through management packets to make a multicast mesh. This basic operation is employed each
to make the initial multicast forwarding state and to take care of the mesh just in case of node quality and
alternative network dynamics.
In ODMRP, an energetic supply sporadically floods the network with be a part of query management
packets. once a node receives a be a query packet, it marks the primary node it receives the packet from as the
upstream node it rebroadcasts the query packet. once a multicast cluster member receives a be a part of question
packet, it replies back with a be a part of REPLY packet, that is forwarded back to the supply node via
traversing the reverse path. every upstream node sets a forwarding flag for the multicast group indicated within
the packet header and becomes a member of the multicast mesh. The forwarding state expires after a planned
time.
A wealth of studies on energy-efficient multicasting in ad hoc networks can be found in [8], [29]. In
[9], the matter of building a minimum energy multicast tree (i.e., specified the entire transmission power
consumption within the multicast tree is minimized) for a given set of multicast nodes inside an ad hoc network
is investigated. Since the matter is NP-complete, an approximation algorithmic program with demonstrable
approximation assurance is proposed. An energy efficient multicasting algorithmic program for wireless
networks with fastened transmit power nodes is given in [25]. In [26], a passive clusturing algorithmic program,
that considers stability as well as residual energy of neighbouring nodes when choosing cluster heads and
gateways, is proposed. This algorithmic considerably reduces routing-related control overhead. This model
focuses on multicast services in wireless LANs. In [27], an approximation algorithmic with definite
approximation ratios for decreasing the total energy consumption of treebased all-to-all multicasting in wireless
ad hoc networks is devised. In [28], a self-managing, energy-efficient multicast routing suite based on the self-
stabilization paradigm is proposed. However, the energy dissipation models employed in these studies include
transmit and/or receive energy dissipation terms, whereas this could be a good approximation for some radios,
there are other energy dissipation modes (i.e., idle, carrier sense, and sleep modes) for several current radios
[14]. Hence, all the energy dissipation sources should be considered when constructing a multicasting protocol.
III. Congestion Control Under Constrained Energy Resource Utilization For Multicast
Routing
3.1 Congestion prediction under constrained energy utilization mechanism
The aim of the proposed congestion detection machine is to capture the degree of overcrowding at
relay hop level node with top precision. In the present model, the detection mechanisms are decoupled from
different activities of the mackintosh stratum like link consistency analysis and protect size analysis. The
acknowledgment model extended to note the congestion at traffic level, which depends on the number of
congestion levels at the relay hop level node.
3.1.1 Measuring degree of jamming of the Relay hop level node:
Unlike traditional networks, nodes within the ad hoc set-up exhibit a higher degree of non uniformity in
terms of each hardware and package configurations. The non uniformity of the die hop nodes will reflect as
numerous radio vary, limit retransmission add up, and barrier capability. Thus the degree of channel loading,
3. Multicast Routing Protocol With Group-Level Congestion Predection And Permanence Under
www.iosrjournals.org 44 | Page
packet drop rate, and therefore the quantity of buffer utilization at the relay hop height node may be a least
combination to search out the degree of obstruction. The usage of those 3 determined values supports to
decouple the obstructive live development from further Mac layer behavior.
The level of channel load, packet drop rate and level of buffer method collectively offer a scope to
imagine the overcrowding, causing unfortunate magnitude relation between crash and retransmission count up.
Once retransmissions peculiar to crash rate are significantly low, then resolution delay of die hop node can
augment proportionately, that escort to obstructive and replicate as blockage attributable to safeguard run over.
3.1.2 Measuring degree of congestion at path level traffic
The scale of congestion at each neighbor hop helps to form the extent of obstruction at path level
transfer from supply to target node. Each relay hop level node takes delivery of the degree of overcrowding
from its entry point. Since the explanation node, that is the last node of the direction-finding path doesn't reply,
the target node initiates to assess the quantity of overcrowding at path level traffic. The periodic updates of
overcrowding position at every corresponding hop height node to its successor in direction-finding path are
notably energy overwhelming activity. Hence to avoid wasting the energy, the interference update approach
decide 2 restricted actions as follows:
1. Amount of blocking ( )c id h at go by on the jump phase node ih will be sent to its heir 1ih if the „ ( )c id h ‟ is
larger than the node height obstacle threshold ( )cd . So the power protect due to restrictive transmission.
2. If the extent of jamming at the corridor altitude interchange ( )cd rp that traditional by nodule ih from its
entrance inventor 1ih is lesser than ( )c id h then it inform the ( )cd rp else it remnants same, hence force
conserve due to prevention of ( )cd rp inform.
IV. Congestion Prediction And Permanence Under Constrained Energy Utilization
Mechanism
The packet dropping often occurs in Manet‟s. The reason for this packet dropping is as below
o Transmission Link failure.
o Inferred transmission due to flooded input that leads Ingress receiving strength to be low. This can be
claimed as packet dropping due to jamming at routing.
Here we divide the network in to groups, for each group, group leader will be selected and then the level of
congestion will be calculated in two stages as below
The level of congestion within the Multicast-group stage.
The level of congestion in various Multicast-group stages.
With this the resource level cost may be reduced and the energy required may be regulated.
3.2 Notations used in the proposed model
Multicast- group A physical area, which is the division of favored mobile ad hoc association
ICEA Intra level congestion Evaluation Algorithm
IERA Intra level Egress Regularization Algorithm
ERA Egress Regularization Algorithm
DPG Distance Power Gradient
EIL Ingress inferred Loss
LFL Link Failure Loss
IRS Ingress receives strength
IRSp Present Ingress receives strength
IRSe Expected Ingress Receiving Strength
RP Routing path
dtn Delay time at node n
N Number of nodes in entire network
Zni Number of nodes in a Multicast-group i
zhi Multicast-group head of the th
i Multicast-group
zh'i Reserved Multicast-group head of the th
i Multicast-group
Zc Current Multicast-group in the hierarchy
Zp Preceding Multicast-group to the current Multicast-group cZ in the hierarchy
Zf Following Multicast-group to the current Multicast-group cZ in hierarchy
Zi
th
i Multicast-group in the routing path
4. Multicast Routing Protocol With Group-Level Congestion Predection And Permanence Under
www.iosrjournals.org 45 | Page
nz Multicast-group of the node n
Z MaximumMulticast-group level Transmission Load
n Maximum Node level Transmission Load
T Predefined Threshold that represents gap between two transmissions at one hop
level
t Actual gap between last two transmissions
et Elapsed time since previous transmission at one hop level
T
IRSζ Maximum average ingress receiving strength observed for predefined gap T
' Standard sloping threshold of the receiving strength
ceIRS Estimated maximum ingress receiving strength at current interval
rIRS ingress receiving strength ratio
crIRS Current input receiving strength ratio
nBT Buffer time at node n
izdil Multicast-group level degree of ingress load, here i is a group id.
kndil Node level degree of ingress load, here k is the node id of the groupi
3.3 Network and Node activities under projected protocol
The network is to be divided into Multicast-groups
For every Multicast-group i where i=1,2,…|Z| (|Z| is total number of groups)
Select Multicast-group-head for each Multicast-group i
Find maximum transmission load nζ for every Multicast-group i
By using nζ of each Multicast-group measure the maximum transmission load for the whole network.
3.4 Splitting the network into Multicast-groups
We choose to the approach described by Mohammad M. Qabajeh et al [8]. The ad hoc network region
is partitioned into equal size groups and it must be known to all the nodes participating in the network. The
hexagon is chosen as the group shape as it can cover a two-dimensional region completely without any overlap
and also it enables communication with more neighbors. The transmission range of a node is denoted as R and
the side length of hexagon as L. The connection between R and L is set as L = R/2 by which each two nodes
inside the group can communicate with each other directly.
Every Multicast-group has a Multicast-group identity (zid), Multicast-group head (zh) and Multicast-
group head reserve ( '
zh ). The zh node maintains information about all the nodes in a Multicast-group with their
positions and IDs. Also, it is responsible to maintain information about the group heads of the neighboring
Multicast-groups as shown in the figure 1. The duty of CLB node is to keep a copy of the data stored at the zh in
order not to be lost when the zh node is off or moving the Multicast-group. By knowing the coordinates of a
node position,nodes can perform our self-mapping algorithm of their physical locations onto the present
Multicast-group and calculate its zid easily. Figure 1 shows the general summary of the network architecture.
3.5 Selecting Multicast-group-Heads
A Multicast-group-Head selection occurs basis on the following terms:
I. Node position: A node in the location p that is close to the center of the multicast group is most
favorable to act as Multicast-group head.
II. Energy level: A node with maximum energy level e is preferable to act as Multicast-group head.
III. Computational capability: The node with high computational ability c is optimal to act as a Multicast-
group Head.
IV. Mobility: The node with less mobility m is acceptable to act as a zone head.
Each node of the Multicast-group broadcasts its( , , , )p e c m . The node which has all the above ( , , , )p e c m
metrics is declared itself as group headzh. The next optimal node in the series becomes the reserve Multicast-
group head '
zh .
5. Multicast Routing Protocol With Group-Level Congestion Predection And Permanence Under
www.iosrjournals.org 46 | Page
Figure 1[8]: Architecture of the Multicast-group partitions in network.
4.4 Information sharing at intra Multicast-group level (between multicast-group head and node)
Each node n that fit in to Multicast-group Z verifies the incoming load and shares degree of ingress
load diln with Multicast-group head. Once ndilk received from each node k of the Multicast-groupi , the
Multicast-group head zh calculates the degree of ingress load at Multicast-group level zdili.
1
zni
ndilk
kzdilzi zni
V. Group-Level Congestion Prediction (GCP) Algorithm
Multicast-group level Congestion Predicition algorithm abbreviated as GCP is presented in this section.
GCP is the finest algorithm that helps in locating the packet drop under congestion. This is evaluated by Mac
layer and then it alerts the network layer.
Fig2: GCP for estimating status of congestion caused due to packet drop
At an event of ingress receiving by node i:
Updating Ingress receiving strength:
if Tt ζζ then
'δ
2
1
ζ2
1
'δ
ζ
t
cr T
IRSIRS
T
tT
T
t
cr TT
IRSIRSIRS
ζ
ζζ
ζ
ζ
ζζ
end if
if Tt ζζ then
t
cr T
IRSIRS
ζ
'δ
ζ
crIRSIRS T
ζ
end if
Detecting packet drop at the Mac layer level
etce T
IRSIRS ζ'δζ
if etce T
IRSIRS ζ'δζ
Mac Alert link failure
Else
Mac Alert Congestion
VI. Group-Level Egress Permanence (GEP) Algorithm
This event occurs if Mac-layer alert indicates the congestion situation. Once the routing protocol [13] gets an
alert from the Mac layer about the congestion at a nodei , it alerts the adjacent node that is the source node s
for conflict node i. Hence s calculates it‟s sdil by comparing with zdil of cZ (Multicast-group of the node s). If
sdil is greater than czzdil and difference between sdil and zszdil is greater than equal to egress threshold then
node s regularize the outflow by increaing its buffering time sBT such that z zs s sndil zdil .
Here can evaluated with the following equation
6. Multicast Routing Protocol With Group-Level Congestion Predection And Permanence Under
www.iosrjournals.org 47 | Page
1
jzn
j k
k
j
j
zdil dil
zn
In case if the node s not able to regularize its outflow such that conflict node i prevents from
congestion then it alerts the
zszh (Multicast-group-head of the cZ , cs Z ). In the series of that event
czzh alert all
the nodes in the group.Thus the nodes those are in upstream side of the source node s in routing way attempt to
regularize their egress load using the above method in this section. Then all nodes update there ndil and send to
Multicast-group-head
czzh , then Multicast-group-head
czzh calculates zdil and verifies reliability of the zdil by
comparing with dil .
cZzdil dil concludes that congestion at conflict node is controlled by egress
regularization at current Multicast-group level. If
czzdil dil then congestion evaluation algorithm will be
initiated at pZ , which is immediate upstream Multicast-group to cZ in hierarchy. In this procedure Multicast-
group head of the cZ initially alerts the Multicast-group head of the counterpart pZ then pzzh alerts all nodes that
belong to pZ , which are part of the route path. The above process of egress regularization at the multicast-group
level can be referred as GEP (Group-level Egress Permanence) algorithm. Therefore the nodes belong to pZ
attempt to regularize their egress load by using GEP and alert Multicast-group head about their updated degree
of ingress load ndil . Then „ pzzh ‟ calculates „ pzzdil ‟ and verifies whether pZzdil dil true or false.True
indicates that the jamming at the conflict node has been reduced or removed because of the egress load
regularization at Multicast-group pZ , if false then Multicast-group head of the pZ alerts all other Multicast-
group heads using a broadcasting [12] approach about the congestion at immediate zone in downstream of the
hierarchy . Hence all Multicast-groups in the upstream side of the pZ apply GEP and the Multicast-groups in the
downstream side of the pZ updates their zdil . Then all Multicast-groups send their zdil to source Multicast-
group. Hence the base Multicast-group evaluates the dil .Basing on the dil ,source node regularizes its egress
load.
Fig 3: Group-level Egress Permanence(GEP)
The notations used in Algorithm:
i Node that had been affected by emptiness.
S Source node of i.
cZ Present Multicast-group where cZsi ,
pZ Immediate Multicast-group to cZ in upstream side of the pecking order.
kin
c
i Zu ,...,2,1, All upstream nodes to s.
kin
c
i Zd ,...,2,1, All downstream nodes to s.
kiZZ iuS ,...,2,1, Set of upstream Multicast-groups to pZ in the routing path, here SZ is a
Multicast - group that contains the source node of the course-plotting path.
miZZ Tdi
,...,2,1,
Set of downstream Multicast-groups to pZ in routing path, here TZ is a
Multicast - group that have target node of the routing path.
Multicast - group level way out threshold.
ε System level way out threshold.
Algorithm
Mac layer alerts about the jamming at the node of the multicast-group cZ to routing protocol, hence the
next steps performed in order
C
CZ
C
C
Z
k
zn
k
Z
Z
zn
dilzdil
1
ε
7. Multicast Routing Protocol With Group-Level Congestion Predection And Permanence Under
www.iosrjournals.org 48 | Page
At node s the following sequence is carried out
if cZs zdilndil and cc ZZs zdilndil ε then
BTs=BTs+bt
Note: Value of buffer threshold bt should be certain such that CC ZZS zdildil ε
return
end if
s sends alert to cZzh about conflict node i.
cZzh alerts all nodes that belong to Multicast-group cZ
kin
c
i Zu ,...,2,1, updates their ndil by apply CON recursively and alerts cZzh
kin
c
i Zd ,...,2,1, events their ndil and alerts cZzh
cZzh actions zdil as fallows
1
znZc
ndilk
kzdil
z znc Zc
if dilzdil cZ and εdilzdil cZ then
Alert: blocking at contention node normalized at present Multicast-group cZ level.
Return.
Endif
cZzh alerts pZzh
pZzh alerts all nodes that feel right to Multicast-group pZ
For both nodes pn Z begin
if pZn zdilndil and pp ZZn zdilndil ε then
BTn=BTn+bt
Note: Value of hurdle threshold bt should be determined such that CC ZZn zdildil ε
endif
Find diln and send diln to pZzh
End-of-for each
pZzh events pZzdil
if dilzdil pZ and εdilzdil pZ begin
Alert: way out regularization at pZ leads to conquer congestion circumstances at disputation
Multicast-group.
go back;
Endif
pZzh alerts all Multicast-group heads in the complex about overcrowding disagreement Multicast-group.
For each Multicast-group z in kiZZ iuS ,...,2,1, begin
zhz alerts all nodes that belong to Multicast-group z
For each node zn begin
If n zndil zdil and n z zndil zdil begin
n nBT BT bt
Note: Value of buffering threshold bt should be assumed such that
ZZn zdildil ε
endif
Find ndil and send ndil to zzh
End-of-for each
zzh measures zzdil and advances towards source Multicast-group.
End-of-for each
8. Multicast Routing Protocol With Group-Level Congestion Predection And Permanence Under
www.iosrjournals.org 49 | Page
For each Multicast-group z in miZZ Tdi
,...,2,1, begin
For each node n fit in to Multicast-group z begin
Concludes ndiln and sends to zhz
End-of-for each
zhz procedures zdilz as
Z
zn
k
k
Z
zn
ndil
zdil
Z
1
zhz sends zdilz to source Multicast-group through broadcasting [12]
End-of-for each
ZS measures dil as
||
||
1
Z
zdil
dil
Z
i
i
Hence the source node s regularizes its egress load to routing path.
VII. Simulations and results discussion
In this section we discuss the end acquired from replication conducted using „Madhoc simulator‟ [16]
in this section. We evaluated concert using Madhoc with the following consideration:
No of Hops: 225
Estimated Hop distance 300 meters
Approximate total network 1000X1000 meters
Quite accurate Multicast-
group Radios
100X100 meters
Physical channel bandwidth 2mbps
Mac Layer:
802.11 DCF with preference of
handshaking prier to data transferring
Physical layer illustration 802:11B
Presentation Index
way out regularization cost and end-
to-end throughput
Be very winning simulation
time
150 sec
Table 2: parameter used in machos [16] for presentation analysis
The imitation is conducted on three routes opposing by the no of hops and length.
1. Short span path: A route with 15 hops
2. Middling span : A route with 40 hops
3. Max span: A route with 81 hops
The same load is agreeing to all the paths with a regular period of 10 sec. Consignment given in kilobytes
is shown in fig 4. The fig 5 concludes the step up of GCP-GEP over jamming control procedure [31] in
obstruction control cost. A. The overcrowding discovery cost evaluation between GCP-GEP and blocking
control etiquette[31] is travelling around in fig 6 that elevate the vigor good group achieve under GCP-GEP.
The process of capacity of congestion control and jamming uncovering cost is as follows:
Based on the reserve effortlessness of use, bandwidth and force, for character process a threshold value between
0 and 1 assign. In the instrument of overcrowding detection and direct the sum cost is calculated by summing
the price threshold of every concerned event. In fig 5 the ruling between blockage costs observed for GCP-GEP
and overcrowding and debate control mock-up [31] are shown.
E
e
ech ctt
1
cos
Here cos cht is the price of an impasse scheming movement ch, E is the total quantity of events built-in. cte is the
threshold cost of an event e. The illustration events are:
1.” Alert to source node as of Mac layer”
9. Multicast Routing Protocol With Group-Level Congestion Predection And Permanence Under
www.iosrjournals.org 50 | Page
2. “Alert from node to Multicast-group head”, “spread by Multicast-group skull to another Multicast-group
head”
3. “Ingress ruling and egress regularization”.
4. Alert about )( ic hd
5. Bring up to date )(rpdc
Fig 4: weight in bytes drive by foundation node of the direction-finding path (in regular interval of 10 sec)
Fig 5: Congestion Control cost comparison chart
Fig 6: A line chart comparison of Congestion detection cost
VIII. Conclusion
This manuscript discussed proposed Multicast routing protocol with Group-level congestion Prediction
and Permanence under constrained energy utilization for mobile Ad hoc Networks in short referred as GCP-
GEP. GCP-GEP derived a Cross layered congestion detection mechanism with energy effectiveness as primary
criteria that included as congestion prediction mechanism. In this regard it opt to a hierarchical approach of
congestion permanence of predicted. This hierarchical approach is efficient to perform under minimal resource
utilization. The simulation results evident that the proposed model is significantly delivered better performance
than other frequently cited energy efficient multicast routing models.
References
[1] C.S.R. Murthy and B.S. Manoj, Ad Hoc Wireless Networks: Architectures and Protocols. Prentice Hall, 2004.
[2] J. Janssen, D.D. Vleeschauwer, G.H. Petit, R. Windey, and J.M. Leroy, “Delay Bounds for Voice over IP Calls Transported over
Satellite Access Links,” Mobile Networks and Applications, vol. 7, pp. 79-89, 2002.
[3] B. Tavli and W. Heinzelman, Mobile Ad Hoc Networks: Energy- Efficient Real-Time Group Communications. Springer, 2006.
10. Multicast Routing Protocol With Group-Level Congestion Predection And Permanence Under
www.iosrjournals.org 51 | Page
[4] C.W. Wu and Y.C. Tay, “AMRIS: A Multicast Protocol for Ad Hoc Wireless Networks,” Proc. IEEE Military Comm. Conf., vol. 1,
pp. 25-29, 1999.
[5] S.J. Lee, W. Su, and M. Gerla, “On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks,” Mobile
Networks and Applications, vol. 7, pp. 441-453, 2002.
[6] V. Kawadia and P.R. Kumar, “A Cautionary Perspective on Cross- Layer Design,” IEEE Wireless Comm., vol. 12, no. 1, pp. 3-11,
Feb. 2005.
[7] J.G. Jetcheva and D.B. Johnson, “Adaptive Demand-Driven Multicast Routing in Multi-Hop Wireless Ad Hoc Networks,” Proc.
ACM Int‟l Symp. Mobile Ad Hoc Networking and Computing, pp. 33-44, 2001.
[8] Mohammad M. Qabajeh, Aisha Hashim, Othman Khalifa & Liana K. Qabajeh, 2010, “Geographical Multicast Quality of Service
Routing Protocol for Mobile Ad-Hoc Networks”, Journal of Engineering Letters, Vol. 18, No. 3, pp. 212-225.
[9] W. Liang, “Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 5,
no. 4, pp. 377-387, Apr. 2006.
[10] B. Tavli and W. Heinzelman, “TRACE: Time Reservation Using Adaptive Control for Energy Efficiency,” IEEE J. Selected Areas
Comm., vol. 21, no. 10, pp. 1506-1515, Dec. 2003.
[11] B. Tavli and W. Heinzelman, “MH-TRACE: Multi Hop Time Reservation Using Adaptive Control for Energy Efficiency,” IEEE J.
Selected Areas Comm., vol. 22, no. 5, pp. 942-953, June 2004.
[12] B. Tavli and W. Heinzelman, “Energy and Spatial Reuse Efficient Network Wide Real-Time Data Broadcasting in Mobile Ad Hoc
Networking,” IEEE Trans. Mobile Computing, vol. 5, no. 10, pp. 1297-1312, Oct. 2006.
[13] H. Moustafa and H. Labiod, “A Performance Comparison of Multicast Routing Protocols in Ad Hoc Networks,” Proc. IEEE
Personal, Indoor and Mobile Radio Conf., pp. 497-501, 2003.
[14] Network Simulator (NS), http://www.isi.edu/nsnam/ns, 2010.
[15] S.J. Lee, W. Su, J. Hsu, M. Gerla, and R. Bagrodia, “A Performance Comparison of Ad Hoc Wireless Multicast Protocols,” Proc.
IEEE Conf. Computer Comm., pp. 565-574, 2000.
[16] W. Ye and J. Heidemann, “Medium Access Control in Wireless Sensor Networks,” Technical Report ISI-TR-580, Information
Sciences Inst., Univ. of Southern California, 2003.
[17] J.-P. Ebert, S. Aier, G. Kofahl, A. Becker, B. Burns, and A. Wolisz, “Measurement and Simulation of the Energy Consumption of
an WLAN Interface,” Telecomm. Network Group Technical Report TKN-02-010, Technical Univ. of Berlin, 2002.
[18] B. Tavli and W. Heinzelman, “MC-TRACE: Multicasting through Time Reservation Using Adaptive Control for Energy
Efficiency,” Proc. IEEE Military Comm. Conf., pp. 2076-2081, 2005.
[19] M. Conti, G. Maselli, G. Turi, and S. Giordano, “Cross-Layering in Mobile Ad Hoc Network Design,” Computer, vol. 37, no. 2, pp.
48- 51, Feb. 2004.
[20] M. Van Der Schaar and S. Shankar, “Cross-Layer Wireless Multimedia Transmission: Challenges, Principles and New Paradigms,”
IEEE Wireless Comm., vol. 12, no. 4, pp. 50-58, Aug. 2005.
[21] V. Srivastava and M. Motani, “Cross-Layer Design: A Survey and the Road Ahead,” IEEE Comm. Magazine, vol. 43, no. 12, pp.
112- 119, Dec. 2005.
[22] M. Gerla, Y.-Z. Lee, J.-S. Park, and Y. Yi, “On Demand Multicast Routing with Unidirectional Links,” Proc. IEEE Wireless
Comm. and Networking Conf., pp. 2162-2167, 2005.
[23] T. Numanoglu, B. Tavli, and W. Heinzelman, “Energy Efficiency and Error Resilience in Coordinated and Non-Coordinated
Medium Access Control Protocols,” Computer Comm., vol. 29, pp. 3493-3506, 2006.
[24] L. Junhai, Y. Danxia, X. Liu, and F. Mingyu, “A Survey of Multicast Routing Protocols for Mobile Ad-Hoc Networks,” IEEE
Comm. Surveys and Tutorials, vol. 11, no. 1, pp. 78-91, First Quarter 2009.
[25] C. Papageorgiou, P. Kokkinos, and E. Varvarigos, “Energy- Efficient Multicasting in Wireless Networks with Fixed Node
Transmission Power,” Proc. ACM Int‟l Conf. Comm. and Mobile Computing, pp. 958-962, 2009.
[26] E. Astier, A. Hafid, and A. Benslimane, “Energy and Mobility Aware Clustering Technique for Multicast Routing Protocols in
Wireless Ad Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf., pp. 1-6, 2009.
[27] W. Liang, R. Brent, Y. Xu, and Q. Wang, “Minimum-Energy Allto- All Multicasting in Wireless Ad Hoc Networks,” IEEE Trans.
Wireless Comm., vol. 8, no. 11, pp. 5490-5499, Nov. 2009.
[28] T. Mukherjee, G. Varsamopoulos, and S.K.S. Gupta, “Self Managing Energy-Efficient Multicast Support in MANETs under End-
to-End Reliability Constraints,” Computer Networks, vol. 53, pp. 1603-1627, 2009.
[29] S. Guo and O.W.W. Yang, “Energy-Aware Multicasting in Wireless Ad Hoc Networks: A Survey and Discussion,” Computer
Comm., vol. 30, pp. 2129-2148, 2007.
[30] B. Tavli and W. Heinzelman, “QoS and Energy Efficiency in Network-Wide Broadcasting: A MAC Layer Perspective,” Computer
Comm., vol. 30, pp. 3705-3720, 2007.
[31] Bulent Tavli and Wendi B. Heinzelman; Energy-Efficient Real-Time Multicast Routing in Mobile Ad Hoc Networks; IEEE
TRANSACTIONS ON COMPUTERS, VOL. 60, NO. 5, MAY 2011