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
01 Jan 2006
TL;DR: This work presents a structure-based algorithm to solve the unique ID assignment problem in sensor networks and can save energy consumption by reducing communication overhead while IDs are assigned.
Abstract: Summary A sensor network consists of a set of battery-powered nodes, which collaborate to perform sensing tasks in a given environment. Globally unique ID allocation is usually not applicable in a sensor network due to the massive production of cheap sensor nodes, the limited bandwidth, and the size of the payload. However, locally unique IDs are still necessary for nodes to implement communications to save energy consumption. Already several solutions have been proposed for locally unique ID assignment in sensor networks. However, they bring much communication overhead, and they are complex to implement. We present a structure-based algorithm to solve the unique ID assignment problem. This algorithm can save energy consumption by reducing communication overhead while IDs are assigned.
11 citations
Cites methods from "Adaptive protocols for information ..."
...In addition, this solution can be used only with cluster-based routing and does not extend to the case of multi-hop routing [11]....
[...]
28 May 2003
TL;DR: Spatial Programming is presented, a novel programming model for NES to offer network-transparent access to data and services distributed on nodes spread across the physical space that can be a viable solution for distributed computing over NES.
Abstract: During the next decade, emerging technologies will help populating the physical space with ubiquitous networks of embedded systems (NES). Programming NES requires new abstractions and computing models since the current programming, models are not designed for the scale and volatility encountered in these networks. This paper presents Spatial Programming (SP), a novel programming model for NES. The key idea in SP is to offer network-transparent access to data and services distributed on nodes spread across the physical space. SP programs access network resources using a high level abstraction, termed spatial reference, which addresses the nodes using their spatial and content properties. An underlying system takes care of mapping spatial references onto target nodes in the network. Our preliminary experience in developing SP applications suggests that SP can be a viable solution for distributed computing over NES.
11 citations
Cites background from "Adaptive protocols for information ..."
...Recent work on large networks of embedded systems has focused on network protocols for wired and wireless sensor networks [ 11 , 13], system architectures for xed-function sensor networks [12], and energy ecient data collection for mobile sensor networks designed to support wildlife tracking [15]....
[...]
...For instance, sensors monitoring the environment [12, 10, 11 ], robots with intelligent cameras collaborating to track a given object [1], or cars on a highway cooperating to adapt to trac conditions [2] will become a daily reality....
[...]
Proceedings Article•
04 Sep 2013
TL;DR: The design issues in routing protocols for WSNs are discussed by considering its various dimensions and metrics such as QoS requirement, path redundancy etc.
Abstract: The modern research has found a variety of applications and systems with vastly varying requirements and characteristics in Wireless Sensor Networks (WSNs). The research has led to materialization of many application specific routing protocols which must be energy-efficient. As a consequence, it is becoming increasingly difficult to discuss the design issues requirements regarding hardware and software support. Implementation of efficient system in a multidisciplinary research such as WSNs is becoming very difficult. In this paper we discuss the design issues in routing protocols for WSNs by considering its various dimensions and metrics such as QoS requirement, path redundancy etc. The paper concludes by presenting the suitable applications and QoS of routing protocols for WSNs.
11 citations
Cites background from "Adaptive protocols for information ..."
...The SPIN protocols are based on two key mechanisms namely negotiation and resource adaptation....
[...]
...SPIN enables the sensors to negotiate with each other before any data dissemination can occur in order to avoid injecting non-useful and redundant information in the network....
[...]
...The sensors running the SPIN protocols are able to compute the energy consumption required to compute, send, and receive data over the network....
[...]
...The SPIN [17] protocols are resource aware and resource adaptive....
[...]
TL;DR: A cost model for data dissemination in peer to peer broadcast networks quantifies the tradeoff between the inconsistency of the data, and its transmission cost; the transmission cost may be given in terms of dollars, energy, or bandwidth.
Abstract: We consider the problem of data dissemination in a broadcast network. In contrast to previously studied models, broadcasting is among peers, rather than client server. Such a model represents, for example, satellite communication among widely distributed nodes, sensor networks, and mobile ad hoc networks. We introduce a cost model for data dissemination in peer to peer broadcast networks. The model quantifies the tradeoff between the inconsistency of the data, and its transmission cost; the transmission cost may be given in terms of dollars, energy, or bandwidth. Using the model we first determine the parameters for which eager (i.e. consistent) replication has a lower cost than lazy (i.e. inconsistent) replication. Then we introduce a lazy broadcast policy and compare it with several naive or traditional approaches to solving the problem.
11 citations
Cites background from "Adaptive protocols for information ..."
...In case is the location of , the database is of interest in what are called Moving Objects Database (MOD) applications (see [28, 30, 16, 17, 34])....
[...]
26 Apr 2004
TL;DR: A resource adaptive information gathering (RAIG) algorithm, that aggregates data on the fly by making trade-offs among latency, energy-efficiency and quality according to resource conditions and specific task requirements is proposed.
Abstract: A distributed sensor network is a self-organized system composed of large number of low-cost sensor nodes. In order to achieve the expected quality of service and fulfill the latency and resource requirements, these sensor nodes have to collaborate with each other and implement effective information gathering and dissemination strategies. In this paper we propose a resource adaptive information gathering (RAIG) algorithm, that aggregates data on the fly by making trade-offs among latency, energy-efficiency and quality according to resource conditions and specific task requirements. A statistical model to represent the report delivery process in sensor networks is investigated and the operation of the RAIG algorithm for various cases and scenarios is described. Finally the performance of the proposed approach, in terms of energy and delay, is presented and evaluated.
11 citations
References
More filters
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
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]....
[...]
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]....
[...]
PARC1
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....
[...]
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