A Survey on Routing Techniques of Data-Centric Wireless Sensor Networks
---
paper_title: A survey on routing protocols for wireless sensor networks

paper_content:

Recent advances in wireless sensor networks have led to many new protocols specifically designed for sensor networks where energy awareness is an essential consideration. Most of the attention, however, has been given to the routing protocols since they might differ depending on the application and network architecture. This paper surveys recent routing protocols for sensor networks and presents a classification for the various approaches pursued. The three main categories explored in this paper are data-centric, hierarchical and location-based. Each routing protocol is described and discussed under the appropriate category. Moreover, protocols using contemporary methodologies such as network flow and quality of service modeling are also discussed. The paper concludes with open research issues. � 2003 Elsevier B.V. All rights reserved.
---
paper_title: Adaptive protocols for information dissemination in wireless sensor networks

paper_content:

In this paper, we present a family of adaptive protocols, called SPIN (Sensor Protocols for Information via Negotiation), that efficiently disseminates information among sensors in an energy-constrained wireless sensor network. Nodes running a SPIN communication protocol name their data using high-level data descriptors, called meta-data. They use meta-data negotiations to eliminate the transmission of redundant data throughout the network. In addition, SPIN nodes can base their communication decisions both upon application-specific knowledge of the data and upon knowledge of the resources that are available to them. This allows the sensors to efficiently distribute data given a limited energy supply. We simulate and analyze the performance of two specific SPIN protocols, comparing them to other possible approaches and a theoretically optimal protocol. We find that the SPIN protocols can deliver 60% more data for a given amount of energy than conventional approaches. We also find that, in terms of dissemination rate and energy usage, the SPlN protocols perform close to the theoretical optimum.
---
paper_title: Adaptive protocols for information dissemination in wireless sensor networks

paper_content:

In this paper, we present a family of adaptive protocols, called SPIN (Sensor Protocols for Information via Negotiation), that efficiently disseminates information among sensors in an energy-constrained wireless sensor network. Nodes running a SPIN communication protocol name their data using high-level data descriptors, called meta-data. They use meta-data negotiations to eliminate the transmission of redundant data throughout the network. In addition, SPIN nodes can base their communication decisions both upon application-specific knowledge of the data and upon knowledge of the resources that are available to them. This allows the sensors to efficiently distribute data given a limited energy supply. We simulate and analyze the performance of two specific SPIN protocols, comparing them to other possible approaches and a theoretically optimal protocol. We find that the SPIN protocols can deliver 60% more data for a given amount of energy than conventional approaches. We also find that, in terms of dissemination rate and energy usage, the SPlN protocols perform close to the theoretical optimum.
---
paper_title: Next century challenges: scalable coordination in sensor networks

paper_content:

Networked sensors-those that coordinate amongst themselves to achieve a larger sensing task-will revolutionize information gathering and processing both in urban environments and in inhospitable terrain. The sheer numbers of these sensors and the expected dynamics in these environments present unique challenges in the design of unattended autonomous sensor networks. These challenges lead us to hypothesize that sensor network coordination applications may need to be structured differently from traditional network applications. In particular, we believe that localized algorithms (in which simple local node behavior achieves a desired global objective) may be necessary for sensor network coordination. In this paper, we describe localized algorithms, and then discuss directed diffusion, a simple communication model for describing localized algorithms.
---
paper_title: Directed diffusion: a scalable and robust communication paradigm for sensor networks

paper_content:

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 datacentric 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. We explore and evaluate the use of directed diffusion for a simple remote-surveillance sensor network.
---
paper_title: Improving the Energy Efficiency of Directed Diffusion Using Passive Clustering

paper_content:

Directed diffusion is a prominent example of data-centric routing based on application layer data and purely local interactions. In its functioning it relies heavily on network-wide flooding which is an expensive operation, specifically with respect to the scarce energy resources of nodes in wireless sensor networks (WSNs). One well-researched way to curb the flooding overhead is by clustering. Passive clustering is a recent proposal for on-demand creation and main- tenance of the clustered structure, making it very attractive for WSNs and directed diffusion in particular. The contribution of this paper is the investigation of this combination: Is it feasible to execute directed diffusion on top of a sensor network where the topology is implicitly constructed by passive clustering? A simulation-based comparison between plain directed diffusion and one based on passive clustering shows that, depending on the scenario, pas- sive clustering can significantly reduce the required energy while main- taining and even improving the delay and the delivery rate. This study also provides insights into the behavior of directed diffusion with respect to its long-term periodic behavior, contributing to a better understand- ing of this novel class of communication protocols.
---
paper_title: Nodes Credit based Direct Diffusion for wireless sensor networks

paper_content:

Sensor Network are emerging as a new tool for important application in diverse fields like military surveillance, habitat monitoring, weather, home electrical appliances and others. Technically, sensor network nodes are limited in respect to energy supply, computational capacity and communication bandwidth. In order to prolong the lifetime of the sensor nodes, designing efficient routing protocol is very critical. In this paper, how information can effectively
---
paper_title: Region Directed Diffusion in Sensor Network Using Learning Automata: RDDLA

paper_content:

One of the main challenges in wireless sensor network is energy problem and life cycle of nodes in networks. Several methods can be used for increasing life cycle of nodes. One of these methods is load balancing in nodes while transmitting data from source to destination. Directed diffusion algorithm is one of declared methods in wireless sensor networks which is data-oriented algorithm. Directed diffusion deals with two fundamental problems. First, in the network the data packets traverse the invalid routes up to the central node in order to make new routes and eliminate the previous ones at a very short period of time. They are dispatched from a platform lacking any central node which itself causes the decrease of data delivery rates. Second, the reconstruction of such routes urges the application of exploration phase which comes along with the distribution of interest packets and exploratory data resulting into a great deal of outputs injected into the network. But with every motion, the application of exploratory phase of central node makes an overflow of outputs. Certainly with intense movement it enjoys high importance. Having more than one sink, network is separated to some regions and the proposed algorithm called Region Directed Diffusion Learning Automata (RDDLA) updates the rout between these sinks and finds interface node with learning automata and sends packet from source to this node and transmits data to sinks with this node. This approach decreased overall network metrics up to 22%.
---
paper_title: Scalable Information-Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks

paper_content:

This paper describes two novel techniques, information-driven sensor querying IDSQ and constrained anisotropic diffusion routing CADR, for energy-efficient data querying and routing in ad hoc sensor networks for a range of collaborative signal processing tasks. The key idea is to introduce an information utility measure to select which sensors to query and to dynamically guide data routing. This allows us to maximize information gain while minimizing detection latency and bandwidth consumption for tasks such as localization and tracking. Our simulation results have demonstrated that the information-driven querying and routing techniques are more energy efficient, have lower detection latency, and provide anytime algorithms to mitigate risks of link/node failures.
---
paper_title: The cougar approach to in-network query processing in sensor networks

paper_content:

The widespread distribution and availability of small-scale sensors, actuators, and embedded processors is transforming the physical world into a computing platform. One such example is a sensor network consisting of a large number of sensor nodes that combine physical sensing capabilities such as temperature, light, or seismic sensors with networking and computation capabilities. Applications range from environmental control, warehouse inventory, and health care to military environments. Existing sensor networks assume that the sensors are preprogrammed and send data to a central frontend where the data is aggregated and stored for offline querying and analysis. This approach has two major drawbacks. First, the user cannot change the behavior of the system on the fly. Second, conservation of battery power is a major design factor, but a central system cannot make use of in-network programming, which trades costly communication for cheap local computation.In this paper, we introduce the Cougar approach to tasking sensor networks through declarative queries. Given a user query, a query optimizer generates an efficient query plan for in-network query processing, which can vastly reduce resource usage and thus extend the lifetime of a sensor network. In addition, since queries are asked in a declarative language, the user is shielded from the physical characteristics of the network. We give a short overview of sensor networks, propose a natural architecture for a data management system for sensor networks, and describe open research problems in this area.
---

Title: A Survey on Routing Techniques of Data-Centric Wireless Sensor Networks

Section 1: INTRODUCTION
Description 1: This section introduces the basic concepts of wireless sensor networks (WSNs), including their architecture, components, and applications, and discusses the challenges and design criteria for WSNs.

Section 2: ROUTING
Description 2: This section defines the process of routing in WSNs, describes the characteristics that routing protocols should possess, and introduces the various protocols designed to efficiently route data within WSNs.

Section 3: Characteristics for a routing protocol
Description 3: This section outlines the specific characteristics that routing protocols in WSNs should have to ensure efficient and reliable data transmission, including fault tolerance, adaptability, and scalability.

Section 4: Data-Centric Routing Protocols in Wireless Sensor Networks
Description 4: This section provides an overview of data-centric routing protocols, explaining the concept of attribute-based naming and how these protocols operate within WSNs.

Section 5: Flooding
Description 5: This section describes the flooding technique used for routing in WSNs, its mechanisms, and the problems associated with it, such as implosion, overlapping, and resource blindness.

Section 6: Gossiping
Description 6: This section explains the gossiping protocol, a modification of the flooding technique, and discusses its mechanism and associated issues such as data redundancy.

Section 7: SPIN
Description 7: This section introduces the Sensor Protocols for Information via Negotiation (SPIN), detailing its approach to overcome the problems of flooding and gossiping through data negotiation.

Section 8: Directed Diffusion
Description 8: This section explains the directed diffusion protocol, an application-aware and data-centric approach, and discusses its phases, variants, and improvements for energy efficiency.

Section 9: Rumor Routing
Description 9: This section describes the Rumor Routing protocol, a variant of directed diffusion suited for cases with infrequent events, outlining its operational principles and efficiency considerations.

Section 10: Gradient Based Routing
Description 10: This section introduces Gradient-Based Routing, detailing its mechanism of leveraging node height to route data and the different data spreading techniques it uses.

Section 11: Constrained Anisotropic Diffusion routing protocol
Description 11: This section discusses the Constrained Anisotropic Diffusion routing protocol (CADR), an extension of directed diffusion, focusing on its methodologies to maximize information gain and minimize communication costs.

Section 12: COUGAR
Description 12: This section presents the data-centric routing protocol COUGAR, emphasizing its query plan generation, leader selection for data aggregation, and the handling of data flow in WSNs.

Section 13: Conclusion
Description 13: This section sums up the discussion on data-centric routing protocols in WSNs, highlighting their importance, the challenges they address, and the future direction for research.