An energy-aware spanning tree algorithm for data aggregation in wireless sensor networks

Lee, M.; Wong, Vincent W. S.

doi:10.1109/pacrim.2005.1517285

Cited by 76 publications

(48 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The Mean lifetime of sensor nodes is higher as compared to the Directed Diffusion. It also maintains a low average packet transfer delay and a high packet delivery ratio [22].  MMSPEED (Multipath Multi SPEED) -It extends the SPEED protocol [23] by introducing multiple speed levels to guarantee timeliness packet delivery.…”

Section: Span Benjie Chenkyle Jamieson Hari Balakrishnan and Robermentioning

confidence: 99%

A Comparative Study on Network structure based Routing Protocol and its Variants in Wireless Sensor Networks: A Survey

Sobti¹

2015

IJCA

View full text Add to dashboard Cite

Nowadays Wireless sensor network is one of the fastest growing and emerging area in the scientific and engineering world .Its basic objective is to sense the crucial data and send it Base station so that it take corrective actions further. Sensor nodes interact with each other via various Routing protocols. This paper surveys various network structure and network operation based routing protocols, and explains the current developments of each protocol pursued .The three basic categories of routing techniques explored here are Data centric, hierarchical and location based protocol. Afterward, various QOS protocols are also surveyed with their recent research work. Further, in this paper, ongoing research and future directions in routing are discussed. KeywordsWSN, LEACH, SPEED, PEGASIS, GBR, SPIN. INTRODUCTIONRecent advancements in the field of computing, sensing and communications have attracted Researchers from various quarters for making huge investments in the field of WSN. However, WSN are still in research period and deployed in various applications like monitoring of environment, crop , wildlife, air pollution, urban traffic, volcanic eruption, heritage buildings and detections of landslides, tsunami , emplaced an IED, Healthcare [2].WSN is self organized group of multiple nodes (motes) that can sense the surrounding environmental condition such as humidity, illumination, temperature. Each node senses the data and transmits it to BS for performing specific application [1].Maximum battery energy of motes is consumed in data transmission and reception. Thus, it is essential for routing protocols to prolong sensor node's lifetime by utilizing energy properly, route data via paths that can evade low energy sensor nodes and reduces transmission power in order to maximize WSN's lifetime. This paper provides the various routing protocols which gives possible solutions to the problems.The rest of the paper is structured as follows. Section 1 exhibits the various routing techniques in WSN. A classification and comprehensive survey of routing protocols based on network structure and network operation and its descendents is presented in Section 2. Here we summarize past and current developments in each categorized protocol. Section 3 highlights the ongoing research and future directions in routing. We conclude with final remarks in Section 4. DIFFERENT ROUTING TECHNIQUESThere are basic two routing techniques that are Network structure and Network operations [1] as shown in Fig 1. Further, they are divided into three categories as data centric, hierarchical and location based on the basis of the structure of the network. However, on the basis of operations of network, QoS based protocols and their current developments are discussed.• Data centric Routing-Data centric routing is query based where data are requested through queries. It depends on the naming scheme for the data which eliminates redundant transmissions. Attribute based naming is used for specifying characteristics of data. Here, Sensor node choose...

show abstract

Section: Span Benjie Chenkyle Jamieson Hari Balakrishnan and Robermentioning

confidence: 99%

A Comparative Study on Network structure based Routing Protocol and its Variants in Wireless Sensor Networks: A Survey

Sobti¹

2015

IJCA

View full text Add to dashboard Cite

show abstract

“…It comes under tree based approach, [5] wherein every node that detects an event reports its collected data by using a shortest path towards the sink node. The data aggregation occurs whenever routing paths overlap.…”

Section: Shortest Path Tree (Spt) Algorithmmentioning

confidence: 99%

A Reliable Routing Technique for Wireless Sensor Networks

Girija¹,

S²

2015

IJCATR

View full text Add to dashboard Cite

Wireless Sensor Network (WSN) consists of very large number of sensor nodes which are deployed close to the area which is to be monitored so as to sense various environmental conditions. WSN is a data-driven network which produces large amount of data and also sensor nodes are energy-limited devices and their energy consumption is mainly associated with data routing. Therefore it is necessary to perform redundant data aggregation so as to save energy. In this work data aggregation is achieved with the help of two key approaches namely Clustering approach and In-network data aggregation. These two approaches help to save energy and thereby increasing the lifetime of the network. The proposed work has some key features like reliable cluster formation, high data aggregation rate, priority of packets, minimized overhead, multiple routes, reduced energy consumption which enhance the network lifetime. The performance evaluation of the proposed approach is carried out using Network Simulator-version 2.

show abstract

“…We first describe the E-Span algorithm [19,20]. It is followed by the description of the centralized and distributed versions of the LPT algorithm [21].…”

Section: Proposed Tree Structuresmentioning

confidence: 99%

“…In this section, we present the performance comparisons between E-Span [20], LPT [21], and the Directed Diffusion [1].…”

Section: Performance Evaluationmentioning

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

An energy-aware spanning tree algorithm for data aggregation in wireless sensor networks

Cited by 76 publications

References 11 publications

A Comparative Study on Network structure based Routing Protocol and its Variants in Wireless Sensor Networks: A Survey

A Comparative Study on Network structure based Routing Protocol and its Variants in Wireless Sensor Networks: A Survey

A Reliable Routing Technique for Wireless Sensor Networks

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

Contact Info

Product

Resources

About