Preferred Language
Articles
/
joe-274
Enhanced Chain-Cluster Based Mixed Routing Algorithm for Wireless Sensor Networks
...Show More Authors

Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorithm that combines the full advantages of both cluster and chain techniques such as CCM (Chain-Cluster based Mixed routing). In this paper, introduce a routing algorithm relying on CCM algorithm called (Enhanced Chain-Cluster based Mixed routing) algorithm E-CCM. Simulation results show that E-CCM algorithm improves the performance of CCM algorithm in terms of three performance metrics which are: energy consumption, network lifetime, and (FND and LND). MATLAB program is used to develop and test the simulation process in a computer with the following specifications: windows 7 (32-operating system), core i5, RAM 4 GB, hard 512 GB.

 

 

View Publication Preview PDF
Quick Preview PDF
Publication Date
Sun Jul 01 2012
Journal Name
Applied Soft Computing
A new evolutionary based routing protocol for clustered heterogeneous wireless sensor networks
...Show More Authors

Scopus (244)
Crossref (198)
Scopus Clarivate Crossref
Publication Date
Mon Nov 01 2021
Journal Name
Indonesian Journal Of Electrical Engineering And Computer Science
Proposed emerged and enhanced routing protocols for wireless networks
...Show More Authors

The problem motivation of this work deals with how to control the network overhead and reduce the network latency that may cause many unwanted loops resulting from using standard routing. This work proposes three different wireless routing protocols which they are originally using some advantages for famous wireless ad-hoc routing protocols such as dynamic source routing (DSR), optimized link state routing (OLSR), destination sequenced distance vector (DSDV) and zone routing protocol (ZRP). The first proposed routing protocol is presented an enhanced destination sequenced distance vector (E-DSDV) routing protocol, while the second proposed routing protocol is designed based on using the advantages of DSDV and ZRP and we named it as

... Show More
Scopus (1)
Crossref (1)
Scopus Crossref
Publication Date
Sat Dec 01 2018
Journal Name
Indonesian Journal Of Electrical Engineering And Computer Science
An Energy-Aware and Load-balancing Routing scheme for Wireless Sensor Networks
...Show More Authors

<p>Energy and memory limitations are considerable constraints of sensor nodes in wireless sensor networks (WSNs). The limited energy supplied to network nodes causes WSNs to face crucial functional limitations. Therefore, the problem of limited energy resource on sensor nodes can only be addressed by using them efficiently. In this research work, an energy-balancing routing scheme for in-network data aggregation is presented. This scheme is referred to as Energy-aware and load-Balancing Routing scheme for Data Aggregation (hereinafter referred to as EBR-DA). The EBRDA aims to provide an energy efficient multiple-hop routing to the destination on the basis of the quality of the links between the source and destination. In

... Show More
View Publication Preview PDF
Scopus (26)
Crossref (11)
Scopus Crossref
Publication Date
Sat May 19 2012
Journal Name
Wireless Personal Communications
Stable-Aware Evolutionary Routing Protocol for Wireless Sensor Networks
...Show More Authors

Scopus (36)
Crossref (26)
Scopus Clarivate Crossref
Publication Date
Thu Dec 01 2011
Journal Name
Swarm And Evolutionary Computation
Energy-aware evolutionary routing protocol for dynamic clustering of wireless sensor networks
...Show More Authors

Scopus (166)
Crossref (136)
Scopus Clarivate Crossref
Publication Date
Sat Aug 25 2012
Journal Name
Wireless Personal Communications
Multi-Objective Evolutionary Algorithm Based on Decomposition for Energy Efficient Coverage in Wireless Sensor Networks
...Show More Authors

Scopus (57)
Crossref (42)
Scopus Clarivate Crossref
Publication Date
Mon Aug 01 2022
Journal Name
Baghdad Science Journal
Perceptually Important Points-Based Data Aggregation Method for Wireless Sensor Networks
...Show More Authors

The transmitting and receiving of data consume the most resources in Wireless Sensor Networks (WSNs). The energy supplied by the battery is the most important resource impacting WSN's lifespan in the sensor node. Therefore, because sensor nodes run from their limited battery, energy-saving is necessary. Data aggregation can be defined as a procedure applied for the elimination of redundant transmissions, and it provides fused information to the base stations, which in turn improves the energy effectiveness and increases the lifespan of energy-constrained WSNs. In this paper, a Perceptually Important Points Based Data Aggregation (PIP-DA) method for Wireless Sensor Networks is suggested to reduce redundant data before sending them to the

... Show More
View Publication Preview PDF
Scopus (45)
Crossref (35)
Scopus Clarivate Crossref
Publication Date
Sun Feb 25 2024
Journal Name
Baghdad Science Journal
An Improved Cuckoo Search Algorithm for Maximizing the Coverage Range of Wireless Sensor Networks
...Show More Authors

The issue of increasing the range covered by a wireless sensor network with restricted sensors is addressed utilizing improved CS employing the PSO algorithm and opposition-based learning (ICS-PSO-OBL). At first, the iteration is carried out by updating the old solution dimension by dimension to achieve independent updating across the dimensions in the high-dimensional optimization problem. The PSO operator is then incorporated to lessen the preference random walk stage's imbalance between exploration and exploitation ability. Exceptional individuals are selected from the population using OBL to boost the chance of finding the optimal solution based on the fitness value. The ICS-PSO-OBL is used to maximize coverage in WSN by converting r

... Show More
View Publication Preview PDF
Scopus (2)
Scopus Crossref
Publication Date
Thu Aug 31 2017
Journal Name
Journal Of Engineering
Enhanced Performance of Consensus Wireless Sensor Controlled System via Particle Swarm Optimization Algorithm
...Show More Authors

     This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s

... Show More
View Publication Preview PDF
Publication Date
Tue May 16 2023
Journal Name
Journal Of Engineering
Parallel Routing in Wireless Sensor Network
...Show More Authors

The limitations of wireless sensor nodes are power, computational capabilities, and memory. This paper suggests a method to reduce the power consumption by a sensor node. This work is based on the analogy of the routing problem to distribute an electrical field in a physical media with a given density of charges. From this analogy a set of partial differential equations (Poisson's equation) is obtained. A finite difference method is utilized to solve this set numerically. Then a parallel implementation is presented. The parallel implementation is based on domain decomposition, where the original calculation domain is decomposed into several blocks, each of which given to a processing element. All nodes then execute computations in parall

... Show More
View Publication Preview PDF
Crossref