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
26 May 2004
TL;DR: A context discovery protocol (CDP) that defines the entire process of discovering, acquiring, aggregating and storing contexts, is needed for ubiquitous computing environments and is presented, which is adaptive, lightweight and energy-efficient.
Abstract: In ubiquitous computing (ubicomp) environments, it is often necessary for the applications to have situation-awareness capability. Current research on situation-aware applications is mainly based on situations with a predefined set of contexts. To achieve more flexible situation-awareness, situation-aware applications should have the ability to discover and collect contexts in a timely and organized fashion. Due to the dynamic and ephemeral nature of ubicomp environments, a context discovery protocol (CDP) that defines the entire process of discovering, acquiring, aggregating and storing contexts, is needed. Because of the serious resource constraints on ubicomp devices, the CDP must be adaptive, lightweight and energy-efficient. In this paper, a CDP with such characteristics for ubicomp environments is presented. The experimental results to show that our CDP is more energy-efficient and has a small increase in latency, compared to a simple context discovery protocol, are also presented.
12 citations
Cites background from "Adaptive protocols for information ..."
...In this scenario, the instructor’s PDA needs to collect three contexts: location, time, and the identity of a neighboring device....
[...]
01 Dec 2010
TL;DR: An analytical model of energy usage hierarchical wireless sensor network protocols such as LEACH is proposed and an analytic expression for the optimal cluster-head selection rate is given.
Abstract: Here we propose an analytical model of energy usage hierarchical wireless sensor network protocols such as LEACH [1]. LEACH has been used as a foundation for much of the wireless sensor network research, so results addressing the underlying nature of these systems build understanding of a wide range of existing protocols. First, we derive the probability density functions of the distance to the nearest cluster head, the distance to the nearest cluster head squared, and the expected number of nodes per cluster. These results are then applied to produce a model of the amount of average energy used per node for each data report. Using this model we give an analytic expression for the optimal cluster-head selection rate. The model is further improved to give an approximate adjustment for distortions in energy usage near the edges of the field. This final model is then compared to the simulation results presented in the original LEACH paper [1] and shown to be accurate. Sensor network protocol researchers can apply results presented here to improve performance of existing systems by making the cluster head selection rate adaptive to external factors.
12 citations
Cites background or methods or result from "Adaptive protocols for information ..."
...have proposed LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that minimizes energy dissipation in sensor networks [1]....
[...]
...Most of these values are taken directly from [1]....
[...]
...Abstract—Here we propose an analytical model of energy usage hierarchical wireless sensor network protocols such as LEACH [1]....
[...]
...This final model is then compared to the simulation results presented in the original LEACH paper [1] and shown to be accurate....
[...]
...To address these energy challenges, several protocols have been proposed for wireless sensor networks [1], [5]–[7]....
[...]
01 Nov 2000
TL;DR: A cost model is introduced for data dissemination in a sensor network that quantifies the tradeoff between the inconsistency of the data, and its transmission cost; the transmission cost is given in terms of energy and bandwidth.
Abstract: We consider the problem of data dissemination in a sensor network. First we introduce a cost model for data dissemination in such networks. The model quantifies the tradeoff between the inconsistency of the data, and its transmission cost; the transmission cost is given in terms of energy and bandwidth. Then we introduce a novel broadcast policy, ABR, that utilizes our cost model. In the ABR policy, each sensor broadcasts updates only if the cost of sending is justified by (its view of) the current level of inconsistency. Data received from other sensors are rebroadcast using the same cost measures. Finally we compare the performance of ABR with that of several existing data dissemination policies. Via the comparison we discover an intricate interplay among the various parameters in choosing a dissemination policy.
12 citations
Cites background or methods from "Adaptive protocols for information ..."
...We compare by simulation FBR, ABR, and two other dissemination protocols for sensors networks, namely SPINBC, and Flooding (see [13])....
[...]
...([13],[3]) proposed a family of protocols, called SPIN, which disseminate information among sensors in an energy-constrained wireless sensor network....
[...]
...This architecture is motivated by sensor and "smar t dust" networks (see [13]), but our results are also applicable to other peer to peer broadcast networks....
[...]
TL;DR: A generic framework to select a minimum cost route that takes the packet loss rate and collision history into account and shows better performance than those routing methods in terms of jitter, reachability, and network lifetime.
Abstract: We propose a network quality aware routing (NQAR) mechanism to provide an enabling method of the delay-sensitive data delivery over error-prone wireless sensor networks. Unlike the existing routing methods that select routes with the shortest arrival latency or the minimum hop count, the proposed scheme adaptively selects the route based on the network qualities including link errors and collisions with minimum additional complexity. It is designed to avoid the paths with potential noise and collision that may cause many non-deterministic backoffs and retransmissions. We propose a generic framework to select a minimum cost route that takes the packet loss rate and collision history into account. NQAR uses a data centric approach to estimate a single-hop delay based on processing time, propagation delay, packet loss rate, number of backoffs, and the retransmission timeout between two neighboring nodes. This enables a source node to choose the shortest expected end-to-end delay path to send a delay-sensitive data. The experiment results show that NQAR reduces the end-to-end transfer delay up to approximately 50% in comparison with the latency-based directed diffusion and the hop count-based directed diffusion under the error-prone network environments. Moreover, NQAR shows better performance than those routing methods in terms of jitter, reachability, and network lifetime.
12 citations
Cites background from "Adaptive protocols for information ..."
...Sensor Protocols for Information via Negotiation (SPIN) [4] is one of the earliest data centric approaches, which allows any sensor nodes around the information data to initiate interest advertisements....
[...]
...It is also better than SPIN from the data coverage point of view....
[...]
Dissertation•
01 Jan 2010
TL;DR: A new approach for analyzing the performance of wireless sensor network protocol designs and a modified clustering algorithm with a three-tier sensor nodes setting to cope with energy heterogeneity among sensor nodes is revealed.
Abstract: While wireless sensor networks (WSN) are increasingly equipped to handle more complex functions, in-network processing still requires the battery powered sensors to judiciously use their constrained energy so as to prolong the effective network life time. There are a few protocols using sensor clusters to coordinate the energy consumption in a WSN. To cope with energy heterogeneity among sensor nodes, a modified clustering algorithm is proposed with a three-tier sensor nodes setting. This approach is an improvement to the original SEP protocol that used two-tier node setting. The result showed a better management of energy resource than both LEACH and SEP. In addition, two forms of extensions to LEACH algorithm, multi-hop and dual-hop LEACH algorithms using a concentric circle around the BS, are presented. The goal of these methods is to analyze the adaptation of different communication modes to the original LEACH protocol that used a single-hop communication mode among its sensor nodes. This thesis further carried out a spatial distribution of energy-based comparative study of homogeneous and heterogeneous clustered WSN. The study revealed a new approach for analyzing the performance of wireless sensor network protocol designs. Simulation has been conducted to evaluate these new approaches and favorable results are obtained in both homogeneous and heterogeneous energy settings.
12 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