IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Load balancing in public cloud combining the concepts of data mining and netw...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Wireless Ad Hoc Networks comprise a fast developing research area with a vast spectrum of
applications. Wireless sensor network systems enable the reliable monitoring of a variety of environments
for both civil and military applications. The Energy efficiency continues to be a key factor in limiting the
deployability of ad-hoc networks. Deploying an energy efficient system exploiting the maximum lifetime
of the network has remained a great challenge since years. The time period from the instant at which the
network starts functioning to the time instant at which the first network node runs out of energy, i.e. the
network lifetime is largely dependent on the system energy efficiency. In this paper, we look at energy
efficient protocols, which can have significant impact on the lifetime of these networks. The cluster heads
get drain out maximum energy in the wireless ad hoc networks. We propose an algorithm that deals with
minimizing the rate of dissipation of energy of cluster heads. The algorithm LEAD deals with energy
efficient round scheduling of cluster head allocation of nodes and then followed by allocation of nodes to
the cluster heads maximizing network lifetime using ANDA [1, 2]. We compare our results with the
previous works.
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
Redundant Actor Based Multi-Hole Healing System for Mobile Sensor NetworksEditor IJCATR
In recent years, the Mobile Wireless Sensor Network
is the emerging solution for monitoring of a specified region of
interest. Several anomalies can occur in WSNs that impair their
desired functionalities resulting in the formation of different
kinds of holes, namely: coverage holes, routing holes. Our
ultimate aim is to cover total area without coverage hole in
wireless sensor networks. We propose a comprehensive solution,
called holes detection and healing. We divided our proposed
work into two phases. The first phase consists of three sub- tasks;
Hole-identification, Hole-discovery and border detection. The
second phase treats the Hole-healing with novel concept, hole
healing area. It consists of two sub-tasks; Hole healing area
determination and node relocation.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
International Journal of Advanced Smart Sensor Network Systems (IJASSN)ijcseit
The placement of base stations in wireless sensor networks affect the energy consumption for
communication between sensor node and base station. In this paper we analyzed the performance of the
zone based clustering protocol [2] under varying position of base stations, different zone sizes and the
effect on network life time with multiple base stations. While evaluating the communication overhead of
various cluster sizes, we observed that the optimal cluster size for a given network is complex, depending
on a range of parameters. Simulation results show that communication overhead decreases as we increase
the number of zone in the network. We show that placing multiple base stations in place of single base
station in zone based routing protocol enhance the network life time.
Load balancing in public cloud combining the concepts of data mining and netw...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Wireless Ad Hoc Networks comprise a fast developing research area with a vast spectrum of
applications. Wireless sensor network systems enable the reliable monitoring of a variety of environments
for both civil and military applications. The Energy efficiency continues to be a key factor in limiting the
deployability of ad-hoc networks. Deploying an energy efficient system exploiting the maximum lifetime
of the network has remained a great challenge since years. The time period from the instant at which the
network starts functioning to the time instant at which the first network node runs out of energy, i.e. the
network lifetime is largely dependent on the system energy efficiency. In this paper, we look at energy
efficient protocols, which can have significant impact on the lifetime of these networks. The cluster heads
get drain out maximum energy in the wireless ad hoc networks. We propose an algorithm that deals with
minimizing the rate of dissipation of energy of cluster heads. The algorithm LEAD deals with energy
efficient round scheduling of cluster head allocation of nodes and then followed by allocation of nodes to
the cluster heads maximizing network lifetime using ANDA [1, 2]. We compare our results with the
previous works.
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
Redundant Actor Based Multi-Hole Healing System for Mobile Sensor NetworksEditor IJCATR
In recent years, the Mobile Wireless Sensor Network
is the emerging solution for monitoring of a specified region of
interest. Several anomalies can occur in WSNs that impair their
desired functionalities resulting in the formation of different
kinds of holes, namely: coverage holes, routing holes. Our
ultimate aim is to cover total area without coverage hole in
wireless sensor networks. We propose a comprehensive solution,
called holes detection and healing. We divided our proposed
work into two phases. The first phase consists of three sub- tasks;
Hole-identification, Hole-discovery and border detection. The
second phase treats the Hole-healing with novel concept, hole
healing area. It consists of two sub-tasks; Hole healing area
determination and node relocation.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
International Journal of Advanced Smart Sensor Network Systems (IJASSN)ijcseit
The placement of base stations in wireless sensor networks affect the energy consumption for
communication between sensor node and base station. In this paper we analyzed the performance of the
zone based clustering protocol [2] under varying position of base stations, different zone sizes and the
effect on network life time with multiple base stations. While evaluating the communication overhead of
various cluster sizes, we observed that the optimal cluster size for a given network is complex, depending
on a range of parameters. Simulation results show that communication overhead decreases as we increase
the number of zone in the network. We show that placing multiple base stations in place of single base
station in zone based routing protocol enhance the network life time.
Performance of the Maximum Stable Connected Dominating Sets in the Presence o...csandit
The topology of mobile ad hoc networks
(
MANETs
)
change dynamically with time. Connected
dominating sets
(
CDS
)
are considered to be an effective topology for net
work-wide broadcasts
in MANETs as only the nodes that are part of the CD
S need to broadcast the message and the
rest of the nodes merely receive the message. Howev
er, with node mobility, a CDS does not exist
for the entire duration of the network session and
has to be regularly refreshed
(
CDS
transition
)
. In an earlier work, we had proposed a benchmarkin
g algorithm to determine a
sequence of CDSs
(
Maximum Stable CDS
)
such that the number of transitions is the global
minimum. In this research, we study the performance
(
CDS Lifetime and CDS Node Size
)
of the
Maximum Stable CDS when a certain fraction of the n
odes in the network are static and
compare the performance with that of the degree-bas
ed CDSs. We observe the lifetime of the
Maximum Stable CDS to only moderately increase
(
by a factor of 2.3
)
as we increase the
percentage of the static nodes in the network; on t
he other hand, the lifetime of the degree-based
CDS increases significantly
(
as large as 13 times
)
as we increase the percentage of static nodes
from 0 to 80
.
Secure multipath routing scheme using keyijfcstjournal
Multipath routing in WSN has been a long wish in security scenario where nodes on next-hop may be
targeted to compromise. Many proposals of Multipath routing has been proposed in ADHOC Networks but
under constrained from keying environment most seems ignorant. In WSN where crucial data is reported by
nodes in deployment area to their securely located Sink, route security has to be guaranteed. Under
dynamic load and selective attacks, availability of multiple secure paths is a boon and increases the
attacker efforts by many folds. We propose to build a subset of neighbors as our front towards destination
node. We also identified forwarders for query by base station. The front is optimally calculated to maintain
the security credential and avail multiple paths. According to our knowledge ours is a novel secure
multipath routing protocol for WSN. We established effectiveness of our proposal with mathematical
analysis.
Congestion Control through Load Balancing Technique for Mobile Networks: A Cl...IDES Editor
The Optimal Routing Path (ORP) for mobile
cellular networks is proposed in this paper with the
introduction of cluster-based approach. Here an improved
dynamic selection procedure is used to elect cluster head.
The cluster head is only responsible for the computation of
least congested path. Hence the delay is reduced with the
significant reduction on the number of backtrackings.
Securing Privacy of User’s Data on Cloud Using Back Propagation Neural Networkstheijes
To improve the accuracy of learning result, in practice multiple parties may collaborate through conducting joint Backpropagation neural network learning on the union of their respective data sets. During this process no party wants to disclose her/his data to others. Existing schemes supporting this kind of collaborative learning are either limited in the way of data partition or just consider two parties. There lacks a solution that allows two or more parties, each with an arbitrarily portioned data set, to collaboratively conduct the learning. this paper solves this open problem by utilizing the power of cloud computing. In our proposed scheme, each party encrypts his/her private data locally and uploads the ciphertexts into the cloud. The cloud then executes most of the operations pertaining to the learning algorithms over ciphertexts without knowing the original private data. To support flexible operations over ciphertexts, we adopt and tailor the BGN ‘doubly homomorphic’ encryption algorithm for the multi-party setting..
Localization Algorithms under Correlated Shadowing in Wireless Sensor NetworksEditor IJCATR
The existing models for radio channel shadowing was considered to be independent. However the
shadowing on real world links are dependent. In this paper we review different wireless sensor network localization
algorithms which considers the the shadowing between different links to be correlated. For this we have used the
NeSH model.The shadowing between the links is modelled as log normal shadowing path loss model. The
algorithms in the different works are analysed and their results are discussed.
International Refereed Journal of Engineering and Science (IRJES)irjes
International Refereed Journal of Engineering and Science (IRJES) is a leading international journal for publication of new ideas, the state of the art research results and fundamental advances in all aspects of Engineering and Science. IRJES is a open access, peer reviewed international journal with a primary objective to provide the academic community and industry for the submission of half of original research and applications.
Selection of Energy Efficient Clustering Algorithm upon Cluster Head Failure ...ijsrd.com
Wireless Sensor Network (WSN) applications have increased in recent times in fields such as environmental sensing, area monitoring, air pollution monitoring, forest res detection, machine health monitoring, and landslide detection. In such applications, there is a high need of secure communication among sensor nodes. There are different techniques to secure network data transmissions, but due to power constraints of WSN, group key based mechanism is the most preferred one. Hence, to implement scalable energy efficient secure group communication, the best approach would be hierarchical based like Clustering. In most of the WSN designs based on clustering, Base Station (BS) is the central point of contact to the outside world and in case of its failure; it may lead to total disconnection in the communication. Critical applications like these cannot afford to have BS failure as it is a gateway from sensor networks to the outside world. In order to provide better fault tolerant immediate action, a new BS at some other physical location will have to take the charge. This may lead to a total change in the hierarchical network topology, which in turn leads to re-clustering the entire network and in turn formation of new security keys. Therefore, there is a need to find a suitable algorithm which clusters sensor nodes in such a way that when a BS fails and a new BS takes the charge, new group key gets established with minimum computation and less energy consumption.
Erca energy efficient routing and reclusteringaciijournal
The pervasive application of wireless sensor networks (WNSs) is challenged by the scarce energy constraints of sensor nodes. En-route filtering schemes, especially commutative cipher based en-route filtering (CCEF) can saves energy with better filtering capacity. However, this approach suffer from fixed paths and inefficient underlying routing designed for ad-hoc networks. Moreover, with decrease in remaining sensor nodes, the probability of network partition increases. In this paper, we propose energy-efficient routing and re-clustering algorithm (ERCA) to address these limitations. In proposed scheme with reduction in the number of sensor nodes to certain thresh-hold the cluster size and transmission range dynamically maintain cluster node-density. Performance results show that our approach demonstrate filtering-power, better energy-efficiency, and an average gain over 285% in network lifetime.
Energy Curtailing with Huddling Practices with Fuzzy in Wireless Sensor Networkijsrd.com
Wireless sensor is a mounting field and energy conservation is always being in the peak challenges. Researchers have gone all the way through architectures and topologies that permit energy proficient operation in wireless sensor network. Clustering being stretchy helps to supplely mould the network according to the needs. Cluster head election and cluster formation is previously investigated by numerous researchers. In this paper, a proposed novel scheme the Fuzzy Abiding Cluster Head Formation Protocol (FACFP) that uses Mamdani’s fuzzy inference system in the process during cluster formation. We demonstrate that using multiple parameters in cluster formation can minimize the usage of energy. We will compare our proposed technique with well-known existing protocols to show that using multi parameter FIS enhances network lifetime and conserves energy utilization.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Performance of the Maximum Stable Connected Dominating Sets in the Presence o...csandit
The topology of mobile ad hoc networks
(
MANETs
)
change dynamically with time. Connected
dominating sets
(
CDS
)
are considered to be an effective topology for net
work-wide broadcasts
in MANETs as only the nodes that are part of the CD
S need to broadcast the message and the
rest of the nodes merely receive the message. Howev
er, with node mobility, a CDS does not exist
for the entire duration of the network session and
has to be regularly refreshed
(
CDS
transition
)
. In an earlier work, we had proposed a benchmarkin
g algorithm to determine a
sequence of CDSs
(
Maximum Stable CDS
)
such that the number of transitions is the global
minimum. In this research, we study the performance
(
CDS Lifetime and CDS Node Size
)
of the
Maximum Stable CDS when a certain fraction of the n
odes in the network are static and
compare the performance with that of the degree-bas
ed CDSs. We observe the lifetime of the
Maximum Stable CDS to only moderately increase
(
by a factor of 2.3
)
as we increase the
percentage of the static nodes in the network; on t
he other hand, the lifetime of the degree-based
CDS increases significantly
(
as large as 13 times
)
as we increase the percentage of static nodes
from 0 to 80
.
Secure multipath routing scheme using keyijfcstjournal
Multipath routing in WSN has been a long wish in security scenario where nodes on next-hop may be
targeted to compromise. Many proposals of Multipath routing has been proposed in ADHOC Networks but
under constrained from keying environment most seems ignorant. In WSN where crucial data is reported by
nodes in deployment area to their securely located Sink, route security has to be guaranteed. Under
dynamic load and selective attacks, availability of multiple secure paths is a boon and increases the
attacker efforts by many folds. We propose to build a subset of neighbors as our front towards destination
node. We also identified forwarders for query by base station. The front is optimally calculated to maintain
the security credential and avail multiple paths. According to our knowledge ours is a novel secure
multipath routing protocol for WSN. We established effectiveness of our proposal with mathematical
analysis.
Congestion Control through Load Balancing Technique for Mobile Networks: A Cl...IDES Editor
The Optimal Routing Path (ORP) for mobile
cellular networks is proposed in this paper with the
introduction of cluster-based approach. Here an improved
dynamic selection procedure is used to elect cluster head.
The cluster head is only responsible for the computation of
least congested path. Hence the delay is reduced with the
significant reduction on the number of backtrackings.
Securing Privacy of User’s Data on Cloud Using Back Propagation Neural Networkstheijes
To improve the accuracy of learning result, in practice multiple parties may collaborate through conducting joint Backpropagation neural network learning on the union of their respective data sets. During this process no party wants to disclose her/his data to others. Existing schemes supporting this kind of collaborative learning are either limited in the way of data partition or just consider two parties. There lacks a solution that allows two or more parties, each with an arbitrarily portioned data set, to collaboratively conduct the learning. this paper solves this open problem by utilizing the power of cloud computing. In our proposed scheme, each party encrypts his/her private data locally and uploads the ciphertexts into the cloud. The cloud then executes most of the operations pertaining to the learning algorithms over ciphertexts without knowing the original private data. To support flexible operations over ciphertexts, we adopt and tailor the BGN ‘doubly homomorphic’ encryption algorithm for the multi-party setting..
Localization Algorithms under Correlated Shadowing in Wireless Sensor NetworksEditor IJCATR
The existing models for radio channel shadowing was considered to be independent. However the
shadowing on real world links are dependent. In this paper we review different wireless sensor network localization
algorithms which considers the the shadowing between different links to be correlated. For this we have used the
NeSH model.The shadowing between the links is modelled as log normal shadowing path loss model. The
algorithms in the different works are analysed and their results are discussed.
International Refereed Journal of Engineering and Science (IRJES)irjes
International Refereed Journal of Engineering and Science (IRJES) is a leading international journal for publication of new ideas, the state of the art research results and fundamental advances in all aspects of Engineering and Science. IRJES is a open access, peer reviewed international journal with a primary objective to provide the academic community and industry for the submission of half of original research and applications.
Selection of Energy Efficient Clustering Algorithm upon Cluster Head Failure ...ijsrd.com
Wireless Sensor Network (WSN) applications have increased in recent times in fields such as environmental sensing, area monitoring, air pollution monitoring, forest res detection, machine health monitoring, and landslide detection. In such applications, there is a high need of secure communication among sensor nodes. There are different techniques to secure network data transmissions, but due to power constraints of WSN, group key based mechanism is the most preferred one. Hence, to implement scalable energy efficient secure group communication, the best approach would be hierarchical based like Clustering. In most of the WSN designs based on clustering, Base Station (BS) is the central point of contact to the outside world and in case of its failure; it may lead to total disconnection in the communication. Critical applications like these cannot afford to have BS failure as it is a gateway from sensor networks to the outside world. In order to provide better fault tolerant immediate action, a new BS at some other physical location will have to take the charge. This may lead to a total change in the hierarchical network topology, which in turn leads to re-clustering the entire network and in turn formation of new security keys. Therefore, there is a need to find a suitable algorithm which clusters sensor nodes in such a way that when a BS fails and a new BS takes the charge, new group key gets established with minimum computation and less energy consumption.
Erca energy efficient routing and reclusteringaciijournal
The pervasive application of wireless sensor networks (WNSs) is challenged by the scarce energy constraints of sensor nodes. En-route filtering schemes, especially commutative cipher based en-route filtering (CCEF) can saves energy with better filtering capacity. However, this approach suffer from fixed paths and inefficient underlying routing designed for ad-hoc networks. Moreover, with decrease in remaining sensor nodes, the probability of network partition increases. In this paper, we propose energy-efficient routing and re-clustering algorithm (ERCA) to address these limitations. In proposed scheme with reduction in the number of sensor nodes to certain thresh-hold the cluster size and transmission range dynamically maintain cluster node-density. Performance results show that our approach demonstrate filtering-power, better energy-efficiency, and an average gain over 285% in network lifetime.
Energy Curtailing with Huddling Practices with Fuzzy in Wireless Sensor Networkijsrd.com
Wireless sensor is a mounting field and energy conservation is always being in the peak challenges. Researchers have gone all the way through architectures and topologies that permit energy proficient operation in wireless sensor network. Clustering being stretchy helps to supplely mould the network according to the needs. Cluster head election and cluster formation is previously investigated by numerous researchers. In this paper, a proposed novel scheme the Fuzzy Abiding Cluster Head Formation Protocol (FACFP) that uses Mamdani’s fuzzy inference system in the process during cluster formation. We demonstrate that using multiple parameters in cluster formation can minimize the usage of energy. We will compare our proposed technique with well-known existing protocols to show that using multi parameter FIS enhances network lifetime and conserves energy utilization.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Load frequency control of a two area hybrid system consisting of a grid conne...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
An enhancing security for mobile sinks by providing location privacy in wsneSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Secure intrusion detection and countermeasure selection in virtual system usi...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Experimental studies on pressure drop in a sinusoidal plate heat exchanger ef...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...Editor IJCATR
In wireless sensor networks, sensor nodes play the most prominent role. These sensor nodes are mainly un-chargeable, so it
raises an issue regarding lifetime of the network. Mainly sensor nodes collect data and transmit it to the Base Station. So, most of the
energy is consumed in the communication process between sensor nodes and the Base Station. In this paper, we present an
improvement on LEACH protocol to enhance the network lifetime. Our goal is to reduce the transmissions between cluster heads and
the sink node. We will choose optimum number of Master Cluster Heads from variation cluster heads present in the network. The
simulation results show that our proposed algorithm enhances the network lifetime as compare to the LEACH protocol.
Sensor Energy Optimization Using Fuzzy Logic in Wireless Sensor NetworkingVIT-AP University
Wireless sensor networks is challenging in that it requires an enormous breadth of knowledge from an enormous variety of disciplines. A lot of study has been done to minimize the energy used in routing and number of protocols has been developed. These protocols can be classified as - Hierarchical, data centric, location based and Network flow protocols. In this paper, we are particularly focusing on hierarchical protocols. In such types of protocols, the energy efficient clusters are formed with a hierarchy of cluster heads. Each cluster has its representative cluster head which is responsible for collecting and aggregating the data from its respective cluster and then transmitting this data to the Base Station either directly or through the hierarchy of other cluster heads. Fuzzy logic has been successfully applied in various areas including communication and has shown promising results. However, the potentials of fuzzy logic in wireless sensor networks still need to be explored. Optimization of wireless sensor networks involve various tradeoffs, for example, lower transmission power vs. longer transmission duration, multi-hop vs. direct communication, computation vs. communication etc. Fuzzy logic is well suited for application having conflicting requirements. Moreover, in WSN, as the energy metrics vary widely with the type of sensor node implementation platform, using fuzzy logic has the advantage of being easily adaptable to such changes.
Enhancement of Improved Balanced LEACH for Heterogeneous Wireless Sensor Netw...acijjournal
Wireless sensor networks consists of thousands of tiny, low cost, low power and multifunctional sensor nodes where each sensor node has very low battery life. Purpose is to conserve the transmitted energy
from various sensor nodes. Various energy efficient algorithms have been designed for this. LEACH uses
distributed cluster formation & randomized rotation of the cluster head to minimize the network energy
consumption. Our paper is proposing an algorithm which is the enhancement of existing IB-LEACH. It reduces the energy consumption by using energy bank. This energy bank stores the energy after each round in both routing and clustering phase which overall increases the life time of the network. In this
approach, ACTIVE_ROUTE_TIMEOUT is also enhanced by shamming the static parameters of HELLO_INTERVAL, RREQ_RETRIES and NET_DIAMETER. Results are compared through MATLAB and provide better approach than previous ones.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Maximizing Network Lifetime by Using Smart Cluster Head Selectioniosrjce
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
LEACH is a hierarchical protocol in which most nodes transmit to cluster heads, and the cluster heads aggregate and compress the data and forward it to the base station (sink).In LEACH, a TDMA-based MAC protocol is integrated with clustering and a simple “routing” protocol. The goal of LEACH is to lower the energy consumption required to create and maintain clusters or to use the energy of the nodes in such a manner so as to improve the life time of a wireless sensor network. In this paper we are presenting an overview of the different protocol changes made in LEACH to improve network lifetime, throughput, coverage area of network etc.
LEACH is a hierarchical protocol in which most nodes transmit to cluster heads, and the cluster heads aggregate and
compress the data and forward it to the base station (sink).In LEACH, a TDMA-based MAC protocol is integrated with clustering and
a simple “routing” protocol. The goal of LEACH is to lower the energy consumption required to create and maintain clusters or to use
the energy of the nodes in such a manner so as to improve the life time of a wireless sensor network. In this paper we are presenting an
overview of the different protocol changes made in LEACH to improve network lifetime, throughput, coverage area of network etc.
Packet Loss and Overlay Size Aware Broadcast in the Kademlia P2P SystemIDES Editor
Kademlia is a structured peer-to-peer (P2P)
application level network, which implements a distributed
hash table (DHT). Its key-value storage and lookup service is
made efficient and reliable by its well-designed binary tree
topology and dense mesh of connections between participant
nodes. While it can carry out data storage and retrieval in
logarithmic time if the key assigned to the value in question
is precisely known, no complex queries of any kind are
supported. In this article a broadcast algorithm for the
Kademlia network is presented, which can be used to
implement such queries. The replication scheme utilized is
compatible with the lookup algorithm of Kademlia, and it
uses the same routing tables. The reliability (coverage) of the
algorithm is increased by assigning the responsibility of
disseminating the broadcast message to many nodes at the
same time. The article presents a model validated with
simulation as well. The model can be used by nodes at runtime
to calculate the required level of replication for any desired
level of coverage. This calculation can take node churn, packet
loss ratio and the size of the overlay into account.
Power consumption is an important metric tool in the context of the wireless sensor networks
(WSNs). In this paper, we described a new Energy-Degree (EDD) Clustering Algorithm for the
WSNs. A node with higher residual energy and higher degree is more likely elected as a
clusterhead (CH). The intercluster and intracluster communications are realized on one hop.
The principal goal of our algorithm is to optimize the energy power and energy load among all
nodes. By comparing EDD clustering algorithm with LEACH algorithm, simulation results
have showen its effectiveness in saving energy.
EDD CLUSTERING ALGORITHM FOR WIRELESS SENSOR NETWORKScscpconf
Power consumption is an important metric tool in the context of the wireless sensor networks
(WSNs). In this paper, we described a new Energy-Degree (EDD) Clustering Algorithm for the
WSNs. A node with higher residual energy and higher degree is more likely elected as a
clusterhead (CH). The intercluster and intracluster communications are realized on one hop.
The principal goal of our algorithm is to optimize the energy power and energy load among all
nodes. By comparing EDD clustering algorithm with LEACH algorithm, simulation results
have showen its effectiveness in saving energy.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
PERFORMANCE EVALUATION OF ENERGY EFFICIENT CLUSTERING PROTOCOL FOR CLUSTER HE...ijp2p
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
PERFORMANCE EVALUATION OF ENERGY EFFICIENT CLUSTERING PROTOCOL FOR CLUSTER HE...ijp2p
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
PERFORMANCE EVALUATION OF ENERGY EFFICIENT CLUSTERING PROTOCOL FOR CLUSTER HE...ijp2p
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
Energy Efficient Zone Divided and Energy Balanced Clustering Routing Protocol...csijjournal
Wireless sensor network has proven its significance in almost every field in today’s era. Wireless sensor network consists of large number of sensor nodes distributed randomly in some areas. In WSN the main objective has been increasing the network lifetime. There is zone divisional approach which has shown sound improvement in increasing the network lifetime over the Leach and EEUC protocols. The proposed protocol Energy efficient zone divided and energy balanced clustering routing protocol (EEZECR) has not only much higher network lifetime as compare to ZECR and it also has much better load balancing in the network. In the EEZECR the concept of double cluster head in a cluster is introduced which reduces the load on cluster head and very efficiently does the task of load balancing in the network thoroughly which makes this protocol favorite for many real time applications. Simulations are performed in MATLAB.
Energy Efficient Zone Divided and Energy Balanced Clustering Routing Protocol...csijjournal
Wireless sensor network has proven its significance in almost every field in today’s era. Wireless sensor network consists of large number of sensor nodes distributed randomly in some areas. In WSN the main objective has been increasing the network lifetime. There is zone divisional approach which has shown sound improvement in increasing the network lifetime over the Leach and EEUC protocols. The proposed protocol Energy efficient zone divided and energy balanced clustering routing protocol (EEZECR) has not only much higher network lifetime as compare to ZECR and it also has much better load balancing in the network. In the EEZECR the concept of double cluster head in a cluster is introduced which reduces the load on cluster head and very efficiently does the task of load balancing in the network thoroughly which
makes this protocol favorite for many real time applications. Simulations are performed in MATLAB.
Similar to A study of localized algorithm for self organized wireless sensor network and it’s implementation (20)
Low power architecture of logic gates using adiabatic techniquesnooriasukmaningtyas
The growing significance of portable systems to limit power consumption in ultra-large-scale-integration chips of very high density, has recently led to rapid and inventive progresses in low-power design. The most effective technique is adiabatic logic circuit design in energy-efficient hardware. This paper presents two adiabatic approaches for the design of low power circuits, modified positive feedback adiabatic logic (modified PFAL) and the other is direct current diode based positive feedback adiabatic logic (DC-DB PFAL). Logic gates are the preliminary components in any digital circuit design. By improving the performance of basic gates, one can improvise the whole system performance. In this paper proposed circuit design of the low power architecture of OR/NOR, AND/NAND, and XOR/XNOR gates are presented using the said approaches and their results are analyzed for powerdissipation, delay, power-delay-product and rise time and compared with the other adiabatic techniques along with the conventional complementary metal oxide semiconductor (CMOS) designs reported in the literature. It has been found that the designs with DC-DB PFAL technique outperform with the percentage improvement of 65% for NOR gate and 7% for NAND gate and 34% for XNOR gate over the modified PFAL techniques at 10 MHz respectively.
Understanding Inductive Bias in Machine LearningSUTEJAS
This presentation explores the concept of inductive bias in machine learning. It explains how algorithms come with built-in assumptions and preferences that guide the learning process. You'll learn about the different types of inductive bias and how they can impact the performance and generalizability of machine learning models.
The presentation also covers the positive and negative aspects of inductive bias, along with strategies for mitigating potential drawbacks. We'll explore examples of how bias manifests in algorithms like neural networks and decision trees.
By understanding inductive bias, you can gain valuable insights into how machine learning models work and make informed decisions when building and deploying them.
We have compiled the most important slides from each speaker's presentation. This year’s compilation, available for free, captures the key insights and contributions shared during the DfMAy 2024 conference.
Water billing management system project report.pdfKamal Acharya
Our project entitled “Water Billing Management System” aims is to generate Water bill with all the charges and penalty. Manual system that is employed is extremely laborious and quite inadequate. It only makes the process more difficult and hard.
The aim of our project is to develop a system that is meant to partially computerize the work performed in the Water Board like generating monthly Water bill, record of consuming unit of water, store record of the customer and previous unpaid record.
We used HTML/PHP as front end and MYSQL as back end for developing our project. HTML is primarily a visual design environment. We can create a android application by designing the form and that make up the user interface. Adding android application code to the form and the objects such as buttons and text boxes on them and adding any required support code in additional modular.
MySQL is free open source database that facilitates the effective management of the databases by connecting them to the software. It is a stable ,reliable and the powerful solution with the advanced features and advantages which are as follows: Data Security.MySQL is free open source database that facilitates the effective management of the databases by connecting them to the software.
HEAP SORT ILLUSTRATED WITH HEAPIFY, BUILD HEAP FOR DYNAMIC ARRAYS.
Heap sort is a comparison-based sorting technique based on Binary Heap data structure. It is similar to the selection sort where we first find the minimum element and place the minimum element at the beginning. Repeat the same process for the remaining elements.
6th International Conference on Machine Learning & Applications (CMLA 2024)ClaraZara1
6th International Conference on Machine Learning & Applications (CMLA 2024) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of on Machine Learning & Applications.
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTjpsjournal1
The rivalry between prominent international actors for dominance over Central Asia's hydrocarbon
reserves and the ancient silk trade route, along with China's diplomatic endeavours in the area, has been
referred to as the "New Great Game." This research centres on the power struggle, considering
geopolitical, geostrategic, and geoeconomic variables. Topics including trade, political hegemony, oil
politics, and conventional and nontraditional security are all explored and explained by the researcher.
Using Mackinder's Heartland, Spykman Rimland, and Hegemonic Stability theories, examines China's role
in Central Asia. This study adheres to the empirical epistemological method and has taken care of
objectivity. This study analyze primary and secondary research documents critically to elaborate role of
china’s geo economic outreach in central Asian countries and its future prospect. China is thriving in trade,
pipeline politics, and winning states, according to this study, thanks to important instruments like the
Shanghai Cooperation Organisation and the Belt and Road Economic Initiative. According to this study,
China is seeing significant success in commerce, pipeline politics, and gaining influence on other
governments. This success may be attributed to the effective utilisation of key tools such as the Shanghai
Cooperation Organisation and the Belt and Road Economic Initiative.
A study of localized algorithm for self organized wireless sensor network and it’s implementation
1. IJRET: International Journal of Research in Engineering and Technology ISSN: 2319-1163
__________________________________________________________________________________________
Volume: 02 Issue: 04 | Apr-2013, Available @ http://www.ijret.org 498
A STUDY OF LOCALIZED ALGORITHM FOR SELF-ORGANIZED
WIRELESS SENSOR NETWORK AND IT’S IMPLEMENTATION
Arnab Kundu
Asst. Professor, Department of E.C.E, B.I.E.T, Suri, Dist.-Birbhum, PIN-731101, W.B., INDIA, a.kunduwb@gmail.com
Abstract
Communication between two nodes is a big issue in now days. To achieve that, wireless network plays a big role. With limited source
of energy, memory & computation power wireless sensor networks can be composed by mass number of sensor nodes. Where the
sensors’ lifetime depend on energies. Like autonomous system in LAN, cluster can be defined for wireless sensor network, where
cluster head plays the prime role for the energy conservation. So, the optimization of cluster head within cluster along with number of
nodes is a big research issue. Here I have analyzed the advanced optimization algorithm for sensor network clustering theoretically. I
have tried to test the proposed method as a clustering algorithm and compared it with other recent sensor network clustering
algorithm named Algorithm for Cluster Establishment (ACE)
Index Terms: ACE; Data sets; Localized algorithm; Migration; Spawning threshold function
-----------------------------------------------------------------------***-----------------------------------------------------------------------
1. INTRODUCTION
The unique characteristics of wireless sensor networks and the
nature of their applications motivate the development of new
algorithmic solutions to provide services such as information
processing, messages routing, fault-tolerance, localization,
naming and addressing. Generally algorithms have been
classified as either centralized or distributed. Centralized
algorithms execute on a single node, which is impractical for
large-scale highly constrained sensor networks. This approach
would require all nodes to send their respective information
(e.g., sensed data, or energy level) to a specified location (e.g.,
a sink node) and wait until this node executes the algorithm
and sends back its output[1,6]. This approach is unsuitable for
sensor networks because of its cost in terms of energy and
delay. In addition, it suffers low fault-tolerance and low
scalability and creates bottlenecks. In the case of distributed
algorithms, different nodes participate in the computation
which can reduce the execution time. To address this problem,
a new class of algorithms called localized algorithms has been
proposed for sensor networks. Localized algorithms are a
special category of distributed algorithms that are designed
specifically to enable efficient and reliable collaboration
between sensor nodes by taking into account their specific
constraints. For instance, a localized algorithm might limit the
collaboration and information exchange to close neighbors of
a node to save energy.[2,4,9,10]
2. (ACE): ALGORITHM FOR CLUSTER
ESTABLISHMENT
Unlike other distributed clustering schemes, ACE employs an
emergent algorithm. Emergent algorithms much like artificial
neural networks evolve to optimal solution through a mix of
local optimization steps. The main idea of ACE is to allow a
node to assess its potential as a CH before becoming one and
stepping down if it is not the best CH at the moment. The
algorithm works in iterations that do not have to be
synchronized at the individual nodes. Spawning new clusters
and migration of existing ones are the two functional
components of ACE. A node spawns of new cluster when it
decides to become a CH. It broadcasts an invitation message
to recruit its neighbors. Upon getting the invitation, a
neighboring sensor joins the new cluster and becomes a
follower of the new CH. At any moment, a node can be a
follower of more than one cluster. However, the node can be a
loyal follower, i.e. a member, of only a single cluster.[3,5]
2.1 Migration
Migration is a process in which the best candidate for being
CH is selected. Each CH periodically checks the ability of its
neighbors for being a CH and decides to step down if one of
these neighbors has more followers than it does. A node that
has the largest number of followers and the least overlap with
existing clusters will be considered as the best candidate for
CH.
2.2 Parameter Selection
In the ACE protocol, an unclustered node will spawn a new
cluster by declaring itself a cluster head whenever it finds that
it can gain at least fmin loyal followers if it were to become a
cluster head. The function fmin is called the spawning
threshold function and is dependent on the time that has
passed since the protocol was initiated for that node. In
general, fmin should decrease as the algorithm proceeds. This
causes fewer clusters to form near the beginning of the
2. IJRET: International Journal of Research in Engineering and Technology ISSN: 2319-1163
__________________________________________________________________________________________
Volume: 02 Issue: 04 | Apr-2013, Available @ http://www.ijret.org 499
algorithm. Here, I used an exponentially decreasing function
for fmin:
In this formula, t is the time passed since the protocol began
and cI is the duration of the protocol as described earlier. d is
the estimated average degree (number of neighbours) of a
node in the network. k1 and k2 are chosen constants that
determine the shape of the exponential graph. In practice, it
was empirically found that k1 = 2:3 and k2 = 0:1 have
produced good results. In this case, fmin starts at 0:9d at the
beginning of the protocol and reduces to 0 by the final
iteration. This ensures that any node left unclustered at the end
of the protocol will declare itself a cluster head.[7]
An alternative parameter setting is k1 = 2:3 as before, but
setting k2 = 0. In this case the function starts near d when the
protocol commences and reduces to 0:1d at the end of the
protocol. Since 0:1d > 1 if d > 10, it is possible that there will
be a small number of nodes that will not be within one hop
radius of any cluster-head at the end of the algorithm. It can be
observed in simulation that the number of nodes not within
one-hop radius of a cluster-head is, on average, less than 4%
of the total number of nodes in low node deployment
densities, and around 2% for moderate to high node
deployment densities (20 or more neighbors per node). These
nodes that are not within one hop radius of any cluster-head
can simply pick a clustered neighbor to act as their bridge to
the cluster head, thus becoming two-hop followers (because
they take 2 hops to communicate with the cluster-head, instead
of the usual 1 hop).
It remains to determine c, the number of iterations the
algorithm should execute. Figure-1. reflects how the
performance of ACE changes as it is given a longer number of
iterations to operate. ACE was simulated in a 2D area with a
uniform random distribution with an average deployment
density d of 50 nodes per circle of one communication radius.
Results for the simulation with k1 = 2:3 and k2 = 0:1 are
shown (results for k2 = 0 have similar characteristics). It can
be noted that increasing the number of iterations above 3
yielded only very slight improvements in average cluster size.
In this simulation the total number of iterations did not
significantly affect the standard deviation in cluster sizes,
which was between 6 and 10 for all iterations > 1. [3,5]
Fig-1 Performance of ACE at various maximum iterations,
d=50, k1=2.3, k2=0.1
Figure-2. illustrates the ACE algorithm operating in
simulation (with k1 = 2:3 and k2 = 0). The little circles
represent nodes. Cluster-heads are highlighted in black, and
their range is indicated with a large black circle (nodes within
the circle are in that cluster). The clusters migrate away from
each other in successive iterations to produce a highly efficient
cover of the area. Clusters tend to center over areas where
nodes are dense. The clusters overlap minimally, and when
they do overlap, they tend to overlap in areas where nodes are
sparse. Figure-2d. provides a qualitative visual comparison of
the Node ID algorithm with ACE. It can be observed that ACE
provides a packing with significantly less cluster overlap than
Node ID.[8]
Fig-2 The ACE algorithm (with k1=2.3 & k2=0)
3. IJRET: International Journal of Research in Engineering and Technology ISSN: 2319-1163
__________________________________________________________________________________________
Volume: 02 Issue: 04 | Apr-2013, Available @ http://www.ijret.org 500
2.3 ACE Algorithm
3. SIMULATION & DISCUSSION
To implement the above algorithm I have used the Application
of Program named “MATLAB – 7” as front end application
and “Microsoft Excel – 2000” as a Backend application or
database. In this section I have shown the outputs of various
type of Sensor nodes for variable Lat-Long. Then I have
evaluated the function fmin in the following program.
3.1. Sensor Node Outputs
Data Name : elcentro_EW.dat
signal=load('elcentro_EW.dat');
From Simulink Library Browser :
Output: 1
Fig-3 Vibration sensor output
Data Name : elcentro_NS.dat
signal=load('elcentro_ NS.dat');
From Simulink Library Browser :
Output: 2
Fig-4 Vibration sensor output
Data Name: elcentro_EW.dat
signal=load(' elcentro_UP.dat');
From Simulink Library Browser :
4. IJRET: International Journal of Research in Engineering and Technology ISSN: 2319-1163
__________________________________________________________________________________________
Volume: 02 Issue: 04 | Apr-2013, Available @ http://www.ijret.org 501
Output: 3
Fig-5 Vibration sensor output
Calculation of fmin
Considering, fmin = d
k1 = a
t/cI = b
k2 = c
d = h
Output: 1
Fig-6 Performance of ACE at various maximum iterations,
d=50, k1=2.3, k2=0.1
Each object is represented by an ordered n-tuple of its
attributes. Objects with similar characteristics must have
individual attributes which are close in value. Since distance is
a measure of "closeness", it can be used in clustering. For each
cluster, there will be a single point which is designated as a
hub. The placement of the hub within the cluster is determined
by the algorithm. I shall start with two-dimensional objects
since they are the easiest to visualize. Suppose I have 8 points
in the configuration below. Draw circles around the clusters
that you see visually.
Table – 1
POINT X Y
1 1 1
2 1 2
3 2 1
4 8 1
5 9 1
6 6 6
7 5 5
8 9 9
Let's see what a computer model of clustering would give us.
This algorithm assumes a minimum of 2 clusters and a
maximum of p clusters where p is the number of objects. The
algorithm is as follows:
1. From the set of objects (data points), choose any one to be
the first hub.
2. Find the point which is farthest from this hub, and make it
the second hub.
3. For each remaining object, find the distance from the
object to each hub and assign the object to the hub to
which it is closer.
4. To determine whether it is necessary to find a third hub,
do the following.
a. Find the distance between the two hubs and
divide by two. Call this value R.
b. Calculate the distance from each object to its
hub. If any distance is greater than R, it is
necessary to find a third hub.
5. To find the third hub, find the object which is farthest
from its hub (1 or 2). So, if Point 8 belongs to Hub 1, look
at the distance from Point 8 to Hub 1, but not Point 8 to
Hub 2.
6. Then, calculate the distance from each point to the new
hub to see if that distance is less than the point's distance
to its current hub. If so, reassign the point to Hub 3.
7. To determine the stop value, R, find the average distance
between the hubs and divide by two. Since there are three
hubs, there will be three distances to average together (H1
- H2, H1 - H3, and H2 - H3).
5. IJRET: International Journal of Research in Engineering and Technology ISSN: 2319-1163
__________________________________________________________________________________________
Volume: 02 Issue: 04 | Apr-2013, Available @ http://www.ijret.org 502
8. Once again, see if any distance from a point to its hub
exceeds R.
9. Continue this process until all points are within R units of
their hub or until all points are themselves hubs.
Table – 2: data.dat (Data File)
1 2
1 4 5
2 1 7
3 1 2
4 2 8
5 8 1
6 7 8
7 8 7
8 5 4
Output: 1.
Fig-7 Graphical plotting of datasheets (Top View)
Fig-8 Graphical plotting of datasheets (3-D View)
Fig-9 Graphical plotting of datasheets (Side top View)
Output: 2.
Fig-10 Clustering of Data Sets
Output: 3.
Fig-11 Clustering process
6. IJRET: International Journal of Research in Engineering and Technology ISSN: 2319-1163
__________________________________________________________________________________________
Volume: 02 Issue: 04 | Apr-2013, Available @ http://www.ijret.org 503
CONCLUSIONS
Through the above theoretical analysis and simulated outputs I
am trying to solve the network link between two Nodes of a
cluster as well as measure the Stability Criteria of those
(A.C.E., S.O.S., Optimization Algorithm) Clustering
Algorithms. Clustering Algorithms are very important at
present. There are huge scope of work. The basic concepts
needed to understand the functionality of the algorithms. This
paper was meant as an introduction to the algorithms and also
the purpose was to create an efficient way to display the
clustering of individual data elements. If something remains to
be done a more throughout analysis of the behavior of the
algorithms should be made. Specially cases where the samples
are badly balanced or in some particular order should be
generated and analyzed.
ACKNOWLEDGEMENTS
The authors would like to thank the authorities of Birbhum
Institute of Engineering & Technology & JIS College of
Engineering for providing every kind of supports and
encouragement during the working process.
REFERENCES
[1]. Alan D. Amis, Ravi Prakash, Thai H.P. Vuong, and Dung
T. Huynh. Max-Min D-Cluster Formation in Wireless Ad Hoc
Networks. In Proceedings of IEEE INFOCOM 2000.
[2]. D.J. Baker, A. Ephremides, and J.A. Flynn. The Design
and Simulation of a Mobile Radio Network with Distributed
Control. IEEE Journal on Selected Areas in Communication,
2(1):226–237, January 1984.
[3]. Suman Banerjee and Samir Khuller. A Clustering Scheme
for Hierarchical Control in Wireless Networks. In Proceedings
of IEEE INFOCOM 2001, April 2001.
[4]. Stefano Basagni. Distributed Clustering for Ad Hoc
Networks. In Proceedings of the IEEE International
Symposium on Parallel Architectures, Algorithms, and
Networks (I-SPAN), June 1999.
[5]. A Survey of Clustering Algorithms for WirelessSensor
NetworksD. J. Dechene, A. El Jardali, M. Luccini, and A.
Sauer.Department of Electrical and Computer EngineeringThe
University Of Western OntarioLondon, Ontario, Canada
[6]. M. Gerla, T.J. Kwon, and G. Pei. On Demand Routing in
Large Ad Hoc Wireless Networks with Passive Clustering. In
Proceedings of IEEE Wireless Communications and
Networking Conference (WCNC 2000), September 2000.
[7]. Rajesh Krishnan, Ram Ramanathan, and Martha
Steenstrup. Optimization Algorithms for Large Self-
Structuring Networks. In IEEE INFOCOM ’99, 1999.
[8]. Chunhung Richard Lin and Mario Gerla. Adaptive
Clustering for MobileWireless Networks. IEEE Journal of
Selected Areas in Communications, 1997.
[9]. Clustering Algorithms: Basics and Visualization – By, -
Jukka Kainulainen
[10]. Glenn Fung: “A Comprehensive Overview of Basic
Clustering Algorithms”, June 22, 2001
BIOGRAPHIES
Arnab Kundu, born in India, obtained
his M.Tech degree from JIS College of
Engineering, Kalyani, West Bengal. Now
he is Asst. Professor of E.C.E.
Department in Birbhum Institute of
Engineering & Technology, P.O.:Suri,
Dist.:Birbhum, PIN:731101, West
Bengal, India. He is Life member of
Indian Society for Technical Education,
Indian Society of Remote Sensing, International Association
of Engineers, The Institution of Electronics &
Telecommunication Engineers. email: a.kunduwb@gmail.com