Underwater Wireless Acoustic Sensor Networks (UWASNs) are creating attentiveness in
researchers due to its wide area of applications. To extract the data from underwater and transmit to
watersurface, numerous clustering and data aggregation schemes are employed. The main objectives of
clustering and data aggregation schemes are to decrease the consumption of energy and prolong the
lifetime of the network. In this paper, we focus on initial clustering of sensor nodes based on their
geographical locations using fuzzy logic. The probability of degree of belongingness of a sensor node to its
cluster, along with number of clusters is analysed and discussed. Based on the energy and distance the
cluster head nodes are determined. Finally using using similarity function data aggregation is analysed and
discussed. The proposed scheme is simulated in MATLAB and compared with LEACH algorithm.
The simulation results indicate that the proposed scheme performs better in maximizing network lifetime
and minimizing energy consumption.
GREEDY CLUSTER BASED ROUTING FOR WIRELESS SENSOR NETWORKSijcsit
In recent years, applications of wireless sensor networks have evolved in many areas such as target tracking, environmental monitoring, military and medical applications. Wireless sensor network continuously collect and send data through sensor nodes from a specific region to a base station. But, data redundancy due to neighbouring sensors consumes energy, compromising the network lifetime. In order to improve the network lifetime, a novel cluster based local route search method, called, Greedy Clusterbased Routing (GCR) technique in wireless sensor network. The proposed GCR method uses arbitrary timer in order to participate cluster head selection process with maximum neighbour nodes and minimum distance between the source and base station. GCR constructs dynamic routing improving the rate of network lifetime through Mass Proportion value. Also, GCR uses a greedy route finding strategy for
balancing energy consumption. Experimental results show that GCR achieves significant energy savings and prolong network lifetime.
Mobile Data Gathering with Load Balanced Clustering and Dual Data Uploading i...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
ENERGY-EFFICIENT MULTI-HOP ROUTING WITH UNEQUAL CLUSTERING APPROACH FOR WIREL...IJCNCJournal
The development of an energy-efficient routing protocol, capable of extending the life of the network, is one of the main constraints of wireless sensor networks (WSN). Research studies on WSN routing prove that clustering offers an effective approach to prolong the lifetime of a WSN, particularly when it is combined with multi-hop communication that can reduces energy costs by minimizing the distance between transmitter and receiver. Most clustering algorithms using multi-hop in data transmission encounter the hotspot problem. In this work, an Energy-efficient Multi-hop routing with Unequal Clustering approach (EMUC) is proposed, to create clusters of different sizes, which depend on the distance between the sensor node and the base station. Equilibrate the energy dissipation between the cluster heads is the purpose of this approach by adopting multi-hop communication to relay data to the base station. The implementation of multi-hop mode to transmit data to the base station reduces the energy cost of transmission over long distances. The effectiveness of this approach is validated through performed simulations, which prove that EMUC balances energy consumption between sensor nodes, mitigates the hotspots problem, saves more energy and significantly extends the network lifetime.
Energy efficiency has recently turned out to be primary issue in wireless sensor networks.
Sensor networks are battery powered, therefore become dead after a certain period of time. Thus,
improving the data dissipation in energy efficient way becomes more challenging problem in order to
improve the lifetime for sensor devices. The clustering and tree based data aggregation for sensor
networks can enhance the network lifetime of wireless sensor networks. Non-dominated Sorting Genetic
Algorithm (NSGA) -III based energy efficient clustering and tree based routing protocol is proposed.
Initially, clusters are formed on the basis of remaining energy, then, NSGA-III based data aggregation
will come in action to improve the inter-cluster data aggregation further. Extensive analysis demonstrates
that proposed protocol considerably enhances network lifetime over other techniques.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
Data collection algorithm for wireless sensor networks using collaborative mo...IJECEIAES
The simplest approach to reduce network latency for data gathering in wireless sensor networks (WSN) is to use multiple mobile elements rather than a single mobile sink. However, the most challneging issues faced this approach are firstly the high network cost as a result of using large number of mobile elements. Secondly, it suffers from the difficulty of network partitioning to achieve an efficient load balancing among these mobile elements. In this study, a collaborative data collection algorithm (CDCA) is developed. Simulation results presented in this paper demonstrated that with this algorithm the latency is significantly reduced at small number of mobile elements. Furthermore, the performance of CDCA algorithm is compared with the Area Splitting Algorithm (ASA). Consequently, the CDCA showed superior performance in terms of network latency, load balancing, and the required number of mobile elements.
GREEDY CLUSTER BASED ROUTING FOR WIRELESS SENSOR NETWORKSijcsit
In recent years, applications of wireless sensor networks have evolved in many areas such as target tracking, environmental monitoring, military and medical applications. Wireless sensor network continuously collect and send data through sensor nodes from a specific region to a base station. But, data redundancy due to neighbouring sensors consumes energy, compromising the network lifetime. In order to improve the network lifetime, a novel cluster based local route search method, called, Greedy Clusterbased Routing (GCR) technique in wireless sensor network. The proposed GCR method uses arbitrary timer in order to participate cluster head selection process with maximum neighbour nodes and minimum distance between the source and base station. GCR constructs dynamic routing improving the rate of network lifetime through Mass Proportion value. Also, GCR uses a greedy route finding strategy for
balancing energy consumption. Experimental results show that GCR achieves significant energy savings and prolong network lifetime.
Mobile Data Gathering with Load Balanced Clustering and Dual Data Uploading i...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
ENERGY-EFFICIENT MULTI-HOP ROUTING WITH UNEQUAL CLUSTERING APPROACH FOR WIREL...IJCNCJournal
The development of an energy-efficient routing protocol, capable of extending the life of the network, is one of the main constraints of wireless sensor networks (WSN). Research studies on WSN routing prove that clustering offers an effective approach to prolong the lifetime of a WSN, particularly when it is combined with multi-hop communication that can reduces energy costs by minimizing the distance between transmitter and receiver. Most clustering algorithms using multi-hop in data transmission encounter the hotspot problem. In this work, an Energy-efficient Multi-hop routing with Unequal Clustering approach (EMUC) is proposed, to create clusters of different sizes, which depend on the distance between the sensor node and the base station. Equilibrate the energy dissipation between the cluster heads is the purpose of this approach by adopting multi-hop communication to relay data to the base station. The implementation of multi-hop mode to transmit data to the base station reduces the energy cost of transmission over long distances. The effectiveness of this approach is validated through performed simulations, which prove that EMUC balances energy consumption between sensor nodes, mitigates the hotspots problem, saves more energy and significantly extends the network lifetime.
Energy efficiency has recently turned out to be primary issue in wireless sensor networks.
Sensor networks are battery powered, therefore become dead after a certain period of time. Thus,
improving the data dissipation in energy efficient way becomes more challenging problem in order to
improve the lifetime for sensor devices. The clustering and tree based data aggregation for sensor
networks can enhance the network lifetime of wireless sensor networks. Non-dominated Sorting Genetic
Algorithm (NSGA) -III based energy efficient clustering and tree based routing protocol is proposed.
Initially, clusters are formed on the basis of remaining energy, then, NSGA-III based data aggregation
will come in action to improve the inter-cluster data aggregation further. Extensive analysis demonstrates
that proposed protocol considerably enhances network lifetime over other techniques.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
Limited energy is the major driving factor for research on wireless sensor networks. Clustering alleviates
this energy shortage problem by reducing data traffic conveyed over the network and therefore several
clustering methods are proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the topology or making clusters near
to the sink with smaller sizes. However, to the best of our knowledge, there is no comprehensive research
that investigates the effects of various structural alternatives on energy consumption of wireless sensor
networks. In this paper, we thoroughly analyse the impact of various structural approaches such as cluster
size, number of tiers in the topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about lifetime prolongation is achieved by
locating a sufficient number of sinks around the network area.
Data collection algorithm for wireless sensor networks using collaborative mo...IJECEIAES
The simplest approach to reduce network latency for data gathering in wireless sensor networks (WSN) is to use multiple mobile elements rather than a single mobile sink. However, the most challneging issues faced this approach are firstly the high network cost as a result of using large number of mobile elements. Secondly, it suffers from the difficulty of network partitioning to achieve an efficient load balancing among these mobile elements. In this study, a collaborative data collection algorithm (CDCA) is developed. Simulation results presented in this paper demonstrated that with this algorithm the latency is significantly reduced at small number of mobile elements. Furthermore, the performance of CDCA algorithm is compared with the Area Splitting Algorithm (ASA). Consequently, the CDCA showed superior performance in terms of network latency, load balancing, and the required number of mobile elements.
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.
DATA GATHERING ALGORITHMS FOR WIRELESS SENSOR NETWORKS: A SURVEYijasuc
Recent developments in processor, memory and radio technology have enabled wireless sensor networks
which are deployed to collect useful information from an area of interest. The sensed data must be
gathered and transmitted to a base station where it is further processed for end-user queries. Since the
network consists of low-cost nodes with limited battery power, power efficient methods must be employed
for data gathering and aggregation in order to achieve long network lifetimes. In an environment where in
a round of communication each of the sensor nodes has data to send to a base station, it is important to
minimize the total energy consumed by the system in a round so that the system lifetime is maximized. With
the use of data fusion and aggregation techniques, while minimizing the total energy per round, if power
consumption per node can be balanced as well, a near optimal data gathering and routing scheme can be
achieved in terms of network lifetime. Several application specific sensor network data gathering protocols
have been proposed in research literatures. However, most of the proposed algorithms have been some
attention to the related network lifetime and saving energy are two critical issues for wireless sensor
networks. In this paper we have explored general network lifetime in wireless sensor networks and made an
extensive study to categorize available data gathering techniques and analyze possible network lifetime on
them.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
AN OPTIMUM ENERGY CONSUMPTION HYBRID ALGORITHM FOR XLN STRATEGIC DESIGN IN WSN’SIJCNCJournal
In this paper, X-Layer protocol is originated which executes mobility error prediction (MEP) algorithm to calculate the remaining energy level of each node. This X-Layer protocol structure employs the mobility aware protocol that senses the mobility concerned to each node with the utilization of Ad-hoc On-Demand Distance Vector (AODV), which shares the information or data specific to the distance among individual nodes. With the help of this theory, the neighbour list will be updated only to those nodes which are mobile resulting in less energy consumption when compared to all (static/mobile) other nodes in the network. Apart from the MEP algorithm, clustering head (CH) election algorithm has also been specified to identify the relevant clusters whether they exists within the network region or not. Also clustering multi-hop routing (CMHR) algorithm was implemented in which the node can identify the cluster to which it belongs depending upon the distance from each cluster surrounding the node. Finally comprising the AODV routing protocol with the Two-Ray Ground method, we implement X-Layer protocol structure by considering MAC protocol in accordance to IEEE 802.15.4 to obtain the best results in energy consumption and also by reducing the energy wastage with respect to each node. The effective results had been illustrated through Network Simulator-II platform.
Dynamic selection of cluster head in in networks for energy managementeSAT Journals
Abstract In this project, we presented Multipath Region Routing (MRR) protocol for energy conservation in Wireless Sensor Networks (WSNs). Large scale dense WSNs are used in different types of applications for accurate monitoring. Energy conservation is an important issue in WSNs. In order to save energy, Multipath Region Routing protocol is used which provides balance in energy consumption and sustains the network life-span. By using this method, we can reduce the number of energy dissipation because the cluster head will collect data directly from other nodes. Hence, the energy can be preserved and network life time is extended to reasonable time. Keywords: Clustering; Wireless Sensor Networks; Security; Multipath Region Routing;
Dynamic selection of cluster head in in networks for energy managementeSAT 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
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.
Data gathering in wireless sensor networks using intermediate nodesIJCNCJournal
Energy consumption is an essential concern to Wireless Sensor Networks (WSNs).The major cause of the energy consumption in WSNs is due to the data aggregation. A data aggregation is a process of collecting data from sensor nodes and transmitting these data to the sink node or base station. An effective way to perform such a task is accomplished by using clustering. In clustering, nodes are grouped into clusters where a number of nodes, called cluster heads, are responsible for gathering data from other nodes, aggregate them and transmit them to the Base Station (BS).
In this paper we produce a new algorithm which focused on reducing the transmission bath between sensor nodes and cluster heads. A proper utilization and reserving of the available power resources is achieved with this technique compared to the well-known LEACH_C algorithm.
Abstract: Energy consumption is one of the constraints in Wireless Sensor Networks (WSNs). The routing protocols are the hot areas to address quality-of-service (QoS) related issues viz. Energy consumption, network lifetime, network scalability and packet overhead. In existing system a hybrid optimization based PEGASIS-DSR optimized routing protocol (PDORP) is presented which used cache and directional transmission concept of both proactive and reactive routing protocols. The performance of PDORP has been evaluated and the results indicated that it performs better in most significant parameters. The performance of the existing method is checked when it is evaluated and validated with the nodes which are highly dynamic in nature based on the application requirement. The current system finds the trusted nodes in the case of only static environment. To overcome the issue the proposed system is applied for dynamic WSN’s with the location frequently being changed. The PDORP-LC is applied with local caching (LC) to acquire the location information so that the path learning can be dynamic without depending on the fixed location. The proposed work is performing in dynamic environment with the dynamic derivation of trusted nodes.
Keywords: local caching (LC), Wireless Sensor Networks (WSNs), PEGASIS-DSR optimized routing protocol (PDORP).
Title: Energy Efficient Optimal Paths Using PDORP-LC
Author: ADARSH KUMAR B, BIBIN CHRISTOPHER, ISSAC SAJAN, AJ DEEPA
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
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
In recent years, applications of wireless sensor networks have evolved in many areas such as target
tracking, environmental monitoring, military and medical applications. Wireless sensor network
continuously collect and send data through sensor nodes from a specific region to a base station. But, data
redundancy due to neighbouring sensors consumes energy, compromising the network lifetime. In order to
improve the network lifetime, a novel cluster based local route search method, called, Greedy Cluster-
based Routing (GCR) technique in wireless sensor network. The proposed GCR method uses arbitrary
timer in order to participate cluster head selection process with maximum neighbour nodes and minimum
distance between the source and base station. GCR constructs dynamic routing improving the rate of
network lifetime through Mass Proportion value. Also, GCR uses a greedy route finding strategy for
balancing energy consumption. Experimental results show that GCR achieves significant energy savings
and prolong network lifetime
In recent years, applications of wireless sensor networks have evolved in many areas such as target tracking, environmental monitoring, military and medical applications. Wireless sensor network continuously collect and send data through sensor nodes from a specific region to a base station. But, data redundancy due to neighbouring sensors consumes energy, compromising the network lifetime. In order to improve the network lifetime, a novel cluster based local route search method, called, Greedy Clusterbased Routing (GCR) technique in wireless sensor network. The proposed GCR method uses arbitrary timer in order to participate cluster head selection process with maximum neighbour nodes and minimum distance between the source and base station. GCR constructs dynamic routing improving the rate of network lifetime through Mass Proportion value. Also, GCR uses a greedy route finding strategy for balancing energy consumption. Experimental results show that GCR achieves significant energy savings and prolong network lifetime.
Energy Conservation in Wireless Sensor Networks Using Cluster-Based ApproachIJRES Journal
In a wireless networking environment, the network is comprised of sensor nodes and backbones are subsets of sensors or actuators that suffice for performing basic data communication operations. They are applied for energy efficient broadcasting. In a broadcasting (also known as data dissemination) task, a message is to be sent from one node, which could be a sink or an actuator, to all the sensors or all the actuators in the network. The goal is to minimize the number of rebroadcasts while attempting to deliver messages to all sensors or actuators. Neighbor detection and route discovery algorithms that consider a realistic physical layer are described. An adaptive broadcasting protocol without parameters suitable for delay tolerant networks is further discussed. In existing solutions for minimal energy broadcasting problem, nodes can adjust their transmission powers. Wireless Sensor Networks (WSNs) are sets of many sensors that gather data and collaborate together. So, the procedures of broadcast or multicast are more important than traditional point-to-point communication in computer network. This paper focuses on broadcasting in structured WSNs. In such a kind, the procedure of network communications is easier than in unstructured WSNs. Thus, it will make an overview of Multi Point Relay (MPR) to show its weakness. Then define a cluster-based architecture for WSNs which is constructed using MPR. Next, provide a new broadcast algorithm based on the previous cluster architecture called 3B (Backbone Based Broadcasting). By the end, an illustration of 3B shows that it minimizes the energy consumption for accomplishing broadcast compared to MPR.
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.
Cluster Based Routing using Energy and Distance Aware Multi-Objective Golden ...IJCNCJournal
In recent years, WSNs have attracted significant attention due to the improvements in various sectors such as communication, electronics, and information technologies. When the clustering algorithm incorporates both Euclidean distance and energy, it automatically decreases the energy consumption. So, the major goal of this research is to reduce energy consumption for prolong the lifetime of the network. In order to achieve an energy-efficient process, Energy and Distance Aware Multi-Objective Golden Eagle Optimization (ED-MOGEO) is proposed in this research. In addition, this proposed solution reduces retransmissions and delays to improve the performance metrics. And so, this research carried out two major fitness functions (Euclidean distance and energy) for creating an energy-efficient WSN. Furthermore, energy consideration is used to reduce the nodes unavailability which results in packet loss during the transmission. For generating the routing path between the source and the Base Station (BS), the ED-MOGEO algorithm is used. From the simulation results, it shows that Proposed ED-MOGEO achieves better performances in terms of residual energy (14.36 J), end-to-end delay (12.9 ms), packet delivery ratio (0.994), normalized routing overhead (0.11), and throughput (1.131 Mbps) when compared to existing Cluster-Based Data Aggregation (CBDA) and Elephant Herding Optimization (EHO)-Greedy methods.
CLUSTER BASED ROUTING USING ENERGY AND DISTANCE AWARE MULTI-OBJECTIVE GOLDEN ...IJCNCJournal
In recent years, WSNs have attracted significant attention due to the improvements in various sectors such
as communication, electronics, and information technologies. When the clustering algorithm incorporates
both Euclidean distance and energy, it automatically decreases the energy consumption. So, the major goal
of this research is to reduce energy consumption for prolong the lifetime of the network. In order to
achieve an energy-efficient process, Energy and Distance Aware Multi-Objective Golden Eagle
Optimization (ED-MOGEO) is proposed in this research. In addition, this proposed solution reduces
retransmissions and delays to improve the performance metrics. And so, this research carried out two
major fitness functions (Euclidean distance and energy) for creating an energy-efficient WSN.
Furthermore, energy consideration is used to reduce the nodes unavailability which results in packet loss
during the transmission. For generating the routing path between the source and the Base Station (BS), the
ED-MOGEO algorithm is used. From the simulation results, it shows that Proposed ED-MOGEO achieves
better performances in terms of residual energy (14.36 J), end-to-end delay (12.9 ms), packet delivery ratio
(0.994), normalized routing overhead (0.11), and throughput (1.131 Mbps) when compared to existing
Cluster-Based Data Aggregation (CBDA) and Elephant Herding Optimization (EHO)-Greedy methods.
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.
Clustering provides an effective method for
extending the lifetime of a wireless sensor network. Current
clustering methods selecting cluster heads with more residual
energy, and rotating cluster heads periodically to distribute the
energy consumption among nodes in each cluster. However,
they rarely consider the hot spot problem in multi hop sensor
networks. When cluster heads forward their data to the base
station, the cluster heads closer to the base station are heavily
burdened with traffic and tend to die much faster. To mitigate
the hot spot problem, we propose a Novel Energy Efficient
Unequal Clustering Routing (NEEUC) protocol. It uses residual
energy and groupsthe nodesinto clusters of unequal layers
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.
DATA GATHERING ALGORITHMS FOR WIRELESS SENSOR NETWORKS: A SURVEYijasuc
Recent developments in processor, memory and radio technology have enabled wireless sensor networks
which are deployed to collect useful information from an area of interest. The sensed data must be
gathered and transmitted to a base station where it is further processed for end-user queries. Since the
network consists of low-cost nodes with limited battery power, power efficient methods must be employed
for data gathering and aggregation in order to achieve long network lifetimes. In an environment where in
a round of communication each of the sensor nodes has data to send to a base station, it is important to
minimize the total energy consumed by the system in a round so that the system lifetime is maximized. With
the use of data fusion and aggregation techniques, while minimizing the total energy per round, if power
consumption per node can be balanced as well, a near optimal data gathering and routing scheme can be
achieved in terms of network lifetime. Several application specific sensor network data gathering protocols
have been proposed in research literatures. However, most of the proposed algorithms have been some
attention to the related network lifetime and saving energy are two critical issues for wireless sensor
networks. In this paper we have explored general network lifetime in wireless sensor networks and made an
extensive study to categorize available data gathering techniques and analyze possible network lifetime on
them.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
AN OPTIMUM ENERGY CONSUMPTION HYBRID ALGORITHM FOR XLN STRATEGIC DESIGN IN WSN’SIJCNCJournal
In this paper, X-Layer protocol is originated which executes mobility error prediction (MEP) algorithm to calculate the remaining energy level of each node. This X-Layer protocol structure employs the mobility aware protocol that senses the mobility concerned to each node with the utilization of Ad-hoc On-Demand Distance Vector (AODV), which shares the information or data specific to the distance among individual nodes. With the help of this theory, the neighbour list will be updated only to those nodes which are mobile resulting in less energy consumption when compared to all (static/mobile) other nodes in the network. Apart from the MEP algorithm, clustering head (CH) election algorithm has also been specified to identify the relevant clusters whether they exists within the network region or not. Also clustering multi-hop routing (CMHR) algorithm was implemented in which the node can identify the cluster to which it belongs depending upon the distance from each cluster surrounding the node. Finally comprising the AODV routing protocol with the Two-Ray Ground method, we implement X-Layer protocol structure by considering MAC protocol in accordance to IEEE 802.15.4 to obtain the best results in energy consumption and also by reducing the energy wastage with respect to each node. The effective results had been illustrated through Network Simulator-II platform.
Dynamic selection of cluster head in in networks for energy managementeSAT Journals
Abstract In this project, we presented Multipath Region Routing (MRR) protocol for energy conservation in Wireless Sensor Networks (WSNs). Large scale dense WSNs are used in different types of applications for accurate monitoring. Energy conservation is an important issue in WSNs. In order to save energy, Multipath Region Routing protocol is used which provides balance in energy consumption and sustains the network life-span. By using this method, we can reduce the number of energy dissipation because the cluster head will collect data directly from other nodes. Hence, the energy can be preserved and network life time is extended to reasonable time. Keywords: Clustering; Wireless Sensor Networks; Security; Multipath Region Routing;
Dynamic selection of cluster head in in networks for energy managementeSAT 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
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.
Data gathering in wireless sensor networks using intermediate nodesIJCNCJournal
Energy consumption is an essential concern to Wireless Sensor Networks (WSNs).The major cause of the energy consumption in WSNs is due to the data aggregation. A data aggregation is a process of collecting data from sensor nodes and transmitting these data to the sink node or base station. An effective way to perform such a task is accomplished by using clustering. In clustering, nodes are grouped into clusters where a number of nodes, called cluster heads, are responsible for gathering data from other nodes, aggregate them and transmit them to the Base Station (BS).
In this paper we produce a new algorithm which focused on reducing the transmission bath between sensor nodes and cluster heads. A proper utilization and reserving of the available power resources is achieved with this technique compared to the well-known LEACH_C algorithm.
Abstract: Energy consumption is one of the constraints in Wireless Sensor Networks (WSNs). The routing protocols are the hot areas to address quality-of-service (QoS) related issues viz. Energy consumption, network lifetime, network scalability and packet overhead. In existing system a hybrid optimization based PEGASIS-DSR optimized routing protocol (PDORP) is presented which used cache and directional transmission concept of both proactive and reactive routing protocols. The performance of PDORP has been evaluated and the results indicated that it performs better in most significant parameters. The performance of the existing method is checked when it is evaluated and validated with the nodes which are highly dynamic in nature based on the application requirement. The current system finds the trusted nodes in the case of only static environment. To overcome the issue the proposed system is applied for dynamic WSN’s with the location frequently being changed. The PDORP-LC is applied with local caching (LC) to acquire the location information so that the path learning can be dynamic without depending on the fixed location. The proposed work is performing in dynamic environment with the dynamic derivation of trusted nodes.
Keywords: local caching (LC), Wireless Sensor Networks (WSNs), PEGASIS-DSR optimized routing protocol (PDORP).
Title: Energy Efficient Optimal Paths Using PDORP-LC
Author: ADARSH KUMAR B, BIBIN CHRISTOPHER, ISSAC SAJAN, AJ DEEPA
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
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
In recent years, applications of wireless sensor networks have evolved in many areas such as target
tracking, environmental monitoring, military and medical applications. Wireless sensor network
continuously collect and send data through sensor nodes from a specific region to a base station. But, data
redundancy due to neighbouring sensors consumes energy, compromising the network lifetime. In order to
improve the network lifetime, a novel cluster based local route search method, called, Greedy Cluster-
based Routing (GCR) technique in wireless sensor network. The proposed GCR method uses arbitrary
timer in order to participate cluster head selection process with maximum neighbour nodes and minimum
distance between the source and base station. GCR constructs dynamic routing improving the rate of
network lifetime through Mass Proportion value. Also, GCR uses a greedy route finding strategy for
balancing energy consumption. Experimental results show that GCR achieves significant energy savings
and prolong network lifetime
In recent years, applications of wireless sensor networks have evolved in many areas such as target tracking, environmental monitoring, military and medical applications. Wireless sensor network continuously collect and send data through sensor nodes from a specific region to a base station. But, data redundancy due to neighbouring sensors consumes energy, compromising the network lifetime. In order to improve the network lifetime, a novel cluster based local route search method, called, Greedy Clusterbased Routing (GCR) technique in wireless sensor network. The proposed GCR method uses arbitrary timer in order to participate cluster head selection process with maximum neighbour nodes and minimum distance between the source and base station. GCR constructs dynamic routing improving the rate of network lifetime through Mass Proportion value. Also, GCR uses a greedy route finding strategy for balancing energy consumption. Experimental results show that GCR achieves significant energy savings and prolong network lifetime.
Energy Conservation in Wireless Sensor Networks Using Cluster-Based ApproachIJRES Journal
In a wireless networking environment, the network is comprised of sensor nodes and backbones are subsets of sensors or actuators that suffice for performing basic data communication operations. They are applied for energy efficient broadcasting. In a broadcasting (also known as data dissemination) task, a message is to be sent from one node, which could be a sink or an actuator, to all the sensors or all the actuators in the network. The goal is to minimize the number of rebroadcasts while attempting to deliver messages to all sensors or actuators. Neighbor detection and route discovery algorithms that consider a realistic physical layer are described. An adaptive broadcasting protocol without parameters suitable for delay tolerant networks is further discussed. In existing solutions for minimal energy broadcasting problem, nodes can adjust their transmission powers. Wireless Sensor Networks (WSNs) are sets of many sensors that gather data and collaborate together. So, the procedures of broadcast or multicast are more important than traditional point-to-point communication in computer network. This paper focuses on broadcasting in structured WSNs. In such a kind, the procedure of network communications is easier than in unstructured WSNs. Thus, it will make an overview of Multi Point Relay (MPR) to show its weakness. Then define a cluster-based architecture for WSNs which is constructed using MPR. Next, provide a new broadcast algorithm based on the previous cluster architecture called 3B (Backbone Based Broadcasting). By the end, an illustration of 3B shows that it minimizes the energy consumption for accomplishing broadcast compared to MPR.
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.
Cluster Based Routing using Energy and Distance Aware Multi-Objective Golden ...IJCNCJournal
In recent years, WSNs have attracted significant attention due to the improvements in various sectors such as communication, electronics, and information technologies. When the clustering algorithm incorporates both Euclidean distance and energy, it automatically decreases the energy consumption. So, the major goal of this research is to reduce energy consumption for prolong the lifetime of the network. In order to achieve an energy-efficient process, Energy and Distance Aware Multi-Objective Golden Eagle Optimization (ED-MOGEO) is proposed in this research. In addition, this proposed solution reduces retransmissions and delays to improve the performance metrics. And so, this research carried out two major fitness functions (Euclidean distance and energy) for creating an energy-efficient WSN. Furthermore, energy consideration is used to reduce the nodes unavailability which results in packet loss during the transmission. For generating the routing path between the source and the Base Station (BS), the ED-MOGEO algorithm is used. From the simulation results, it shows that Proposed ED-MOGEO achieves better performances in terms of residual energy (14.36 J), end-to-end delay (12.9 ms), packet delivery ratio (0.994), normalized routing overhead (0.11), and throughput (1.131 Mbps) when compared to existing Cluster-Based Data Aggregation (CBDA) and Elephant Herding Optimization (EHO)-Greedy methods.
CLUSTER BASED ROUTING USING ENERGY AND DISTANCE AWARE MULTI-OBJECTIVE GOLDEN ...IJCNCJournal
In recent years, WSNs have attracted significant attention due to the improvements in various sectors such
as communication, electronics, and information technologies. When the clustering algorithm incorporates
both Euclidean distance and energy, it automatically decreases the energy consumption. So, the major goal
of this research is to reduce energy consumption for prolong the lifetime of the network. In order to
achieve an energy-efficient process, Energy and Distance Aware Multi-Objective Golden Eagle
Optimization (ED-MOGEO) is proposed in this research. In addition, this proposed solution reduces
retransmissions and delays to improve the performance metrics. And so, this research carried out two
major fitness functions (Euclidean distance and energy) for creating an energy-efficient WSN.
Furthermore, energy consideration is used to reduce the nodes unavailability which results in packet loss
during the transmission. For generating the routing path between the source and the Base Station (BS), the
ED-MOGEO algorithm is used. From the simulation results, it shows that Proposed ED-MOGEO achieves
better performances in terms of residual energy (14.36 J), end-to-end delay (12.9 ms), packet delivery ratio
(0.994), normalized routing overhead (0.11), and throughput (1.131 Mbps) when compared to existing
Cluster-Based Data Aggregation (CBDA) and Elephant Herding Optimization (EHO)-Greedy methods.
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.
Clustering provides an effective method for
extending the lifetime of a wireless sensor network. Current
clustering methods selecting cluster heads with more residual
energy, and rotating cluster heads periodically to distribute the
energy consumption among nodes in each cluster. However,
they rarely consider the hot spot problem in multi hop sensor
networks. When cluster heads forward their data to the base
station, the cluster heads closer to the base station are heavily
burdened with traffic and tend to die much faster. To mitigate
the hot spot problem, we propose a Novel Energy Efficient
Unequal Clustering Routing (NEEUC) protocol. It uses residual
energy and groupsthe nodesinto clusters of unequal layers
A NODE DEPLOYMENT MODEL WITH VARIABLE TRANSMISSION DISTANCE FOR WIRELESS SENS...ijwmn
The deployment of network nodes is essential to ensure the wireless sensor network's regular operation and affects the multiple network performance metrics, such as connectivity, coverage, lifetime, and cost. This paper focuses on the problem of minimizing network costs while meeting network requirements, and proposes a corona-based deployment method by using the variable transmission distance sensor. Based on the analysis of node energy consumption and network cost, an optimization model to minimize Cost Per Unit Area is given. The transmission distances and initial energy of the sensors are obtained by solving the model. The optimization model is improved to ensure the energy consumption balance of nodes in the same corona. Based on these parameters, the process of network node deployment is given. Deploying the
network through this method will greatly reduce network costs.
Energy efficient data transmission using multiobjective improved remora optim...IJECEIAES
A wireless sensor network (WSN) is a collection of nodes fitted with small sensors and transceiver elements. Energy consumption, data loss, and transmission delays are the major drawback of creating mobile sinks. For instance, battery life and data latency might result in node isolation, which breaks the link between nodes in the network. These issues have been avoided by means of mobile data sinks, which move between nodes with connection issues. Therefore, energy aware multiobjective improved
remora optimization algorithm and multiobjective ant colony optimization
(EA-MIROA-MACO) is proposed in this research to improve the WSN’s energy efficiency by eliminating node isolation issue. MIRO is utilized to pick the optimal cluster heads (CHs), while multiobjective ant colony optimization (MACO) is employed to find the path through the CHs. The EA-MIROA-MACO aims to optimize energy consumption in nodes and enhance data transmission within a WSN. The analysis of EA-MIROA-MACO’s performance is conducted by considering the number of alive along with dead nodes, average residual energy, and network lifespan. The EA-MIROA-MACO is compared with traditional approaches such as mobile sink and fuzzy based relay node routing (MSFBRR) protocol as well as hybrid neural network (HNN). The EA-MIROA-MACO demonstrates a higher number of alive nodes, specifically 192, over the MSFBRR and HNN for 2,000 rounds.
Energy efficient clustering in heterogeneousIJCNCJournal
Cluster head election is a key technique used to reduce energy consumption and enhancing the throughput
of wireless sensor networks. In this paper, a new energy efficient clustering (E2C) protocol for
heterogeneous wireless sensor networks is proposed. Cluster head is elected based on the predicted
residual energy of sensors, optimal probability of a sensor to become a cluster head, and its degree of
connectivity as the parameters. The probability threshold to compete for the role of cluster head is derived.
The probability threshold has been extended for multi-levels energy heterogeneity in the network. The
proposed E2C protocol is simulated in MATLAB. Results obtained in the simulationshowthat performance
of the proposed E2Cprotocol is betterthan stable election protocol (SEP), and distributed energy efficient
clustering (DEEC) protocol in terms of energy consumption, throughput, and network lifetime.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and
packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which
ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer
from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of
sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads
in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption
and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer
and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers
reduces the energy consumption and increases the throughput of the wireless sensor networks.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and
packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which
ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer
from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of
sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads
in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption
and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer
and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers
reduces the energy consumption and increases the throughput of the wireless sensor networks.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
Mobile Agents based Energy Efficient Routing for Wireless Sensor NetworksEswar Publications
Energy Efficiency and prolonged network lifetime are few of the major concern areas. Energy consumption rated of sensor nodes can be reduced in various ways. Data aggregation, result sharing and filtration of aggregated data among sensor nodes deployed in the unattended regions have been few of the most researched areas in the field of wireless sensor networks. While data aggregation is concerned with minimizing the information transfer from source to sink to reduce network traffic and removing congestion in network, result sharing focuses on sharing of information among agents pertinent to the tasks at hand and filtration of aggregated data so as to remove redundant information. There exist various algorithms for data aggregation and filtration using different mobile agents. In this proposed work same mobile agent is used to perform both tasks data aggregation and data filtration. This approach advocates the sharing of resources and reducing the energy consumption level of sensor nodes.
Smart parking is common in contemporary cities. These smart parking lots are outfitted mostly with wireless sensor networks (WSNs), which are used to detect, monitor, and collect data on the availability status of all existing parking spaces in a given area. Sensors make up WSN, which may gather, process, and transmit informations to the sink. However, the power and
communication limitations of the sensors have an effect on the performance and quality of the WSNs. The decrease in the battery and the energy of the
nodes causes a decrease in the life of the nodes and also of the entire WSN network. In this article, we present a routing protocol that implements an
efficient and robust algorithm allowing the creation of clusters so that the base station can receive data from the entire WSN network. This protocol
adopts a reliable and efficient algorithm allowing to minimize the energy dissipation of the sensors and to increase the lifetime of the WSN. In
comparison to alternative parking lot management protocols already in use,
the simulation results of the proposed protocol are effective and robust in terms of power consumption, data transmission reliability, and WSN network longevity.
Design and implementation of grid based clustering in WSN using dynamic sink ...journalBEEI
A wireless sensor networks (WSNs) play a significant application, especially in the monitored remoting environmental, which enables by the availability of sensors which are cheaper, smaller, and intelligent. The equipment of such sensors be with wireless interfaces, which a communication with other sensors occurs for creating a network, that contains many distributed nodes. The closest nodes to the sink are exploited at an enormous traffic load while the data from the whole regions are forwarded between them to reach the sink. This result in exhausting their energy quickly and partitioning the network. This is solved by changing the sink node position in Grid based clustering technique, which considers the optimal method for this purpose. A simulation with MATLAB can be applied for grid based clustering technique to evaluate the performance of WSN. The expected results deal with outperforms in throughput, reducing energy consumption and increasing residual energy, in addition to prolong the network lifetime of the sensor network.
VHFRP: Virtual Hexagonal Frame Routing Protocol for Wireless Sensor NetworkIJCNCJournal
As physical and digital worlds become increasingly intertwined, wireless sensor networks are becoming an indispensable technology. A mobile sink may be required for some applications in the sensor field, where incomplete and/or delayed data delivery can lead to inappropriate conclusions. Therefore, latency and packet delivery ratios must be of high quality. In most existing schemes, mobile sinks are used to extend network lifetimes. By partitioning the sensor field into k equal sized frames, the proposed scheme creates a virtual hexagonal structure. Each frame header (FH) is linked together through the creation of a virtual backbone network. Frame headers are assigned to nodes near the centre of each frame. The virtual backbone network enables data collection from members of the frame and delivers it to the mobile sink. The proposed Virtual Hexagonal Frame Routing Protocol (VHFRP) improves throughput by 25%, energy consumption by 30% and delay by 9% as compared with static sink scenario.
VHFRP: VIRTUAL HEXAGONAL FRAME ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKIJCNCJournal
As physical and digital worlds become increasingly intertwined, wireless sensor networks are becoming an
indispensable technology. A mobile sink may be required for some applications in the sensor field, where
incomplete and/or delayed data delivery can lead to inappropriate conclusions. Therefore, latency and
packet delivery ratios must be of high quality. In most existing schemes, mobile sinks are used to extend
network lifetimes. By partitioning the sensor field into k equal sized frames, the proposed scheme creates a
virtual hexagonal structure. Each frame header (FH) is linked together through the creation of a virtual
backbone network. Frame headers are assigned to nodes near the centre of each frame. The virtual
backbone network enables data collection from members of the frame and delivers it to the mobile sink.
The proposed Virtual Hexagonal Frame Routing Protocol (VHFRP) improves throughput by 25%, energy
consumption by 30% and delay by 9% as compared with static sink scenario.
Similar to Clustering and data aggregation scheme in underwater wireless acoustic sensor network (20)
Amazon products reviews classification based on machine learning, deep learni...TELKOMNIKA JOURNAL
In recent times, the trend of online shopping through e-commerce stores and websites has grown to a huge extent. Whenever a product is purchased on an e-commerce platform, people leave their reviews about the product. These reviews are very helpful for the store owners and the product’s manufacturers for the betterment of their work process as well as product quality. An automated system is proposed in this work that operates on two datasets D1 and D2 obtained from Amazon. After certain preprocessing steps, N-gram and word embedding-based features are extracted using term frequency-inverse document frequency (TF-IDF), bag of words (BoW) and global vectors (GloVe), and Word2vec, respectively. Four machine learning (ML) models support vector machines (SVM), logistic regression (RF), logistic regression (LR), multinomial Naïve Bayes (MNB), two deep learning (DL) models convolutional neural network (CNN), long-short term memory (LSTM), and standalone bidirectional encoder representations (BERT) are used to classify reviews as either positive or negative. The results obtained by the standard ML, DL models and BERT are evaluated using certain performance evaluation measures. BERT turns out to be the best-performing model in the case of D1 with an accuracy of 90% on features derived by word embedding models while the CNN provides the best accuracy of 97% upon word embedding features in the case of D2. The proposed model shows better overall performance on D2 as compared to D1.
Design, simulation, and analysis of microstrip patch antenna for wireless app...TELKOMNIKA JOURNAL
In this study, a microstrip patch antenna that works at 3.6 GHz was built and tested to see how well it works. In this work, Rogers RT/Duroid 5880 has been used as the substrate material, with a dielectric permittivity of 2.2 and a thickness of 0.3451 mm; it serves as the base for the examined antenna. The computer simulation technology (CST) studio suite is utilized to show the recommended antenna design. The goal of this study was to get a more extensive transmission capacity, a lower voltage standing wave ratio (VSWR), and a lower return loss, but the main goal was to get a higher gain, directivity, and efficiency. After simulation, the return loss, gain, directivity, bandwidth, and efficiency of the supplied antenna are found to be -17.626 dB, 9.671 dBi, 9.924 dBi, 0.2 GHz, and 97.45%, respectively. Besides, the recreation uncovered that the transfer speed side-lobe level at phi was much better than those of the earlier works, at -28.8 dB, respectively. Thus, it makes a solid contender for remote innovation and more robust communication.
Design and simulation an optimal enhanced PI controller for congestion avoida...TELKOMNIKA JOURNAL
In this paper, snake optimization algorithm (SOA) is used to find the optimal gains of an enhanced controller for controlling congestion problem in computer networks. M-file and Simulink platform is adopted to evaluate the response of the active queue management (AQM) system, a comparison with two classical controllers is done, all tuned gains of controllers are obtained using SOA method and the fitness function chose to monitor the system performance is the integral time absolute error (ITAE). Transient analysis and robust analysis is used to show the proposed controller performance, two robustness tests are applied to the AQM system, one is done by varying the size of queue value in different period and the other test is done by changing the number of transmission control protocol (TCP) sessions with a value of ± 20% from its original value. The simulation results reflect a stable and robust behavior and best performance is appeared clearly to achieve the desired queue size without any noise or any transmission problems.
Improving the detection of intrusion in vehicular ad-hoc networks with modifi...TELKOMNIKA JOURNAL
Vehicular ad-hoc networks (VANETs) are wireless-equipped vehicles that form networks along the road. The security of this network has been a major challenge. The identity-based cryptosystem (IBC) previously used to secure the networks suffers from membership authentication security features. This paper focuses on improving the detection of intruders in VANETs with a modified identity-based cryptosystem (MIBC). The MIBC is developed using a non-singular elliptic curve with Lagrange interpolation. The public key of vehicles and roadside units on the network are derived from number plates and location identification numbers, respectively. Pseudo-identities are used to mask the real identity of users to preserve their privacy. The membership authentication mechanism ensures that only valid and authenticated members of the network are allowed to join the network. The performance of the MIBC is evaluated using intrusion detection ratio (IDR) and computation time (CT) and then validated with the existing IBC. The result obtained shows that the MIBC recorded an IDR of 99.3% against 94.3% obtained for the existing identity-based cryptosystem (EIBC) for 140 unregistered vehicles attempting to intrude on the network. The MIBC shows lower CT values of 1.17 ms against 1.70 ms for EIBC. The MIBC can be used to improve the security of VANETs.
Conceptual model of internet banking adoption with perceived risk and trust f...TELKOMNIKA JOURNAL
Understanding the primary factors of internet banking (IB) acceptance is critical for both banks and users; nevertheless, our knowledge of the role of users’ perceived risk and trust in IB adoption is limited. As a result, we develop a conceptual model by incorporating perceived risk and trust into the technology acceptance model (TAM) theory toward the IB. The proper research emphasized that the most essential component in explaining IB adoption behavior is behavioral intention to use IB adoption. TAM is helpful for figuring out how elements that affect IB adoption are connected to one another. According to previous literature on IB and the use of such technology in Iraq, one has to choose a theoretical foundation that may justify the acceptance of IB from the customer’s perspective. The conceptual model was therefore constructed using the TAM as a foundation. Furthermore, perceived risk and trust were added to the TAM dimensions as external factors. The key objective of this work was to extend the TAM to construct a conceptual model for IB adoption and to get sufficient theoretical support from the existing literature for the essential elements and their relationships in order to unearth new insights about factors responsible for IB adoption.
Efficient combined fuzzy logic and LMS algorithm for smart antennaTELKOMNIKA JOURNAL
The smart antennas are broadly used in wireless communication. The least mean square (LMS) algorithm is a procedure that is concerned in controlling the smart antenna pattern to accommodate specified requirements such as steering the beam toward the desired signal, in addition to placing the deep nulls in the direction of unwanted signals. The conventional LMS (C-LMS) has some drawbacks like slow convergence speed besides high steady state fluctuation error. To overcome these shortcomings, the present paper adopts an adaptive fuzzy control step size least mean square (FC-LMS) algorithm to adjust its step size. Computer simulation outcomes illustrate that the given model has fast convergence rate as well as low mean square error steady state.
Design and implementation of a LoRa-based system for warning of forest fireTELKOMNIKA JOURNAL
This paper presents the design and implementation of a forest fire monitoring and warning system based on long range (LoRa) technology, a novel ultra-low power consumption and long-range wireless communication technology for remote sensing applications. The proposed system includes a wireless sensor network that records environmental parameters such as temperature, humidity, wind speed, and carbon dioxide (CO2) concentration in the air, as well as taking infrared photos.The data collected at each sensor node will be transmitted to the gateway via LoRa wireless transmission. Data will be collected, processed, and uploaded to a cloud database at the gateway. An Android smartphone application that allows anyone to easily view the recorded data has been developed. When a fire is detected, the system will sound a siren and send a warning message to the responsible personnel, instructing them to take appropriate action. Experiments in Tram Chim Park, Vietnam, have been conducted to verify and evaluate the operation of the system.
Wavelet-based sensing technique in cognitive radio networkTELKOMNIKA JOURNAL
Cognitive radio is a smart radio that can change its transmitter parameter based on interaction with the environment in which it operates. The demand for frequency spectrum is growing due to a big data issue as many Internet of Things (IoT) devices are in the network. Based on previous research, most frequency spectrum was used, but some spectrums were not used, called spectrum hole. Energy detection is one of the spectrum sensing methods that has been frequently used since it is easy to use and does not require license users to have any prior signal understanding. But this technique is incapable of detecting at low signal-to-noise ratio (SNR) levels. Therefore, the wavelet-based sensing is proposed to overcome this issue and detect spectrum holes. The main objective of this work is to evaluate the performance of wavelet-based sensing and compare it with the energy detection technique. The findings show that the percentage of detection in wavelet-based sensing is 83% higher than energy detection performance. This result indicates that the wavelet-based sensing has higher precision in detection and the interference towards primary user can be decreased.
A novel compact dual-band bandstop filter with enhanced rejection bandsTELKOMNIKA JOURNAL
In this paper, we present the design of a new wide dual-band bandstop filter (DBBSF) using nonuniform transmission lines. The method used to design this filter is to replace conventional uniform transmission lines with nonuniform lines governed by a truncated Fourier series. Based on how impedances are profiled in the proposed DBBSF structure, the fractional bandwidths of the two 10 dB-down rejection bands are widened to 39.72% and 52.63%, respectively, and the physical size has been reduced compared to that of the filter with the uniform transmission lines. The results of the electromagnetic (EM) simulation support the obtained analytical response and show an improved frequency behavior.
Deep learning approach to DDoS attack with imbalanced data at the application...TELKOMNIKA JOURNAL
A distributed denial of service (DDoS) attack is where one or more computers attack or target a server computer, by flooding internet traffic to the server. As a result, the server cannot be accessed by legitimate users. A result of this attack causes enormous losses for a company because it can reduce the level of user trust, and reduce the company’s reputation to lose customers due to downtime. One of the services at the application layer that can be accessed by users is a web-based lightweight directory access protocol (LDAP) service that can provide safe and easy services to access directory applications. We used a deep learning approach to detect DDoS attacks on the CICDDoS 2019 dataset on a complex computer network at the application layer to get fast and accurate results for dealing with unbalanced data. Based on the results obtained, it is observed that DDoS attack detection using a deep learning approach on imbalanced data performs better when implemented using synthetic minority oversampling technique (SMOTE) method for binary classes. On the other hand, the proposed deep learning approach performs better for detecting DDoS attacks in multiclass when implemented using the adaptive synthetic (ADASYN) method.
The appearance of uncertainties and disturbances often effects the characteristics of either linear or nonlinear systems. Plus, the stabilization process may be deteriorated thus incurring a catastrophic effect to the system performance. As such, this manuscript addresses the concept of matching condition for the systems that are suffering from miss-match uncertainties and exogeneous disturbances. The perturbation towards the system at hand is assumed to be known and unbounded. To reach this outcome, uncertainties and their classifications are reviewed thoroughly. The structural matching condition is proposed and tabulated in the proposition 1. Two types of mathematical expressions are presented to distinguish the system with matched uncertainty and the system with miss-matched uncertainty. Lastly, two-dimensional numerical expressions are provided to practice the proposed proposition. The outcome shows that matching condition has the ability to change the system to a design-friendly model for asymptotic stabilization.
Implementation of FinFET technology based low power 4×4 Wallace tree multipli...TELKOMNIKA JOURNAL
Many systems, including digital signal processors, finite impulse response (FIR) filters, application-specific integrated circuits, and microprocessors, use multipliers. The demand for low power multipliers is gradually rising day by day in the current technological trend. In this study, we describe a 4×4 Wallace multiplier based on a carry select adder (CSA) that uses less power and has a better power delay product than existing multipliers. HSPICE tool at 16 nm technology is used to simulate the results. In comparison to the traditional CSA-based multiplier, which has a power consumption of 1.7 µW and power delay product (PDP) of 57.3 fJ, the results demonstrate that the Wallace multiplier design employing CSA with first zero finding logic (FZF) logic has the lowest power consumption of 1.4 µW and PDP of 27.5 fJ.
Evaluation of the weighted-overlap add model with massive MIMO in a 5G systemTELKOMNIKA JOURNAL
The flaw in 5G orthogonal frequency division multiplexing (OFDM) becomes apparent in high-speed situations. Because the doppler effect causes frequency shifts, the orthogonality of OFDM subcarriers is broken, lowering both their bit error rate (BER) and throughput output. As part of this research, we use a novel design that combines massive multiple input multiple output (MIMO) and weighted overlap and add (WOLA) to improve the performance of 5G systems. To determine which design is superior, throughput and BER are calculated for both the proposed design and OFDM. The results of the improved system show a massive improvement in performance ver the conventional system and significant improvements with massive MIMO, including the best throughput and BER. When compared to conventional systems, the improved system has a throughput that is around 22% higher and the best performance in terms of BER, but it still has around 25% less error than OFDM.
Reflector antenna design in different frequencies using frequency selective s...TELKOMNIKA JOURNAL
In this study, it is aimed to obtain two different asymmetric radiation patterns obtained from antennas in the shape of the cross-section of a parabolic reflector (fan blade type antennas) and antennas with cosecant-square radiation characteristics at two different frequencies from a single antenna. For this purpose, firstly, a fan blade type antenna design will be made, and then the reflective surface of this antenna will be completed to the shape of the reflective surface of the antenna with the cosecant-square radiation characteristic with the frequency selective surface designed to provide the characteristics suitable for the purpose. The frequency selective surface designed and it provides the perfect transmission as possible at 4 GHz operating frequency, while it will act as a band-quenching filter for electromagnetic waves at 5 GHz operating frequency and will be a reflective surface. Thanks to this frequency selective surface to be used as a reflective surface in the antenna, a fan blade type radiation characteristic at 4 GHz operating frequency will be obtained, while a cosecant-square radiation characteristic at 5 GHz operating frequency will be obtained.
Reagentless iron detection in water based on unclad fiber optical sensorTELKOMNIKA JOURNAL
A simple and low-cost fiber based optical sensor for iron detection is demonstrated in this paper. The sensor head consist of an unclad optical fiber with the unclad length of 1 cm and it has a straight structure. Results obtained shows a linear relationship between the output light intensity and iron concentration, illustrating the functionality of this iron optical sensor. Based on the experimental results, the sensitivity and linearity are achieved at 0.0328/ppm and 0.9824 respectively at the wavelength of 690 nm. With the same wavelength, other performance parameters are also studied. Resolution and limit of detection (LOD) are found to be 0.3049 ppm and 0.0755 ppm correspondingly. This iron sensor is advantageous in that it does not require any reagent for detection, enabling it to be simpler and cost-effective in the implementation of the iron sensing.
Impact of CuS counter electrode calcination temperature on quantum dot sensit...TELKOMNIKA JOURNAL
In place of the commercial Pt electrode used in quantum sensitized solar cells, the low-cost CuS cathode is created using electrophoresis. High resolution scanning electron microscopy and X-ray diffraction were used to analyze the structure and morphology of structural cubic samples with diameters ranging from 40 nm to 200 nm. The conversion efficiency of solar cells is significantly impacted by the calcination temperatures of cathodes at 100 °C, 120 °C, 150 °C, and 180 °C under vacuum. The fluorine doped tin oxide (FTO)/CuS cathode electrode reached a maximum efficiency of 3.89% when it was calcined at 120 °C. Compared to other temperature combinations, CuS nanoparticles crystallize at 120 °C, which lowers resistance while increasing electron lifetime.
In place of the commercial Pt electrode used in quantum sensitized solar cells, the low-cost CuS cathode is created using electrophoresis. High resolution scanning electron microscopy and X-ray diffraction were used to analyze the structure and morphology of structural cubic samples with diameters ranging from 40 nm to 200 nm. The conversion efficiency of solar cells is significantly impacted by the calcination temperatures of cathodes at 100 °C, 120 °C, 150 °C, and 180 °C under vacuum. The fluorine doped tin oxide (FTO)/CuS cathode electrode reached a maximum efficiency of 3.89% when it was calcined at 120 °C. Compared to other temperature combinations, CuS nanoparticles crystallize at 120 °C, which lowers resistance while increasing electron lifetime.
A progressive learning for structural tolerance online sequential extreme lea...TELKOMNIKA JOURNAL
This article discusses the progressive learning for structural tolerance online sequential extreme learning machine (PSTOS-ELM). PSTOS-ELM can save robust accuracy while updating the new data and the new class data on the online training situation. The robustness accuracy arises from using the householder block exact QR decomposition recursive least squares (HBQRD-RLS) of the PSTOS-ELM. This method is suitable for applications that have data streaming and often have new class data. Our experiment compares the PSTOS-ELM accuracy and accuracy robustness while data is updating with the batch-extreme learning machine (ELM) and structural tolerance online sequential extreme learning machine (STOS-ELM) that both must retrain the data in a new class data case. The experimental results show that PSTOS-ELM has accuracy and robustness comparable to ELM and STOS-ELM while also can update new class data immediately.
Electroencephalography-based brain-computer interface using neural networksTELKOMNIKA JOURNAL
This study aimed to develop a brain-computer interface that can control an electric wheelchair using electroencephalography (EEG) signals. First, we used the Mind Wave Mobile 2 device to capture raw EEG signals from the surface of the scalp. The signals were transformed into the frequency domain using fast Fourier transform (FFT) and filtered to monitor changes in attention and relaxation. Next, we performed time and frequency domain analyses to identify features for five eye gestures: opened, closed, blink per second, double blink, and lookup. The base state was the opened-eyes gesture, and we compared the features of the remaining four action gestures to the base state to identify potential gestures. We then built a multilayer neural network to classify these features into five signals that control the wheelchair’s movement. Finally, we designed an experimental wheelchair system to test the effectiveness of the proposed approach. The results demonstrate that the EEG classification was highly accurate and computationally efficient. Moreover, the average performance of the brain-controlled wheelchair system was over 75% across different individuals, which suggests the feasibility of this approach.
Adaptive segmentation algorithm based on level set model in medical imagingTELKOMNIKA JOURNAL
For image segmentation, level set models are frequently employed. It offer best solution to overcome the main limitations of deformable parametric models. However, the challenge when applying those models in medical images stills deal with removing blurs in image edges which directly affects the edge indicator function, leads to not adaptively segmenting images and causes a wrong analysis of pathologies wich prevents to conclude a correct diagnosis. To overcome such issues, an effective process is suggested by simultaneously modelling and solving systems’ two-dimensional partial differential equations (PDE). The first PDE equation allows restoration using Euler’s equation similar to an anisotropic smoothing based on a regularized Perona and Malik filter that eliminates noise while preserving edge information in accordance with detected contours in the second equation that segments the image based on the first equation solutions. This approach allows developing a new algorithm which overcome the studied model drawbacks. Results of the proposed method give clear segments that can be applied to any application. Experiments on many medical images in particular blurry images with high information losses, demonstrate that the developed approach produces superior segmentation results in terms of quantity and quality compared to other models already presented in previeous works.
Automatic channel selection using shuffled frog leaping algorithm for EEG bas...TELKOMNIKA JOURNAL
Drug addiction is a complex neurobiological disorder that necessitates comprehensive treatment of both the body and mind. It is categorized as a brain disorder due to its impact on the brain. Various methods such as electroencephalography (EEG), functional magnetic resonance imaging (FMRI), and magnetoencephalography (MEG) can capture brain activities and structures. EEG signals provide valuable insights into neurological disorders, including drug addiction. Accurate classification of drug addiction from EEG signals relies on appropriate features and channel selection. Choosing the right EEG channels is essential to reduce computational costs and mitigate the risk of overfitting associated with using all available channels. To address the challenge of optimal channel selection in addiction detection from EEG signals, this work employs the shuffled frog leaping algorithm (SFLA). SFLA facilitates the selection of appropriate channels, leading to improved accuracy. Wavelet features extracted from the selected input channel signals are then analyzed using various machine learning classifiers to detect addiction. Experimental results indicate that after selecting features from the appropriate channels, classification accuracy significantly increased across all classifiers. Particularly, the multi-layer perceptron (MLP) classifier combined with SFLA demonstrated a remarkable accuracy improvement of 15.78% while reducing time complexity.
Automobile Management System Project Report.pdfKamal Acharya
The proposed project is developed to manage the automobile in the automobile dealer company. The main module in this project is login, automobile management, customer management, sales, complaints and reports. The first module is the login. The automobile showroom owner should login to the project for usage. The username and password are verified and if it is correct, next form opens. If the username and password are not correct, it shows the error message.
When a customer search for a automobile, if the automobile is available, they will be taken to a page that shows the details of the automobile including automobile name, automobile ID, quantity, price etc. “Automobile Management System” is useful for maintaining automobiles, customers effectively and hence helps for establishing good relation between customer and automobile organization. It contains various customized modules for effectively maintaining automobiles and stock information accurately and safely.
When the automobile is sold to the customer, stock will be reduced automatically. When a new purchase is made, stock will be increased automatically. While selecting automobiles for sale, the proposed software will automatically check for total number of available stock of that particular item, if the total stock of that particular item is less than 5, software will notify the user to purchase the particular item.
Also when the user tries to sale items which are not in stock, the system will prompt the user that the stock is not enough. Customers of this system can search for a automobile; can purchase a automobile easily by selecting fast. On the other hand the stock of automobiles can be maintained perfectly by the automobile shop manager overcoming the drawbacks of existing system.
Quality defects in TMT Bars, Possible causes and Potential Solutions.PrashantGoswami42
Maintaining high-quality standards in the production of TMT bars is crucial for ensuring structural integrity in construction. Addressing common defects through careful monitoring, standardized processes, and advanced technology can significantly improve the quality of TMT bars. Continuous training and adherence to quality control measures will also play a pivotal role in minimizing these defects.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Courier management system project report.pdfKamal Acharya
It is now-a-days very important for the people to send or receive articles like imported furniture, electronic items, gifts, business goods and the like. People depend vastly on different transport systems which mostly use the manual way of receiving and delivering the articles. There is no way to track the articles till they are received and there is no way to let the customer know what happened in transit, once he booked some articles. In such a situation, we need a system which completely computerizes the cargo activities including time to time tracking of the articles sent. This need is fulfilled by Courier Management System software which is online software for the cargo management people that enables them to receive the goods from a source and send them to a required destination and track their status from time to time.
COLLEGE BUS MANAGEMENT SYSTEM PROJECT REPORT.pdfKamal Acharya
The College Bus Management system is completely developed by Visual Basic .NET Version. The application is connect with most secured database language MS SQL Server. The application is develop by using best combination of front-end and back-end languages. The application is totally design like flat user interface. This flat user interface is more attractive user interface in 2017. The application is gives more important to the system functionality. The application is to manage the student’s details, driver’s details, bus details, bus route details, bus fees details and more. The application has only one unit for admin. The admin can manage the entire application. The admin can login into the application by using username and password of the admin. The application is develop for big and small colleges. It is more user friendly for non-computer person. Even they can easily learn how to manage the application within hours. The application is more secure by the admin. The system will give an effective output for the VB.Net and SQL Server given as input to the system. The compiled java program given as input to the system, after scanning the program will generate different reports. The application generates the report for users. The admin can view and download the report of the data. The application deliver the excel format reports. Because, excel formatted reports is very easy to understand the income and expense of the college bus. This application is mainly develop for windows operating system users. In 2017, 73% of people enterprises are using windows operating system. So the application will easily install for all the windows operating system users. The application-developed size is very low. The application consumes very low space in disk. Therefore, the user can allocate very minimum local disk space for this application.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
2. TELKOMNIKA ISSN: 1693-6930 ◼
Clustering and data aggregation scheme in underwater wireless... (Vani Krishnaswamy)
1605
Our contributions in this paper in comparison to the existing works include the following:
− Development of a mathematical model to evaluate the probability of sensor node
belongingness to form the initial clusters. The sensor nodes are deployed stochastically
and the nodes positions are stationary according to their communication range.
− Designing fuzzy clustering scheme based on the developed mathematical model.
− Determining the number of clusters using SSE parameter.
− Designing an energy level scheme for cluster head selection in the hierarchical topology.
− Using similarity function, design data aggregation scheme for transmitting the aggregated
data to the BS.
− Comparative analysis of proposed scheme with LEACH algorithm [16] in terms of network
lifespan and death rate of nodes.
The rest of the paper is organized as follows. Section 2 breifs about works related to
various clustering schemes, selection of cluster head and several cluster based data
aggregation schemes in networks. Section 3 explains the network model and energy model for
cluster formation respectively. It explains the proposed fuzzy scheme in clustering, the cluster
head selection considering parameters like energy level and distance and data aggregation
scheme using similarity function. Section 4 deals with simulation and its parameters. Section 5
deals with result analysis. Summary of the proposed work and future works are presented in
Section 6.
2. Related Works
In [17], the authors have proposed an agent based routing protocol which
is energy efficient. The process of dynamic clustering is initiatiated and the cluster head along
with the agents is responsible for data aggregation at the affected area. They have proposed an
algorithm to increase the connectivity and reliability in the network. In [18], the authors have
used Fuzzy Clustering Means (FCM) to select the cluster heads from an optimal number of
clusters and setup the Underwater Isomorphic Sensor Network (UWISN). In addition to this,
a scheme for determining the real cluster heads and selecting them have also been proposed.
The authors in [19] have proposed a routing protocol based on grid with fuzzy logic where the
entire network is separated into various virtual grids. Every grid in the network has only one
active node which is selected using the fuzzy logic system.
In [20], the authors have proposed a new GPS-free routing protocol with Distributed
Underwater Clustering Scheme (DUCS) which utilizes data aggregation to remove the
redundant information and reduce the data loss in UWASN. In [21], the authors have proposed
a scheme for an optimal selection of cluster head and cluster size using fuzzy logic along with
inter and intra cluster communication considering the energy and the multiple paths for UWASN.
The authors in [22-24] have recommended clustering and aggregation techniques in
UWASNs which are based on fuzzy logic system that captivates the residual energy, the node
density, the link quality, the load and the distance to the sink/Base Station (BS) node.
In [25], the authors have focused on designing an energy efficient routing protocol to transfer
the data between sensor nodes utilizing the fixed courier nodes inorder to enhance the lifetime
and decrease the end to end delay in the network. The authors in [26] have analyzed the
consumption of energy in UWASNs for various transmission mechanisms with effect of
changing ambient conditions.
3. Clustering
This section presents network model, clustering terminology and energy model
employed for designing the proposed clustering scheme. It includes proposed fuzzy clustering
scheme with selection of cluster head and data aggregation scheme.
3.1. Network Model
The network model explained here is similar to that presented in [16, 21] with the
subsequent features. The sensor nodes are placed randomly in an underwater environment to
form a 3-D static network where the communications between the sensor nodes are full duplex.
The 3-D position information of each sensor node is achieved by positioning algorithms or by
the use of hardware units, which are detected by acoustic waves.
3. ◼ ISSN: 1693-6930
TELKOMNIKA Vol. 17, No. 4, August 2019: 1604-1614
1606
The sensor nodes in the network are homogeneous and transmit the required
information with different ranges of communication radius. The position of the sink node or BS is
usually on the surface of the sea. The energy possessed by the BS is unlimited and it can
communicate using underwater acoustic waves and radio waves. The processing and
aggregation of data at the BS is carried out by each sensor node. During this process, the
energy of the sensor node is reduced gradually; this in turn results in a dead node. The network
is considered to be dead when the dead nodes number exceeds beyond the threshold limit.
Therefore, the aim of the hierarchical topology scheme is to increase the network lifetime to the
maximum feasible extent.
3.2. Energy Model
The major limitation of UWASN is its energy capability to recharge the battery which
cannot be done frequently. In underwater environment the consumption of energy by the nodes
depends on the following factors. 1) To sense, receive and process the data. 2) To convey the
collective data to the sink. The first factor is considered, as the energy consumption is less
when compared to the second. This model of energy consumption for transmitting data by the
nodes is presented in [24]. The Unit energy consumed to process one bit of message is denoted
as 𝐸𝑡𝑥(𝑑) and is evaluated according to the (1):
𝐸𝑡𝑥(𝑑) = 𝑃𝑟 X 𝑇𝑝 X 𝐴(𝑑) (1)
where Pr represents the threshold power of a node for receiving the data package, d represents
the distance of transmitting data package, and Tp represents the time of the transmitting data
package which is represented as follows:
𝑇𝑝 =
𝑀 𝑏
𝑆 𝑣
where Mb and Sv represents the size and the transmission speed of data package respectively.
The energy attenuation A (d) with the transmitting distance of the data package is ‘d’ is
calculated as follows:
A (d) = dλ X βd
where λ represents the energy spreading factor which is 1 for cylindrical, 1.5 for practical and 2
for spherical spreading respectively. The parameter
𝛽 = 10
𝛼(𝑓)
10
absorption coefficient α (f), which can be calculated using the following equation:
𝛼(𝑓) = 0.11
10−3(𝑓2)
1+𝑓2 + 44(10−3)
𝑓2
(4100+𝑓2)
+ 2.75 𝑋 10−7
𝑓2
+ 3 𝑋10−6
where ‘f’ is the frequency of the carrier acoustic signal in KHz, and α (f) is in dB/m. Considering
the underwater environment, the amount of energy consumed to transmit ‘l’ bit of data over a
distance d by the node is given by Etx (d, l) as shown in the (2):
𝐸𝑡𝑥(𝑑, 1) = 1𝐸𝑒𝑙𝑒𝑐 + 1 X 𝑇𝑝 X 𝐶 𝑋 𝐻 𝑋 𝑑 𝑋 𝛽𝑑 (2)
where H represents the depth of the node in mtrs.
C = (2π (0:67)109:5)
The amount of energy consumed to receive ’l’ bit of data by the receiver is given by
Erx (d, l). To be specific the threshold value ‘d0’ is set, which is related to the transfer distance.
If the transfer distance is less than ‘d0’, then the energy consumption proportional to the
4. TELKOMNIKA ISSN: 1693-6930 ◼
Clustering and data aggregation scheme in underwater wireless... (Vani Krishnaswamy)
1607
squared distance else, the energy consumed is proportional to the fourth power of the distance.
The energy consumption for transmitting and receiving 1 bit of data with the distance ‘d’
is calculated in (3) and (4):
𝐸𝑡𝑥(𝑑, 1) = {
1. 𝐸𝑒𝑙𝑒𝑐 + 1. ∈ 𝑓𝑠. 𝑑2
𝑖𝑓 𝑑 < 𝑑0
1. 𝐸𝑒𝑙𝑒𝑐 + 1. ∈ 𝑓𝑠. 𝑑4
𝑖𝑓 𝑑 ≥ 𝑑0
(3)
𝐸𝑟𝑥(𝑑, 1) = 1 + 𝐸𝑒𝑙𝑒𝑐 (4)
where Eelec represents the electronics energy, which depends on the energy dissipated per bit to
run the transmitter or the receiver. The energy cost of the signal amplifier in two communication
modes considering the distance between transmitter and receiver are represented as εfs: d2,
εfs: d4. In this paper the assumption made regarding data fusion is that in spite of the number of
nodes in a cluster, every node in a cluster gathers and transmits l- bit to the cluster head, and in
turn the cluster head condenses the overall received information to l- bit.
3.3. Proposed Fuzzy Clustering Scheme
The cluster formation is performed by taking into account the given 3-D network
environment. Cluster structure is characterized by two types of nodes called Member cluster
nodes and ClusterHeadnodes which are considered as the backbone of the network.
The Memberclusternodes that are connected to its own ClusterHeadnode lie dormant to save
the energy consumption of the network. Whereas the ClusterHeadnodes that are connected to
the closest neighbor node of other clusters is usually in a shallower location. The process of
selecting the ClusterHeadnodes and the reconstruction of the network is called as a round.
This process is achieved periodically to decrease the consumption of energy in the network
which in turn increases the network's lifetime.
Before the communication begins between the sensor nodes, initially the nodes are
divided according to locations of the nodes into a number of fuzzy subsets using fuzzy
clustering model. During the formation of clusters, the nodes which are closer to the location
and which require less energy for communication are assigned to the same cluster. Initially at
the commencement of each round, which is based on assured probabilities, every node in the
network belongs to the initial subsets of the clusters. The process of selection of the cluster
heads will be performed by each subset in parallel and the messages are transmitted to the
base station. The size of the network and time required for the calculation are reduced
in this scheme.
A method is proposed to segregate the underwater acoustic wireless sensor nodes into
m primary fuzzy clusters. Further, the optimal numbers of clusters are obtained using an elbow
method. The next step, determines the matrix wij; 1≤ i < n; 1≤ j < m by means of fuzzy clustering
method. Prior to every round, each node is related to a suitable cluster depending on the degree
of belongingness of each node. If the node yi is applied to Bj, then it satisfies the condition
given in (5).
∑ 𝑊𝑖𝑙1
𝑗−1
𝑙1=1 ≤ 𝑟 < ∑ 𝑊𝑖𝑙2
𝑗
𝑙2=1
(5)
The random number with uniform distribution is between 0 and 1 is denoted by r.
The basic definition of traditional clustering is the division of basic set of identical objects into
numerous subsets. In reality, the real clusters which are formed are typically much complex and
the dependency of objects to them is more fuzzy. In short, such clusters are called fuzzy
subsets of the basic set which are comprised of delicate parts. This is how, the concept of fuzzy
clustering was proposed. In this paper, the process of initialization is proposed considering the
fuzzy clustering model. Basically in this clustering method, the set of n objects are partitioned
A=a1, a2, a3 … an into m fuzzy clusters B1, B2.... Bm, the clustering is denoted as nm matrix:
𝐶 = [𝑤𝑖𝑗](1𝑖 < 𝑛, 1𝑗𝑚)
where wij=the degree of belongingness of the ith object to the jth cluster. The matrix
𝐶 = [𝑤𝑖𝑗] must convince the subsequent conditions. For each object ai and cluster Bj, 0≤ wij ≤1
5. ◼ ISSN: 1693-6930
TELKOMNIKA Vol. 17, No. 4, August 2019: 1604-1614
1608
for each object ai, ∑ j = 1m wij = 1. For each cluster Bj, 0 ≤ ∑j = 1n wij < n. To calculate the
center of the cluster Bj; 1jm is bj. The degree of belongingness of object of ai to cluster bj is
expressed in terms of the distance between the ai and the center of the cluster bj which is
represented as follows dist (ai, bj). The possibility of any object belonging to the cluster can be
determined by the distance between the object and the center of cluster. For example shorter
the distance between the cluster center bj and the object xj, greater are the opportunities for the
object xi belonging to the corresponding cluster Bj. The amount of belongingness of an object ai
to cluster Bj is expressed using the (6).
𝑤𝑖𝑗 =
1
𝑑𝑖𝑠𝑡(𝑥 𝑖,𝑏 𝑗)2 (6)
The definition of degree of belongingness wij is obtained by normalizing the (6) which satisfies
the conditions of matrix 𝐶 = [𝑤𝑖𝑗].
𝑤𝑖𝑗 =
1
dist(xi,bj)2
∑
1
dist(xi,bl)2
m
l=1
(7)
Clustering algorithms are broadly classified into hard and soft clustering algorithms.
Fuzzy clustering belongs to soft clustering because in this algorithm every object belongs to
multiple clusters. The following are the advantages of soft clustering. 1) Every object belongs to
multiple clusters; hence the user can observe multiple themes for a cluster. 2) Various clusters
get formed for various themes. 3) In order to calculate the order of the object appropriately,
the measure related between clusters and objects can be used as a relevance measure.
The initialization of fuzzy clustering is based on expectation maximization algorithm [23].
This expectation maximization algorithm used for fuzzy clustering generates ‘m’ different
clusters are briefed in the steps which is given in Process 1:
1) Classify the set of ‘n’ objects based on its features into ‘m’ clusters.
2) The cluster centers Bj are selected by uniform distribution of random vectors.
3) Compute the degree of belongingness (wij) using the distance between the nodes within
the cluster.
4) Normalize (wij) until we get ‘m’ clusters
3.4. Determination of the Number of Clusters
To decide the suitable cluster number is a cumbersome task especially in fuzzy
clustering. The granularity of the clustering and the discovery of an appropriate balance
between precision and compressibility have to be managed. The sum of squared error (SSE) for
each cluster is defined in (8).
𝑆𝑆𝐸(𝐶𝐽) = ∑ 𝑤𝑖𝑗
𝑝𝑛
𝐼=1 𝑑𝑖𝑠𝑡(𝑎𝑖, 𝑏𝑗)2
(8)
𝑆𝑆𝐸(𝑚) = ∑ ∑ 𝑤𝑖𝑗
𝑝
𝑑𝑖𝑠𝑡(𝑎𝑖, 𝑏𝑗)2𝑚
𝑖=1
𝑛
𝑖=1 (9)
The SSE inside each cluster can be decreased by increasing the number of clusters.
The above concept results in better characters of the data objects which are retained from a
number of clusters, in a manner such that the objects in the cluster are more analogous to each
other. There will be a trivial reduction in SSE in each cluster due to the splitting of cluster into
sub clusters. To decide on the number of clusters, Elbow method which is an efficient algorithm
is employed. When the number of clusters m>0; the following steps are followed:
1) Determine the SSE(m);
2) Sketch the curve between the determined SSE (m) and the variable ‘m’;
3) The accurate number of cluster will be implied from the most significant inflection point on
the curve;
6. TELKOMNIKA ISSN: 1693-6930 ◼
Clustering and data aggregation scheme in underwater wireless... (Vani Krishnaswamy)
1609
where p (p≥0) represents a parameter to determine the priority weighting of the degree of
belongingness wij. The amount of fitness of the data can be evaluated using the SSE for fuzzy
clustering with ‘m’ clusters as defined in (9).
3.5. Selection of Cluster Head
According to the analysis of energy consumption, there are few disadvantages of using
LEACH protocol in underwater environment.
− The energy of the nodes which are distant from the sink/BS is exhausted early.
− The cluster head nodes are randomly selected and gets concentrated due to which the
energy efficiency of the node will decrease.
To avoid the disadvantages of the LEACH protocol [16] and to select the cluster head
node with high energy and to enhance the life time of network, a new scheme of selecting the
cluster head node is proposed by taking the idea from the work given in [8]. The sink/BS will
broadcast the information; the nodes are classified into different levels based on the strength of
the information and the distance from the sink as level 1, level 2 as shown in the Figure 1.
The node nearer to the base station has the lesser level number and more chance of
selecting as CH (Cluster Head).
Figure 1. Energy level classification
The wait time of the node is represented using the formula:
𝑊𝑇 = 𝑖𝑛𝑖𝑡 [𝑁 (1 −
𝐸 𝑟
𝐸 𝐼
)] + (𝐿𝐼 − 1) + 𝐼 𝐷
𝐼
/𝑁 (10)
where Er= residual energy of node i; Ei= initial energy of node i; N= number of nodes; Li=level
number of node i; IDi=Identification number of node i. From the (9), it is to infer that the member
node with more energy will broadcast the message more quickly when compared to other
nodes. If two or more nodes have same energy in different energy levels, then the node with
higher energy level is chosen primarily to transmit the message. Process 2 explains about the
steps involved in selecting the cluster head node. Process 2:
The following are the steps followed to select the Cluster Head (CH) node.
1) Initially during setting up of network, base station broadcasts the messages to all the nodes.
Every node will know their energy Level number Li using the strength of the received power.
Then, calculate Ti using Li and energy level.
2) Nodes (m for every round) with higher Ti are selected as cluster head nodes. Accordingly
using CSMA (Carrier Sense Multiple Access) MAC (Medium Access Control) protocol CH will
broadcast advertisement message (ADV) in time with Ti.
CH
CH
CH
SINK/BS
CLUSTER HEAD NODE
MEMBER NODE
LEVEL 1
LEVEL 2 LEVEL 3
7. ◼ ISSN: 1693-6930
TELKOMNIKA Vol. 17, No. 4, August 2019: 1604-1614
1610
3) Depending on the strength of the received signal, every member node other than CH will
determine it's CH for the next round.
4) Once again using CSMA MAC protocol every non CH node will transmit a join-request back
to its chosen CH.
5) Using TDMA (Time Division Multiple Access) CH node will schedule for data transmission
within the cluster.
The uniform distribution of CH for the entire network is ensured, when a node receives the
strong signal of ADV message, it will surrender the opportunity to turn out to be CH which
avoids the CH to get close.
3.5. Data Aggregation Scheme
The cluster head periodically receives the information from the member nodes in the
network. The collective data received by the CH will be transmitted to the sink. Sequentially to
avoid the data redundancy which results in duplication of data and reduce the energy
consumption in transmissions, a data aggregation scheme is proposed taking the idea from the
work given in [14]. A data aggregation scheme has been implemented among CHs using the
concept of similarity function. Euclidean distance formula is used with similarity function. CH
collects all the data transmitted from it’s member nodes and accumulates as a set of data called
vector. The comparisons of two vectors are performed using similarity function and if two
vectors are found to be alike then CH will transmit only one data in place of both to the sink.
This process avoids the data redundancy which in turn reduces the energy consumption
in the network
4. Simulation
This section presents simulation model, simulation parameter inputs and performance
parameters.
4.1. Simulation Model
A node is considered to be dead or alive depending on the available energy. If the node
energy reduces to 0, then it is considered as a dead node. Simultaneously in the network, if the
count of dead nodes exceeds a cut off value, then the entire network is said to be deceased.
Network environment discussed in Section 3 is simulated for analyzing the performance of
clustering scheme.
The simulations were carried out using MATLAB and the performances of LEACH and
the proposed FBC algorithm were analyzed in terms of the number of dead and alive nodes,
Number of cluster using SSE and the total energy. The sensor nodes were randomly deployed
in the region S and are able to communicate with each other. We assume that the base station
is built at two different positions (25 𝑚𝑥25 𝑚𝑥50 𝑚) and (50 𝑚𝑥50 𝑚𝑥100 𝑚). For simulations,
the number of sensor nodes N set were 100 and with data packet size of 400 bits for every
transmission time. The initial energy of each node and electronic energy set are 0.5 J and
50 nJ/bit respectively. In addition to this, the energy of the base station is assumed to be
unlimited as it is solar powered.
4.2. Simulation Parameters
The simulation inputs are shown in Table 1. The performance parameters are explained
as follows.
− Number of clusters: Elbow method which is an efficient algorithm is employed to find out
the number of cluster using SSE parameter.
− Life cycle: The study of life cycle of the nodes with respect to their initial energy and
position of the base stations are conducted.
− Energy consumption: In data aggregation phase the CH aggregates the data and transmits
to the sink. The comparative analysis of consumption of energy with and without data
aggregation is performed.
8. TELKOMNIKA ISSN: 1693-6930 ◼
Clustering and data aggregation scheme in underwater wireless... (Vani Krishnaswamy)
1611
Table 1. The Parameters for Simulation
Variable Parameter Value
S Distribution area 100x100x100m3
n Number of nodes 100
l length of every data 400 bit package
Eelec Energy cost of data aggregation 10mJ/bit
EDA Factors in objective function 5mJ/bit
α, β, γ 0.2,0.3,0.5
5. Result Analysis
This section presents the comparative analysis of proposed scheme (denoted as FBC)
and LEACH algorithm [16].
5.1. Determination of Cluster Amount
Experiments were carried out for 50 iterations using process (1). The value of SSE
within each cluster was determined by the variable m. Figure 2 depicts the relationship between
SSE and the number of clusters. The graph shows that when the number of cluster
amounts to 2, SSE has higher value. Consequently, number of clusters set to 2 for conducting
all the experiments.
Figure 2. Relation between numbers of clusters vs SSE
5.2. Study of Life Cycle
The life cycle of the UWASN is greatly influenced by two factors. (1) The initial energy
of the nodes. (2) The position of the Base Station (BS). In the experiment conducted it was
decided to have two different situations: first considering the first factor where every node in the
network has the same initial energy as 0.5J and secondly uniformly distributing the energy
among the nodes between 0.3 to 0.6 J.
The positions of the BS was varied at (25, 25, 50) which was nearer to the network area
and at (50, 50,100) which was considerably far from the network area. The entire experiment
was repeated for LEACH algorithm and FBC. It was found that the death of a few nodes in the
network area did not have an immense impact on network lifetime, especially when the
redundancy of the network coverage was more. After that we considered dead nodes with
network lifetime. Figures 3 and 4 depicts the relationship between the percentage of dead
nodes and the rounds.
Figures 3 and 4 shows that the positions of the BS are different, irrespective of the fact
that the network nodes contained an equal initial energy. In both the situations the proposed
algorithm FBC achieved better results when compared to the LEACH algorithm resulting in
prolonging the expiry of the nodes. The most important reason for this is that, in our proposed
algorithm the selection of cluster heads were achieved effectively. This in turn decreased the
consumption of the energy for the communication between the nodes. Simultaneously the
9. ◼ ISSN: 1693-6930
TELKOMNIKA Vol. 17, No. 4, August 2019: 1604-1614
1612
nodes with high outstanding energy had the preference of being cluster heads, which balanced
the consumption of the energy in each network node and thereby avoiding the early death of the
nodes. Hence the lifespan of the network was extended. It was also observed from the graph
that the BS nearer to the network area performed better when compared to the BS located at a
larger distance in the network area. In both the situations the proposed algorithm performed well
when compared to LEACH.
Figure 3. Dead nodes vs rounds with same
energy at the BS (25, 25, 50)
Figure 4. Dead nodes vs rounds with same
energy at the BS (50, 50,100)
Practically when we consider the optimal cost point, smaller range controls the
redundancy of the network. During such situation, to assure that the entire network is
connected, on a condition that all nodes in the network stay alive for a longer duration.
Even when one node demise, the quality of service across the network is momentarily reduced
resulting in focusing more interest on the living rate of UWASN.
Figures 5 and 6 depict the relation between rate of survivability of nodes and the
network life cycle. The graphs show that when compared to LEACH algorithm, FBC has a
smaller curved slope which indicates that the process of nodes dying was reasonably placid.
This is because in FBC, both the distance and energy are considered to share the energy
consumption between each node. Thus assuring that none of the nodes in the network
diminished their energy, ultimately the lifespan of the node was extended.
Figure 5. Nodes alive vs rounds with same
energy at the BS (25, 25, 50)
Figure 6. Nodes alive vs rounds with same
energy at the BS (50, 50,100)
10. TELKOMNIKA ISSN: 1693-6930 ◼
Clustering and data aggregation scheme in underwater wireless... (Vani Krishnaswamy)
1613
Figure 7 depicts the consumption of the energy in the network, considering both the
schemes of with and without data aggregation. The overall consumption of the energy in the
network with and without data aggregation is indicated by red line and blue line respectively.
In the proposed scheme of clustering and cluster head selection, the energy is saved at each
phase. The data aggregation and transmission of aggregated data to the BS is performed by
cluster head nodes. Also, the energy is saved in the data aggregation scheme as it uses
similarity function through which it reduces the number of duplicate data transmissions from
cluster-heads to the BS/sink. As a result, networks using clustering with data aggregation
scheme devour less energy compared to a network without clustering and data aggregation.
Figure 7. Energy consumption vs offered load
6. Conclusion
In this study, we propose a new clustering scheme using fuzzy logic considering energy
and the probability of belongingness of the sensor nodes. The cluster head selection is
performed based on the factors such as the energy and distance. Further, using similarity
function the aggregated data at CH is transmitted to the BS. A simulation result shows that the
proposed scheme performs better in prolonging the lifespan of the network. As a future
enhancement, various PSO (Particle Swarm Optimization) alternatives could be used to resolve
the problem of cluster head selection and analysis could be carried out based on their
performances. In addition to this various initial clustering algorithms could be designed to
decrease the redundant data. This would result in the energy being conserved and in turn
increasing the lifespan of the network. We are focusing to work on various data aggregatin
schemes to achieve better accuracy of data.
References
[1] Akyildiz TF, Pompili D, Melodia T. Underwater acoustic sensor networks: research challenges.
Ad Hoc Networks. 2005; 3(3): 257-279.
[2] PV Amoli. An Overview on Current Researches on Underwater Sensor Networks: Applicaltions.
Challenges and Future Trends. International Journal of Electrical and Computer Engineering.
2016; 6(3): 955.
[3] IF Akyildiz, D Pompili, T Melodia. State-of-the-art in protocol research for underwater acoustic sensor
networks. WUWNet 06. 2006: 7-16.
[4] Rakesh Kumar and Navdeep Singh. A Survey on Data Aggregation and Clustering Schemes in
Underwater Sensor Networks. International Journal of Grid and Distributed Computing.
2014; 7: 29-52.
[5] Kumar R, Singh N, A survey on data aggregation and clustering schemes in underwater sensor
networks. Int. J. Grid Distrib. Comput. 2014; 7(6): 29-52.
[6] Yu JY, Chong PHJ. A survey of clustering schemes for mobile adhoc networks.
IEEE Communications Surveys and Tutorials. 2005; 7(1): 32-48.
11. ◼ ISSN: 1693-6930
TELKOMNIKA Vol. 17, No. 4, August 2019: 1604-1614
1614
[7] Domingo MC, Prior C. A distributed clustering scheme for underwater wireless sensor networks.
PIMRC 07. 2007: 1-5.
[8] Manjula RB, Manvi SS. Cluster based data aggregation in underwater acoustic sensor networks.
INDICON12. 2012: 104-109.
[9] Wang P Li, C Zheng J, Mouftah HT. A dependable clustering protocol for survivable. ICC 08.
2008: 3263-3268.
[10] Yang G, Xiao M, Cheng E, Zhang J. A cluster-head selection scheme for underwater acoustic sensor
networks. CMC 10. 2010: 188-191.
[11] Buddha S, Lobiyal DK. A novel energy-aware cluster head selection based on particle swarm
optimization for wireless sensor networks. Humancentric Computing and Information Sciences' 12.
2012: 1-18.
[12] Goyal N, Dave M, Verma AK. Energy Efficient Architecture for Intra and Inter Cluster Communication
for Underwater Wireless Sensor Networks. Wireless Personal Communications. 2016; 89: 687-707.
[13] Goyal N. Data aggregation in underwater wireless sensor network: Recent approaches and issues.
Journal of King Saud University–Computer and Information Sciences. 2017; 4(7): 1-12.
[14] Tran KTM, Oh SH, Byun JH. Well-suited similarity functions for data aggregation in cluster-based
underwater wireless sensor networks. International Journal of Distributed Sensor Networks.
2013; 9(8): 1-7.
[15] Virmani D, Sharma T, Sharma R. Adaptive energy aware data aggregation tree for wireless sensor
networks. International Journal of Hybrid Information Technology. 2013; 6(1): 25-36.
[16] WB Heinzelman, AP Chandrakasan, H Balakrishnan. Application-specific protocol architecture for
wireless microsensor networks. IEEE Transactions on Wireless Communications. 2002;
1(4): 660-670.
[17] Bharamagoudra MR, Manvi SS, Gonen B. Event driven energy depth and channel aware routing for
underwater acoustic sensor networks: agent oriented clustering based approach. Elsevier Journal of
Computer and Electrical Engineering. 2017; 58: 1–19.
[18] Wang F, Wang L, Han Y, Liu B, Wang J, Su X. A Study on the Clustering Technology of Underwater
Isomorphic Sensor Networks Based on Energy Balance. Sensors. 2014: 12523-12532.
[19] Reza MM, Rahman KT, Zakaria Rakesh Kumar, Navdeep Singh. A.S.M. Grid based Fuzzy Optimized
Routing Protocol for Underwater Sensor Networks. Int. J. Comput. Appl. 2015; 112: 2326.
[20] Domingo MC, Prior R. Design and Analysis of a GPS-free Routing Protocol for Underwater Wireless
Sensor Networks in Deep Water. 2007 International Conference on Sensor Technologies and
Applications (SENSORCOMM 2007). 2007: 215-220.
[21] Ni Q, Pan Q, Du H, Cao C, Zhai Y. A Novel Cluster Head Selection Algorithm Based on Fuzzy
Clustering and Particle Swarm Optimization. IEEE/ACM Transactions on computational Biology and
Bioinformatics. 2017; 14(1): 76-84.
[22] Rakesh Kumar and Navdeep Singh. Fuzzy Based Clustering and Aggregation Technique for Under
Water Wireless Sensor Networks. lCECS. 2014.
[23] Nasser S, Alkhaldi R, Vert. A modified fuzzy K-means clustering using expectation maximization.
Proc. IEEE Int. Conf. Fuzzy Syst. 2006: 231-235.
[24] Quost B, Denux. Clustering Fuzzy Data Using the Fuzzy EM Algorithm. SUM '10. 2010: 333-346.
[25] Ahmed Mukhtiar, Salleh Mazleen, Channa Muhammad, Rohani Mohd. RMEER: Relaiable Multipath
Energy Efficient routing protocol for underwater wireless sensor network. International Journal of
Electrical and Computer Engineering. 2018; 8(6): 4366-4373.
[26] Sehgal Anuj, David Catalin, Schnwlder Jrgen. Energy Consumption Analysis of Underwater Acoustic
Sensor Networks. OCEANS'11-MTS/IEEE. 2011: 1-6.