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
Journal ArticleDOI
TL;DR: Simulation results show that TTDD-QL and TT DD-QL-A can reduce sensor node energy consumption and extend the lifetime of the WSN.
Abstract: Green communication for different kinds of wireless networks has begun to receive significant research attention recently. Green communication focuses mainly on the issue of improving energy efficiency substantially. A wireless sensor network (WSN) consists of a large number of randomly and widely deployed sensor nodes, and these nodes themselves have the ability to wireless communicate, detect and process data. Sensor nodes can thus detect their surrounding environment, and transmit related data to a sink via wireless communication. This study proposes two two-tier data dissemination schemes based on Q-learning for wireless sensor networks. In the proposed schemes, a source node uses Q-learning to find the most energy efficient data dissemination path from the source node to the sink. The first scheme is called TTDD-QL, and the second scheme is called TTDD-QL-A which is an advanced version of TTDD-QL. In TTDD-QL, the reward is determined by the distance between the current dissemination node and the sink. In each iteration, the proposed scheme will update the Q values. After multiple learning iterations, the Q values are converged, and the data dissemination path is found according to the Q values. In TTDD-QL-A, the reward is determined not only by the distance between the current dissemination node and the sink but also by the remaining energy of the current dissemination node. Simulation results show that TTDD-QL and TTDD-QL-A can reduce sensor node energy consumption and extend the lifetime of the WSN.

15 citations


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

  • ...Sensors are not only able to sense and detect environmental targets and changes, but can also process collected data and send that processed data to a sink by wireless transmission [15]–[17]....

    [...]

Proceedings ArticleDOI
29 Nov 2004
TL;DR: This paper develops two novel algorithms, MIR and CMIR, designed to maximize information flow, and presents a comparison of the algorithms to a previously proposed algorithm-MREP (maximum residual energy path) through simulations.
Abstract: This paper introduces the measure of information as a new criterion for the performance analysis of routing algorithms in wireless sensor networks. We argue that since the objective of a sensor network is to estimate a two dimensional random field, a routing algorithm must maximize information flow about the underlying field over the lifetime of the sensor network. We develop two novel algorithms, MIR (maximum information routing) and CMIR (conditional maximum information routing) designed to maximize information flow, and present a comparison of the algorithms to a previously proposed algorithm-MREP (maximum residual energy path) through simulations. We show that the proposed algorithms give significant improvement in terms of information flow, when compared to MREP.

15 citations


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

  • ...The Sensor Protocols for Information via Negotiation (SPIN) algorithm [9] attempts to maximize the data disseminated for unit energy consumption....

    [...]

01 Jan 2005
TL;DR: This paper introduces IDEALS (Information manageD Energy Aware aLgorithm for Sensor networks), which aims to extend the network lifetime for important messages through the possible loss of low importance messages.
Abstract: Wireless sensor networks are continuing to receive considerable research interest. The energy constraint inherent in the small battery powered nodes presents a considerable problem, and much effort is being put into reducing the power consumption. In this paper, we introduce IDEALS (Information manageD Energy Aware aLgorithm for Sensor networks), which aims to extend the network lifetime for important messages. This is obtained through the possible loss of low importance messages. IDEALS is fundamentally built upon a concept of message and power priorities, and is particularly relevant for energy harvesting nodes. The results obtained from a developed simulator show that considerable advantages can be obtained from IDEALS.

15 citations


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

  • ...In many WSN algorithms, the decision as to whether or not the neighbouring node has enough power to forward a message forms part of a negotiation process [11]....

    [...]

Proceedings ArticleDOI
19 Mar 2005
TL;DR: The geographic grid routing (GGR) protocol aims to provide robust task dissemination and data collection from large sensor networks such that the useful lifetime of the network is prolonged.
Abstract: High resolution data collection using low-cost wireless sensor networks has recently become feasible due to advances in electronics and wireless networking technologies. The geographic grid routing (GGR) protocol described in this paper aims to provide robust task dissemination and data collection from large sensor networks such that the useful lifetime of the network is prolonged. The work builds on a previously developed routing protocol called two-tier data dissemination (TTDD). Our work is differentiated by the use of multiple paths, a more efficient and useful data collection model, and more authentic environmental assumptions, including the presence of asymmetric links. Extensive and realistic experiments were used to evaluate the performance of GGR. The results show GGR to be a highly efficient, scalable, versatile and robust solution.

15 citations

01 Jan 2003
TL;DR: This paper presents a novel approach to sensor network routing based on energy consumption that uses swarm intelligence, which is computationally efficient.
Abstract: Energy consumption is currently a key issue in research for future sensor networks. This paper presents a novel approach to sensor network routing based on energy consumption. The unique routing algorithm uses swarm intelligence, which is computationally efficient.

15 citations


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

  • ...In this paper, a building sensor network consisting of wired and wireless nodes possessing energy constraints[2] between nodes is considered....

    [...]

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