2,839 research outputs found
A Differential Evolution-Based Routing Algorithm for Environmental Monitoring Wireless Sensor Networks
The traditional Low Energy Adaptive Cluster Hierarchy (LEACH) routing protocol is a clustering-based protocol. The uneven selection of cluster heads results in premature death of cluster heads and premature blind nodes inside the clusters, thus reducing the overall lifetime of the network. With a full consideration of information on energy and distance distribution of neighboring nodes inside the clusters, this paper proposes a new routing algorithm based on differential evolution (DE) to improve the LEACH routing protocol. To meet the requirements of monitoring applications in outdoor environments such as the meteorological, hydrological and wetland ecological environments, the proposed algorithm uses the simple and fast search features of DE to optimize the multi-objective selection of cluster heads and prevent blind nodes for improved energy efficiency and system stability. Simulation results show that the proposed new LEACH routing algorithm has better performance, effectively extends the working lifetime of the system, and improves the quality of the wireless sensor networks
Routing Algorithm with Uneven Clustering for Energy Heterogeneous Wireless Sensor Networks
Aiming at the “hotspots” problem in energy heterogeneous wireless sensor networks, a routing algorithm of heterogeneous sensor network with multilevel energies based on uneven clustering is proposed. In this algorithm, the energy heterogeneity of the nodes is fully reflected in the mechanism of cluster-heads’ election. It optimizes the competition radius of the cluster-heads according to the residual energy of the nodes. This kind of uneven clustering prolongs the lifetime of the cluster-heads with lower residual energies or near the sink nodes. In data transmission stage, the hybrid multihop transmission mode is adopted, and the next-hop routing election fully takes account of the factors of residual energies and the distances among the nodes. The simulation results show that the introduction of an uneven clustering mechanism and the optimization of competition radius of the cluster-heads significantly prolonged the lifetime of the network and improved the efficiency of data transmission
Adaptive Dynamics of Realistic Small-World Networks
Continuing in the steps of Jon Kleinberg's and others celebrated work on
decentralized search in small-world networks, we conduct an experimental
analysis of a dynamic algorithm that produces small-world networks. We find
that the algorithm adapts robustly to a wide variety of situations in realistic
geographic networks with synthetic test data and with real world data, even
when vertices are uneven and non-homogeneously distributed.
We investigate the same algorithm in the case where some vertices are more
popular destinations for searches than others, for example obeying power-laws.
We find that the algorithm adapts and adjusts the networks according to the
distributions, leading to improved performance. The ability of the dynamic
process to adapt and create small worlds in such diverse settings suggests a
possible mechanism by which such networks appear in nature
ASURVEY ON CLUSTER BASED LOAD BALANCINGAPPROACHESFOR WIRELESSSENSOR NETWORK
Wireless sensor network (WSN) is becoming a very interesting field of research in recent days. It has wide area of research due to various issues caused by the hardware capabilities of sensing nodes such as memory, power, and computing capabilities. One of the major issues is to concentrate on the energy consumption of the sensing node which determines the lifetime of the network. One of such problem is called Hot-spot problem, in which the best channel to the sink are overloaded with traffic and thus causing the nodes to deplete their energy quicker than the energy of other nodes in the network. Clustering algorithms along with sink mobility widely support for equal distribution of the load in the network. In order to overcome this problem various load balancing algorithms are discussed for improving the lifetime of the network
Enhancing network lifetime with an improved MOD- LEACH
Wireless sensor network will be the most dominating field in future era. There are certain issues which wireless sensor network suffers from. The main concern with wireless sensor network is limited energy which directly impact on network lifetime. In this paper we modify the cluster selection procedure of MODLEACH. MODLEACH protocol use threshold value for selecting cluster head. Once a cluster head is selected, it retains its position until it bypasses the threshold limit. In Basic LEACH, it does not use any threshold value but it randomly selects cluster head from the available nodes. We combine the probabilistic nature of LEACH to select the cluster head and threshold base selection of cluster head of MODLEACH. We also apply proposed modification in EAMMH protocol. Our main focus is on the enhancement of network lifetime, and we got significant improvement in network lifetime
Recommended from our members
Survey of partitioning techniques in silicon compilation
In the silicon compilation design process, partitioning is usually the first problem to be investigated because partitioning algorithms form the backbone of many algorithms including: system synthesis, processor synthesis, floorplanning, and placement. In this survey, several partitioning techniques will be examined. In addition, this paper will review the partitioning algorithms used by synthesis systems at different design levels
- …