Wireless Sensor Network Routing Protocols: A Survey
---
paper_title: Integrated comparison of energy efficient routing protocols in wireless sensor network: A survey

paper_content:

The dramatic increase in sensors application over the past 20 years, made it clear that the sensors will make a revolution like that witnessed in microcomputers in 1980s. Moreover, some researchers have labeled the first decade of the 21st century as the “Sensor Decade” [1]. Sensor nodes are powered by limited capacity of batteries and because of this limitation, the energy consumption of a sensor node must be tightly controlled. WSN life time mainly depends on the lifetime of limited power source of the nodes. Therefore, energy consumption is main concern in WSNs. So, during the operation of each sensor node, the sources that consume energy must be analyzed and maintained efficiently. In this paper, we have focused on features of Sensor Networks, Clustering and Routing and more precisely on Energy Efficient (E.E) routing protocols and finally, made an integrated comparison among these E.E Routing protocols.
---
paper_title: Integrated comparison of energy efficient routing protocols in wireless sensor network: A survey

paper_content:

The dramatic increase in sensors application over the past 20 years, made it clear that the sensors will make a revolution like that witnessed in microcomputers in 1980s. Moreover, some researchers have labeled the first decade of the 21st century as the “Sensor Decade” [1]. Sensor nodes are powered by limited capacity of batteries and because of this limitation, the energy consumption of a sensor node must be tightly controlled. WSN life time mainly depends on the lifetime of limited power source of the nodes. Therefore, energy consumption is main concern in WSNs. So, during the operation of each sensor node, the sources that consume energy must be analyzed and maintained efficiently. In this paper, we have focused on features of Sensor Networks, Clustering and Routing and more precisely on Energy Efficient (E.E) routing protocols and finally, made an integrated comparison among these E.E Routing protocols.
---
paper_title: Protocols for self-organization of a wireless sensor network

paper_content:

We present a suite of algorithms for self-organization of wireless sensor networks in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing, and formation of ad hoc subnetworks for carrying out cooperative signal processing functions among a set of the nodes.
---
paper_title: Protocols for self-organization of a wireless sensor network

paper_content:

We present a suite of algorithms for self-organization of wireless sensor networks in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing, and formation of ad hoc subnetworks for carrying out cooperative signal processing functions among a set of the nodes.
---
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: SPIN-IT: a data centric routing protocol for image retrieval in wireless networks

paper_content:

We propose and analyze a routing protocol for mobile ad hoc networks that supports efficient image retrieval based on metadata queries. In digital photography, metadata describes captured information about an image and provides the key element needed for advanced techniques for sharing pictures. Our goal was to find an efficient way to utilize metadata to retrieve images in a wireless network of imaging devices. Building on the SPIN (sensor protocols for information via negotiation) protocol for metadata negotiation, we designed SPIN-IT (SPIN-image transfer), a protocol where wireless imaging devices use metadata queries to retrieve desired pictures. This protocol provides low bandwidth query-based communication prior to the transfer of image data to set up routes to desired data rather than routes to specific nodes. We compare SPIN-IT to a centralized approach and discuss the advantages of each design for different picture-sharing scenarios.
---
paper_title: Rumor routing algorthim for sensor networks

paper_content:

Advances in micro-sensor and radio technology will enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. In order to constrain communication overhead, dense sensor networks call for new and highly efficient methods for distributing queries to nodes that have observed interesting events in the network. A highly efficient data-centric routing mechanism will offer significant power cost reductions [17], and improve network longevity. Moreover, because of the large amount of system and data redundancy possible, data becomes disassociated from specific node and resides in regions of the network [10][7][8]. This paper describes and evaluates through simulation a scheme we call Rumor Routing, which allows for queries to be delivered to events in the network. Rumor Routing is tunable, and allows for tradeoffs between setup overhead and delivery reliability. It's intended for contexts in which geographic routing criteria are not applicable because a coordinate system is not available or the phenomenon of interest is not geographically correlated.
---
paper_title: A New Gradient-Based Routing Protocol in Wireless Sensor Networks

paper_content:

Every physical event results in a natural information gradient in the proximity of the phenomenon. Moreover, many physical phenomena follow the diffusion laws. This natural information gradient can be used to design efficient information-driven routing protocols for sensor networks. Information-driven routing protocols based on the natural information gradient, may be categorized into two major approaches: (i) the single-path approach and (ii) the multiple-path approach. In this paper, using a regular grid topology, we develop analytical models for the query success rate and the overhead of both approaches for ideal and lossy wireless link conditions. We validate our analytical models using simulations. Also, both the analytical and the simulation models are used to characterize each approach in terms of overhead, query success rate and increase in path length.
---
paper_title: Protocols for self-organization of a wireless sensor network

paper_content:

We present a suite of algorithms for self-organization of wireless sensor networks in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing, and formation of ad hoc subnetworks for carrying out cooperative signal processing functions among a set of the nodes.
---
paper_title: Improvement on LEACH Protocol of Wireless Sensor Network

paper_content:

This paper studies LEACH protocol, and puts forward energy-LEACH and multihop-LEACH protocols. Energy-LEACH protocol improves the choice method of the cluster head, makes some nodes which have more residual energy as cluster heads in next round. Multihop-LEACH protocol improves communication mode from single hop to multi-hop between cluster head and sink. Simulation results show that energy-LEACH and multihop-LEACH protocols have better performance than LEACH protocols.
---
paper_title: Improvement on LEACH Protocol of Wireless Sensor Network

paper_content:

This paper studies LEACH protocol, and puts forward energy-LEACH and multihop-LEACH protocols. Energy-LEACH protocol improves the choice method of the cluster head, makes some nodes which have more residual energy as cluster heads in next round. Multihop-LEACH protocol improves communication mode from single hop to multi-hop between cluster head and sink. Simulation results show that energy-LEACH and multihop-LEACH protocols have better performance than LEACH protocols.
---
paper_title: A two-levels hierarchy for low-energy adaptive clustering hierarchy (TL-LEACH)

paper_content:

Wireless sensor networks with thousands of tiny sensor nodes are expected to find wide applicability and increasing deployment in coming years, as they enable reliable monitoring and analysis of the environment. In this paper we propose a modification to a well-known protocol for sensor networks called Low Energy Adaptive Clustering Hierarchy (LEACH). This last is designed for sensor networks where end- user wants to remotely monitor the environment. In such situation, the data from the individual nodes must be sent to a central base station, often located far from the sensor network, through which the end-user can access the data. In this context our contribution is represented by building a two-level hierarchy to realize a protocol that saves better the energy consumption. Our TL-LEACH uses random rotation of local cluster base stations (primary cluster-heads and secondary cluster-heads). In this way we build, where it is possible, a two-level hierarchy. This permits to better distribute the energy load among the sensors in the network especially when the density of network is higher. TL- LEACH uses localized coordination to enable scalability and robustness. We evaluated the performances of our protocol with NS-2 and we observed that our protocol outperforms the LEACH in terms of energy consumption and lifetime of the network.
---
paper_title: Improvement on LEACH Protocol of Wireless Sensor Network (VLEACH)

paper_content:

This paper presents a new version of LEACH protocol called VLEACH which aims to reduce energy consumption within the wireless network. We evaluate both LEACH and V-LEACH through extensive simulations using OMNET++ simulator which shows that VLEACH performs better than LEACH protocol.
---
paper_title: U-LEACH: A novel routing protocol for heterogeneous Wireless Sensor Networks

paper_content:

A Wireless Sensor Network comprises of a number of energy-constraint sensor nodes deployed in the area of interest. In our paper, we have proposed a new hierarchical clustering based routing protocol for the heterogeneous wireless sensor networks. The proposed protocol named as Universal - Low Energy Adaptive Cluster Hierarchy (U-LEACH) is an energy efficient protocol showing a significant reduction in the energy consumption by the sensor nodes. Unlike LEACH, in U-LEACH, the selection of Cluster-Head depends on the initial and the residual energy of the nodes. In a particular cluster, the transfer of information between the nodes takes place by forming a chain, starting from the farthest node from the base station. Data aggregation has also been implemented successfully to slam down the energy-consumption. Simulations results show substantial improvement of the U-LEACH over its nemesis protocols.
---
paper_title: CHIRON: An energy-efficient chain-based hierarchical routing protocol in wireless sensor networks

paper_content:

Due to the power restriction of sensor nodes, efficient routing, in wireless sensor networks, is a critical approach to saving node's energy and thus prolonging the network lifetime. Even the chain-based routing is one of significant routing mechanisms, several common flaws, such as data propagation delay and redundant transmission, are associated. In this paper, we propose an energy efficient Chain-Based Hierarchical Routing Protocol, named as CHIRON, to alleviate such deficiencies. Based on the BeamStar concept [9], the main idea of CHIRON is to split the sensing field into a number of smaller areas, so that it can create multiple shorter chains to reduce the data transmission delay and redundant path, and therefore effectively conserve the node energy and prolong the network lifetime. Simulation results show that, in contrast to Enhanced PEGASIS and PEGASIS protocols, the proposed CHIRON can achieve about 15% and 168% improvements on average data propagation delay, 30% and 65% improvements on redundant transmission path, respectively. By these contributions, the network lifetime can also be extended to about 14%∼7% and 50%∼23%, under various small and large simulation areas, respectively.
---
paper_title: TEEN: a routing protocol for enhanced efficiency in wireless sensor networks

paper_content:

Wireless sensor networks are expected to find wide applicability and increasing deployment in the near future. In this paper, we propose a formal classification of sensor networks, based on their mode of functioning, as proactive and reactive networks. Reactive networks, as opposed to passive data collecting proactive networks, respond immediately to changes in the relevant parameters of interest. We also introduce a new energy efficient protocol, TEEN (Threshold sensitive Energy Efficient sensor Network protocol) for reactive networks. We evaluate the performance of our protocol for a simple temperature sensing application. In terms of energy efficiency, our protocol has been observed to outperform existing conventional sensor network protocols.
---
paper_title: An efficient clustering protocol increasing wireless sensor networks life time

paper_content:

Due to their rapid and promising development, Wireless Sensor Networks (WSNs) have been predicted to invade all domains in our daily life in the near future. However in order to reach their maturity, researchers must find solution to some difficulties which are slowing down the wide spread use of these networks. These difficulties are inherent to their constrained specificities which require adapted solutions unrelated to classical wire networks. One the activity done by WSN that consumed the most energy is the number of packets sent/received. In order to reduce this number and to ensure WSN successful operation, hierarchical clustering protocols have been developed. In this paper, we present WB-TEEN and WBM-TEEN: two hierarchical routing protocols, based on nodes clustering and improving the well known protocol Threshold sensitive Energy Efficient sensor Network protocol (TEEN). This improvement is accomplished in a way such that each cluster is nodes balanced and the total energy consumption between sensor nodes and cluster heads is minimized by using multi-hops intra-cluster communication. Simulation results (using NS2 simulator) show that the proposed protocols exhibit better performance than Low Energy Adaptive Clustering Hierarchy (LEACH) and TEEN in terms of energy consumption and network lifetime prolongation.
---
paper_title: Energy-Efficient Routing Protocol Based on Clustering and Least Spanning Tree in Wireless Sensor Networks

paper_content:

A particular wireless sensor networks (WSNs), cluster-based WSN (CWSN) have received more and more attention due to the limited energy of battery-powered nodes, but rarely consider the shortest path at the same time. In this paper, we propose an novel energy-efficient routing protocol based on clustering and least spanning tree for wireless sensor network to prolong network lifetime and shorten path while emphasizing energy conservation at the same time. Clustering includes partitioning stage and choosing stage, namely, partitions the multi-hop network and then chooses cluster-heads, cluster-head is responsible for receiving, sending and maintaining information in its cluster. Then all cluster-heads will construct a least spanning tree to prolong network lifetime, save energy and shorten path. Simulation results show that the system?s performance have further improved by using clustering and least spanning tree. It is a promising approach and deserves more future research.
---
paper_title: SEP: A stable election protocol for clustered heterogeneous wireless sensor networks

paper_content:

We study the impact of heterogeneity of nodes, in terms of their energy, in wireless sensor networks that are hierarchically clustered. In these networks some of the nodes become cluster heads, aggregate the data of their cluster members and transmit it to the sink. We assume that a percentage of the population of sensor nodes is equipped with additional energy resources—this is a source of heterogeneity which may result from the initial setting or as the operation of the network evolves. We also assume that the sensors are randomly (uniformly) distributed and are not mobile, the coordinates of the sink and the dimensions of the sensor field are known. We show that the behavior of such sensor networks becomes very unstable once the first node dies, especially in the presence of node heterogeneity. Classical clustering protocols assume that all the nodes are equipped with the same amount of energy and as a result, they can not take full advantage of the presence of node heterogeneity. We propose SEP, a heterogeneous-aware protocol to prolong the time interval before the death of the first node (we refer to as stability period), which is crucial for many applications where the feedback from the sensor network must be reliable. SEP is based on weighted election probabilities of each node to become cluster head according to the remaining energy in each node. We show by simulation that SEP always prolongs the stability period compared to (and that the average throughput is greater than) the one obtained using current clustering protocols. We conclude by studying the sensitivity of our SEP protocol to heterogeneity parameters capturing energy imbalance in the network. We found that SEP yields longer stability region for higher values of extra energy brought by more powerful nodes.
---
paper_title: HSEP: Heterogeneity-aware Hierarchical Stable Election Protocol for WSNs

paper_content:

Wireless Sensor Networks (WSNs) are increasing to handle complex situations and functions. In these networks some of the nodes become Cluster Heads (CHs) which are responsible to aggregate data of from cluster members and transmit it to Base Stations (BS). Those clustering techniques which are designed for homogenous network are not enough efficient for consuming energy. Stable Election Protocol (SEP) introduces heterogeneity in WSNs, consisting of two type of nodes. SEP is based on weighted election probabilities of each node to become CH according to remaining energy of nodes. We propose Heterogeneity-aware Hierarchal Stable Election Protocol (HSEP) having two level of energies. Simulation results show that HSEP prolongs stability period and network lifetime, as compared to conventional routing protocols and having higher average throughput than selected clustering protocols in WSNs.
---
paper_title: Minimum-energy mobile wireless networks revisited

paper_content:

We propose a protocol that, given a communication network, computes a subnetwork such that, for every pair $(u,v)$ of nodes connected in the original network, there is a minimum-energy path between $u$ and $v$ in the subnetwork (where a minimum-energy path is one that allows messages to be transmitted with a minimum use of energy). The network computed by our protocol is in general a subnetwork of the one computed by the protocol given in [13]. Moreover, our protocol is computationally simpler. We demonstrate the performance improvements obtained by using the subnetwork computed by our protocol through simulation.
---
paper_title: Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks

paper_content:

Future sensor networks will be composed of a large number of densely deployed sensors/actuators. A key feature of such networks is that their nodes are untethered and unattended. Consequently, energy efficiency is an important design consideration for these networks. Motivated by the fact that sensor network queries may often be geographical, we design and evaluate an energy efficient routing algorithm that propagates a query to the appropriate geographical region, without flooding. The proposed Geographic and Energy Aware Routing (GEAR) algorithm uses energy aware neighbor selection to route a packet towards the target region and Recursive Geographic Forwarding or Restricted Flooding algorithm to disseminate the packet inside the destina-
---
paper_title: Trajectory based forwarding and its applications

paper_content:

Trajectory based forwarding (TBF) is a novel methodto forward packets in a dense ad hoc network that makes it possible to route a packet along a predefined curve. It is a hybrid between source based routing and Cartesian forwarding in that the trajectory is set by the source, but the forwarding decision is based on the relationship to the trajectory rather than names of intermediate nodes. The fundamental aspects of TBF are: it decouples path naming from the actual path; it provides cheap path diversity; it trades off communication for computation. These aspects address the double scalability issue with respect to mobility rate and network size. In addition, TBF provides a common framework for many services such as: broadcasting, discovery, unicast, multicast and multipath routing in ad hoc networks. TBF requires that nodes know their position relative to a coordinate system. While a global coordinate system afforded by a system such as GPS would be ideal, approximate positioning methods provided by other algorithms are also usable.
---
paper_title: Insect sensory systems inspired computing and communications

paper_content:

Insects are the most successful group of living things in terms of the number of species, the biomass and their distribution. Entomological research has revealed that the insect sensory systems are crucial for their success. Compared to human brains, the insect central nerve systems are extremely primitive and simple, both structurally and functionally, and are of minimal learning ability. Faced with these constraints, insects have evolved a set of extremely effective sensory systems that are structurally simple, functionally versatile and powerful, and highly distributed, as well as noise and fault tolerant. As a result, in recent years insect sensory systems have been inspirational to new communications and computing paradigms, which have lead to significant advances. However, we believe that the potential for insect-inspired solutions for communications and computing is far from being fully recognized. In particular, the contrasting similarity between the ubiquitous existences of insect sensory networks in nature and the idea of pervasive computing has received little attention. For example, the chemosensory communication systems in many of the moth, ant and beetle populations are essentially ''wireless'' sensory networks. The difference between the ''wireless'' network of an insect population and an engineered wireless sensor network is that insects encode messages with semiochemicals (also known as infochemicals) rather than with radio frequencies; in addition, the computing node is the individual insect powered by its brain, sensory and neuromotor systems, rather than a microchip-powered sensor. The objectives of this paper are threefold: (1) to introduce the state-of-the art research in insect sensory systems from entomological perspectives; (2) to propose potential new research problems inspired by insect sensory system with focusing on unexplored fields; and (3) to justify how and why insect sensory systems may inspire novel computing and communications paradigms.
---
paper_title: AntNet: Distributed Stigmergetic Control for Communications Networks

paper_content:

This paper introduces AntNet, a novel approach to the adaptive learning of routing tables in communications networks. AntNet is a distributed, mobile agents based Monte Carlo system that was inspired by recent work on the ant colony metaphor for solving optimization problems. AntNet's agents concurrently explore the network and exchange collected information. The communication among the agents is indirect and asynchronous, mediated by the network itself. This form of communication is typical of social insects and is called stigmergy. We compare our algorithm with six state-of-the-art routing algorithms coming from the telecommunications and machine learning fields. The algorithms' performance is evaluated over a set of realistic testbeds. We run many experiments over real and artificial IP datagram networks with increasing number of nodes and under several paradigmatic spatial and temporal traffic distributions. Results are very encouraging. AntNet showed superior performance under all the experimental conditions with respect to its competitors. We analyze the main characteristics of the algorithm and try to explain the reasons for its superiority.
---
paper_title: Ant Colony-Based Reinforcement Learning Algorithm for Routing in Wireless Sensor Networks

paper_content:

The field of routing and sensor networking is an important and challenging research area of network computing today. Advancements in sensor networks enable a wide range of environmental monitoring and object tracking applications. Routing in sensor networks is a difficult problem: as the size of the network increases, routing becomes more complex. Therefore, biologically-inspired intelligent algorithms are used to tackle this problem. Ant routing has shown excellent performance for sensor networks. In this paper, we present a biologically-inspired swarm intelligence-based routing algorithm, which is suitable for sensor networks. Our proposed ant routing algorithm also meet the enhanced sensor network requirements, including energy consumption, success rate, and time delay. The paper concludes with the measurement data we have found.
---
paper_title: Ant System Based Anycast Routing in Wireless Sensor Networks

paper_content:

Anycast is a mechanism that it sends the data groups to the nearest interface during which they have the same anycast address. Ant colony system, a population-based algorithm, provides natural and intrinsic way of exploration of search space in optimization settings in determining optimal anycast tree. In this paper, we propose a sink selection heuristic algorithm called Minimum Ant-based Data Fusion Tree(MADFT) for energy constraint wireless sensor networks. Different from existing schemes, MADAT not only optimizes over the data transmission cost, but also incorporates the cost for data fusion which can be significant for emerging sensor networks with vectorial data and/or security requirements. Via simulation, it is shown that this algorithm has excellent performance behavior and provides a near-optimal solution.
---
paper_title: Swarm intelligence optimization based routing algorithm for Wireless Sensor Networks

paper_content:

Energy balance is an important performance index in the design of routing algorithm for wireless sensor networks. A swarm intelligence optimization based routing algorithm for wireless sensor networks is proposed, whose kernel idea is taking less hop numbers into consideration and choosing the nodes with less pheromone as next hop to avoid some nodespsila prematurely exhausting their energy because of too concentrated routes through the nodes. The experiments show that the algorithm proposed in this paper is better than the directed diffusion routing protocol both in end-to-end delay and global energy balance and can effectively balance the global energy consumption and prolong the network lifetime.
---
paper_title: An Improved Gossiping Data Distribution Technique with Emphasis on Reliability and Resource Constraints

paper_content:

In this paper we present an improved Gossiping data distribution technique with emphasis on the location of nodes called "LGossiping" that reliably disseminate information among sensors in a wireless sensor network. Nodes running LGossiping data distribution technique use global positioning system to relay data throughout the network. Each node decides upon position knowledge of the others. This allows each sensor to send its data reliably to one of known neighbors instead of sending data blindly to one of neighbors which may not be near to source node and cause data lost. We outlined SystemC as simulation language and simulate and analyzed Gossiping and LGossiping protocols. In each experiment source node propagate data among nodes with the hope of reaching to sink node. This procedure is called data transmission. We found that LGossiping with transmission radius greater than or equal to 4 (TR≫=4) is 30% more reliable than Gossiping for a specific number of experiments. LGossiping is an improvement of Gossiping in terms of reliability. Therefore reliability in this improved method is critical. Moreover, network energy consumption with respect to different TR is considered. We concluded that network energy consumption decreases as the transmission radius increases. As termination, increasing area during the experiment is mentioned. In order to have constant reliability with constant number of nodes in LGossiping method in immense areas, with each 600m2 increase of area transmission radius should increases 1 meter.
---
paper_title: TAG: a Tiny AGgregation service for ad-hoc sensor networks

paper_content:

We present the Tiny AGgregation (TAG) service for aggregation in low-power, distributed, wireless environments. TAG allows users to express simple, declarative queries and have them distributed and executed efficiently in networks of low-power, wireless sensors. We discuss various generic properties of aggregates, and show how those properties affect the performance of our in network approach. We include a performance study demonstrating the advantages of our approach over traditional centralized, out-of-network methods, and discuss a variety of optimizations for improving the performance and fault tolerance of the basic solution.
---
paper_title: The design of an acquisitional query processor for sensor networks

paper_content:

We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs of acquiring data, we are able to significantly reduce power consumption over traditional passive systems that assume the a priori existence of data. We discuss simple extensions to SQL for controlling data acquisition, and show how acquisitional issues influence query optimization, dissemination, and execution. We evaluate these issues in the context of TinyDB, a distributed query processor for smart sensor devices, and show how acquisitional techniques can provide significant reductions in power consumption on our sensor devices.
---
paper_title: Breath: A Self-Adapting Protocol for Wireless Sensor Networks in Control and Automation

paper_content:

The novel cross-layer protocol Breath for wireless sensor networks is designed, implemented, and experimentally evaluated. The Breath protocol is based on randomized routing, MAC and duty-cycling, which allow it to minimize the energy consumption of the network while ensuring a desired packet delivery end-to-end reliability and delay. The system model includes a set of source nodes that transmit packets via multi-hop communication to the destination. A constrained optimization problem, for which the objective function is the network energy consumption and the constraints are the packet latency and reliability, is posed and solved. It is shown that the communication layers can be jointly optimized for energy efficiency. The optimal working point of the network is achieved with a simple algorithm, which adapts to traffic variations with negligible overhead. The protocol was implemented on a test-bed with off-the-shelf wireless sensor nodes. It is compared with a standard IEEE 802.15.4 solution. Experimental results show that Breath meets the latency and reliability requirements, and that it exhibits a good distribution of the working load, thus ensuring a long lifetime of the network.
---
paper_title: Localized power-aware routing in linear wireless sensor networks

paper_content:

Energy-efficency is a key concern when designing protocols for wireless sensor networks (WSN). This is of particular importance in commercial applications where demonstrable return on investment is a crucial factor. One such commercial application that motivated this work is telemetry and control for freight railroad trains. Since a railroad train has a global linear structure by nature, we consider in this paper linear WSNs as sensor networks having, roughly, a linear topology. Aiming at such networks, we introduce two routing schemes that efficiently utilize energy: Minimum Energy Relay Routing (MERR) and Adaptive MERR (AMERR). We derive a theoretical lower bound on the optimal power consumption of routing in a linear WSN, where we assume a Poisson model for the distribution of nodes along a linear path. We evaluate the efficiency of our protocols with respect to the theoretical optimal lower bound and with respect to other well-known protocols. AMERR achieves optimal performance for practical deployment settings, while MERR rapidly approaches optimal performance as sensors are more densely deployed. Compared to other protocols, we show that MERR and AMERR are less complex and have better scalability. We also postulate how both protocols might be generalized to a two-dimensional WSN.
---
paper_title: Protocols for self-organization of a wireless sensor network

paper_content:

We present a suite of algorithms for self-organization of wireless sensor networks in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing, and formation of ad hoc subnetworks for carrying out cooperative signal processing functions among a set of the nodes.
---
paper_title: Energy Efficient Adaptive Multipath Routing for Wireless Sensor Networks

paper_content:

Routing in wireless sensor networks is a demanding task. This demand has led to a number of routing protocols which efficiently utilize the limited resources available at the sensor nodes. All these protocols typically find the minimum energy path. In this paper we take a view that, always using the minimum energy path deprives the nodes energy quickly and the time taken to determine an alternate path increases. Multipath routing schemes distribute traffic among multiple paths instead of routing all the traffic along a single path. Two key questions that arise in multipath routing are how many paths are needed and how to select these paths. Clearly, the number and the quality of the paths selected dictate the performance of a multipath routing scheme. We propose an energy efficient adaptive multipath routing technique which utilizes multiple paths between source and the sink, adaptive because they have low routing overhead. This protocol is intended to provide a reliable transmission environment with low energy consumption, by efficiently utilizing the energy availability and the received signal strength of the nodes to identify multiple routes to the destination. Simulation results show that the energy efficient adaptive multipath routing scheme achieves much higher performance than the classical routing protocols, even in the presence of high node density and overcomes simultaneous packet forwarding
---
paper_title: Reliable Multi-path Routing Protocol in Wireless Sensor Networks

paper_content:

There are often some faults happening in the wireless sensor networks due to node failure or energy exhaustion. It is because the nodes in sensor networks are energy constrained and usually deployed in harsh environments. These factors strongly influence reliability of data transmission and decrease the lifetime of networks. An important issue in designing wireless sensor network is the reliable routing protocols which provide as much reliability of data transmission as possible. Another important factor is to make the best use of the limited energy presented by nodes of wireless sensor networks. This paper proposes a new routing protocol called REEM(Reliable and Energy-Efficient Multi-path routing protocol) to settle above problems. Simulation results show that our protocol surpasses the MSR, AOMDV and ARAMA protocols in terms of reliability and network lifetime.
---
paper_title: Energy Efficient Multipath Routing in Large Scale Sensor Networks with Multiple Sink Nodes

paper_content:

Due to the battery resource constraint, it is a critical issue to save energy in wireless sensor networks, particularly in large sensor networks. One possible solution is to deploy multiple sink nodes simultaneously. In this paper, we propose a protocol called MRMS (Multipath Routing in large scale sensor networks with Multiple Sink nodes) which incorporates multiple sink nodes, a new path cost metric for improving path selection, dynamic cluster maintenance and path switching to improve energy efficiency. MRMS is shown to increase the lifetime of sensor nodes substantially compared to other algorithms based on a series of simulation experiments.
---
paper_title: Energy-balancing multipath routing protocol for wireless sensor networks

paper_content:

A Wireless Sensor Network (WSN) is a collection of wireless sensor nodes forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, due to the limited range of each node's wireless transmissions, it may be necessary for one sensor node to ask for the aid of other sensor nodes in forwarding a packet to its destination, usually the base station. One big issue when designing wireless sensor network is the routing protocol to make the best use of the severe resource constraints presented by WSN, especially the energy limitation. In this paper, we propose a new scheme called EBMR: Energy-Balancing Multipath Routing Protocol that uses multipath alternately to prolong the lifetime of the network.
---
paper_title: Protocols for self-organization of a wireless sensor network

paper_content:

We present a suite of algorithms for self-organization of wireless sensor networks in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing, and formation of ad hoc subnetworks for carrying out cooperative signal processing functions among a set of the nodes.
---
paper_title: Protocols for self-organization of a wireless sensor network

paper_content:

We present a suite of algorithms for self-organization of wireless sensor networks in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing, and formation of ad hoc subnetworks for carrying out cooperative signal processing functions among a set of the nodes.
---

Title: Wireless Sensor Network Routing Protocols: A Survey

Section 1: INTRODUCTION
Description 1: This section provides an overview of Wireless Sensor Networks (WSNs) and highlights the challenges in routing due to unique characteristics and diverse applications. It also outlines the scope and objectives of the survey.

Section 2: RELATED WORK
Description 2: This section reviews the existing literature on WSN routing protocols, identifying gaps and distinguishing the scope of this survey from previous efforts.

Section 3: ROUTING PROTOCOLS IN WIRELESS SENSOR NETWORKS
Description 3: This section categorizes and discusses various routing protocols for WSNs, providing detailed descriptions of each protocol.

Section 4: Network Structure Protocols
Description 4: This subsection examines routing protocols based on network structure, including data-centric, hierarchical, and location-based protocols.

Section 5: Protocol Operation Routing Protocols
Description 5: This subsection explores routing protocols based on operational principles such as multi-path, query-based, negotiation-based, QoS-based, and bio-inspired routing protocols.

Section 6: Coherent and Non-coherent Protocols
Description 6: This subsection discusses routing protocols focused on data processing strategies, distinguishing between coherent and non-coherent methods.

Section 7: Established Path Based Routing Protocol
Description 7: This subsection categorizes protocols based on the communication paths they follow, including proactive, reactive, and hybrid protocols.

Section 8: Initiator of Communication
Description 8: This subsection classifies routing protocols based on whether communication initiation is source-driven or sink-driven.

Section 9: CONCLUSION
Description 9: This section summarizes the survey findings and proposes future research directions, emphasizing the need for WSN routing protocol integration with wired networks and exploring applications for security and environmental monitoring.