Adaptive protocols for information dissemination in wireless sensor networks
01 Aug 1999-pp 174-185
TL;DR: It is found that the SPIN protocols can deliver 60% more data for a given amount of energy than conventional approaches, and that, in terms of dissemination rate and energy usage, the SPlN protocols perform close to the theoretical optimum.
Abstract: 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.
Citations
More filters
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
Cites background or methods from "Adaptive protocols for information ..."
...SPIN [35] Sends data to sensor nodes only if they are interested; has three types of messages, i....
[...]
...There are two approaches used for interest dissemination: sinks broadcast the interest [39], and sensor nodes broadcast an advertisement for the available data [35] and wait for a request from the interested sinks....
[...]
...However, it has several deficiencies such as [35]:...
[...]
...(SPIN): A family of adaptive protocols called SPIN [35] is designed to address the deficiencies of classic flooding by negotiation and resource adaptation....
[...]
...Note that SPIN is based on data-centric routing [35] where the sensor nodes broadcast an advertisement for the available data and wait for a request from interested sinks....
[...]
TL;DR: The current state of the art of sensor networks is captured in this article, where solutions are discussed under their related protocol stack layer sections.
Abstract: The advancement in wireless communications and electronics has enabled the development of low-cost sensor networks. The sensor networks can be used for various application areas (e.g., health, military, home). For different application areas, there are different technical issues that researchers are currently resolving. The current state of the art of sensor networks is captured in this article, where solutions are discussed under their related protocol stack layer sections. This article also points out the open research issues and intends to spark new interests and developments in this field.
14,048 citations
Cites background or methods from "Adaptive protocols for information ..."
...With this respect, data aggregation is known as data fusion [ 15 ]....
[...]
...For attribute based naming, the users are more interested in querying an � Figure 4. a) The power efficiency of the routes; b) an example of data aggregation; c) the SPIN protocol [ 15 ]; d) an example of directed diffusion [5]....
[...]
...However, it has several deficiencies such as [ 15 ]: • Implosion: Implosion is a situation where duplicated messages are sent to the same node....
[...]
...Note that SPIN is based on data-centric routing [ 15 ] where the sensor nodes broadcast an advertisement for the available data and wait for a request from interested sinks....
[...]
...A family of adaptive protocols called Sensor Protocols for Information via Negotiation (SPIN) [ 15 ] is designed to address the deficiencies of classic flooding by negotiation and resource adaptation....
[...]
04 Jan 2000
TL;DR: The Low-Energy Adaptive Clustering Hierarchy (LEACH) as mentioned in this paper is 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.
Abstract: 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.
12,497 citations
01 Jan 2000
TL;DR: 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, is proposed.
Abstract: 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 signicant impact on the overall energy dissipation of these networks. Based on our ndings that the conventional protocols of direct transmission, minimum-transmission-energy, multihop 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 base stations (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 that LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional routing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.
11,412 citations
TL;DR: This work develops and analyzes low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality.
Abstract: Networking together hundreds or thousands of cheap microsensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. These networks require robust wireless communication protocols that are energy efficient and provide low latency. We develop and analyze low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality. LEACH includes a new, distributed cluster formation technique that enables self-organization of large numbers of nodes, algorithms for adapting clusters and rotating cluster head positions to evenly distribute the energy load among all the nodes, and techniques to enable distributed signal processing to save communication resources. Our results show that LEACH can improve system lifetime by an order of magnitude compared with general-purpose multihop approaches.
10,296 citations
Cites background or methods from "Adaptive protocols for information ..."
...We added a Resource-Adaptive Node [41] to ns, as shown in Figure A-2....
[...]
...With this goal in mind, the authors in [41] developed SPIN (Sensor Protocols for Information via Negotiation), a family of protocols to disseminate information in a wireless microsensor network....
[...]
...Recently, there has been a great deal of work on application-controlled routing [3, 41, 48]....
[...]
...Similarly, the SPIN [41] and directed di usion [48] protocols use application-speci c data naming and routing to achieve energy e ciency in a wireless microsensor network....
[...]
...Internet delivery [8], application-controlled routing [3, 41, 48], wireless multimedia delivery [46, 49], and protocol frameworks for active wireless networks [53]....
[...]
References
More filters
01 May 1997
TL;DR: A variant of the pessimistic algorithm in which locks are released as soon as transactions finish their execution locally is developed, however, this optimistic releasing of locks introduces the possibility of cascading aborts while ensuring serializable executions.
Abstract: 1 Introduction We present a family of epidemic algorithms for maintaining replicated data in a transactional framework. The algorithms are based on the causal delivery of log records where each record corresponds to one transaction instead of one operation. The fist algorithm in this family is a pessimistic protocol that ensures serializability and guarantees strict executions. Since we expect the epidemic algorithms to be used in environments with low probability of conflicts among transactions, we develop a variant of the pessimistic algorithm in which locks are released as soon as transactions finish their execution locally. However, this optimistic releasing of locks introduces the possibility of cascading aborts while ensuring serializable executions. The last member of thii family of epidemic algorithms is motivated from the need for asynchronous replication solutions that are being increasingly used in commercial systems. The protocol is optimistic in that transactions commit as soon as they terminate locally and inconsistencies are detected asynchronously as the effects of committed transactions propagate through the system. With the proliferation of computer networks, PCs, and workstations, new models for workplaces are emerging. In particular, organizations need to provide ready access to corporate information to users who may or may not always be connected to the database. One way to provide access to such data is through replication. However, traditional synchronous solutions for managing replicated data [Sto79, Tho79, Gif79] can not be used especially in such a distributed, mobile, and disconnected environment. As the need for replication grows, several vendors have adopted asynchronous solutions for managing repli-cate data pBH+88, Ora]. For example, Lotus Notes uses value-base& replication in which updates are performed locally and a propagation mechanism is provided to apply these updates to other replica sites. In addition, a version number is used to detect inconsistencies. Resolution of inconsistencies is left to the users. Although the Lotus approach works reasonably well for single object updates (i.e., environments such as file-systems), it fails when multiple objects are involved in a single update (i.e., transaction oriented environments). In particular, more formal mechanisms are needed for update propagation and conflict detection in the context of asynchronous replication.
130 citations
TL;DR: A survey of the fast-growing area of research investigating capabilities for fault-tolerant broadcasting and gossiping algorithms, focusing on two most important efficiency measures: running time and number of elementary transmissions required by the communication process.
Abstract: Broadcasting and gossiping are fundamental tasks in network communication. In broadcasting, or one-to-all communication, information originally held in one node of the network (called the source) must be transmitted to all other nodes. In gossiping, or all-to-all communication, every node holds a message which has to be transmitted to all other nodes. As communication networks grow in size, they become increasingly vulnerable to component failures. Thus, capabilities for fault-tolerant broadcasting and gossiping gain importance. The present paper is a survey of the fast-growing area of research investigating these capabilities. We focus on two most important efficiency measures of broadcasting and gossiping algorithms: running time and number of elementary transmissions required by the communication process. We emphasize the unifying thread in most results from the research in fault-tolerant communication: the trade-offs between efficiency of communication schemes and their fault-tolerance. © 1996 John Wiley & Sons, Inc.
130 citations
31 May 1998
TL;DR: It is shown 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 both stationary and mobile networks.
Abstract: This paper describes a network design strategy that focuses on energy conservation. This position-based network protocol is optimized for minimum energy consumption in wireless networks that support peer-to-peer communication. Given any number of randomly deployed communication 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 both stationary and mobile networks.
82 citations
01 Sep 1998
TL;DR: A new data naming scheme is proposed that toss the structure of apphcation data to the transport layer, thereby mcing the ~\TrXbti@ of= apphcations’ r&abti@ and ordering se mantiw.
Abstract: The Application Levd Raining (ALF) protocol architecture [2] encourag~ apphcation control over mech* that traditiontiy W tithin the %ansport layer”, e.g., loss detection md recovery. ~aditiond ARQ-based rtiable protocok for unicast (e.g., TCP) as w~ as mtdticast (e.g., Horus [30], ~ITP [15], etc.) number data units sequenti~y to detect 10SSS. Unfortunatdy, these hmport-levd sequence nuntbers do not permit receivers to fiatibly t~or their r~abti~ semantics. Achieving receiver-driven r&abti~ is cutnbersome in the e%mg ~ayeredn artitecture of the netiork protocol stack whine the receiving application has no knowledge of how apphcation-levd objects map onto transport levd sequence numbers. b this paper, we propose a new data naming scheme that e\Toss the structure of appEcation data to the transport layer, thereby mcing the ~\TrXbti@ of= apphcations’ r&abti@ and ordering se mantiw. IfTe apply this data naming scheme to a rtiable mtitiwt protocol framework to achieve receiver-t~ored re fiabii~ that enhancw its sdabii~. To demonstrate the ~caey of our scheme, we have designed and implemented our scalable naming and announcement protocol (SNAP) in the mtitimedia application too~t MASH [17] as a reusable protocol modtie.
47 citations
"Adaptive protocols for information ..." refers background in this paper
..., [20]), which we follow in the design of our meta-data....
[...]