This document summarizes several cluster head selection techniques for mobile ad-hoc networks (MANETs). It begins with an introduction to MANETs and clustering in MANETs. It then surveys 12 different cluster head selection techniques: Lowest ID, Highest Degree, K-hop Connectivity ID, Mobility Based D-hop, Adaptive Cluster Load Balance, Least Cluster Change, Load Balancing, Power-aware Dominant Set, Weighted Approach, Max-Min D-cluster Formation, and Mobility Based Cluster Formation. It provides a brief description of each technique and analyzes their merits and demerits. Finally, it concludes that different techniques select the cluster head based on various parameters like node ID,
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Distributed Three Hop Routing Protocol for Enhancing Routing Process in WSNpaperpublications3
Abstract: For Hybrid wireless network there is need of efficient data routing protocol for improvement of network capability and scalability. By using Distributed Three Hop routing protocol (DTR), we improve capacity of Hybrid network and Reduce overhead. In early Two- Hop Transmission protocol is used for eliminate route maintenance and limited number of hop in routing for Hybrid Wireless Network but it only considers the node transmission within a single cell while DTR can Also deals with Inter-cell communication in real word. DTR is Top-quality from Other routing Protocol to analyses the hybrid wireless networks with the parametric quantity such as throughput, QoS, packet loss, overhead (due to traffic), channel quality, load balancing, routing delivery, scalability and power consumption. DTR also has a congestion control algorithm to avoid load congestion in base station in the case of unbalanced traffic distributions in networks. DTR makes significantly lower overhead by eliminating route monitoring and maintenance. To enhance the efficiency of routing protocol in wireless network Weight Based Data Assignment technique is used for data allocation in distributed routing protocol using the technique of least delay detection to maintain less data congestion in the network . for that DTR divides a message data stream into segments and transmits the segments in a distributed manner.
Keywords: Data Fragmentation, Responses Delay, Hybrid Wireless Network, Three of Routing Protocol, Fuzzy Logic.
Title: Distributed Three Hop Routing Protocol for Enhancing Routing Process in WSN
Author: Amruta A. Mandhare, Kashmira J. Mayekar, Sayali L. Khanekar, Sarika V.Bodake, Sayali S. Bale.
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Communication synchronization in cluster based wireless sensor network a re...eSAT Journals
Abstract A wireless sensor network is acquiring more popularity in different sectors. A scalable, low latency and energy efficient are desire challenges that should meet by wireless sensor network. Clustering permits sensors to systematically communicate among clusters. Cluster based sensor network satisfies these challenges as it provides flexible, energy saving and QoS. The communication efficiency and network performance degrades if the interaction between inter-cluster and intra-cluster communication are not managed properly. The proposed work uses two approaches to solve this problem. At aiming low packet delay and high throughput first approach uses cycle- based synchronous scheduling. By completely removing necessity of communication synchronization second approach send packets with no synchronization delay. The combined scheme can take benefit of both approaches. Keywords: Wireless sensor network, clustering, communication synchronization, QoS.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Distributed Three Hop Routing Protocol for Enhancing Routing Process in WSNpaperpublications3
Abstract: For Hybrid wireless network there is need of efficient data routing protocol for improvement of network capability and scalability. By using Distributed Three Hop routing protocol (DTR), we improve capacity of Hybrid network and Reduce overhead. In early Two- Hop Transmission protocol is used for eliminate route maintenance and limited number of hop in routing for Hybrid Wireless Network but it only considers the node transmission within a single cell while DTR can Also deals with Inter-cell communication in real word. DTR is Top-quality from Other routing Protocol to analyses the hybrid wireless networks with the parametric quantity such as throughput, QoS, packet loss, overhead (due to traffic), channel quality, load balancing, routing delivery, scalability and power consumption. DTR also has a congestion control algorithm to avoid load congestion in base station in the case of unbalanced traffic distributions in networks. DTR makes significantly lower overhead by eliminating route monitoring and maintenance. To enhance the efficiency of routing protocol in wireless network Weight Based Data Assignment technique is used for data allocation in distributed routing protocol using the technique of least delay detection to maintain less data congestion in the network . for that DTR divides a message data stream into segments and transmits the segments in a distributed manner.
Keywords: Data Fragmentation, Responses Delay, Hybrid Wireless Network, Three of Routing Protocol, Fuzzy Logic.
Title: Distributed Three Hop Routing Protocol for Enhancing Routing Process in WSN
Author: Amruta A. Mandhare, Kashmira J. Mayekar, Sayali L. Khanekar, Sarika V.Bodake, Sayali S. Bale.
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Communication synchronization in cluster based wireless sensor network a re...eSAT Journals
Abstract A wireless sensor network is acquiring more popularity in different sectors. A scalable, low latency and energy efficient are desire challenges that should meet by wireless sensor network. Clustering permits sensors to systematically communicate among clusters. Cluster based sensor network satisfies these challenges as it provides flexible, energy saving and QoS. The communication efficiency and network performance degrades if the interaction between inter-cluster and intra-cluster communication are not managed properly. The proposed work uses two approaches to solve this problem. At aiming low packet delay and high throughput first approach uses cycle- based synchronous scheduling. By completely removing necessity of communication synchronization second approach send packets with no synchronization delay. The combined scheme can take benefit of both approaches. Keywords: Wireless sensor network, clustering, communication synchronization, QoS.
Data Dissemination in Wireless Sensor Networks: A State-of-the Art SurveyCSCJournals
A wireless sensor network is a network of tiny nodes with wireless sensing capacity for data collection processing and further communicating with the Base Station this paper discusses the overall mechanism of data dissemination right from data collection at the sensor nodes, clustering of sensor nodes, data aggregation at the cluster heads and disseminating data to the Base Station the overall motive of the paper is to conserve energy so that lifetime of the network is extended this paper highlights the existing algorithms and open research gaps in efficient data dissemination.
IMPROVEMENTS IN ROUTING ALGORITHMS TO ENHANCE LIFETIME OF WIRELESS SENSOR NET...IJCNCJournal
Wireless sensor network (WSN) brings a new paradigm of real-time embedded systems with limited
computation, communication, memory, and energy resources that are being used fora huge range of
applications. Clustering in WSNs is an effective way to minimize the energy consumption of sensor nodes.
In this paper improvements in various parameters are compared for three different routing algorithms.
First, it is started with Low Energy Adaptive Cluster Hierarchy (LEACH)which is a famed clustering
mechanism that elects a CH based on the probability model. Then, work describes a Fuzzy logic system
initiated CH selection algorithm for LEACH. Then Artificial Bee Colony (ABC)which is an optimisation
protocol owes its inspiration to the exploration behaviour of honey bees. In this study ABC optimization
algorithm is proposed for fuzzy rule selection. Then, the results of the three routing algorithms are
compared with respect to various parameters
Review on Clustering and Data Aggregation in Wireless Sensor NetworkEditor IJCATR
Wireless Sensor Network is a collection of various sensor nodes with sensing and communication capabilities. Clustering is the
process of grouping the set of objects so that the objects in the same group are similar to each other and different to objects in the other
group. The main goal of Data Aggregation is to collect and aggregate the data by maintaining the energy efficiency so that the network
lifetime can be increased. In this paper, I have presented a comprehensive review of various clustering routing protocols for WSN, their
advantages and limitation of clustering in WSN. A brief survey of Data Aggregation Algorithm is also outlined in this paper. Finally, I
summarize and conclude the paper with some future directions
Mobile elements scheduling for periodic sensor applicationsijwmn
In this paper, we investigate the problem of designing the mobile elements tours such that the length of each tour is below a per-determined length and the depth of the multi-hop routing trees bounded by k. The path of the mobile element is designed to visit subset of the nodes (cache points). These cache points store other nodes data. To address this problem, we propose two heuristic-based solutions. Our solutions take into consideration the distribution of the nodes during the establishment of the tour. The results of our experiments indicate that our schemes significantly outperforms the best comparable scheme in the literature.
A wireless network consists of a set of wireless nodes forming the network. The bandwidth allocation scheme used in wireless networks should automatically adapt to the network’s environments, where issues such as mobility are highly variable. This paper proposes a method to distribute the bandwidth for wireless network nodes depending on dynamic methodology;this methodology uses intelligent clustering techniques that depend on the student’s distribution at the university campus, rather than the classical allocation methods. We propose a clustering-based approach to solve the dynamic bandwidth allocation problem in wireless networks, enabling wireless nodes to adapt their bandwidth allocation according to the changing number of expected users over time. The proposed solution allows the optimal online bandwidth allocation based on the data extracted from the lectures timetable, and fed to the wireless network control nodes, allowing them to adapt to their environment. The environment data is processed and clustered using the KMeans clustering algorithm to identify potential peak times for every wireless node. The proposed solution feasibility is tested by applying the approach to a case study, at the Arab American University campus wireless network.
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.
An Integrated Distributed Clustering Algorithm for Large Scale WSN...................................................1
S. R. Boselin Prabhu, S. Sophia, S. Arthi and K. Vetriselvi
An Efficient Connection between Statistical Software and Database Management System ................... 1
Sunghae Jun
Pragmatic Approach to Component Based Software Metrics Based on Static Methods ......................... 1
S. Sagayaraj and M. Poovizhi
SDI System with Scalable Filtering of XML Documents for Mobile Clients ............................................... 1
Yi Yi Myint and Hninn Aye Thant
An Easy yet Effective Method for Detecting Spatial Domain LSB Steganography .................................... 1
Minati Mishra and Flt. Lt. Dr. M. C. Adhikary
Minimizing the Time of Detection of Large (Probably) Prime Numbers ................................................... 1
Dragan Vidakovic, Dusko Parezanovic and Zoran Vucetic
Design of ATL Rules for TransformingUML 2 Sequence Diagrams into Petri Nets..................................... 1
Elkamel Merah, Nabil Messaoudi, Dalal Bardou and Allaoua Chaoui
A QoI Based Energy Efficient Clustering for Dense Wireless Sensor Networkijassn
In a wireless sensor network Quality of Information (QoI), Energy Efficiency, Redundant data avoidance,
congestion control are the important metrics that affect the performance of wireless sensor network. As
many approaches were proposed to increase the performance of a wireless sensor network among them
clustering is one of the efficient approaches in sensor network. Many clustering algorithms concentrate
mainly on power Optimization like FSCH, LEACH, and EELBCRP. There is necessity of the above
metrics in wireless sensor network where nodes are densely deployed in a given network area. As the nodes
are deployed densely there is maximum possibility of nodes appear in the sensing region of other nodes. So
there exists an option that nodes have to send the information that is already reached the base station by its
own cluster members or by members of other clusters. This mechanism will affect the QoI, Energy factor
and congestion control of the wireless sensor networks. Even though clustering uses TDMA (Time Division
Multiple Access) for avoiding congestion control for intra clustering data transmission, but it may fail in
some critical situation. This paper proposed a energy efficient clustering which avoid data redundancy in a
dense sensor network until the network becomes sparse and hence uses the TDMA efficiently during high
density of the nodes.
Algorithmic Construction of Optimal and Load Balanced Clusters in Wireless Se...M H
This paper proposes a clustering algorithm - Ba-lanced Minimum Radius Clustering (BMRC) - for use in large scale, distributed Wireless Sensor Networks (WSN). Cluster balancing is an intractable problem to solve in a distributed manner, and distribution is important, by reason of both avoiding specialised node vulnerability and minimising message overhead.The BMRC algorithm described here distributes several of the cluster balancing functions to the cluster-heads. In proposing this algorithm, several tentative claims have been made for it, namely that it is suitable for arbitrary number of cluster heads; that its pecifies a way to elect cluster heads and use them to create the local models; that it accomplishes optimal balanced clusters in distributed manner; that it is scalable and it uses the number-of-hops as a clustering parameter; that it is energy efficient. These claims were studied and verified by simulation.
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...graphhoc
There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and connectivity aware constraints. Cluster head selection is proposed using adaptive learning in neural networks followed by coverage and connectivity aware routing with data transmission. The proposed scheme is compared with existing schemes with respect to the parameters such as number of alive nodes, packet delivery fraction, and node residual energy. The simulation results show that the proposed scheme can be used in wide area of applications in WSNs.
Literature Review: Convey the Data in Massive Parallel ComputingAM Publications,India
In this paper we have studied several works on direct network architectures which are well-built contestant for useful in many successful cost-effective, experimental massive parallel computers and well scale up shared memory of multiprocessors. The uniqueness of direct networks, as reflected by the communication latency and routing latency metrics are significant to the performance of such systems. A multiprocessor system can be used for the wormhole routing for the most capable switching method and has been adopted in several new massive parallel computers. This technique is unique technical challenges in routing and flow control in particular system, and avoid deadlock. The highly scale up network is a combination of topology and hypercube. Due to the being of concurrent multiple mesh and hypercubes, this network provides a great architectural support for parallel processing. The growth of the network is more efficient in terms of communication, interconnection network is scaled up the network and will be more reliable and also the unreliability of the interconnection network to get minimized. This is very desirable characteristic for the interconnection network as the network remains equipped for more failure of adjoining nodes or links in parallel computer architecture. Formulations to optimize the performance of throughput of networks through queuing theory M\M\1 concept.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACEScscpconf
Opportunistic networks are usually formed spontaneously by mobile devices equipped with
short range wireless communication interfaces. The idea is that an end-to-end connection may
never be present. Designing and implementing a routing protocol to support both service
discovery and delivery in such kinds of networks is a challenging problem on account of
frequent disconnections and topology changes. In these networks one of the most important
issues relies on the selection of the best intermediate node to forward the messages towards the
destination. This paper presents a mobile trace based routing protocol that uses the location
information of the nodes in the network. Using the trace information, next hop is selected to forward the packets to destination. Data forwarding is done via the selected nodes. The effectiveness is shown using simulation
The Study of Premature Failure of Springs Used In Railway CoachesIOSR Journals
The springs used in the bogie suspension of railway coaches are compression springs. They are
made of an elastic wire material formed into the shape of a helix. They are commonly referred to as a coil
spring or a helical spring. They are used to store energy and subsequently release it to absorb shock or to
maintain a force between contact surfaces. The spring returns to its natural length or position when unloaded.
Springs used in railway coaches have been failing prematurely much before their intended service life. The
springs are made with quality materials. Before being put to service, the springs are tested with extensive Non
Destructive Testing Methods which are approved by ISO standards to make sure that quality parts are used.
However the springs still fail before their service life ends
Andres Eloy Blanco, fue un gran caballero apegado a las causas de libertad y democracia, sus versos eran de inspiración tradicionales y abiertos al pueblo, sus obras fueron editadas en diversos libros, Andres Eloy se destaco en diversas obras como , Giraluna, el huerto de Epopeya, Navegacion de Altura, entre otras. tubo dominio del lenguaje y habilidad para escribir fue un hombre de pensamiento universal, sus versos enaltecieron el sentir venezolano, también se destaco por ser humorista e irónico político.
Andres Eloy Blanco marco la poesía venezolana se preocupo por el país y la visión que le toco vivir para esa época y por otra parte el modernismo que se estaba viviendo, pero tubo siempre criterio de justicia social, por eso vio la política como un camino hacia la justicia social, por eso se decía que Andres Eloy fue un hombre socialista y humanista
DINORAH PAREDES
Profesor: Robert Estanga
Trayecto III. Periodo II
Data Dissemination in Wireless Sensor Networks: A State-of-the Art SurveyCSCJournals
A wireless sensor network is a network of tiny nodes with wireless sensing capacity for data collection processing and further communicating with the Base Station this paper discusses the overall mechanism of data dissemination right from data collection at the sensor nodes, clustering of sensor nodes, data aggregation at the cluster heads and disseminating data to the Base Station the overall motive of the paper is to conserve energy so that lifetime of the network is extended this paper highlights the existing algorithms and open research gaps in efficient data dissemination.
IMPROVEMENTS IN ROUTING ALGORITHMS TO ENHANCE LIFETIME OF WIRELESS SENSOR NET...IJCNCJournal
Wireless sensor network (WSN) brings a new paradigm of real-time embedded systems with limited
computation, communication, memory, and energy resources that are being used fora huge range of
applications. Clustering in WSNs is an effective way to minimize the energy consumption of sensor nodes.
In this paper improvements in various parameters are compared for three different routing algorithms.
First, it is started with Low Energy Adaptive Cluster Hierarchy (LEACH)which is a famed clustering
mechanism that elects a CH based on the probability model. Then, work describes a Fuzzy logic system
initiated CH selection algorithm for LEACH. Then Artificial Bee Colony (ABC)which is an optimisation
protocol owes its inspiration to the exploration behaviour of honey bees. In this study ABC optimization
algorithm is proposed for fuzzy rule selection. Then, the results of the three routing algorithms are
compared with respect to various parameters
Review on Clustering and Data Aggregation in Wireless Sensor NetworkEditor IJCATR
Wireless Sensor Network is a collection of various sensor nodes with sensing and communication capabilities. Clustering is the
process of grouping the set of objects so that the objects in the same group are similar to each other and different to objects in the other
group. The main goal of Data Aggregation is to collect and aggregate the data by maintaining the energy efficiency so that the network
lifetime can be increased. In this paper, I have presented a comprehensive review of various clustering routing protocols for WSN, their
advantages and limitation of clustering in WSN. A brief survey of Data Aggregation Algorithm is also outlined in this paper. Finally, I
summarize and conclude the paper with some future directions
Mobile elements scheduling for periodic sensor applicationsijwmn
In this paper, we investigate the problem of designing the mobile elements tours such that the length of each tour is below a per-determined length and the depth of the multi-hop routing trees bounded by k. The path of the mobile element is designed to visit subset of the nodes (cache points). These cache points store other nodes data. To address this problem, we propose two heuristic-based solutions. Our solutions take into consideration the distribution of the nodes during the establishment of the tour. The results of our experiments indicate that our schemes significantly outperforms the best comparable scheme in the literature.
A wireless network consists of a set of wireless nodes forming the network. The bandwidth allocation scheme used in wireless networks should automatically adapt to the network’s environments, where issues such as mobility are highly variable. This paper proposes a method to distribute the bandwidth for wireless network nodes depending on dynamic methodology;this methodology uses intelligent clustering techniques that depend on the student’s distribution at the university campus, rather than the classical allocation methods. We propose a clustering-based approach to solve the dynamic bandwidth allocation problem in wireless networks, enabling wireless nodes to adapt their bandwidth allocation according to the changing number of expected users over time. The proposed solution allows the optimal online bandwidth allocation based on the data extracted from the lectures timetable, and fed to the wireless network control nodes, allowing them to adapt to their environment. The environment data is processed and clustered using the KMeans clustering algorithm to identify potential peak times for every wireless node. The proposed solution feasibility is tested by applying the approach to a case study, at the Arab American University campus wireless network.
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.
An Integrated Distributed Clustering Algorithm for Large Scale WSN...................................................1
S. R. Boselin Prabhu, S. Sophia, S. Arthi and K. Vetriselvi
An Efficient Connection between Statistical Software and Database Management System ................... 1
Sunghae Jun
Pragmatic Approach to Component Based Software Metrics Based on Static Methods ......................... 1
S. Sagayaraj and M. Poovizhi
SDI System with Scalable Filtering of XML Documents for Mobile Clients ............................................... 1
Yi Yi Myint and Hninn Aye Thant
An Easy yet Effective Method for Detecting Spatial Domain LSB Steganography .................................... 1
Minati Mishra and Flt. Lt. Dr. M. C. Adhikary
Minimizing the Time of Detection of Large (Probably) Prime Numbers ................................................... 1
Dragan Vidakovic, Dusko Parezanovic and Zoran Vucetic
Design of ATL Rules for TransformingUML 2 Sequence Diagrams into Petri Nets..................................... 1
Elkamel Merah, Nabil Messaoudi, Dalal Bardou and Allaoua Chaoui
A QoI Based Energy Efficient Clustering for Dense Wireless Sensor Networkijassn
In a wireless sensor network Quality of Information (QoI), Energy Efficiency, Redundant data avoidance,
congestion control are the important metrics that affect the performance of wireless sensor network. As
many approaches were proposed to increase the performance of a wireless sensor network among them
clustering is one of the efficient approaches in sensor network. Many clustering algorithms concentrate
mainly on power Optimization like FSCH, LEACH, and EELBCRP. There is necessity of the above
metrics in wireless sensor network where nodes are densely deployed in a given network area. As the nodes
are deployed densely there is maximum possibility of nodes appear in the sensing region of other nodes. So
there exists an option that nodes have to send the information that is already reached the base station by its
own cluster members or by members of other clusters. This mechanism will affect the QoI, Energy factor
and congestion control of the wireless sensor networks. Even though clustering uses TDMA (Time Division
Multiple Access) for avoiding congestion control for intra clustering data transmission, but it may fail in
some critical situation. This paper proposed a energy efficient clustering which avoid data redundancy in a
dense sensor network until the network becomes sparse and hence uses the TDMA efficiently during high
density of the nodes.
Algorithmic Construction of Optimal and Load Balanced Clusters in Wireless Se...M H
This paper proposes a clustering algorithm - Ba-lanced Minimum Radius Clustering (BMRC) - for use in large scale, distributed Wireless Sensor Networks (WSN). Cluster balancing is an intractable problem to solve in a distributed manner, and distribution is important, by reason of both avoiding specialised node vulnerability and minimising message overhead.The BMRC algorithm described here distributes several of the cluster balancing functions to the cluster-heads. In proposing this algorithm, several tentative claims have been made for it, namely that it is suitable for arbitrary number of cluster heads; that its pecifies a way to elect cluster heads and use them to create the local models; that it accomplishes optimal balanced clusters in distributed manner; that it is scalable and it uses the number-of-hops as a clustering parameter; that it is energy efficient. These claims were studied and verified by simulation.
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...graphhoc
There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and connectivity aware constraints. Cluster head selection is proposed using adaptive learning in neural networks followed by coverage and connectivity aware routing with data transmission. The proposed scheme is compared with existing schemes with respect to the parameters such as number of alive nodes, packet delivery fraction, and node residual energy. The simulation results show that the proposed scheme can be used in wide area of applications in WSNs.
Literature Review: Convey the Data in Massive Parallel ComputingAM Publications,India
In this paper we have studied several works on direct network architectures which are well-built contestant for useful in many successful cost-effective, experimental massive parallel computers and well scale up shared memory of multiprocessors. The uniqueness of direct networks, as reflected by the communication latency and routing latency metrics are significant to the performance of such systems. A multiprocessor system can be used for the wormhole routing for the most capable switching method and has been adopted in several new massive parallel computers. This technique is unique technical challenges in routing and flow control in particular system, and avoid deadlock. The highly scale up network is a combination of topology and hypercube. Due to the being of concurrent multiple mesh and hypercubes, this network provides a great architectural support for parallel processing. The growth of the network is more efficient in terms of communication, interconnection network is scaled up the network and will be more reliable and also the unreliability of the interconnection network to get minimized. This is very desirable characteristic for the interconnection network as the network remains equipped for more failure of adjoining nodes or links in parallel computer architecture. Formulations to optimize the performance of throughput of networks through queuing theory M\M\1 concept.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACEScscpconf
Opportunistic networks are usually formed spontaneously by mobile devices equipped with
short range wireless communication interfaces. The idea is that an end-to-end connection may
never be present. Designing and implementing a routing protocol to support both service
discovery and delivery in such kinds of networks is a challenging problem on account of
frequent disconnections and topology changes. In these networks one of the most important
issues relies on the selection of the best intermediate node to forward the messages towards the
destination. This paper presents a mobile trace based routing protocol that uses the location
information of the nodes in the network. Using the trace information, next hop is selected to forward the packets to destination. Data forwarding is done via the selected nodes. The effectiveness is shown using simulation
The Study of Premature Failure of Springs Used In Railway CoachesIOSR Journals
The springs used in the bogie suspension of railway coaches are compression springs. They are
made of an elastic wire material formed into the shape of a helix. They are commonly referred to as a coil
spring or a helical spring. They are used to store energy and subsequently release it to absorb shock or to
maintain a force between contact surfaces. The spring returns to its natural length or position when unloaded.
Springs used in railway coaches have been failing prematurely much before their intended service life. The
springs are made with quality materials. Before being put to service, the springs are tested with extensive Non
Destructive Testing Methods which are approved by ISO standards to make sure that quality parts are used.
However the springs still fail before their service life ends
Andres Eloy Blanco, fue un gran caballero apegado a las causas de libertad y democracia, sus versos eran de inspiración tradicionales y abiertos al pueblo, sus obras fueron editadas en diversos libros, Andres Eloy se destaco en diversas obras como , Giraluna, el huerto de Epopeya, Navegacion de Altura, entre otras. tubo dominio del lenguaje y habilidad para escribir fue un hombre de pensamiento universal, sus versos enaltecieron el sentir venezolano, también se destaco por ser humorista e irónico político.
Andres Eloy Blanco marco la poesía venezolana se preocupo por el país y la visión que le toco vivir para esa época y por otra parte el modernismo que se estaba viviendo, pero tubo siempre criterio de justicia social, por eso vio la política como un camino hacia la justicia social, por eso se decía que Andres Eloy fue un hombre socialista y humanista
DINORAH PAREDES
Profesor: Robert Estanga
Trayecto III. Periodo II
10 اشياء يجب عليك معرفتها قبل إجراء مقابلة التوظيفosmanabdelrhman
مهما كانت سيرتك الذاتية ممتازة واجتهدت فى كتابتها فانك تكون قد قطعت نصف الطريق فقط للحصول على الوظيفة . لذا يجب عليك الاستعداد لاجراء مقابلة التوظيف لتثبت انك كفء للحصول على الوظيفة
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.
Every cluster comprise of a leader which is known as cluster head. The cluster head will be chosen by the sensor nodes in the individual cluster or be pre-assigned by the user. The main advantages of clustering are the transmission of aggregated data to the base station, offers scalability for huge number of nodes and trims down energy consumption. Fundamentally, clustering could be classified into centralized clustering, distributed clustering and hybrid clustering. In centralized clustering, the cluster head is fixed. The rest of the nodes in the cluster act as member nodes. In distributed clustering, the cluster head is not fixed. The cluster head keeps on shifting form node to node within the cluster on the basis of some parameters. Hybrid clustering is the combination of both centralized clustering and distributed clustering mechanisms. This paper gives a brief overview on clustering process in wireless sensor networks. A research on the well evaluated distributed clustering algorithm Low Energy Adaptive Clustering Hierarchy (LEACH) and its followers are portrayed artistically. To overcome the drawbacks of these existing algorithms a hybrid distributed clustering model has been proposed for attaining energy efficiency to a larger scale.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
An Analysis of Low Energy Adaptive Clustering Hierarchy (LEACH) Protocol for ...IJERD Editor
Wireless sensor network is an emerging field leading to the various applications worldwide. Small nodes being used are capable enough to sensing, computation, collection and forwarding the data to the Base Station. Battery source is one of the most prominent concerning issue in making the sensor network running for performing various assigned tasks. This battery source has all business with the routing strategies being employed. Here in this paper the routing protocol LEACH (Low-Energy Adaptive Clustering Hierarchy) is being reviewed to explore the advancements in clustering strategies. LEACH is being the first clustering protocol which selects the cluster head in each round and thereby balancing the energy consumption throughout the network. The work in the paper focus to discuss various variants of LEACH aiming to enhance the network life-time.
An Adaptive Cluster Head Election Algorithm for Heterogeneous Mobile Ad-hoc N...IJLT EMAS
Mobile ad-hoc network characterized as a homogenous and heterogeneous on the basis of node capabilities. Heterogeneity property may make issues for mobile ad-hoc network in context of coverage area, link stability, lifetime etc. To resolve these issues, require a mechanism to adapt different characteristics and make decision for smooth functioning. Heterogeneity also leads effective routing problem that occurs instability in route or path. Though to make effective routing in this situation, efficient clustering algorithm may be apply. In this paper, the effects of heterogeneity property are studied and analyzed. A cluster head algorithm is also suggested to deal with the effects of the property. Suggested algorithm is simulated in network simulation and performance is evaluated in context of computation cost, lifetime and number of clusters.
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.
Hierarchical Routing Protocols in Wireless Sensor Networks: A Survey and its ...rahulmonikasharma
In Wireless Sensor Networks (WSN), profound research articles are presented to address the hierarchical routing protocols which reduce the energy consumption of sensor nodes and also prolong the life of the network. The state of art of this research article focus on the survey of different hierarchical routing protocols which is utilized to efficiently deliver the sensed data from source to sink node. This article presents a detailed survey on major clustering techniques LEACH, SEP, PEGASIS, and TEEN. Also, this article strongly examines about the advantages and limitations of each hierarchical routing protocol with its recent research issues. Finally, the paper concludes with some of the research issues in hierarchical routing protocols of wireless sensor networks.
Constructing Minimum Connected Dominating Set in Mobile Ad Hoc NetworksGiselleginaGloria
One of the most important challenges of a Mobile Ad Hoc Network (MANET) is to ensure efficient routing among its nodes. A Connected Dominating Set (CDS) is a widely used concept by many protocols for broadcasting and routing in MANETs. Those existing protocols require significant message overhead in construction of CDS. In this paper, we propose a simple, inexpensive and novel algorithm of computing a minimum CDS. The proposed algorithm saves time and message overhead in forming a CDS while supporting node mobility efficiently. Simulation results show that the proposed algorithm is efficient in terms of both message complexity and the size of the CDS.
A NOVEL APPROACH FOR ENERGY EFFICIENT HIERARCHY BASED ROUTING IN SENSOR NETWO...cscpconf
Wireless sensor network (WSN) is the collection of many micro-sensor nodes, connecting each other by a
wireless medium. WSN exhibits different approaches to provide reliable sensing of the environment,
detecting and reporting events. In this paper, we have proposed an algorithm for hierarchy based protocols
of wireless sensor networks, which consist of two groups of sensor nodes in a single cluster node. Each
cluster consists of a three cluster head. The event driven data sensing mechanism is used in this paper and
this sensed data is transmitted to the master section head. Hence efficient way of data transmission is possible with larger group of nodes. In this approach, using hierarchy based protocols; the lifetime of the sensor network is increased.
Simulator for Energy Efficient Clustering in Mobile Ad Hoc Networkscscpconf
The research on various issues in Mobile ad hoc networks is getting popular because of its
challenging nature and all time connectivity to communicate. Network simulators provide the
platform to analyse and imitate the working of the nodes in the networks along with the traffic
and other entities. The current work proposes the design of a simulator for the mobile ad hoc
networks that provides a test bed for the energy efficient clustering in the dynamic network.
Node parameters like degree of connectivity and average transmission power are considered for
calculating the energy consumption of the mobile devices. Nodes that consume minimum energy among their 1-hop neighbours are selected as the cluster heads.
AggreLEACH: Enhance Privacy Preserving in Wireless Sensor Networkijsrd.com
Privacy preservation is an important issue in today's context of extreme penetration of internet and mobile technology. It is more important in the case of wireless sensor network where collected data often requires in network processing and collaborative computing. Security is always booming in wireless sensor network. Privacy preserving data aggregation emerged as an important concern in designing data aggregation algorithm. Encryption schemes that support operation over cipher text are of utmost for wireless sensor networks & especially in LEACH protocol. The salient limit of LEACH is energy. Due to this limitation, it seems important to design Confidentiality scheme for WSN so that sensing data can be transmitted to the receiver securely and efficiently and the energy consumed must be minimum hence we proposed AggreLEACH in which confidentiality scheme i.e. holomorphic encryption is added to LEACH protocol. In holomorphic encryption data can be aggregated without decryption and hence less energy consumption. The objective is to provide secure data transmission between sensor node and aggregator. Simulation result are obtain in terms of two metrics- total energy Consumed of node, life-time of node. It is observed that the performance of AggreLEACH compare to LEACH. We have performed theoretical analysis as well as simulation to check the performance in terms of accuracy, complexity and security.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
A SURVEY ON DIFFERENT TYPES OF CLUSTERING BASED ROUTING PROTOCOLS IN WIRELESS...Journal For Research
In most of today’s application the wireless sensor network (WSN) play an important role.WSN is an autonomous system to monitor physical and environmental conditions. It can sense and compute the information or data or message that transmitted through it. Important design issue of the Wireless sensor networks energy consumption and lifetime of the network. The design of different routing protocol is another important design issue in WSN. There are mainly broad types of routing protocols in wireless sensor networks. This paper mainly deals with different types of cluster based routing protocols in WSN. Clustering algorithms are mainly defined to reduce the energy consumption and improves the life time of the network.
WIRELESS SENSOR NETWORK CLUSTERING USING PARTICLES SWARM OPTIMIZATION FOR RED...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality. The most important issue in this type of networks is energy constraints. In this area several researches have been done from which clustering is one of the most effective solutions. The goal of clustering is to divide network into sections each of which has a cluster head (CH). The task of cluster heads collection, data aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF, PSO-MV) in terms of network lifetime and energy consumption.
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.
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.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
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.
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/
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
AI for Every Business: Unlocking Your Product's Universal Potential by VP of ...
F017123439
1. IOSR Journal of Computer Engineering (IOSR-JCE)
e-ISSN: 2278-0661,p-ISSN: 2278-8727, Volume 17, Issue 1, Ver. II (Jan – Feb. 2015), PP 34-39
www.iosrjournals.org
DOI: 10.9790/0661-17123439 www.iosrjournals.org 34 | Page
A Survey Paper on Cluster Head Selection Techniques for Mobile
Ad-Hoc Network
Nilesh Goriya1
, Indr Jeet Rajput2
, Mihir Mehta3
123
Hasmukh Goswami College of Engineering, Ahmedabad, India
Abstract: Wireless Technologies are very useful due to their use. Mobile Ad-hoc Network (MANET) has
become an essential technology in field of research In MANET, Clustering is an important research area, it
offers several advantages like it improves stability and decrees the overhead of the network that increases the
efficiency of the network. Clustering increases system capacity by reusing available resources. This Survey
paper analyzes number of Cluster head Selection Techniques that are widely used for partitioning mobile host
into distinct virtual groups. Each Clustering Technique uses various parameters for selecting Cluster head in
cluster. Cluster head is work as leader in cluster and maintain the whole network information which decreases
the computation cost and routing overhead of the network in MANET. Each technique is used on the bases of
their parameters. Each approach has its own pros and cons.
Keywords: Mobile Ad-hoc Network, Clustering, Cluster head (CH), Cluster Gateway, Cluster Member
I. Introduction
The term Ad-hoc, says it‟s just “Temporary Network” network. Mobile Ad-hoc Network is containing
the mobile nodes that are also called as mobile host. All mobile hosts are connecting with each other through
wireless links they all are contained by infrastructure-less environment. Such network referred as multi-hop
networks. Each node working as router, it forwards data packets to the destination node of the network.The
growth of laptops and 802.11/Wi-Fi wireless networking has made MANET a popular topic for research in
recent time.
In Clustering, the mobile nodes in a network are partitioned into distinct virtual groups. Nodes are
assigned geographically adjacent into same cluster according to some rules [1]. Cluster based network describes
the three types of nodes in the network. They are as follows:
Figure 1: Mobile Ad Hoc Network (MANET) [15]
1. Cluster Head:
Cluster Head serves as a leader node for its Cluster. Through cluster head any node can easily
communicate with each other. In network it is a key factor for communication of node. It performs responsible
duties like inter-clustering, intra-clustering, data packet forwarding and maintains the entire network.
2. Cluster Gateway:
It is a non-Cluster Head node. It is one kind of intermediate node which provide link between two
clusters. It is also called as Border node in Cluster. It can access neighboring cluster and transfer data packet
between clusters.
2. A Survey Paper on Cluster Head Selection Techniques for Mobile Ad-hoc Network
DOI: 10.9790/0661-17123439 www.iosrjournals.org 35 | Page
3. Cluster Members:
It is also called as Ordinary nodes in the Cluster. It is neither Cluster Head node nor Border nodes. It
does not have any inter cluster links.
Figure 2: Clustering in MANET [4]
Clustering in MANET:
In Clustering, the mobile hosts in a network are divided into virtual groups and create sub network.
Clustering is control based network in that there is cluster head that manage or maintain the whole cluster; it has
ability in performing the role of the local coordinator. The MANET Clustering problem is to partition M into a
set of Clusters, C = {c1, c2, c3... cn} such that c1 ∪ c2 ∪...∪cn= M.
Clustering offers several benefits when it is used with MANET:
1. It increases system capacity by spatial reusing available resources [10]. If two clusters are not neighbouring
clusters and they are not overlapped then they can use same set of frequency.
2. Cluster Head and Border nodes form a virtual backbone for routing among neighbouring clusters. So
generation and spreading of routing information is minimized to this set of nodes [11, 12].
3. Resource allocation can be done.
4. In cluster when mobile nodes moves to another cluster, only nodes present at that cluster need to update the
information. So information stored by each node is reduced, thus overhead of storing information is
decrees.
5. Reduction of control packet in routing [10].
Demerits of the clustering in MANET:
1. When any mobile node dies or node moves to another Cluster it causes the re-clustering sometimes. It is
called as the ripple effect of re-clustering.
2. Clustering is divided into two phases, Cluster Formation and Cluster Maintenance. During Cluster
Formation all nodes are mobile nodes so routing strategies may be frequently changed that will decrees the
performance of the network.
The objective of this survey is to choose appropriate cluster head selection techniques by selecting
most suitable node as cluster head. And to maintain a cluster to keep cluster head changes as least as possible.
That reduces the effect of re-clustering.
The rest of this paper is organized as follows. Section 2 presents literature review on cluster head selection
techniques for selecting suitable cluster head. Section 3 Comparative analysis of cluster head selection
techniques. Conclusion and Future work is given in Section 4.
II. Survey On Cluster Head Selection Techniques In Manets
A. Lowest ID Clustering ( LIC ) [2]
In this Clustering approach unique identifier is assigned to each mobile host in the network. All nodes
recognize its neighbors‟ ID and CH is chosen according to minimum ID, Thus the node IDs of the neighbors of
the CH will be higher than that CH.The main drawback with this scheme is; here is no limitation to the number
of nodes attached to the same CH. Also, CHs are prone to power drainage due to serving as cluster heads longer
period of time.
3. A Survey Paper on Cluster Head Selection Techniques for Mobile Ad-hoc Network
DOI: 10.9790/0661-17123439 www.iosrjournals.org 36 | Page
Figure3: Lowest ID Clustering [2]
B. Highest Degree Clustering (HCC) [2][4][6]
It is connectivity based Clustering approach. All nodes broadcast their ID to the nodes which are in
their transmission range. In comparison with Lowest-ID scheme, the degree of nodes is computed based on its
distance from each other‟s [6]. All nodes flood its connectivity value within their transmission range. Thus, a
node decides to become a CH or remain as cluster node by comparing the connectivity value of its neighbors
with its own value. Node with highest connectivity value in its vicinity will become CH as shown in Fig. 4.
Connectivity-based clustering follows the same circumstances of ID-based regarding to cluster size and
performance degradation. The node which has highest number of neighbors is selected as CH by this approach.
There is a direct link between CH and its neighbors.
Figure 4: Highest Degree Connectivity Clustering [2]
C. K- hop connectivity ID Clustering (K-CONID) [3][5]
This approach combines Lowest ID Clustering approach with highest degree Clustering approach.
HCC is considered as first criteria and Lowest Id as second criteria. In this Clustering technique the node
connectivity D is paired with node ID which can be written as DID = (D, ID). The node is selected as Cluster
Head if and only if it has highest degree and lowest ID.
D. Mobility Based D-Hop Clustering Algorithm [2]
Another technique can be used with clustering in MANETs. It applies partitioning ad-hoc network into
D-Hop clusters. This process based on mobility metric as it follows the objectives of forming cluster with more
flexible cluster diameter according to D-Hop. This technique is adaptable with respect to node mobility. Both of
variation of estimated distance and relative mobility between hosts are used to calculate the local stability. A
node may be selected as a CH if we found the most stable node among its neighborhood. Consequently, the
node with the lowest value of local stability among its neighbors will be the CH.
E. Adaptive Cluster Load balance approach [3]
In Highest connectivity clustering algorithm (HCC) scheme, one CH can be exhausted when it serves
too many mobile hosts. It is unpredictable and the CH becomes a bottleneck. So a new Technique is given. In
hello message format, there is an "Option" item. If CH is a sender node, it will set the number of its dominated
member nodes as "Option" value. When CH is not a sender node or it is undecided (CH or non-CH), "Option"
item will be reset to 0. When a Cluster head's Hello message shows it‟s dominated nodes' number increase
4. A Survey Paper on Cluster Head Selection Techniques for Mobile Ad-hoc Network
DOI: 10.9790/0661-17123439 www.iosrjournals.org 37 | Page
beyond a threshold (the maximum number one CH can manage), no new node will take part in this cluster. As a
result, this can eliminate the CH bottleneck phenomenon and optimize the cluster structure. Through this
algorithm we can get load balance between different types of clusters. Thus, resource consumption and
information transmission is distributed to all clusters.
F. Least Cluster change Algorithm [3][7]
LCC has a useful improvement over LIC and HCC algorithms as for as the cost of cluster maintenance
is considered. The clustering procedures periodically considered by protocol, and re-cluster the nodes
periodically in order to satisfy some proper characteristic of CH. In HCC, the clustering scheme is performed
periodically to check the “local highest node degree” aspect of a cluster head. When a cluster head finds a
member node with a higher degree, it is forced to hand over its cluster head role. Re-clustering is frequently
involved by this mechanism. In LCC the clustering algorithm is further categorized into two steps: cluster
formation and cluster maintenance. The LIC technique is followed by Cluster formation method, i.e. initially
mobile nodes with the lowest ID in their neighborhoods are chosen as CH. Re-clustering is event-driven and
invoked in only two cases:
When two cluster heads move into the reach range of each other, one gives up the cluster head role.
When a mobile node cannot access any CH, it re-constructs the cluster structure for the network according
to LIC.
G. Load balancing Clustering [3][4]
It provides the balance of loads on Cluster Heads. Once a node is selected as a CH; it is desirable for it
to stay as a Cluster Head up to some maximum specified time limit or budget. Budget is defined by user and it
constraint placed on the heuristic and can be modified to meet some particular characteristics of the system.
Two local parameters are maintained Physical ID – unique ID for each node and Virtual ID (VID). Initially VID
is set as its ID number at first. Mobile nodes have highest IDs in their local area is elected as Cluster Head first.
LBC limits the maximum time unit that a node can serve as a Cluster Head continuously by budget; so; when
selected Cluster Heads‟ budget is over; it is reset to zero. After that it becomes non Cluster Head node. When
two Cluster Heads move into the range of each other; the one having higher VID wins as CH.
H. Power-aware connected dominant set [3][4][8]
It is an energy efficient clustering approach which decreases the size of Dominating set (DS) without
affecting its functions. Unnecessary nodes are removed from the DS without. If all the nodes in the system are
either in the set or neighbor of the nodes in the set is called as Dominating Set. In this schema energy level
instead of ID or node degree is used as Metric for CH selection. Nodes in dominating set consume more energy
than nodes outside the set because they handle extra responsibilities like updating routing information, data
packet relay etc. So it is required to minimize the energy consumptions of Dominating set. A mobile node can
be deleted from the Dominating set when its close neighbor set is covered by one or two dominating neighbors.
I. Weighted Clustering approach[4][9]
WCA is based on the use of a combined weight metric. For Cluster Head selection; used parameters are
number of neighbors, distance with all neighbors, mobility, transmission power and battery power. To decrease
communication overhead; this approach is not called periodically. Cluster Head elect ion procedure is invoked
based on node mobility and when current Dominating set cannot cover all mobile nodes in the network.
Steps for WCA:
Step 1: Find the set of Neighbors of each node v called N(v).
Step 2: Calculate the degree difference for each node; ∆ v = │dv ─ ‟│ where dv is the number of neighbor of
nodes and ‟ is the pre-defined threshold value which shows maximum number of nodes Cluster Head can
handle ideally.
Step 3: For every node compute sum of distances Dv with all its neighbors. Then compute running average of
the speed for every node until current time T. This gives a measure of mobility Mv where (Xt, Yt) defines the
position of node V at instant. Mv
,
Step 4: Compute the cumulative time Pv during which node V acts as Cluster Head. Pv measures how much
battery power has been consumed.
5. A Survey Paper on Cluster Head Selection Techniques for Mobile Ad-hoc Network
DOI: 10.9790/0661-17123439 www.iosrjournals.org 38 | Page
Step 5: Calculate
Wv = w1 ∆v + w2 Dv + w3 Mv + w4 Pv
The node with the minimum weight is elected as Cluster Head.
J. Max-Min d-cluster formation Algorithm [4][13]
In most clustering approaches, all nodes are one hop away from elected cluster head in the cluster. The
main drawback of these approaches is they generate large number of cluster heads within the network. Because
of it network becomes congested. So, in Max-Min heuristic clusters are formed by nodes that are d-hops away
from the cluster head. A d - neighborhood of a node consists of node itself and the set of all nodes located within
d-hops away from the node. In this approach d is defined as the maximum number of hops away from nearest
cluster head. This value is an input to the clustering approach which allows control over the number of cluster
heads to be selected.
K. Mobility based Cluster formation algorithm for wireless mobile ad-hoc network [14]
In this paper, The Author proposes learning automata based weighted cluster formation algorithm
called MCFA in which the mobility parameters of the hosts are assumed to be random variables with unknown
distributions. In the proposed clustering algorithm, the expected relative mobility of each host with respect to all
its neighbors is estimated by sampling its mobility parameters in various epochs. MCFA is a fully distributed
algorithm in which each mobile independently chooses the neighboring host with the minimum expected
relative mobility as its cluster-head. This is done based solely on the local information each host receives from
its neighbors and the hosts need not to be synchronized.
III. Comparitive Analysis
Clustering Technique Cluster Head selection
Criteria
Merits Demerits
Lowest Id Cluster
algorithm
Max-Min d-
clustering
Node with Minimum
is selected as CH
If node A is largest in
neighborhood of node
b, then A will be CH
Simple and easy to
implement
No of cluster head
elected are controlled
by value of d
No limitation of node in
one cluster and power
drainage
How to select value of d
is not specified
Highest
connectivity
clustering algorithm
(HCC)
K-Hop connectivity
ID clustering
algorithm
Adaptive cluster
Load balance method
The node with
maximum degree is
chosen as CH
Each node in the
network is assigned a
pair id= (d, ID).
To overcome
the disadvantage of
HCC ,to achieve load
balance distributing
resources
Number of nodes in
the cluster gets
increases
If used LIC only
creates maximum
Number of clusters
then necessary. If uses
HCC only it causes
ties between nodes.
Load balancing
achieved and CH
bottleneck
phenomenon can be
removed
There is flooding of
control messages
Each node needs to
maintain two parameters
connectivity and ID
Ties cannot be eliminated
between nodes having
same degree of
connectivity
Mobility based D-
Hop clustering
algorithm
A node may be selected
as CH if it is found to
be the most stable node
among its
neighborhood
It reduces the re-
clustering problem
Each node has to compute
mobility value , that
requires time
Least cluster change
algorithm (LCC)
Follows the method of
LIC for CH
Improve cluster
stability
If single node moves
outside to cluster; it may
require cluster structure
re-computation
Power-aware
connected dominant
set
Weighted clustering
algorithm
Whether a node should
serve as a cluster head
CH is selects according
to the number of nodes
Reduces size of DS
Refused overhead Knowing the weight of all
nodes before clustering
6. A Survey Paper on Cluster Head Selection Techniques for Mobile Ad-hoc Network
DOI: 10.9790/0661-17123439 www.iosrjournals.org 39 | Page
IV. Conclusion
We have surveyed some of the Clustering head selection techniques which is useful to organize Mobile
Ad Hoc Networks in a classified manner. In this survey paper we have seen cluster head select on the bases of
which parameter is used. We also have seen the importance of the Clustering approaches, we have also seen that
a Cluster based Mobile Ad Hoc Networks have various issues to examine, such as the Cluster stability, the
energy consumption of mobile nodes, the load distribution, and the fairness of serving as CHs for a mobile node.
Acknowledgment
I would like to thank to Mr. Indr Jeet Rajput, Mr. Mihir Mehta And Mr. Vinit Gupta for encouraging me to write
this research paper. I thank my family who always encourage me to do new things in life.
.
References
[1]. Jane Y. Yu and Peter H, J. Chong “A Survey of clustering schemas for Mobile Ad Hoc Network” Presented at IEEE
Communications Surveys & Tutorials, First Quarter 2005.
[2]. Dr. Mohammad Bokhari and Hatem S, Hamatta “A Review of Clustering Algorithms as Applied in MANETs” Presented at
IJARCSSE, November-2012.
[3]. Ratish Agrawal and Dr. Mahesh Motwani “Survey of Clustering Algorithms for MANETs”published at International Journal on
Computer Science and Engineering, Volume 1, Issue 2, February-2009.
[4]. Sheetal Mehta, Priyanka Sharma and Ketan Kotecha ”A Survey on Various Cluster Head Election Algorithms for MANET”
presented at International Conference on Concurrent trends in technology, „NUiCONE – 2011.
[5]. G. Chen, F. Nocetti, J. Gonzalez, “Connectivity based K-hop clustering in wireless networks”. Proceedings of the 35th Annual
Hawaii International Conference on System Sciences. Vol.7, pp. 188.3, 2002
[6]. Narendra Singh Yadav, Bhaskar P. Deosarkar, and R.P.Yadav “A Low Control Overhead Cluster Maintenance Scheme for Mobile
Ad hoc Networks” published at International Journal of Recent Trends in Engineering, Vol. 1, No. 1, May-2009.
[7]. F. Li, S. Zhang, X. Wang “ Vote Based Clustering Algorithm in Mobile Ad Hoc Networks ” In proceedings of International
Conference on Networking Technologies, 2004.
[8]. Jie Wu, Fei Dai, Ming Gao, and Ivan Stojmenovic, "On Calculating Power-Aware Connected Dominating Sets for Efficient Routing
in Ad Hoc Wireless Networks" Journal of Communications and Networks, Vol.4, no.1, pp. 59-70, March 2002.
[9]. Amer O. Abu Salem and Suffin Yosef “WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks” presented at IEEE
International Conference on Personal Wireless Communication, New Delhi, India, 2005.
[10]. S. Muthuramlingam, M. Sujatha, R. Surya, “An Enhanced Sectorized Clustering Scheme based on Transmission Range for
MANETs” in proceedings of IEEE International Conference on Recent Trends on Information Technology, June-2011.
[11]. C. R. Lin and M. Gerla, “Adaptive Clustering for Mobile Ad-hoc Network”, IEEE JSAC, Vol. 15, September-1997.
[12]. U. C. Kozat et al., “Virtual Dynamic Backbone for Mobile Ad-hoc Network”, Proc. IEEE International Conference on
Communication in Mobile Ad Hoc Networks‟ 01, Vol. 1, June 2001.
[13]. Umamaheswari, G Radhamani, “Clustering Schemes for Mobile Ad-hoc Networks: A Review”, International Conference on
Computer Communication and Informatics (ICCCI-2012), Jan.10-12, 2012, Coimbatore,India.
[14]. Javad Akbari Torkestani “A Mobility Based Cluster Formation Algorithm for Wireless Mobile Ad-hoc Networks” Accepted at
Springer Science+ Business Media, January-2011.
[15]. Nisha, Sandeep Arora, “Analysis of Black Hole and Gray Hole Attack on RP-AODV in MANET”, published at International
Journal of Engineering & Technology, August-2013.