Network Structure and Topology based Routing Techniques in Wireless Sensor Network- A survey
---
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: 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: Energy-efficient communication protocol for wireless microsensor networks

paper_content:

Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our findings that the conventional protocols of direct transmission, minimum-transmission-energy, multi-hop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show the LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional outing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.
---
paper_title: PEGASIS : Power-Efficient Gathering in Sensor Information Systems

paper_content:

Sensor network consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. The main idea in PEGASIS is for each node to receive from and transmit to close neighbors and take turns being the leader for transmission to the BS. This approach distributes the energy load evenly among the sensor nodes in the network. Sensor nodes are randomly deployed in the sensor field, and therefore, the i th node is at a random location. The nodes will be organized to form a chain, which can either be accomplished by the sensor nodes themselves using a greedy algorithm. The algorithm to resolve the unbalanced energy consumption problem caused by long distance data transmission of some nodes in a chain formed by the greedy algorithm.
---
paper_title: Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach

paper_content:

Prolonged network lifetime, scalability, and load balancing are important requirements for many ad-hoc sensor network applications. Clustering sensor nodes is an effective technique for achieving these goals. In this work, we propose a new energy-efficient approach for clustering nodes in ad-hoc sensor networks. Based on this approach, we present a protocol, HEED (hybrid energy-efficient distributed clustering), that periodically selects cluster heads according to a hybrid of their residual energy and a secondary parameter, such as node proximity to its neighbors or node degree. HEED does not make any assumptions about the distribution or density of nodes, or about node capabilities, e.g., location-awareness. The clustering process terminates in O(1) iterations, and does not depend on the network topology or size. The protocol incurs low overhead in terms of processing cycles and messages exchanged. It also achieves fairly uniform cluster head distribution across the network. A careful selection of the secondary clustering parameter can balance load among cluster heads. Our simulation results demonstrate that HEED outperforms weight-based clustering protocols in terms of several cluster characteristics. We also apply our approach to a simple application to demonstrate its effectiveness in prolonging the network lifetime and supporting data aggregation.
---
paper_title: APTEEN: A Hybrid Protocol for Efficient Routing and Comprehensive Information Retrieval in Wireless Sensor Networks

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 hybrid routing protocol (APTEEN) which allows for comprehensive information retrieval. The nodes in such a network not only react to time-critical situations, but also give an overall picture of the network at periodic intervals in a very energy efficient manner. Such a network enables the user to request past, present and future data from the network in the form of historical, one-time and persistent queries respectively. We evaluated the performance of these protocols and observe that these protocols are observed to outperform existing protocols in terms of energy consumption and longevity of the network.
---
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: 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: Location based energy-efficient reliable routing protocol for wireless sensor networks

paper_content:

Minimizing Energy consumption is considered as one of the most important principles in the development of routing protocols for Wireless Sensor Networks (WSN). In this study, we propose a Location based Energy-Aware Reliable routing protocol (LEAR) for WSN based on sensor position and clustering. Geographical routing protocols are efficient and convenient for optimum energy consumption and bandwidth utilization. Most of the existing geographic routing protocols make use of greedy routing to forward packets from source to destination. Enhance Greedy Forwarding is proposed to perform a geographic, efficient and reliable routing for WSN. A comprehensive simulation study illustrates that the lifetime of WSN can be consequentially extended with LEAR. Finally, LEAR algorithm has been developed, tested and validated through a set of experiments to illustrate the relative advantages and capabilities of a proposed algorithm.
---
paper_title: Minimum energy mobile wireless networks

paper_content:

We describe a distributed position-based network protocol optimized for minimum energy consumption in mobile wireless networks that support peer-to-peer communications. Given any number of randomly deployed nodes over an area, we show that a simple local optimization scheme executed at each node guarantees strong connectivity of the entire network and attains the global minimum energy solution for the stationary case. Due to its localized nature, this protocol proves to be self-reconfiguring and stays close to the minimum energy solution when applied to the case of mobile nodes. Our simulations verify its performance.
---
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.
---

Title: Network Structure and Topology based Routing Techniques in Wireless Sensor Network- A Survey

Section 1: INTRODUCTION
Description 1: Provide an overview of Wireless Sensor Networks (WSNs), including their components, functionalities, and applications. Discuss the challenges such as energy efficiency, memory limitations, and computational constraints, and introduce the importance of routing techniques in WSNs.

Section 2: ROUTING TECHNIQUE AND ITS DESIGN CONSIDERATION IN WSN
Description 2: Define the concept of routing in WSNs. Discuss the general considerations for designing routing protocols in these networks.

Section 3: Directed Diffusion
Description 3: Explain the Directed Diffusion routing technique, its operation, and its energy efficiency benefits. Describe the process of interest propagation, gradient formation, and path selection.

Section 4: Flooding and Gossiping
Description 4: Discuss the Flooding and Gossiping protocols, their mechanisms, advantages, and drawbacks. Highlight the differences between the two techniques in terms of overhead and message propagation.

Section 5: Spin-Sensor Protocols for Information via Negotiation (SPIN)
Description 5: Detail the SPIN protocol, emphasizing its data advertisement mechanism and the sequence of messages used. Explain how SPIN overcomes the redundancy issue seen in Flooding.

Section 6: Rumor Routing
Description 6: Provide an overview of the Rumor Routing technique, if described in detail in the paper. 

Section 7: LEACH
Description 7: Describe the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol, including its cluster formation, data fusion, and energy dissipation balancing mechanisms.

Section 8: PEGASIS
Description 8: Explain the Power-Efficient Gathering in Sensor Information Systems (PEGASIS) protocol, focusing on its chain-based approach and efficiency improvements over LEACH.

Section 9: HEED
Description 9: Provide details on the Hybrid Energy-Efficient Distributed (HEED) protocol, if elaborated in the paper.

Section 10: TEEN
Description 10: Discuss the Threshold-sensitive Energy Efficient sensor Network protocol (TEEN), its application in time-sensitive scenarios, and the multi-level hierarchical clustering approach.

Section 11: APTEEN
Description 11: Explain the Adaptive Threshold-sensitive Energy Efficient sensor Network protocol (APTEEN), its similarities and improvements over TEEN, and its hybrid clustering approach.

Section 12: LOCATION BASED ROUTING
Description 12: Introduce location-based routing protocols, describing how nodes are identified and data is transmitted based on geographic location and signal strength.

Section 13: GAF
Description 13: Discuss the Geographic adaptive fidelity (GAF) protocol, the process of grid formation, and how it enhances network lifetime by putting nodes in sleep mode.

Section 14: GEAR
Description 14: Explain the Geographic and energy-aware routing (GEAR) protocol, including the calculation of estimated and learned costs to choose the next hop in data transmission.

Section 15: LEAR
Description 15: Provide an overview of the Location Based Energy-Efficient Reliable Routing (LEAR) technique, its use of GPS for distance calculation, and the Enhanced Greedy Forwarding algorithm.

Section 16: MECN
Description 16: Describe the Minimum Energy Communication Network (MECN), the concept of relay regions, and the use of the Bellman-Ford algorithm to find minimum energy paths.

Section 17: SMECN
Description 17: Discuss the Small Minimum Energy Communication Network (SMECN) protocol, its improvements over MECN, and the process of forming smaller sub-networks to minimize transmission hops.