LE2P

In Wireless Sensor Network, the total energy consumption determines the lifetime of the entire network. As a result, a number of recently-designed energy-efficient routing algorithm stated that clustering approach has an important issue for organizing a network into a connected hierarchy and increasing the network lifetime. The clustering hierarchical model consists in two main steps, cluster heads selection and assignment of each node to one cluster. This paper proposes an enhancement of Low Energy Adaptive Clustering with deterministic cluster-head selection by introducing a new parameter for electing cluster-head. Nodes having the highest remaining energy and the lowest energy variance consumption become cluster heads with high probability. The additional variance parameter takes into account energy consumption dispersion if the considered node is elected as cluster-head. This dispersion highly depends on the relative positioning of the node to the base station. Variance keeps the energy consumption of the node in the preceding rounds. This is useful for predicting node status when elected as cluster-head in the current round in order to balance the network energy. Simulation results show that our proposal extends the networks lifetime compared to recent cluster-based protocol. More-over, the energy consumption is balanced between the wireless sensor nodes.

In Wireless Sensor Network (WSN), the clustering algorithm was developed to reduce the total energy consumption which determines the lifetime of the whole network. As a result, a number of recently-designed energy-efficient routing algorithms stated that clustering approach has an important issue for organizing a network into a connected hierarchy and increasing the network lifetime. This paper proposes a new algorithm to improve the performance of Low Energy Adaptive Clustering Centralized (LEACH-C) by improving the criterion for electing a cluster-head and the determination of optimal number of cluster-heads. Firstly, the optimal number of cluster-heads is based on the density of the covering. The sensor nodes are deployed randomly on the plane area of the sensing field covered by the communication range of the node. Secondly, nodes having the highest remaining energy and the lowest energy variance consumption becomes cluster-heads. The variance parameter keeps energy consumption dispersion, if the considered node is elected as cluster-head. This dispersion highly depends on the relative positioning of the node to the base station. This is useful for predicting node status when elected as cluster-head in the current round in order to balance the network energy. The simulation and analytical results of the proposed algorithm outperform the existing protocols in terms of lifetime of the network.

This paper presents Forwarding and Routing Cluster-Based Protocol which aims to prolong wireless network lifetime by balancing energy consumption among all nodes. It avoids the premature death of the closest cluster-head (CH) for multi-hop protocols using hierarchical network clustering. FoRoC introduces two items: first, to take into consideration the node’s local informations during CHs selection steps, such as remaining energy and its coefficient of variation. And secondly, it also combines one-hop and multi-hop elementary path routing methods for data transfer for inter-cluster communication as a unique path. Furthermore, periodically changing the role between CH or end-node, and periodically changing the route between CHs and base-station, balances the CHs energy consumption. For going further towards the ideal energy balance which is illustrated by a coefficient of synchronous death.
Simulation results show that the FoRoC shows great performance in terms of energy consumption and the network lifetime. Lifetime is increased by 80% compared to one-hop protocols. Compared to multi-hop protocol, FoRoC reaches a coefficient of synchronous death of 2.09.

In Wireless Sensor Network, the total energy consumption determines the lifetime of the entire network. As a result, a number of recently-designed energy-efficient routing algorithm stated that clustering approach has an important issue for organizing a network into a connected hierarchy and increasing the network lifetime. The clustering hierarchical model consists in two main steps, cluster heads selection and assignment of each node to one cluster. This paper proposes an enhancement of Low Energy Adaptive Clustering with deterministic cluster-head selection by introducing a new parameter for electing cluster-head. Nodes having the highest remaining energy and the lowest energy variance consumption become cluster heads with high probability. The additional variance parameter takes into account energy consumption dispersion if the considered node is elected as cluster-head. This dispersion highly depends on the relative positioning of the node to the base station. Variance keeps the energy consumption of the node in the preceding rounds. This is useful for predicting node status when elected as cluster-head in the current round in order to balance the network energy. Simulation results show that our proposal extends the networks lifetime compared to recent cluster-based protocol. Moreover , the energy consumption is balanced between the wireless sensor nodes.

In Wireless Sensor Network (WSN), the clustering algorithm was developed to reduce the total energy consumption which determines the lifetime of the whole network. As a result, a number of recently-designed energy-efficient routing algorithms stated that clustering approach has an important issue for organizing a network into a connected hierarchy and increasing the network lifetime. This paper proposes a new algorithm to improve the performance of Low Energy Adaptive Clustering Centralized (LEACH-C) by improving the criterion for electing a cluster-head and the determination of optimal number of cluster-heads. Firstly, the optimal number of cluster-heads is based on the density of the covering. The sensor nodes are deployed randomly on the plane area of the sensing field covered by the communication range of the node. Secondly, nodes having the highest remaining energy and the lowest energy variance consumption becomes cluster-heads. The variance parameter keeps energy consumption dispersion, if the considered node is elected as cluster-head. This dispersion highly depends on the relative positioning of the node to the base station. This is useful for predicting node status when elected as cluster-head in the current round in order to balance the network energy. The simulation and analytical results of the proposed algorithm outperform the existing protocols in terms of lifetime of the network.

In Wireless Sensor Network, the total energy consumption determines the lifetime of the entire network. As a result, a number of recently-designed energy-efficient routing algorithm stated that clustering approach has an important issue for organizing a network into a connected hierarchy and increasing the network lifetime. The clustering hierarchical model consists in two main steps, cluster heads selection and assignment of each node to one cluster. This paper proposes an enhancement of Low Energy Adaptive Clustering with deterministic cluster-head selection by introducing a new parameter for electing cluster-head. Nodes having the highest remaining energy and the lowest energy variance consumption become cluster heads with high probability. The additional variance parameter takes into account energy consumption dispersion if the considered node is elected as cluster-head. This dispersion highly depends on the relative positioning of the node to the base station. Variance keeps the energy consumption of the node in the preceding rounds. This is useful for predicting node status when elected as cluster-head in the current round in order to balance the network energy. Simulation results show that our proposal extends the networks lifetime compared to recent cluster-based protocol. More-over, the energy consumption is balanced between the wireless sensor nodes.

This paper presents Forwarding and Routing Cluster-Based Protocol which aims to prolong wireless network lifetime by balancing energy consumption among all nodes. It avoids the premature death of the closest cluster-head (CH) for multi-hop protocols using hierarchical network clustering. FoRoC introduces two items: first, to take into consideration the node's local informations during CHs selection steps, such as remaining energy and its coefficient of variation. And secondly, it also combines one-hop and multi-hop elementary path routing methods for data transfer for inter-cluster communication as a unique path. Furthermore, periodically changing the role between CH or end-node, and periodically changing the route between CHs and base-station, balances the CHs energy consumption. For going further towards the ideal energy balance which is illustrated by a coefficient of synchronous death. Simulation results show that the FoRoC shows great performance in terms of energy consumption and the network lifetime. Lifetime is increased by 80% compared to one-hop protocols. Compared to multi-hop protocol, FoRoC reaches a coefficient of synchronous death of 2.09.

This paper develops an unfamiliar modelling of printed circuit board (PCB) interconnect behaving as HH-tree. The developed model is based on the tensorial analysis of networks (TAN) formalism. The HH-tree is implemented with the equivalent LC-network based on Hammerstad-Jensen modelling. The unfamiliar TAN methodology is described by starting from the equivalent graph topology. The HH-tree TAN model is established from the branch and mesh spaces implementation of voltage, current and impedance tensorial objects. Then, the HH-tree PCB problem is reformulated with the tensorial electrical system metric. The solution of the metric problem is validated with commercial tool simulation from DC up to 2.5 GHz with a microstrip circuit proof-of-concept. As expected, computed and simulated results are in good agreement.

This paper introduces a tensorial analysis of networks (TAN) applied to a tree asymmetrical structure. To illustrate the TAN concept easily, the present investigation is applied to a three-port structure represented by a Y -tree topology. The unfamiliar method of TAN circuit modelling is elaborated from the graph topology. The fast formulation of the Y -matrix model of the structure is established from branch and mesh space TAN analyses. The TAN model is validated with commercial tool simulation and measurements from DC up to 0.5 GHz in the frequency domain and two different waveform signals in the time domain. The proof of concept circuit is implemented in microstrip technology on an FR4-epoxy dielectric substrate. Mapping sensitivity analysis with respect to the Y -tree RLC-parameters is realized by showing that local variations around initial set of R, L, and C do not equally influence reflection and transmission coefficients over the frequency bandwidth. If a similar impact is o...

Energy conservation can be achieved by the use of clustering routing protocols in Wireless Sensor Networks (WSN). They have a great impact on the system lifetime. In these WSNs, the concepts of communication between Cluster Head (CH) nodes and Base Station (BS), data aggregation and round can be approached in a different way. This paper studies a cluster-based multi-hop routing protocol. The proposed approach introduces a progressive data aggregation, and a sequential data request during a round. Simulation results show that the new Forwarding and Routing Stateless Multi-Hop (FRSM) protocol extends network lifetime (improved by 50%) and lowers energy consumption. The comparison with an existing cluster-based protocol shows better performances.

Because of its counterintuitive nature, the Negative Group Delay (NGD) remains as an uncommon and unfamiliar electronic function. For this reason, the design and analysis of NGD circuits are not well-known for most of electronic designers. This paper initiates a basic and easy to understand theory, in addition to a design methodology for the low-pass NGD function. The circuit theory on the low-pass NGD function is described using an NGD passive topology which is constituted by a RC-parallel network with a resistive load. The NGD analysis and synthesis equations in function of NGD specifications are provided and a proof-of-concept of 6-dB low-pass NGD circuits has been designed, simulated, fabricated and tested. Frequency and time domain analyses have been performed to validate the low-pass NGD function. Theoretical and simulated results are in very good agreement and an NGD has been obtained in measurement for the proposed structure.

This paper elaborates an accurate energy model for Wireless Sensor Device (WSD) based on power consumption measurement. We found that compared to the energy consumption of processing, transmission, listening and reception phases, the data transfer consumes up to 40\% of total WSD energy whereas this aspects is often neglected in usual models.