scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Adaptive protocols for information dissemination in wireless sensor networks

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.

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI
13 Apr 2008
TL;DR: A cross-layering approach is a promising tradeoff between generic solutions and solutions optimized for a specific application in wireless ad hoc and sensor networks to maximize network lifetime.
Abstract: The diversity of the applications supported by wireless ad hoc and sensor networks explain the success of these networks. However, their energy constrained nature requires the use of energy efficient strategies to maximize network lifetime. We can classify these strategies in four categories: 1. energy efficient routing, 2. scheduling the nodes sleeping state, 3. topology control by tuning node transmission power and 4. reducing the volume of information transferred. For each category, a state of the art is given and new protocols are presented. The best energy efficiency will be obtained by combining all the four categories of strategies. A cross-layering approach is a promising tradeoff between generic solutions and solutions optimized for a specific application.

109 citations


Cites background from "Adaptive protocols for information ..."

  • ...…[16], [17]; 4) Reducing the volume of information transferred by: • aggregating information with the use of clusters, like [18], [19] or without, like [20], [21], [22]; • decreasing the frequency of information refreshment with distance, like [23], [24]; • avoiding to transfer information to…...

    [...]

Proceedings ArticleDOI
22 Apr 2003
TL;DR: This paper develops an energy-efficient chain construction algorithm which uses a sequence of insertions to add the least amount of energy consumption to the whole chain and consumes less transmission power compared to the closest neighbor algorithm.
Abstract: In wireless sensor networks, the sensor nodes gather information and send the information to a base station periodically. Some important messages need to be broadcasted to all nodes. Data gathering and broadcasting are important operations that consume significant amounts of battery power. Due to the limited battery life, energy efficiency is becoming a major challenging problem in these power-constrained networks. Chain-based protocols construct a transmission chain connecting all nodes to save energy dissipation of data transmission. In this paper, we first review several existing chain-based protocols. We then present our multiple-chain scheme which outperforms the existing ones in the sparse-node distribution case. Furthermore, we develop an energy-efficient chain construction algorithm which uses a sequence of insertions to add the least amount of energy consumption to the whole chain. It consumes less transmission power compared to the closest neighbor algorithm.

109 citations


Cites background from "Adaptive protocols for information ..."

  • ...In this paper, we concentrate on energy-efficient all-toall broadcasting in sensor networks....

    [...]

Proceedings ArticleDOI
07 Mar 2004
TL;DR: A faster greedy heuristic for this problem that uses an exponential metric based on the approximation algorithm is developed and shown to perform near-optimally and significantly better than other shortest-path routing approaches, particularly when nodes are heterogeneous in their energy and data availability.
Abstract: We examine the problem of maximizing data collection from an energy-limited store-and-extract wireless sensor network, which is analogous to the maximum lifetime problem of interest in continuous data-gathering sensor networks. One significant difference is that this problem requires attention to "data-awareness" in addition to "energy-awareness." We formulate the maximum data extraction problem as a linear program and present a 1+omega iterative approximation algorithm for it. As a practical distributed implementation we develop a faster greedy heuristic for this problem that uses an exponential metric based on the approximation algorithm. We then show through simulation results that the greedy heuristic incorporating this exponential metric performs near-optimally (within 1 to 20% of optimal, with low overhead) and significantly better than other shortest-path routing approaches, particularly when nodes are heterogeneous in their energy and data availability

108 citations


Cites background from "Adaptive protocols for information ..."

  • ...Heinzelman et al. propose a family of adaptive protocols called SPIN for energy efficient dissemination of information throughout the sensor network [6]....

    [...]

Proceedings Article
01 Jan 2006
TL;DR: The current routing protocols for sensor networks are described and their characteristics and functionality are examined and the advantages and drawbacks for these routing protocols are provided.
Abstract: A wireless sensor network consists of a number of sensors spreading across a geographical area to perform distributed sensing tasks using wireless medium. In order to facilitate data transfer from a source node to a destination (sink) node, a routing protocol is needed to determine the possible routes. With a limited power supply, sensor nodes are deployed densely and prone to failures. As a result, many traditional ad-hoc routing protocols may not be suitable for large-scale, dense sensor networks. Recently, studies in routing protocols in sensor networks have become a very active and vital area of research. Sensor routing algorithms must be energy efficient, robust to failures, and secure against the compromised and malicious nodes to ensure correct data delivery. In general, the routing protocols can be classified into two categories based on the network structure: flat and cluster-based routing. This paper describes the current routing protocols for sensor networks and examines their characteristics and functionality. The advantages and drawbacks for these routing protocols are provided as well.

108 citations

Journal ArticleDOI
TL;DR: This paper discusses algorithms, protocols, and mechanisms that deal directly with congestion control and avoidance in WSNs, a special category of wireless ad hoc networks with unique characteristics and important limitations.
Abstract: Congestion control and reliable data delivery are two primary functions of the transport layer in wired and wireless networks. Wireless sensor networks (WSNs) are a special category of wireless ad hoc networks with unique characteristics and important limitations. Limitations concern their resources, such as energy, memory, and computational power, as well as their applications. Due to these limitations and characteristics, the Transmission Control Protocol (TCP), the legacy protocol that implements congestion control and reliable transmission in the Internet, cannot apply to WSNs in its traditional form. To deal with this unavailability of a standard solution, many efforts are taking place in this area. In this paper, we review, classify, and compare algorithms, protocols, and mechanisms that deal directly with congestion control and avoidance in WSNs.

107 citations

References
More filters
Proceedings ArticleDOI
01 Oct 1994
TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Abstract: An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such ad-hoc networks. The basic idea of the design is to operate each Mobile Host as a specialized router, which periodically advertises its view of the interconnection topology with other Mobile Hosts within the network. This amounts to a new sort of routing protocol. We have investigated modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP [5], to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks. Our modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile Hosts. Finally, we describe the ways in which the basic network-layer routing can be modified to provide MAC-layer support for ad-hoc networks.

6,877 citations

Proceedings ArticleDOI
25 Oct 1998
TL;DR: The results of a derailed packet-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocols, which cover a range of designchoices: DSDV,TORA, DSR and AODV are presented.
Abstract: An ad hoc networkis a collwtion of wirelessmobilenodes dynamically forminga temporarynetworkwithouttheuseof anyexistingnetworkirrfrastructureor centralizedadministration.Dueto the limitedtransmissionrange of ~vlrelessnenvorkinterfaces,multiplenetwork“hops”maybe neededfor onenodeto exchangedata ivithanotheracrox thenetwork.Inrecentyears, a ttiery of nelvroutingprotocols~geted specificallyat this environment havebeen developed.but little pcrfomrartwinformationon mch protocol and no ralistic performancecomparisonbehvwrrthem ISavailable. ~Is paper presentsthe results of a derailedpacket-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocolsthatcovera range of designchoices: DSDV,TORA, DSR and AODV. \Vehave extended the /~r-2networksimulatorto accuratelymodelthe MACandphysical-layer behaviorof the IEEE 802.1I wirelessLANstandard,includinga realistic wtrelesstransmissionchannelmodel, and present the resultsof simulations of net(vorksof 50 mobilenodes.

5,147 citations


"Adaptive protocols for information ..." refers background in this paper

  • ...Recently, mobile ad hoc routing protocols have become an active area of research [3, 10, 16, 18, 22]....

    [...]

Proceedings ArticleDOI
09 Apr 1997
TL;DR: The proposed protocol is a new distributed routing protocol for mobile, multihop, wireless networks that is highly adaptive, efficient and scalable; being best-suited for use in large, dense, mobile networks.
Abstract: We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms. The protocol's reaction is structured as a temporally-ordered sequence of diffusing computations; each computation consisting of a sequence of directed link reversals. The protocol is highly adaptive, efficient and scalable; being best-suited for use in large, dense, mobile networks. In these networks, the protocol's reaction to link failures typically involves only a localized "single pass" of the distributed algorithm. This capability is unique among protocols which are stable in the face of network partitions, and results in the protocol's high degree of adaptivity. This desirable behavior is achieved through the novel use of a "physical or logical clock" to establish the "temporal order" of topological change events which is used to structure (or order) the algorithm's reaction to topological changes. We refer to the protocol as the temporally-ordered routing algorithm (TORA).

2,211 citations


"Adaptive protocols for information ..." refers background in this paper

  • ...Recently, mobile ad hoc routing protocols have become an active area of research [3, 10, 16, 18, 22]....

    [...]

Proceedings ArticleDOI
01 Dec 1987
TL;DR: This paper descrikrs several randomized algorit, hms for dist,rihut.ing updates and driving t,he replicas toward consist,c>nc,y.
Abstract: Whru a dilt~lhSC is replicated at, many sites2 maintaining mutual consistrnry among t,he sites iu the fac:e of updat,es is a signitirant problem. This paper descrikrs several randomized algorit,hms for dist,rihut.ing updates and driving t,he replicas toward consist,c>nc,y. The algorit Inns are very simple and require few guarant,ees from the underlying conllllunicat.ioll system, yc+ they rnsutc t.hat. the off(~c~t, of (‘very update is evcnt,uwlly rf+irt-ted in a11 rq1ica.s. The cost, and parformancc of t,hr algorithms arc tuned I>? c%oosing appropriat,c dist,rilMions in t,hc randoinizat,ioii step. TIN> idgoritlmls ilr(’ c*los~*ly analogoIls t,o epidemics, and t,he epidcWliolog)litc\ratiirc, ilitlh iii Illld~~rsti4lldill~ tlicir bc*liavior. One of tlW i$,oritlims 11&S brc>n implrmcWrd in the Clraringhousr sprv(brs of thr Xerox C’orporat~c~ Iiitcrnc4, solviiig long-standing prol>lf~lns of high traffic and tlatirl>ilsr inconsistcllcp.

1,958 citations


"Adaptive protocols for information ..." refers background or methods in this paper

  • ...Using gossiping and broadcasting algorithms to disseminate information in distributed systems has been extensively explored in the literature, often as epidemic algorithms [6]....

    [...]

  • ...In [1, 6], gossiping is used to maintain database consistency, while in [18], gossiping is used as a mechanism to achieve fault tolerance....

    [...]

Journal ArticleDOI
TL;DR: In this paper, the authors specify extensions to two common internetwork routing algorithms (distancevector routing and link-state routing) to support low-delay datagram multicasting beyond a single LAN, and discuss how the use of multicast scope control and hierarchical multicast routing allows the multicast service to scale up to large internetworks.
Abstract: Multicasting, the transmission of a packet to a group of hosts, is an important service for improving the efficiency and robustness of distributed systems and applications. Although multicast capability is available and widely used in local area networks, when those LANs are interconnected by store-and-forward routers, the multicast service is usually not offered across the resulting internetwork. To address this limitation, we specify extensions to two common internetwork routing algorithms—distance-vector routing and link-state routing—to support low-delay datagram multicasting beyond a single LAN. We also describe modifications to the single-spanning-tree routing algorithm commonly used by link-layer bridges, to reduce the costs of multicasting in large extended LANs. Finally, we discuss how the use of multicast scope control and hierarchical multicast routing allows the multicast service to scale up to large internetworks.

1,365 citations