The document summarizes a research paper that proposes a new clustering routing protocol called Cluster based Stable Routing protocol (CSR) for mobile ad hoc networks. The protocol uses Binary Particle Swarm Optimization (BPSO) to select cluster heads and determine the optimal number of clusters. The goal is to minimize the number of clusters, efficiently select cluster heads based on remaining battery power, and maximize network lifetime. Experiments showed the proposed method efficiently forms clusters in mobile ad hoc networks.
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.
PERFORMANCE IMPROVEMENT OF NONREGENERATIVE COOPERATIVE RELAY NETWORKS WITH OP...ijwmn
This paper analyzes the performance of Channel Side Information (CSI)-assisted cooperative amplify-andforward
(CAF) relay networks that employ both the node placement (i.e., relay position) based optimal
power allocation policy among collaborating nodes and adaptive M-ary quadrature amplitude modulation
(M-QAM)/ M-ary phase shift keying (M-PSK) techniques in generalized wireless fading environments. In
particular, we advocate a simple yet unified numerical approach based on the marginal moment generating
function (MGF) of the total received Signal to Noise Ratio (SNR) to derive analytical expressions for the
average bit error rate (ABER), mean achievable spectral efficiency, and outage probability performance
metrics. The proposed analytical framework is sufficiently general and flexible to characterize the
performance of adaptive-link CAF relay networks over a wide range of fading distributions (i.e., not
restricted to Rayleigh fading or independent identically distributed (i.i.d) Nakagami-m fading ) with
independent but non-identically distributed (i.n.d) fading statistics across the spatially distributed diversity
paths. Additionally, we further simplify the computational complexity, by employing the use of an
“approximate MGF expression” to compute the system performance metrics over the generalized fading
channel. Employing the above novel approach based on “approximate MGF” in conjunction derived
analytical frameworks allows us to simplify the computation complexity of achievable spectral efficiency as
well as ABER of CAF relay system in the generalized fading environments by simply replacing appropriate
single channel MGF which is readily available
The maximization of a networks lifetime is an important part of research in the present scenario. In ad hoc network, the topology of network changes frequently due to the mobility of mobile nodes where the communication is possible without any network infrastructure. Mobile nodes have limited energy resources so that the energy efficient routing should be provided which increases the life time of the network. The existing routing mechanisms do not consider energy of nodes for data transmission. In this paper a novel approach is analyzed to improve the networks lifetime where the data transfer is based on the minimum hop count and residual energy of the mobile nodes. The analysis is carried out by using the network simulator and the simulation results shows that the proposed work provides an energy efficient routing in ad hoc networks.
Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...IJNSA Journal
With the rapid growth of wireless communication infras,,tructure over the recent few years, new
challenges has been posed on the system and analysis on wireless adhoc networking. Implementation of
MIMO communication in such type of network is enhancing the packet transmission capabilities. There
are different techniques for cooperative transmission and broadcasting packet in MIMO equipped
Mobile Adhoc Network. We have employed a model network in the OPNET environment and propose a
new scheduling algorithm based on investigating the different broadcasting algorithm. The new
broadcasting algorithm improves the packet transmission rate of the network based on energy
performance of the network and minimizes the BER for different transmission mode which is illustrated
in this paper. The simulations are done in MATLAB and OPNET environment and the simulated result
for the packet transmission rate are collected and shown in the tabular form. Also simulate the network
for generating a comparative statement for each mobile node. And performance analysis is also done for
the model network. The main focus is to minimize BER and improve information efficiency of the
network.
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%.
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.
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.
PERFORMANCE IMPROVEMENT OF NONREGENERATIVE COOPERATIVE RELAY NETWORKS WITH OP...ijwmn
This paper analyzes the performance of Channel Side Information (CSI)-assisted cooperative amplify-andforward
(CAF) relay networks that employ both the node placement (i.e., relay position) based optimal
power allocation policy among collaborating nodes and adaptive M-ary quadrature amplitude modulation
(M-QAM)/ M-ary phase shift keying (M-PSK) techniques in generalized wireless fading environments. In
particular, we advocate a simple yet unified numerical approach based on the marginal moment generating
function (MGF) of the total received Signal to Noise Ratio (SNR) to derive analytical expressions for the
average bit error rate (ABER), mean achievable spectral efficiency, and outage probability performance
metrics. The proposed analytical framework is sufficiently general and flexible to characterize the
performance of adaptive-link CAF relay networks over a wide range of fading distributions (i.e., not
restricted to Rayleigh fading or independent identically distributed (i.i.d) Nakagami-m fading ) with
independent but non-identically distributed (i.n.d) fading statistics across the spatially distributed diversity
paths. Additionally, we further simplify the computational complexity, by employing the use of an
“approximate MGF expression” to compute the system performance metrics over the generalized fading
channel. Employing the above novel approach based on “approximate MGF” in conjunction derived
analytical frameworks allows us to simplify the computation complexity of achievable spectral efficiency as
well as ABER of CAF relay system in the generalized fading environments by simply replacing appropriate
single channel MGF which is readily available
The maximization of a networks lifetime is an important part of research in the present scenario. In ad hoc network, the topology of network changes frequently due to the mobility of mobile nodes where the communication is possible without any network infrastructure. Mobile nodes have limited energy resources so that the energy efficient routing should be provided which increases the life time of the network. The existing routing mechanisms do not consider energy of nodes for data transmission. In this paper a novel approach is analyzed to improve the networks lifetime where the data transfer is based on the minimum hop count and residual energy of the mobile nodes. The analysis is carried out by using the network simulator and the simulation results shows that the proposed work provides an energy efficient routing in ad hoc networks.
Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...IJNSA Journal
With the rapid growth of wireless communication infras,,tructure over the recent few years, new
challenges has been posed on the system and analysis on wireless adhoc networking. Implementation of
MIMO communication in such type of network is enhancing the packet transmission capabilities. There
are different techniques for cooperative transmission and broadcasting packet in MIMO equipped
Mobile Adhoc Network. We have employed a model network in the OPNET environment and propose a
new scheduling algorithm based on investigating the different broadcasting algorithm. The new
broadcasting algorithm improves the packet transmission rate of the network based on energy
performance of the network and minimizes the BER for different transmission mode which is illustrated
in this paper. The simulations are done in MATLAB and OPNET environment and the simulated result
for the packet transmission rate are collected and shown in the tabular form. Also simulate the network
for generating a comparative statement for each mobile node. And performance analysis is also done for
the model network. The main focus is to minimize BER and improve information efficiency of the
network.
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%.
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.
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.
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%.
Advance in the WIRELESS SENSOR NETWORK (WISENET) technology is energy efficient routing protocols that promises a wide range of potential applications in both civilian and military areas. In the WISNET the sensor node have a limited transmission range and their processing and storage capabilities as well as their energy sources are limited. So the Equalized Cluster Head Election Routing Protocol (ECHERP) and PEGASIS with Double Cluster Head (PDCH) pursues energy conservation through balanced clustering for Energy Efficiency. In WSN, energy efficient routing protocol is important to increase the network lifetime. ECHERP and PDCH both protocol claims to be energy efficient.
As the nodes in Wireless Sensor Networks (WSNs) have limited power, energy conservation is essential at different layers of the protocol stack to prolong lifetime. In our previous work, ”Priority based slot allocation for media access in wireless sensor networks” (PSAWSN), probability based priority scheme is used to allocate slots to competing nodes. Limitations of this work include 1) It does not handle dynamic and variable slot allocation based on varying requirements of nodes. 2) Error control is not taken into account. To overcome these limitations, we propose a Medium Access Control scheme using Priority Index (MACPI) that generates Priority Index (PI) to allocate varying slots based on parameters: message length (ML), node energy (NE), number of requests (NR) and message urgency (MU). Models have been de- signed for all these parameters and an expert system is proposed that makes decisions based on collective knowledge of these parameters. Analysis and simulation results for various message sizes and error conditions show that there is an improvement in terms of energy efficiency, optimal message length and throughput compared to the ”Reliable data deliveries using packet optimization in multi-hop underwater sensor networks”(RDPSN).
Energy Consumption in Ad Hoc Network With Agents Minimizing the Number of Hop...CSCJournals
Wireless mobile ad-hoc network (MANET) is a special kind of network, where all of the nodes move in time. Node is intended to help relaying packets of neighboring nodes using multi-hop routing mechanism in order to solve problem of dead communication. MANET which engages broadcasting and contains multiple hops becomes increasingly vulnerable to problems such as mobile node’s energy degradation, routing problem and rapid increasing of overhead packets. This paper provides an extensive study of energy consumption in the MANET that consists of several network areas with the presence agents. Agents will minimize number of hops and its affect in linearity with the delay. As nodes grow, either in data transmission services or coverage of node’s communication or more agents stand in overlapped locations, accordingly data exchange and topology development to adapt the network are becoming an important issue. As a result, agents are needed to support process automation, high-level connectivity and intelligent service on that such environment. We evaluate the agents’ performance and network energy consumption for supporting MANET. The proposed agents provides service packets transmission between networks; e.g. determine appropriate relay nodes dynamically, maintain the transmission between networks through another nodes, share the topology knowledge among agents, and route packets between source and final destination that are unable to communicate directly. The achievement on research with this approach is conducted via simulation study. A similar network without agents is presented to derive such referential bounds by using appropriate functions of network agents. The proposed algorithm is confirmed with composite simulation results.
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.
Aiming at the problem that existing femtocell base station searching the optimal clustering scheme based on the clustering resource allocation algorithm is complex. We propose that building an conflict graph and adjacency matrix before clustering to calculate the number of clusters needed for FBS group by using the adaptive clustering heuristic algorithm. We follow maximization the sum of the FBS distances in the cluster and group the femtocell base stations to narrow the search range to reduce the computational complexity. In order to achieve different business types service, based on the above clustering algorithm, this paper proposes a new method that using the weighted energy efficiency, which including the user interruption and the network spectral efficiency as a fitness function of the power control scheme to solve the problem. The simulation results show that the same rate requirement reduces the complexity, while the same complexity increases the user's average rate.
The novel applications of sensor networks impose some requirements in wireless sensor network design. With the energy efficiency and lifetime awareness, the throughput and network delayalso required to support emerging applications of sensor networks. In this paper, we propose
throughput and network delay aware intra-cluster routing protocol. We introduce the back-up links in the intra-cluster communication path. The link throughput, communication delay, packet loss ratio, interference, residual energy and node distance are the considered factors in finding efficient path of data communication among the sensor nodes within the cluster. The
simulation result shows the higher throughput and lower average packet delay rate for the proposed routing protocol than the existing benchmarks. The proposed routing protocol also shows energy efficiency and lifetime awareness with better connectivity rate.
FAULT-TOLERANT MULTIPATH ROUTING SCHEME FOR ENERGY EFFICIENT WIRELESS SENSOR ...ijwmn
Themain challengein wireless sensor network is to improve the fault tolerance of each
node and also provide an energy efficient fast data routing service. In this paper we propose an
energyefficient node fault diagnosis and recovery for wireless sensor networks referred as fault tolerant
multipath routing scheme for energy efficientwireless sensor network (FTMRS).The FTMRSis based on
multipath data routing scheme. One shortest path is use for main data routing in FTMRS technique and
other two backup paths are used as alternative path for faulty network and to handle the overloaded
traffic on main channel.Shortest path data routing ensures energy efficient data routing. The
performance analysis of FTMRSshows better results compared to other popular fault tolerant techniques
in wireless sensor networks.
A RELIABLE AND ENERGY EFFICIENCT ROUTING PROTOCOL FOR MANETs cscpconf
A mobile ad-hoc network (MANETs) is an infrastructure less network in which the mobile nodes
communicate with each other. Due to its various characteristics like highly dynamic topology
and limited battery power of the nodes, routing is one of the key issue. Also, it is not possible to
give a significant amount of power to the mobile nodes of ad-hoc networks. Because of all this
the energy consumption is also an important issue. Due to limited battery power, some other
issues like if some node gets fail, which results in loss of data packets and no reliable data
transfer has been raised. In this paper, an algorithm is proposed for data transmission which
detects the node failure (due to energy) before it actually happens. Because of this network
lifetime gets improved. The proposed routing algorithm is energy efficient as compared to
AODV routing algorithm. The performance is analyzed on the basis of various performance
metrics like Energy Consumption, Packet Delivery Ratio, Network Life Time, Network Routing
Overhead and number of Exhausted nodes in the network by using the NS2 Simulator.
A Novel Grid Based Dynamic Energy Efficient Routing Approach for Highly Dense...ijasuc
A research work without considering the power constraint cannot be conceded a fine contribution towards
Mobile Ad Hoc Networks (MANET). As MANET comes into action for some special purpose, but its
fugacity sometimes result degrades in network performance. Although the many prominent features of
MANET like mobility, dynamic change in topology, multi radio relaying, quickly lay down the network
without depending upon fixed infrastructures and many more provides tremendous flexibilities for the end
user but challenges like limited power constraint, reliable data communication, band width utilization ,
network performance and throughput are still needed to be handle very sensibly. As limited battery power
and inefficient routing protocol mechanism are high prone to network partition, in such case the network
needs to be established more than once. Because communication establishment involves many costly
operations like route discovery and route maintenance. The more the network partition the more the packet
drops and packet loss which indeed requires a number of retransmission of packets, consuming network
bandwidth as well as depleting battery power of individual nodes with a higher rate, which are the major
destructive elements in network performance degradation as well as the major cause of reducing individual
node’s life time and network life time. So with all caveat in mind, we have proposed a novel Grid Based
Dynamic Energy Efficient Routing (GBDEER) approach which is aimed to construct an energy efficient
path from source to destination based on grid area, where each grid will have three deferent levels of
transmission power. Every grid will have its own grid supervisor node who will take the responsibility
during data communication, especially when the data is been passed through that specific grid. And
keeping the dynamic nature of MANET in mind, we have also provide the feature of grid subordinate
node, who will take the place of grid supervisor in case the supervisor is moving out of the grid area or
running out of energy from certain threshold level. So we our proposed method not only establishes an
energy efficient path but also concerned a dedicated path which can be used for data communication for a
long period of time without any network partition. Hence this approach will be less prone to all those
problems mentions above by the incorporating an efficient mobility handling mechanism.
Energy efficient load balanced routing protocol for wireless sensor networkscsandit
Telecommunications is increasingly vital to the society at large, and has become essential to
business, academic, as well as social activities. Due to the necessity to have access to
telecommunications, the deployment requires regulations and policy. Otherwise, the deployment
of the infrastructures would contribute to environment, and human complexities rather than
ease of use.
However, the formulation of telecommunication infrastructure deployment regulation and
policy involve agents such as people and processes. The roles of the agents are critical, and are
not as easy as it meant to belief. This could be attributed to different factors, as they produce
and reproduce themselves overtime.
This paper presents the result of a study which focused on the roles of agents in the formulation
of telecommunication infrastructures deployment regulation and policy. In the study, the
interactions that take place amongst human and non-human agents were investigated. The study
employed the duality of structure, of Structuration theory as lens to understand the effectiveness
of interactions in the formulation of regulations, and how policy is used to facilitate the
deployment of telecommunications infrastructure in the South African environment.
Evaluation of Energy Consumption of Reactive and Proactive Routing Protocols ...IJCNCJournal
Mobile Ad hoc Network (MANET) is a distributed, infrastructure-less and decentralized network. A routing
protocol in MANET is used to find routes between mobile nodes to facilitate communication within the
network. Numerous routing protocols have been proposed for MANET. Those routing protocols are
designed to adaptively accommodate for dynamic unpredictable changes in network's topology. The mobile
nodes in MANET are often powered by limited batteries and network lifetime relies heavily on the energy
consumption of nodes. In consequence, the lack of a mobile node can lead to network partitioning. In this
paper we analyse, evaluate and measure the energy efficiency of three prominent MANET routing protocols
namely DSR, AODV and OLSR in addition to modified protocols. These routing protocols follow the
reactive and the proactive routing schemes. A discussion and comparison highlighting their particular
merits and drawbacks are also presented. Evaluation study and simulations are performed using NS-2 and
its accompanying tools for analysis and investigation of results.
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.
Energy Consumption Analysis of Ad hoc Routing Protocols for Different Energy ...IOSR Journals
Abstract : In Mobile Ad hoc Networks (MANETs), energy conservation is a critical issue as the nodes are powered by the batteries which have limited energy reservoir. Hence the power level of the nodes is a problematical factor that extensively affects the performance and efficiency of ad hoc routing protocols. The rapidly changing traffic pattern the mobility of the nodes and the lack of fixed infrastructure makes routing in a MANET a challenging issue. So one of the main issues in MANET routing protocols is the development of energy efficient and QoS aware routing protocols which requires the energy analysis of routing protocols so that some modifications can be suggested. This paper presents performance comparison of three categories of mobile ad hoc routing protocols i.e. proactive, reactive and hybrid. The performance analysis is based on different metrics of Physical Layer such as Power Consumed in Transmit Mode, Power Consumed in Receive and Idle Modes, and metrics of application layer like Average End to End Delay, Average Jitter, Throughput and Packet Delivery Ratio based on the simulation analysis. Simulation analysis is performed over well known network simulator QualNet 6.1. Keywords - MANET, AODV, DYMO, OLSR, PDR
A MyDominium teve a visão única de unir dois mercados fundamentais: O Marketing de rede e o Mercado tradicional.
O elo entre os dois mercados é o cartão MyDominium/MtCard (unipessoal e vitalício).
Na realidade, o produto da MyDominium é o próprio mercado tradicional!
Mais informaçao: http://bit.ly/MD-BAPT
Telm: 0351 919205161
Jair Baptista
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%.
Advance in the WIRELESS SENSOR NETWORK (WISENET) technology is energy efficient routing protocols that promises a wide range of potential applications in both civilian and military areas. In the WISNET the sensor node have a limited transmission range and their processing and storage capabilities as well as their energy sources are limited. So the Equalized Cluster Head Election Routing Protocol (ECHERP) and PEGASIS with Double Cluster Head (PDCH) pursues energy conservation through balanced clustering for Energy Efficiency. In WSN, energy efficient routing protocol is important to increase the network lifetime. ECHERP and PDCH both protocol claims to be energy efficient.
As the nodes in Wireless Sensor Networks (WSNs) have limited power, energy conservation is essential at different layers of the protocol stack to prolong lifetime. In our previous work, ”Priority based slot allocation for media access in wireless sensor networks” (PSAWSN), probability based priority scheme is used to allocate slots to competing nodes. Limitations of this work include 1) It does not handle dynamic and variable slot allocation based on varying requirements of nodes. 2) Error control is not taken into account. To overcome these limitations, we propose a Medium Access Control scheme using Priority Index (MACPI) that generates Priority Index (PI) to allocate varying slots based on parameters: message length (ML), node energy (NE), number of requests (NR) and message urgency (MU). Models have been de- signed for all these parameters and an expert system is proposed that makes decisions based on collective knowledge of these parameters. Analysis and simulation results for various message sizes and error conditions show that there is an improvement in terms of energy efficiency, optimal message length and throughput compared to the ”Reliable data deliveries using packet optimization in multi-hop underwater sensor networks”(RDPSN).
Energy Consumption in Ad Hoc Network With Agents Minimizing the Number of Hop...CSCJournals
Wireless mobile ad-hoc network (MANET) is a special kind of network, where all of the nodes move in time. Node is intended to help relaying packets of neighboring nodes using multi-hop routing mechanism in order to solve problem of dead communication. MANET which engages broadcasting and contains multiple hops becomes increasingly vulnerable to problems such as mobile node’s energy degradation, routing problem and rapid increasing of overhead packets. This paper provides an extensive study of energy consumption in the MANET that consists of several network areas with the presence agents. Agents will minimize number of hops and its affect in linearity with the delay. As nodes grow, either in data transmission services or coverage of node’s communication or more agents stand in overlapped locations, accordingly data exchange and topology development to adapt the network are becoming an important issue. As a result, agents are needed to support process automation, high-level connectivity and intelligent service on that such environment. We evaluate the agents’ performance and network energy consumption for supporting MANET. The proposed agents provides service packets transmission between networks; e.g. determine appropriate relay nodes dynamically, maintain the transmission between networks through another nodes, share the topology knowledge among agents, and route packets between source and final destination that are unable to communicate directly. The achievement on research with this approach is conducted via simulation study. A similar network without agents is presented to derive such referential bounds by using appropriate functions of network agents. The proposed algorithm is confirmed with composite simulation results.
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.
Aiming at the problem that existing femtocell base station searching the optimal clustering scheme based on the clustering resource allocation algorithm is complex. We propose that building an conflict graph and adjacency matrix before clustering to calculate the number of clusters needed for FBS group by using the adaptive clustering heuristic algorithm. We follow maximization the sum of the FBS distances in the cluster and group the femtocell base stations to narrow the search range to reduce the computational complexity. In order to achieve different business types service, based on the above clustering algorithm, this paper proposes a new method that using the weighted energy efficiency, which including the user interruption and the network spectral efficiency as a fitness function of the power control scheme to solve the problem. The simulation results show that the same rate requirement reduces the complexity, while the same complexity increases the user's average rate.
The novel applications of sensor networks impose some requirements in wireless sensor network design. With the energy efficiency and lifetime awareness, the throughput and network delayalso required to support emerging applications of sensor networks. In this paper, we propose
throughput and network delay aware intra-cluster routing protocol. We introduce the back-up links in the intra-cluster communication path. The link throughput, communication delay, packet loss ratio, interference, residual energy and node distance are the considered factors in finding efficient path of data communication among the sensor nodes within the cluster. The
simulation result shows the higher throughput and lower average packet delay rate for the proposed routing protocol than the existing benchmarks. The proposed routing protocol also shows energy efficiency and lifetime awareness with better connectivity rate.
FAULT-TOLERANT MULTIPATH ROUTING SCHEME FOR ENERGY EFFICIENT WIRELESS SENSOR ...ijwmn
Themain challengein wireless sensor network is to improve the fault tolerance of each
node and also provide an energy efficient fast data routing service. In this paper we propose an
energyefficient node fault diagnosis and recovery for wireless sensor networks referred as fault tolerant
multipath routing scheme for energy efficientwireless sensor network (FTMRS).The FTMRSis based on
multipath data routing scheme. One shortest path is use for main data routing in FTMRS technique and
other two backup paths are used as alternative path for faulty network and to handle the overloaded
traffic on main channel.Shortest path data routing ensures energy efficient data routing. The
performance analysis of FTMRSshows better results compared to other popular fault tolerant techniques
in wireless sensor networks.
A RELIABLE AND ENERGY EFFICIENCT ROUTING PROTOCOL FOR MANETs cscpconf
A mobile ad-hoc network (MANETs) is an infrastructure less network in which the mobile nodes
communicate with each other. Due to its various characteristics like highly dynamic topology
and limited battery power of the nodes, routing is one of the key issue. Also, it is not possible to
give a significant amount of power to the mobile nodes of ad-hoc networks. Because of all this
the energy consumption is also an important issue. Due to limited battery power, some other
issues like if some node gets fail, which results in loss of data packets and no reliable data
transfer has been raised. In this paper, an algorithm is proposed for data transmission which
detects the node failure (due to energy) before it actually happens. Because of this network
lifetime gets improved. The proposed routing algorithm is energy efficient as compared to
AODV routing algorithm. The performance is analyzed on the basis of various performance
metrics like Energy Consumption, Packet Delivery Ratio, Network Life Time, Network Routing
Overhead and number of Exhausted nodes in the network by using the NS2 Simulator.
A Novel Grid Based Dynamic Energy Efficient Routing Approach for Highly Dense...ijasuc
A research work without considering the power constraint cannot be conceded a fine contribution towards
Mobile Ad Hoc Networks (MANET). As MANET comes into action for some special purpose, but its
fugacity sometimes result degrades in network performance. Although the many prominent features of
MANET like mobility, dynamic change in topology, multi radio relaying, quickly lay down the network
without depending upon fixed infrastructures and many more provides tremendous flexibilities for the end
user but challenges like limited power constraint, reliable data communication, band width utilization ,
network performance and throughput are still needed to be handle very sensibly. As limited battery power
and inefficient routing protocol mechanism are high prone to network partition, in such case the network
needs to be established more than once. Because communication establishment involves many costly
operations like route discovery and route maintenance. The more the network partition the more the packet
drops and packet loss which indeed requires a number of retransmission of packets, consuming network
bandwidth as well as depleting battery power of individual nodes with a higher rate, which are the major
destructive elements in network performance degradation as well as the major cause of reducing individual
node’s life time and network life time. So with all caveat in mind, we have proposed a novel Grid Based
Dynamic Energy Efficient Routing (GBDEER) approach which is aimed to construct an energy efficient
path from source to destination based on grid area, where each grid will have three deferent levels of
transmission power. Every grid will have its own grid supervisor node who will take the responsibility
during data communication, especially when the data is been passed through that specific grid. And
keeping the dynamic nature of MANET in mind, we have also provide the feature of grid subordinate
node, who will take the place of grid supervisor in case the supervisor is moving out of the grid area or
running out of energy from certain threshold level. So we our proposed method not only establishes an
energy efficient path but also concerned a dedicated path which can be used for data communication for a
long period of time without any network partition. Hence this approach will be less prone to all those
problems mentions above by the incorporating an efficient mobility handling mechanism.
Energy efficient load balanced routing protocol for wireless sensor networkscsandit
Telecommunications is increasingly vital to the society at large, and has become essential to
business, academic, as well as social activities. Due to the necessity to have access to
telecommunications, the deployment requires regulations and policy. Otherwise, the deployment
of the infrastructures would contribute to environment, and human complexities rather than
ease of use.
However, the formulation of telecommunication infrastructure deployment regulation and
policy involve agents such as people and processes. The roles of the agents are critical, and are
not as easy as it meant to belief. This could be attributed to different factors, as they produce
and reproduce themselves overtime.
This paper presents the result of a study which focused on the roles of agents in the formulation
of telecommunication infrastructures deployment regulation and policy. In the study, the
interactions that take place amongst human and non-human agents were investigated. The study
employed the duality of structure, of Structuration theory as lens to understand the effectiveness
of interactions in the formulation of regulations, and how policy is used to facilitate the
deployment of telecommunications infrastructure in the South African environment.
Evaluation of Energy Consumption of Reactive and Proactive Routing Protocols ...IJCNCJournal
Mobile Ad hoc Network (MANET) is a distributed, infrastructure-less and decentralized network. A routing
protocol in MANET is used to find routes between mobile nodes to facilitate communication within the
network. Numerous routing protocols have been proposed for MANET. Those routing protocols are
designed to adaptively accommodate for dynamic unpredictable changes in network's topology. The mobile
nodes in MANET are often powered by limited batteries and network lifetime relies heavily on the energy
consumption of nodes. In consequence, the lack of a mobile node can lead to network partitioning. In this
paper we analyse, evaluate and measure the energy efficiency of three prominent MANET routing protocols
namely DSR, AODV and OLSR in addition to modified protocols. These routing protocols follow the
reactive and the proactive routing schemes. A discussion and comparison highlighting their particular
merits and drawbacks are also presented. Evaluation study and simulations are performed using NS-2 and
its accompanying tools for analysis and investigation of results.
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.
Energy Consumption Analysis of Ad hoc Routing Protocols for Different Energy ...IOSR Journals
Abstract : In Mobile Ad hoc Networks (MANETs), energy conservation is a critical issue as the nodes are powered by the batteries which have limited energy reservoir. Hence the power level of the nodes is a problematical factor that extensively affects the performance and efficiency of ad hoc routing protocols. The rapidly changing traffic pattern the mobility of the nodes and the lack of fixed infrastructure makes routing in a MANET a challenging issue. So one of the main issues in MANET routing protocols is the development of energy efficient and QoS aware routing protocols which requires the energy analysis of routing protocols so that some modifications can be suggested. This paper presents performance comparison of three categories of mobile ad hoc routing protocols i.e. proactive, reactive and hybrid. The performance analysis is based on different metrics of Physical Layer such as Power Consumed in Transmit Mode, Power Consumed in Receive and Idle Modes, and metrics of application layer like Average End to End Delay, Average Jitter, Throughput and Packet Delivery Ratio based on the simulation analysis. Simulation analysis is performed over well known network simulator QualNet 6.1. Keywords - MANET, AODV, DYMO, OLSR, PDR
A MyDominium teve a visão única de unir dois mercados fundamentais: O Marketing de rede e o Mercado tradicional.
O elo entre os dois mercados é o cartão MyDominium/MtCard (unipessoal e vitalício).
Na realidade, o produto da MyDominium é o próprio mercado tradicional!
Mais informaçao: http://bit.ly/MD-BAPT
Telm: 0351 919205161
Jair Baptista
ENERGY EFFICIENT ROUTING ALGORITHM FOR MAXIMIZING THE MINIMUM LIFETIME OF WIR...ijasuc
In wireless sensor network, devices or nodes are generally battery powered devices. These nodes have
limited amount of initial energy that are consumed at different rates, depending on the power level. The
lifetime of the network is defined as the time until the first node fails (or runs out of battery). In this paper
different type of energy efficient routing algorithms are discussed and approach of these algorithms is to
maximize the minimum lifetime of wireless sensor network. Special attention has been devoted for
algorithms formulate the routing problem as a linear programming problem, which uses the optimal flow
path for data transmission and gives the optimum results. Advantages, limitations as well as comparative
study of these algorithms are also discussed in this paper.
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.
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.
A Transmission Range Based Clustering Algorithm for Topology Control Manetgraphhoc
This paper presents a novel algorithm for clustering of nodes by transmission range based clustering (TRBC).This algorithm does topology management by the usage of coverage area of each node and power management based on mean transmission power within the context of wireless ad-hoc networks. By reducing the transmission range of the nodes, energy consumed by each node is decreased and topology is formed. A new algorithm is formulated that helps in reducing the system power consumption and prolonging the battery life of mobile nodes. Formation of cluster and selection of optimal cluster head and thus forming the optimal cluster taking weighted metrics like battery life, distance, position and mobility is done based on the factors such as node density, coverage area, contention index, required and current node degree of the nodes in the clusters
Enhancing Survivability, Lifetime, and Energy Efficiency of Wireless NetworksIJRES Journal
In this paper, we focus on improving wireless networks survivability in terms of increasing network lifetime and its energy efficiency via clustering the network in an efficient way. Clustering the network is the procedure of partitioning it into groups, where each of them is known as a cluster. Each cluster elects the station with the highest power to be a cluster head. The remaining stations follow the nearest cluster head. Instead of having each station sends its packets to a remote receiver, the cluster head receives packets from all stations within its cluster, aggregates them, and forwards the resulting packets to the remote receiver. The most significant benefit of clustering the network that we focus on is to decrease distances between sending and receiving stations, which in turn reduces the transmission energy. This reduction in the energy yields an increase in the network lifetime and its survivability.
Cross-layer Design of an Asymmetric Loadpower Control Protocol in Ad hoc Netw...IDES Editor
Cross-layer design is important in wireless ad hoc
network and the power control methods. Power control is the
intelligent selection of transmit power in a communication to
achieve the better performance within the system. Cross-layer
is used to sharing the information between the layers. CLD
using LOADPOWER (LOADPOW) control protocol is reduce
the overall end-end delay in transmission power. So many
power control schemes are dealt in network layer but this
work Power control protocol was done in MAC layer and it
plays a vital role. A MAC approach to power control only does
a local optimization whereas network layer is capable of a
global optimization. Simulation was done in NS-2 simulator
with the performance metrics as throughput, and energy
consumption and end-end delay. The key concept is to improve
the throughput, saves energy by sending all the packets with
optimal transmit power according to the network load,
transmission power was given, when the network load is low,
higher transmission power gives lower end-end delay and viceversa.
Performance Analysis of Mtpr Routing Protocol in Power Deficient Nodepijans
Power conservation in Mobile Ad hoc Network (MANET) is a major challenge even today for researchers.
To conserve it various power aware routing protocols have been proposed. These protocols do not take into
consideration the residual power left in nodes. To find the impact of the same a simulator was designed in
MATLAB-7.01. The routing protocol used in our simulation is Minimum Total Power Routing (MTPR) and
different performance metrics such as path optimality, throughput and hop count were recorded in
presence and absence of power scarce node. The result shows significant impact of power scarce node on
MANET performance.
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.
Energy Efficient Multipath Routing For Mobile Ad Hoc NetworksZac Darcy
Energy consumption is a significant issue in ad hoc networks since mobile nodes are battery powered. In
order to prolong the lifetime of ad hoc networks, it is the most critical issue to minimize the energy
consumption of nodes. In this paper, we propose an energy efficient multipath routing protocol for
choosing energy efficient path. This system also considers transmission power of nodes and residual energy
as energy metrics in order to maximize the network lifetime and to reduce energy consumption of mobile
nodes. The objective of our proposed system is to find an optimal route based on two energy metrics while
choosing a route to transfer data packets. This system is implemented by using NS-2.34. Simulation results
show that the proposed routing protocol with transmission power and residual energy control mode can
extend the life-span of network and can achieve higher performance when compared to traditional ad-hoc
on-demand multipath distance vector (AOMDV) routing protocol.
Energy Efficient Multipath Routing For Mobile Ad Hoc NetworksZac Darcy
Energy consumption is a significant issue in ad hoc networks since mobile nodes are battery powered. In
order to prolong the lifetime of ad hoc networks, it is the most critical issue to minimize the energy
consumption of nodes. In this paper, we propose an energy efficient multipath routing protocol for
choosing energy efficient path. This system also considers transmission power of nodes and residual energy
as energy metrics in order to maximize the network lifetime and to reduce energy consumption of mobile
nodes. The objective of our proposed system is to find an optimal route based on two energy metrics while
choosing a route to transfer data packets. This system is implemented by using NS-2.34. Simulation results
show that the proposed routing protocol with transmission power and residual energy control mode can
extend the life-span of network and can achieve higher performance when compared to traditional ad-hoc
on-demand multipath distance vector (AOMDV) routing protocol.
EEIT2-F: energy-efficient aware IT2-fuzzy based clustering protocol in wirel...IJECEIAES
Improving the network lifetime is still a vital challenge because most wireless sensor networks (WSNs) run in an unreached environment and offer almost impossible human access and tracking. Clustering is one of the most effective methods for ensuring that the relevant device process takes place to improve network scalability, decrease energy consumption and maintain an extended network lifetime. Many researches have been developed on the numerous effective clustering algorithms to address this problem. Such algorithms almost dominate on the cluster head (CH) selection and cluster formation; using the intelligent type1 fuzzy-logic (T1-FL) scheme. In this paper, we suggest an interval type2 FL (IT2-FL) methodology that assumes uncertain levels of a decision to be more efficient than the T1-FL model. It is the so-called energy-efficient interval type2 fuzzy (EEIT2-F) low energy adaptive clustering hierarchical (LEACH) protocol. The IT2-FL system depends on three inputs of the residual energy of each node, the node distance from the base station (sink node), and the centrality of each node. Accordingly, the simulation results show that the suggested clustering protocol outperforms the other existing proposals in terms of energy consumption and network lifetime.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Similar to A CLUSTER BASED STABLE ROUTING PROTOCOL USING BINARY PARTICLE SWARM OPTIMIZATION TOWARDS SERVICE DISCOVERY IN MOBILE AD HOC NETWORK (20)
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
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
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/
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
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.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
To Graph or Not to Graph Knowledge Graph Architectures and LLMs
A CLUSTER BASED STABLE ROUTING PROTOCOL USING BINARY PARTICLE SWARM OPTIMIZATION TOWARDS SERVICE DISCOVERY IN MOBILE AD HOC NETWORK
1. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.4, August 2013
DOI : 10.5121/ijmnct.2013.3404 29
A CLUSTER BASED STABLE ROUTING PROTOCOL
USING BINARY PARTICLE SWARM OPTIMIZATION
TOWARDS SERVICE DISCOVERY IN MOBILE AD HOC
NETWORK
M.Buvana1
and M.Suganthi2
1
Department of Computer Science and Engineering, PSNACET,Dindigul,Tamilnadu,
India
bhuvana_beula@yahoo.co.in
2
ECE,TCE,Madurai,India.
ABSTRACT
A Mobile Ad hoc Network consists of active nodes that can be in motion freely. These networks can be
improved by the use of clusters because of huge congestion in the whole network. In such a system, the
performance of MANET is improved by splitting the whole network into various clusters. The performance
of clustering is improved by the cluster head selection and number of clusters. In this paper, we have
designed a new protocol, Cluster based Stable Routing protocol (CSR) based on Binary Particle Swarm
Optimization (BPSO). The proposed algorithm shows how BPSO can be useful in enhancing the
performance of service discovery in MANET. This algorithm is to select the best cluster head and minimum
number of clusters. Experiments were performed to prove that the proposed method is an efficient method
for clustering in MANET. Also the path stability is combined with clustering with use of remaining battery
power of the nodes.
KEYWORDS
Mobile Ad hoc Network, stable routing protocol, Binary particle swarm optimization, clusters, cluster
head.
1. INTRODUCTION
Mobile ad hoc networks (MANETs) play a critical role in today’s wireless ad hoc network
research. A MANET consists of wireless nodes which can communicate with each other over a
wireless medium. Such a network can be formed spontaneously whenever devices are located
within transmission range. New nodes can join or leave an existing node dynamically, because of
the mobility in wireless networks. MANETs provide unforeseen applications in some new fields.
One such problem is how to create an organizational structure amongst these nodes . The
MANETs is the capability to organize them in an ad hoc method, as it is not feasible to arrange
these nodes into groups. For this reason, we need to group nodes into clusters[1],[2]. The
clustering phenomenon, as we shall see, plays an important role not just in organization
of the network but also can dramatically affect network performance. There are several key
limitations in MANETs that clustering schemes must consider, such as limited energy, network
lifetime, mobility and stability.
Different existing algorithms for the creation of clusters are limited in many routing protocols, as
well as clustering algorithm, such as (i) lowest-ID (ii) node-weight heuristic.
2. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.4, August 2013
30
Lowest-ID [3] is known as identifier based clustering. In this algorithm, ID is assigned to each
node. Periodically, every node broadcasts the list of nodes so that it can be heard. Among the
neighbors, the node with minimum ID is selected as a cluster head. The drawback of this
algorithm leads to battery drainage of certain nodes. Furthermore, it does not try to balance the
load equally across all the nodes.
Weighted clustering algorithms (WCA) [4] depend on the weight of the nodes in the network. In
these algorithms, the node with lower weight among the neighbors is selected as a cluster head.
Although it can increase the stability of clusters, it cannot obtain the optimal number of cluster
heads. Furthermore, calculation and storage of the weight are costly and the overhead induced by
WCA is very high.
In [5] this research, the main objective is towards maximizing the lifetime of wireless ad hoc
networks through energy efficient routing. Furthermore, the factors that control the reduction of
energy in ad hoc networks are shown and the method for load balancing, which is considered as
important factor in MANETs, is proposed. But as in many researches, the proposed method for
load balancing is the theoretical one and hence the correctness of the method is not guaranteed
since there are no results of simulation.
Li Q, Aslam J, Rus D [6] describes Online Power-aware Routing in Wireless Ad-hoc Networks.
This paper describes online power-aware routing in large wireless ad-hoc networks for
applications where the message order is not known. The main purpose of this research is to
optimize the lifetime of the network. Here an approximation algorithm called max-min z Pmin that
has a good empirical competitive ratio is proposed. To ensure scalability, a second online
algorithm for power-aware routing is introduced. This hierarchical algorithm is called zone-based
routing.
In this paper, we propose a routing protocol towards service discovery protocol for MANET,
cluster based stable routing protocol (CSR) based on binary particle swarm optimization (BPSO).
The main objective is to minimize the number of cluster, election of cluster head with efficient
energy consumption and maximizing the network lifetime. The rest of this paper is organized as
follows. Section 2 consists of power aware routing that includes the nodes which are having the
optimized power in the path. Section 3 introduces definitions and models like system model,
energy model and transmission range. Section 4 provides the proposed work with Novel Binary
Particle swarm optimization is applied to optimize the cluster head election procedure. The
simulation results have demonstrated its performance improvement in terms of packet delivery
ratio and network lifetime is explained in section 5.
2. POWER AWARE ROUTING
Commonly routing is the very important part in MANET. Until now, so many protocols have
been proposed for routing. The working of each protocol is different from each other and each has
their own benefits and limitations.The purpose behind this method is to send the message as
quickly as possible. But this should not be considered as the best path at all times. Because if the
battery power of any node in the selected path is very low then the message cannot be transmitted
through that path at any cost because in the middle of the transmission, the link may get broken
down due to insufficient power. In the network shown below, consider the path 1-6-3 as the
shortest path. In Fig 1, node1 starts transmission then the power gets depleted to some extent.
3. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.4, August 2013
31
Fig. 1. Status of power during initial transmission
Fig. 2. Status of power after first transmission
Fig. 3. Status of power before final transmission
So this problem has to be resolved by the following ways
(a) The path has to reconstructed
(b)The message has to be retransmitted.
But here the power of the nodes got wasted unnecessarily. Now all these problems occur because
of the instability of the selected paths. Hence, the lasting battery power of the nodes in the
network should be taken into account during the route discovery process in MANETS to avoid
such link breakage during the message transmission. This is the concept of power aware
algorithm proposed so far.
3.SYSTEM MODEL AND DEFINITIONS
3.1.System Model
We consider a distributed heterogeneous wireless network where data tends to be correlated in
both time and space and nodes are assumed to be time synchronized. The nodes are organized
into clusters based on power calculation and distance based and spatial correlation. Each cluster
4. Interna
has an
topolog
networ
, each
nodes i
}An ex
cluster
3.2 En
All the
energy
during
where
When
selectio
receive
model:
Where
wavele
the tran
The re
detecte
correct
The tot
ational Journal o
aggregator o
gy is modele
rk and E repre
cluster head
in Ci are repre
xample of N
s are connect
nergy Mode
e nodes in th
y level (Eth) an
route discov
it is stored i
the residual
on by the d
ed signal (r(t
:
PT and PR
ength, d is the
nsmitting and
eceiver sensit
ed is, PRmin as
t reception of
tal amount of
of Mobile Netw
or cluster hea
ed as an undi
esents an edg
CHi has k sp
esented by Zk
(Ci) cluster i
ted.
Fig. 4.
el
he given area
nd each node
very. The resi
in the routing
energy is les
estination. O
t)) strength w
TGTPRP
are transmi
e distance betw
d receiving an
losPath
tivity, the mi
s from (1). Th
f signals. The
f energy consu
work Communic
ad denoted a
irected graph
ge which conn
patially corre
k = { Zk ;k=1
is shown in F
. Example of cl
a have same
must mainta
idual battery
g tables to m
s than thresh
On receiving
which holds t
2
t
h
RGT
d
r
h
itter power a
ween the send
ntenna respect
R
P-
T
Pss
inimum recei
he receiver st
sender uses t
umed per tran
cations & Telem
s CHi and a
h G where G
nects two nod
elated neighbo
1…n}, i.e., N(
Figure 4. The
luster with its m
transmit pow
ain the value i
energy value
make routing d
hold energy v
the RREQ
the following
2
and receiver
ders and the r
tively. Hence
ived power n
trength is the
this PR as PRm
nsmitted pack
matics ( IJMNC
set of nodes
= (C, E). C
des within a c
oring nodes.
(Ci) = { Zk Є
e clusters are
member N(Ci)
wer and each
in their routin
e can be obta
decisions bas
value, that no
the intermed
g relationship
power resp
receiver and G
the node calc
necessary for
e only one par
min for further t
ket is written a
CT) Vol. 3, No.4
as Zk Є Ci.
represents c
cluster. Within
The k spatial
Ci |( Zk, CHi)
e formed suc
h node select
ng table to sel
ained to the n
sed on the ba
de is avoided
diate nodes c
p for two-ray
(1)
ectively, λ i
GT GR are the
culates the pa
(2)
r a signal to
rameter whic
transmissions
as
4, August 2013
32
The network
clusters in the
n a cluster C
lly associated
) Є E}U{ CH
ch that all the
ts a threshold
lect the nodes
network layer
attery energy
d in the route
calculates the
y propagation
is the carrier
e unity gain of
ath loss using
be correctly
ch decides the
s.
2
k
e
Ci
d
Hi
e
d
s
r
.
e
e
n
r
f
y
e
5. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.4, August 2013
33
b
L/R*
T
P (3)
Where
α = transmitted energy
PT = transmitter power
L = packet length
Rb = data rate or bandwidth
The total amount of energy consumed per received packet is written as
b
L/R*
minR
P (4)
where, β, PRmin are the energy consumed in received packets and minimum receiving power
respectively.
The node then calculates the residual energy ER using the following parameters:
Σ – Initial energy taken by the node
α – Energy consumed in transmitting packets
β – Energy consumed in receiving packets
γ – Energy consumption in idle state.
RE (5)
3.3.Transmission Range
Distance and the transmission power are generated randomly for the nodes. Average distance and
mean transmission power are calculated. Max distance of the nodes generated is taken as the
radius for coverage area in transmission range. Average transmission range is computed with
distance of the nodes.
(
minR
P
r
G
t
G
t
P
2
c )f4C
tx
TR (6)
This transmission range is taken as the parameter to decide the cluster head. If a node has this
value with all other nodes, that node will be selected as the cluster head.
4.PROPOSED WORK
4.1.Problem Statement
In this proposed work, the remaining battery power of the node is calculated and then routing
decision will be made. And identify the nodes those are having the higher capacity. Based on the
power of the node cluster head (CH) is elected then the clusters are formed based on the
transmission range that is calculated as per equation (6). BPSO is applied to optimize the number
of clusters as well as manage the load among the clusters.
6. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.4, August 2013
34
4.2.Method Overview
In this method, during route discovery, the remaining battery power of each node is first
calculated and then it is compared with a pre determined threshold value. A node is approved
only if it is greater than threshold value (Eth) to make sure that there is enough power for the node
to forward the packets to its neighbours. In fig 5, the power of node 6 is compared with the
threshold and it is low.
Fig. 5. Checking power condition for the first neighbor of source
So remove all the paths involving 6 and move to next neighbour which is node 2 as shown in fig
5
Fig. 6. Checking power condition for the next neighbor of source
Node 2 also fails, and node 5 satisfies the condition and now move to its neighbour node 4 as
shown in fig 6.
Fig. 7. Situation in which all the nodes of a path satisfies the power condition
7. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.4, August 2013
35
If the condition fails, then that node can be simply removed from the consideration, not only the
node but also all the paths in which the node gets involved. So by this method, the entire route
discovery process is simplified by considering only one-third of the total number of nodes. In
addition to this, a special case has been dealt even though it is very rare. The following pseudo
code describes the steps about, when none of the nodes in the network meet the situation, then the
threshold value is decreased by half and the procedure is repeated until a node which satisfies the
condition is identified. As a result the stability of the paths in which the message has to be
transmitted gets increased and also it avoids unnecessary power reduction, which is one of the
very limited resources in MANETS.
/****** pseudo code for path stability *****/
Begin
BPi initial power of nodes;
for each node ‘n’ in the network
calculate BPi;
L:
for i 0 to n
if(BP[Ni] >THi)
Forward to adja(Ni)
Else
Remove(Ni)
While(BP[Ni] != NULL)
THi = THi/2;
i++;
GoTo L;
Improve the path stability by avoid power depletion;
4.3.Novel Binary Particle Swarm Optimization
Kennedy and Eberhart proposed a discrete binary version of PSO for binary problems [3].In the
binary PSO, the particle's personal best and global best is modernized .The difference is that
velocities of the particles. This velocity must be controlled within the range of [0, 1]. The velocity
of each particle is obtained using the equation:
11
1
,,,
,,22
,,11,
,
tvtxtx
txtgrc
txtprctv
tv
jijiji
jijibest
jijibestji
ji
(7)
where vi,j is the velocity of particle, xi,j is the position of the particle, t is the number of iterations,
c1, and c2 are two positive constants, referred to as the cognitive and social acceleration factors
respectively, r1 and r2 are random numbers within the range [0,1], and w is the inertia weight.
The particle’s best position (pbest) is denoted as pibeset,j,the best position among all particles in the
swarm is denoted as gibeset,j.
8. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.4, August 2013
36
minmin
max
maxmax
)1(,
)1(,1
)1(,
1(
vtvifv
vtviftv
vtvifv
tvh
i
ii
i
i (8)
Here vi depends on the sigmoid function
ivivsig
1
1
)( (9)
Then the position of the particle is updated as[9]
)1(()(3,1
)1(()(3,0
)1(
tvsigtrif
tvsigtrif
tx
i
i
i (10)
1,
0,
,
0
,
,
1
,
,
jiji
jiji
ji
xifv
xifv
v
(11)
Where r3 is a random number within the range [0,1].
22
0
,22
0
,
22
1
,22
1
,
11
0
,11
0
,
11
1
,11
1
,
2,2,1
2,2,1
1,1,0
1,1,1
rcdandrcdThenpif
rcdandrcdThenpif
rcdandrcdThenpif
rcdandrcdThenpif
jiji
j
gbest
jiji
j
gbest
jiji
j
ibest
jiji
j
ibest
(12)
2,1,
1
,
1
,
1
,
1
, jijijiji ddwvv (13)
2,1,
0
,
0
,
0
,
0
, jijijiji ddwvv (14)
4.4.Cluster Formation
The proposed algorithm is a fully distributed algorithm as in section 3.1. All nodes in the mobile
network share the same responsibility and act as a cluster head. The proposed protocol takes
rounds where each round begins with a setup phase at the time cluster is formed. At the starting
phases, all the nodes share their energy level as per the energy model in section 3.2, to its
neighbor node. To ensure that only node with sufficient energy and transmission range are
selected as a cluster head (CH) as per section 3.3. The node with an energy above the threshold
value is suitable to be a cluster head for this round. During second phase, Novel Binary particle
swarm optimization is used to improve the performance of the cluster head election procedure.
The aim is that the numbers of clusters are minimized while the load in the network is balanced
among the clusters.
9. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.4, August 2013
37
4.4.1.Cluster head election procedure.
For each particle in the population every dimension of the particle is traversed according to the
order of their experience. Cluster head election procedure is not a periodic and it is invoked at
starting and rarely when the network node joins in the cluster or moves away from the cluster
4.4.2.Initialize cluster head.
Cluster head candidate have the possible to become the cluster head for the cluster in the current
round. Cluster head candidate is selected based on the threshold energy (Eth) and based on the
transmission range as per equation (8).
Nn
C
pnCjZ pnCHjZ pndf
..2,1
max1
(15)
where zj member of the node in the cluster
CHp cluster head of the particle
||
pn
C Number of nodes that belongs to cluster cn of particle p.
2
11
))()(( jpn
s
jpn
pnCHjZ
zCHzCHd
N
n
pn
N
i
CHE
zE
f
i
1
1
)(
)(
2
(16)
tx
TRvudifrangeofout
tx
TRvudif
f
),(
),(r2
3
(17)
Where,
TRtx-Transmission Range based on the distance.
In this approach, a local lbest is found for each swarm member selected from the ‘closest’ two
swarm members. The distance between each particle and its neighbour’s particle that computed
the proximity depends on the first function, f1. Consequently, the preference of local optima
among the neighbours of a particle is based upon the second function, f2. The Third function f3
describes the optimal function for the transmission range through the nodes distance. In the next
sub-section, the steps of the algorithm will be described in detail.
/*Algorithm for cluster formation*/
1. Initialize swarm Xi, the position of the particles are initialized. Elements of Xi are
randomly selected from the binary values o and 1.
2. Initialize the randomly selected zk among the eligible cluster head candidate.
3. Particles position using the equation(7)
4. for each Xi in swarm find the function,
5. Assign each node ni, i =1,2……N in the network to the closest cluster head CH.
a. Assign each node ni,i=1,2……N in the network to the Closest cluster head CH.
10. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.4, August 2013
38
b. Calculate the function f1, f2, f3 using (15)(16)(17).
6. Evaluate the performance of each particle to its best presentation.
if(f1(Xi(t+1)<f1(Pibest )and(f2(Xi(t+1)<f2(Pibest )and f3
f1(Pibest )= f1(Xi(t+1))
f2(Pibest )= f2(Xi(t+1))
f3(Pibest)= f3(Xi(t+1))
Pibest = Xi(t+1)
7. Compare the performance of each particle to the Gbest particle.
if(f1(Xi(t+1)<f1(Gibest )and (f2(Xi(t+1)<f2(Gibest )
f1(Gibest )= f1(Xi(t+1))
f2(Gibest )= f2(Xi(t+1))
f3(Gibest )= f3(Xi(t+1))
Gibest = Xi (t+1)
8. Apply the velocity update on all particles 10
j
vandjv
9. Apply the binary position update using (10)(11)
10. Calculate the velocity change of the bits j
cv
.
11. Generate the random variable rij in the range (0,1).Move each particle to new position
using (12).
12. Reinitialize M.
13. Repeat steps 2 to 11 until the maximum iteration is reached.
5.SIMULATION AND RESULTS
In this section, we evaluate the performance of our proposed technique via simulations. We The
network simulation model was built using MATLAB. The BPSO starts with a “swarm” of nodes
randomly generated. As shown in Figure 8 is a randomly deployed network with equal initial
energy of 0.25 J. A linear decreasing inertia weight value w is 0.8 and coefficients c1 and c2 both
are set to 2 as proposed in [7]. r1 and r2 are random numbers within the range [0,1]. In the
simulation wireless network composed by 400 nodes, for optimization, we have used 20 particles,
which are denoted by all nodes coordinates, for our experiment nodes are randomly distributed in
a 300m x300 m area square mobile ad hoc network shown in figure(8), and the maximum number
of iterations we are running is 6000. The transmission range of each node in the network and the
maximum speed (velocity) of the particle is set as 5 units and 50.Initially cluster head candidate is
selected based on the Residual energy (ER) which is calculated from the Eq. (5) and based on the
transmission range as per equation (7).Based on the transmission range nodes are moved and
located in their final position. For optimizing the clusters functions are calculated.
The nodes are organized into clusters by the cluster head candidate. Each particle will be
estimated by the functions in equations (15) (16) (17) in each iterations. Our purposed work is to
find the optimal location of cluster heads. As can be seen in Figure 9, our proposed algorithm
CSR-BPSO locates minimum number of clusters (3 clusters) in the whole network than
SEP[8],LEACH[9], PSO-C in the 300 x 300 m area with a transmission range of 35. The
proposed algorithm CSR-BPSO mechanism better than the other algorithms in terms of produce
the average number of clusters. The reason to find the best solution is that the total fitness value
should be minimal. The proposed work results confirm the network with minimum number of
clusters that can decrease the routing cost of the network.
11. Interna
For the
numbe
time. I
the pow
conside
is repe
useful
environ
ational Journal o
e current pap
er of clusters
nitially the re
wer of each
ered as failed
eated. Then th
to reduce t
nment. The
of Mobile Netw
per, Life time
are optimize
equired powe
node with th
d paths. If no
he message i
the number
clusters are
work Communic
Fig. 8. N
Fig. 9.optimiz
e of a node i
ed. Our analy
er is set as th
he threshold.
paths availab
is transmitted
of hops and
huge when
cations & Telem
Node Deployme
zed cluster form
is maximized
ysis focuses t
e threshold a
If it fails, all
ble, the thresh
d via the disc
d the delays
the transmis
matics ( IJMNC
ent
mation
d and the num
the energy ef
and the route
l the paths in
hold is reduce
covered path
s of packets
ssion ranges
CT) Vol. 3, No.4
mber of clust
fficiency and
is discovered
nvolving that
ed by half an
with enough
transmitted
of nodes ar
4, August 2013
39
ter heads and
d network life
d by checking
node will be
nd the process
h power. It is
in a cluster
re little. The
9
d
e
g
e
s
s
r
e
12. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.4, August 2013
40
evaluation results show that the proposed method performs better than other algorithms in a
mobile ad hoc network environment.
The simulation results have been compared with various existing protocols. Table I describes the
Life Time of the node for different amount of energy and it also shows the comparisons of SEP,
LEACH, PSO-C with our proposed protocol CSR-BPSO algorithm. It shows when the first node
lost their energy during different energy levels 0.25J, 0.5J, 1J. Our proposed CSR-BPSO
algorithm has the highest lifetime compare to the other protocols.
Table 1 Lifetime of the Node
Protocol First Node Dies Last Node Dies Energy(J)
SEP 590 1654 0.25
LEACH 420 806
PSO-C 801 1809
CSR-BPSO 1011 2010
SEP 1001 2715 0.5
LEACH 934 2951
PSO-C 1501 3001
CSR-BPSO 1901 3125
SEP 1983 4100 1
LEACH 1851 3961
PSO-C 2002 4510
CSR-BPSO 2251 5805
The performance of the CSR-BPSO algorithm is compared with the well known algorithm
LEACH, SEP and PSO-C. In every round a set of new cluster heads is selected and the member
nodes send packet to their connected cluster head.
Figure 10 demonstrates the lifetime of the nodes in the clusters. The Number of nodes that stay on
active after each round. Initial energy is assigned as 0.25J.This figure shows that the network life
time for CSR-BPSO increases considerably compared to PSO-C, LEACH, and SEP. This
development is based on the following reasons, Firstly considerable energy saving is achieved by
CSR-BPSO algorithm through the use of dynamic clustering with the proposed functions. By
using the proposed dynamic clustering method, the CSR-BPSO algorithm can attain the minimum
number of clusters all the way through the simulations which leads to minimum energy.
Secondly, the functions can generate improved network partitioning with smallest amount
network energy dissipation. Here the total energy efficiency is raised nearly 48% than the PSO-C,
LEACH, SEP. After 5805 rounds only the proposed algorithm nodes are in dead situation, but in
the case of PSO-C, LEACH, SEP all the nodes are lost their energy nearly 806 rounds itself.
13. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.4, August 2013
41
Fig. 10. Lifetime of the nodes
Figure 11 gives the results of amount of packet delivered in the network. Equation (18) shows the
ratio between number of packets received and number of packets transmitted. This parameter
finds the fraction of successful packet reception. In figure 11, the ratio of packet delivery in the
cluster for various numbers of nodes in Ad hoc network environment. In our algorithm, the ratio
of packet delivery is high by maintaining a stable route by considering residual energy and
transmission power taken from PHY and MAC layers. It reduces the rate of packet loss due to
link break by choosing an alternate path according to residual energy and transmission power.
Fig. 11. Packet Delivery Ratio vs Number of Nodes
14. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.4, August 2013
42
Packet delivery ratio (18)
Furthermore, we also observed in the above Figures that the network lifetime increased to a
certain length in the cluster formation scenario. In our proposed work network life time will be
increased when compare to the LEACH, SEP, PSO-C. With this increase, the Network lifetime
was further prolonged when compare to the other cluster formation technique. This scheme can
produce results close to the optimal result.
6.CONCLUSION
In this paper, we have proposed a CSR-BPSO algorithm for routing towards service discovery
using a binary particle swarm optimization algorithm. Our algorithm improves the routing
function by taking into account of number of clusters and load among the clusters. It tries to
minimize the number of clusters as well as cluster heads.
The Performance results show a minimum number of clusters in every round during simulation.
Furthermore, the proposed algorithm gives the network lifetime is 84.34% and packet delivery
ratio is more compared to other algorithms such as LEACH, SEP, and PSO-C.
REFERENCES
[1]. Dhurandher.S.K., & Singh.G.V. (2006). “Power Aware Clustering Technique in Wireless Ad Hoc
Networks”, International Symposium on Ad Hoc and Ubiquitous Computing, ISAUHC '06.
[2]. Bandyopadhyay S, Coyle EJ. “An energy efficient hierarchical clustering algorithm for wireless
sensor networks”.In IEEE INFOCOM 2003; 1713–1723.
[3]. Kennedy, J.; Eberhart, R.C. (1997),” A discrete binary version of the particle swarm algorithm”, IEEE
Conference on Systems, Man, and Cybernetics, 1997.
[4]. Vieu .V.B., Nasser .N., & Mikou .N. (2006). “A Weighted Clustering Algorithm Using Local Cluster-
heads Election for QoS in MANETs.” IEEE GLOBECOM.
[5]. Natalia Vassileva, Francisco Barcelo-Arroyo, “A Survey of Routing Protocols for Maximizing the
Lifetime of Ad Hoc Wireless Networks”, International Journal of Software Engineering and Its
Applications, Vol. 2, No. 3, July, 2008
[6]. Nen-Chung Wang, Jong-Shin Chen, Yung-Fa Huang, Yu-Li Su, “A Power-Aware Multicast Routing
Protocol for Mobile Ad-hoc Networks With Mobility Prediction”, Wireless Pers Communication,
2007
[7]. Mojtaba Ahmadieh Khanesar, Hassan Tavakoli, Mohammad Teshnehlab andMahdi Aliyari
Shoorehdeli K N. Toosi” A Novel Binary particle swarm algorithm”, Mediterranean Conference on
Control & Automation, pp 1-6,.2007.
[8]. Georgios Smaragdakis, Ibrahim Matta & Azer Bestavros, (2004) “SEP: A Stable Election Protocol for
Clustered heterogeneous wireless Sensor Networks”, Second International Workshop on Sensor and
Actuator Network Protocols and Applications (SANPA -04).
[9]. Fan Xiangning & Song Yulin, (2007) “Improvement on LEACH Protocol of Wireless Sen-sor
Network”, Pro. International Conference on Sensor Technologies and Applications,EEE2007.
15. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.4, August 2013
43
M.Buvana has over 9 years of teaching experience and is currently working as a Associate
Prof in PSNA College of Engineering and Technology. She finished her bachelor of
Engineering (computer science) at PSNA College of engineering and Technology, Dindigul
in the year 2004. And She completed her M.E in PSNA College of engineering and
Technology in 2008. She published two papers in International journal and she has
published papers in the 7 national and 5 International and IEEE conferences such as ICoAC
2011,ICICCA 2013,etc.. She is pursuing PhD degree in the field of Mobile communication at Anna
University Chennai, India.
M.Suganthi is currently working as Professor of Department of Electronics and
Communication Engineering in Thiyagaraja College of Engineering, Madurai. She
graduated her B.E. in Electronics and Communication Engineering from Thiyagaraja
College of Engireeing, Madurai, M.E. in Communication Systems from P.S.G College of
Technology, Coimbatore, and Ph.D in Mobile Com munication from Madurai Kamaraj
University, Madurai. She has been an educator in the technical teaching society for the past
23 years. She has published various papers about the wireless communication in different conferences and
journal and she has guided 6 research scholars.