A Tree-Based Local Repairing Approach for Increasing Lifetime of Query Driven WSN
24 Aug 2011-pp 475-482
TL;DR: A novel scheme has been proposed to locally repair the tree with constant round of message transmissions to ensure the correct delivery of messages in a query-response based application.
Abstract: Query driven Broadcast through wireless sensor nodes also leads to the domain of event driven converge cast. A query-response based application in Wireless Sensor Networks(WSN) demands the correct delivery of data message at each sensor node. A Breadth-First Search(BFS) tree rooted at the base station offers shortest path traversal for each data message which utilizes the sensor resources efficiently. Resource constrained sensor nodes are highly prone to sudden crash. So the application demands a quick and smart approach to repair the tree when a node dies. In this paper a novel scheme has been proposed to locally repair the tree with constant round of message transmissions. Each node piggybacks a few bytes of extra information along with each query and response messages. Based on these piggybacked values each node calculates its alternate parent. When a parent node fails, its children can contact their respective alternate parents immediately to establish an alternate path to the root. Reduced communication cost in terms of extra message transmissions saves battery power at each node. Efficient query-response message handler ensures the correct delivery of messages. Fast repairing offers good Quality of Service(QoS). Simulation result shows that no message is lost except the one holding by the crashed node.
Citations
More filters
01 Jan 2021
TL;DR: In this article, the authors proposed multi-tree and multiple-tree algorithms for improving network parameters in the usual data collection WSN application scenarios, where single parameter type sensors are arranged in a tree-based topology so as to reduce the energy consumption as well as the end-to-end delay in data communication.
Abstract: A sensor node is usually coupled with more than one sensor. This imposes more burdens on individual nodes in data gathering functions. Also, the energy consumption increases in order to power a greater number of transducers as well as in carrying out data communication and aggregation functions for different sensed parameters. This article proposes multi-tree and multiple-tree algorithms for improving network parameters in the usual data collection WSN application scenarios. A multi-tree simply suggests a strategy where single parameter-type sensors are arranged in a tree-based topology so as to reduce the energy consumption as well as the end-to-end delay in data communication. The multiple-tree exemplifies a more effective way of query result propagation in data centric applications where delay requirements are not very stringent.
1 citations
TL;DR: The proposed EHSQP algorithm ensures that only the relevant nodes are involved in the query execution, and reduces communication cost significantly, and saves energy and time very effectively for the connected sensors in the given region.
Abstract: In order to address the problem of energy and time-efficient execution of spatial queries in multi-sink wireless sensor networks, an efficient hybrid spatial query processing algorithm EHSQP is proposed in this paper. In EHSQP, sink nodes perform the sector selection for the query region and seek the query route to a query region using the known infrastructure information. Sensor nodes can adjust the query dissemination and reversing route for query results based on the available local information. To minimise the energy consumption and the response time, the proposed EHSQP algorithm ensures that only the relevant nodes are involved in the query execution. Experimental results show that the proposed algorithm reduces communication cost significantly, and saves energy and time very effectively for the connected sensors in the given region. The proposed technique has an advantage over other techniques in terms of energy and time-efficient query cover with lower communication cost.
01 Jan 2015
TL;DR: It is shown that quasi random deployment strategy is better than deterministic deployment which is difficult to maintain and better than random deployment scheme that is expensive in terms of coverage, and network constraints.
Abstract: This article evaluates the performance of a quasi random deployment strategy for wireless sensor networks on the basis of the application invoked for tree based communication networks. The quasi random deployment strategy tries to combine the benefits of both random and deterministic approaches for effective coverage and connectivity. We adopt Halton sequence to generate the node placement co-ordinates and study the features and effects on the network traffic, the total carried load, the amount of delay incurred and the energy consumption under the IEEE 802.15.4 standard. Our analysis suggests the need to revisit currently used models of deployment in such networks. This paper also tries to suggest adoption of quasi based deployment on the basis of the simulation results. It shows that quasi random deployment strategy is better than deterministic deployment which is difficult to maintain and better than random deployment scheme that is expensive in terms of coverage, and network constraints. Keyword- Wireless Sensor networks, Minimum Spanning Tree architectures, Delay, Throughput, Quasi- random deployment, Zigbee networks
Additional excerpts
...While Localized area spanning tree (LAST) protocols for wireless short range sensor networks optimizes the energy cost and the interference imposed by the structure [5], a BFS based tree rooted at the base station offers shortest path traversal for each data message which utilizes the sensor resources efficiently by employing a local repairing approach for the crashing nodes thereby increasing the lifetime [6]....
[...]
References
More filters
Book•
01 Jan 1990TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Abstract: From the Publisher:
The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition,this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects.
In its new edition,Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity,and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage.
As in the classic first edition,this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further,the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds.
Each chapter presents an algorithm,a design technique,an application area,or a related topic. The chapters are not dependent on one another,so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally,the new edition offers a 25% increase over the first edition in the number of problems,giving the book 155 problems and over 900 exercises thatreinforcethe concepts the students are learning.
21,651 citations
TL;DR: The concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics is described.
17,936 citations
"A Tree-Based Local Repairing Approa..." refers background in this paper
...Sensors are micro-electronic devices which can sense different environmental parameters like temperature, speed, geographic position, light intensity and so on[1]....
[...]
TL;DR: In this article, a language similar to logo is used to draw geometric pictures using this language and programs are developed to draw geometrical pictures using it, which is similar to the one we use in this paper.
Abstract: The primary purpose of a programming language is to assist the programmer in the practice of her art. Each language is either designed for a class of problems or supports a different style of programming. In other words, a programming language turns the computer into a ‘virtual machine’ whose features and capabilities are unlimited. In this article, we illustrate these aspects through a language similar tologo. Programs are developed to draw geometric pictures using this language.
5,749 citations
TL;DR: In this article, the authors explore and evaluate the use of directed diffusion for a simple remote-surveillance sensor network analytically and experimentally and demonstrate that directed diffusion can achieve significant energy savings and can outperform idealized traditional schemes under the investigated scenarios.
Abstract: Advances in processor, memory, and radio technology will enable small and cheap nodes capable of sensing, communication, and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the directed-diffusion paradigm for such coordination. Directed diffusion is data-centric in that all communication is for named data. All nodes in a directed-diffusion-based network are application aware. This enables diffusion to achieve energy savings by selecting empirically good paths and by caching and processing data in-network (e.g., data aggregation). We explore and evaluate the use of directed diffusion for a simple remote-surveillance sensor network analytically and experimentally. Our evaluation indicates that directed diffusion can achieve significant energy savings and can outperform idealized traditional schemes (e.g., omniscient multicast) under the investigated scenarios.
2,550 citations