Maximum Network Lifetime Problem with Time Slots and coverage constraints: heuristic approaches

Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.

Download Full-text

Multi-Criteria Reliability Analysis Based on Heuristic Approaches by the Ritz Method

Recent Patents on Mechanical Engineering ◽

10.2174/2212797610801020106 ◽

2008 ◽

Vol 1 (2) ◽

pp. 106-115

Author(s):

Jhojan Rojas ◽

Abdelkhalak Hami ◽

Domingos Rade

Keyword(s):

Reliability Analysis ◽

Ritz Method ◽

Heuristic Approaches

Download Full-text

Enhanced Adaptive Distributed Energy-Efficient Clustering (EADEEC) for Wireless Sensor Networks

Recent Advances in Computer Science and Communications ◽

10.2174/2213275912666190404162447 ◽

2020 ◽

Vol 13 (2) ◽

pp. 168-172

Author(s):

Ravi Kumar Poluru ◽

M. Praveen Kumar Reddy ◽

Syed Muzamil Basha ◽

Rizwan Patan ◽

Suresh Kallam

Keyword(s):

Network Lifetime ◽

Routing Protocols ◽

Energy Efficient ◽

High Energy ◽

Base Station ◽

Sensor Nodes ◽

Wireless Sensor ◽

Distributed Energy ◽

Stability Period ◽

Energy Efficient Clustering

Background:Recently Wireless Sensor Network (WSN) is a composed of a full number of arbitrarily dispensed energy-constrained sensor nodes. The sensor nodes help in sensing the data and then it will transmit it to sink. The Base station will produce a significant amount of energy while accessing the sensing data and transmitting data. High energy is required to move towards base station when sensing and transmitting data. WSN possesses significant challenges like saving energy and extending network lifetime. In WSN the most research goals in routing protocols such as robustness, energy efficiency, high reliability, network lifetime, fault tolerance, deployment of nodes and latency. Most of the routing protocols are based upon clustering has been proposed using heterogeneity. For optimizing energy consumption in WSN, a vital technique referred to as clustering.Methods:To improve the lifetime of network and stability we have proposed an Enhanced Adaptive Distributed Energy-Efficient Clustering (EADEEC).Results:In simulation results describes the protocol performs better regarding network lifetime and packet delivery capacity compared to EEDEC and DEEC algorithm. Stability period and network lifetime are improved in EADEEC compare to DEEC and EDEEC.Conclusion:The EADEEC is overall Lifetime of a cluster is improved to perform the network operation: Data transfer, Node Lifetime and stability period of the cluster. EADEEC protocol evidently tells that it improved the throughput, extended the lifetime of network, longevity, and stability compared with DEEC and EDEEC.

Download Full-text

Energy Efficient Clustering and Routing Algorithm for WSN

Recent Patents on Computer Science ◽

10.2174/2213275912666190716112254 ◽

2019 ◽

Vol 12 ◽

Cited By ~ 1

Author(s):

Mohit Kumar ◽

Sonu Mittal ◽

Md. Amir Khusru Akhtar

Keyword(s):

Energy Consumption ◽

Network Lifetime ◽

Energy Efficient ◽

Hot Spot ◽

Routing Algorithm ◽

Relay Node ◽

Sensor Nodes ◽

Wireless Sensor ◽

Energy Efficient Clustering ◽

Hot Spot Problem

Background: This paper presents a novel Energy Efficient Clustering and Routing Algorithm (EECRA) for WSN. It is a clustering-based algorithm that minimizes energy dissipation in wireless sensor networks. The proposed algorithm takes into consideration energy conservation of the nodes through its inherent architecture and load balancing technique. In the proposed algorithm the role of inter-cluster transmission is not performed by gateways instead a chosen member node of respective cluster is responsible for data forwarding to another cluster or directly to the sink. Our algorithm eases out the load of the gateways by distributing the transmission load among chosen sensor node which acts as a relay node for inter-cluster communication for that round. Grievous simulations show that EECRA is better than PBCA and other algorithms in terms of energy consumption per round and network lifetime. Objective: The objective of this research lies in its inherent architecture and load balancing technique. The sole purpose of this clustering-based algorithm is that it minimizes energy dissipation in wireless sensor networks. Method: This algorithm is tested with 100 sensor nodes and 10 gateways deployed in the target area of 300m × 300m. The round assumed in this simulation is same as in LEACH. The performance metrics used for comparisons are (a) network lifetime of gateways and (b) energy consumption per round by gateways. Our algorithm gives superior result compared to LBC, EELBCA and PBCA. Fig 6 and Fig 7 shows the comparison between the algorithms. Results: The simulation was performed on MATLAB version R2012b. The performance of EECRA is compared with some existing algorithms like PBCA, EELBCA and LBCA. The comparative analysis shows that the proposed algorithm outperforms the other existing algorithms in terms of network lifetime and energy consumption. Conclusion: The novelty of this algorithm lies in the fact that the gateways are not responsible for inter-cluster forwarding, instead some sensor nodes are chosen in every cluster based on some cost function and they act as a relay node for data forwarding. Note the algorithm does not address the hot-spot problem. Our next endeavor will be to design an algorithm with consideration of hot-spot problem.

Download Full-text

A Fuzzy Logic-Based Decentralized Clustering Algorithm for WSN to Extend the Network Lifetime

International Journal for Research in Applied Science and Engineering Technology ◽

10.22214/ijraset.2017.4143 ◽

2017 ◽

Vol V (IV) ◽

pp. 782-785

Author(s):

Mr. K. Manikannan

Keyword(s):

Fuzzy Logic ◽

Network Lifetime ◽

Clustering Algorithm

Download Full-text

Division of labor

10.1093/oso/9780199672363.003.0003 ◽

2018 ◽

Author(s):

Phanish Puranam

Keyword(s):

Division Of Labor ◽

Task Allocation ◽

Task Structure ◽

Heuristic Approaches ◽

Object Based ◽

The Creation ◽

Task Division ◽

And Task

Division of labor involves task division and task allocation. An extremely important consequence of task division and allocation is the creation of interdependence between agents. In fact, division of labor can be seen as a process that converts interdependence between tasks into interdependence between agents. While there are many ways in which the task structure can be chunked and divided among agents, two important heuristic approaches involve division of labor by activity vs. object. I show that a choice between these two forms of division of labor only arises when the task structure is non-decomposable, but the product itself is decomposable. When the choice arises, a key criterion for selection between activity vs. object-based division of labor is the gain from specialization relative to the gain from customization.

Download Full-text