Analysis of energy consumption and lifetime of heterogeneous wireless sensor networks

Duarte-Melo, Enrique J.; Liu, Mingyan

doi:10.1109/glocom.2002.1188034

Cited by 267 publications

(161 citation statements)

References 5 publications

Supporting

Mentioning

155

Contrasting

Unclassified

Order By: Relevance

“…One sensor node could have as many as 40 or more neighbours in the network. Although ECC public-key cryptography is executable for small sensor nodes, a 160-bit [2] ECC point multiplication still takes about less than one second. It would need too much computational time and energy for LN-sensor to run ECC with each of its 30 neighbours.…”

Section: Ecdh Key Management Schemementioning

confidence: 99%

A Secured Grid Based Route Driven PKC Scheme for Heterogeneous Sensor Network

Pradheepkumar¹,

Fareedha²,

Jenieferkavetha³

et al. 2010

IJGCA

View full text Add to dashboard Cite

show abstract

Section: Ecdh Key Management Schemementioning

confidence: 99%

A Secured Grid Based Route Driven PKC Scheme for Heterogeneous Sensor Network

Pradheepkumar¹,

Fareedha²,

Jenieferkavetha³

et al. 2010

IJGCA

View full text Add to dashboard Cite

show abstract

“…In the literature, network lifetime has often been defined as either the time till the first or a set of nodes runs out of its energy [9][10][11][12], or till the first loss of connectivity or coverage [13,14], or a combination of these [15]. A formal definition of network lifetime may depend on the application scenario in which the network is targeted at.…”

Section: Problem Formulationmentioning

confidence: 99%

E-Span and LPT for data aggregation in wireless sensor networks

Lee

Wong

2006

Computer Communications

View full text Add to dashboard Cite

In wireless sensor networks (WSNs), when a stimulus or event is detected within a particular region, data reports from the neighboring sensor nodes (sources) are sent to the sink (destination). Data from these sources are usually aggregated along their way to the sink. The data aggregation via in-network processing reduce communication cost and improves energy efficiency. In this paper, we propose two different tree structures to facilitate data aggregation. We first propose E-Span, which is an energy-aware spanning tree algorithm. In E-span, the source node which has the highest residual energy is chosen as the root. Other source nodes choose their corresponding parent node among their neighbors based on the information of the residual energy and distance to the root. We also propose the Lifetime-Preserving Tree (LPT). In LPT, nodes which have higher residual energy are chosen as the aggregating parents. LPT also includes a self-healing feature by which the tree will be re-constructed again whenever a node is no longer functional or a broken link is detected. By choosing Directed Diffusion [C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in: Proc. of ACM MobiCom'00, Boston, MA, Aug. 2000, pp. 56-67.] as the underlying routing platform, simulation results show that in a WSN with 250 sensor nodes, the lifetime of sources can be extended significantly when data are aggregated by using either E-Span or LPT algorithms.

show abstract

“…J. Duarte-Melo and M. Liu [4] propose and analyze a hierarchical scheme which is closer to ours by utilizing two types of nodes to organize the infrastructure of the network. However, it still needs to dynamically choose clusterheads among "strong" nodes and it deploys single-hop links within a cluster as well.…”

Section: Related Workmentioning

confidence: 99%

A Cluster-Based Energy Balancing Scheme in Heterogeneous Wireless Sensor Networks

Turgut

Bölöni

2005

Networking - ICN 2005

View full text Add to dashboard Cite

Abstract. In this paper, we propose a novel, cluster-based energy balancing scheme. We assume the existence of a fraction of "strong" nodes in terms of abundant storage, computing and communication abilities as well as energy. With the transformation of the flat network infrastructure into a hierarchical one, we obtained significant improvements in energy balancing leading to a longer connected time of the network. The improvement is quantified by mathematical analysis and extensive numerical simulations.

show abstract

Analysis of energy consumption and lifetime of heterogeneous wireless sensor networks

Cited by 267 publications

References 5 publications

A Secured Grid Based Route Driven PKC Scheme for Heterogeneous Sensor Network

A Secured Grid Based Route Driven PKC Scheme for Heterogeneous Sensor Network

E-Span and LPT for data aggregation in wireless sensor networks

A Cluster-Based Energy Balancing Scheme in Heterogeneous Wireless Sensor Networks

Contact Info

Product

Resources

About