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
Dissertation•
01 Mar 2012
TL;DR: This thesis addresses the problem of task allocation in a distributed satellite system by proposing the use of a market-based, multi-agent approach to achieve the necessary macro-level behaviour, based on human labour markets, in order to obtain similar robustness and flexibility.
Abstract: This thesis addresses the problem of task allocation in a distributed satellite system. These spacecraft specialise in different functions, and must collaborate to complete the mission objectives. The energy available for task execution and communication is, however, extremely limited, which poses a challenging design problem. I propose the use of a market-based, multi-agent approach to achieve the necessary macro-level behaviour. The development and verification of this allocation mechanism constitutes the first major objective of this thesis. Although numerous examples of task allocation in related systems exist, I found a worrying disconnect between our general, theoretical knowledge of task allocation, and the specific application thereof. General analyses of abstracted task allocation exist, and specific implementations have been constructed in a heuristic way, but very little work navigates between these two extremes. My second major objective therefore contributes to mapping the problem space. The proposed task allocation mechanism is based on human labour markets in order to obtain similar robustness and flexibility. It uses fully distributed auctions to efficiently allocate tasks in volatile networks, without any global knowledge of the system state. The energy required for communication is constant, irrespective of the size of the network, resulting in a highly scalable allocation mechanism. To find the area in parameter space where market-based control is the more suitable solution, when compared to a centralised approach, I characterised the allocation mechanism in terms of network size, node failure rate, and robustness. The relationship between communication cost and topology is explored by looking at the overheads associated with different static topologies, and the impact of communication distance. The ability of the allocation mechanism to cope with realistic Keplerian dynamics is also confirmed. Finally, I investigate the difference in performance between the allocation mechanism, as an example of a cooperative market, and a competitive scenario where adaptive agents compete to maximise their revenue. Results show that competitive markets are subject to positive feedback loops which can result in inferior performance for sparsely connected and heavily loaded networks. This exploration of the system parameters is treated as a traversal of the problem space, resulting in an emergent taxonomy of both problem and solution elements.
11 citations
TL;DR: This paper inclusively evaluated eight sensor network distributions namely: normal, gamma, exponential, beta, generalized inverse Gaussian, poison, Cauchy and Weibull to derive a new investigation for the wireless sensor networks (WSNs) when the underlying sensor node distribution strategies have strong influence on event specific communication performance.
Abstract: We derive a new investigation for the wireless sensor networks (WSNs) when the underlying sensor node distribution strategies have strong influence on event specific communication performance In this paper, we inclusively evaluated eight sensor network distributions namely: normal, gamma, exponential, beta, generalized inverse Gaussian, poison, Cauchy and Weibull We designed and illustrated our proposed model with these node distributions for data dissemination Moreover, performance evaluation matrices like sense count, receive count and receive redundant count are also evaluated Additionally, we emphasized over the routing protocol behavior for different distribution strategies in the deployed WSN framework Finally, simulation analysis has been carried out to prove the validity of our proposal However, routing protocol for WSNs seems intractable to the sensor node distribution strategies when varied from one to another in the scenario
11 citations
18 Dec 2007
TL;DR: A novel two-tier Chord based network protocol for serving efficient queries in WSNs (C2WSN), which has a <3(log M+log lambdai) bounded times for data lookup, where M is the number of cluster and lambDai is the maximal number of sensor nodes within a cluster, respectively.
Abstract: Efficiently locate data is a fundamental problem for future applications of wireless sensor networks (WSNs). It is known that distributed hash table (DHT) based Internet peer-to-peer (P2P) protocols provide near-optimum data lookup times for queries made on networks of distributed nodes. In this paper we propose a novel two-tier Chord based network protocol for serving efficient queries in WSNs (C2WSN), which has a <3(log M+log lambdai) bounded times for data lookup, where M is the number of cluster and lambdai is the maximal number of sensor nodes within a cluster, respectively. Furthermore, in C2WSN a new dynamic rotation mechanism of cluster head is presented, which increases the network lifetime greatly.
11 citations
Cites methods from "Adaptive protocols for information ..."
...Furthermore, LEACH [8] proposed a solution to randomly rotate the cluster heads within a cluster....
[...]
...LEACH [8] proposed a solution to this problem by randomly rotating the cluster heads within a cluster....
[...]
Posted Content•
TL;DR: This paper presents an Energy Driven Architecture (EDA) as a new architecture and indicates a novel approach for minimising the total energy consumption of a WSN.
Abstract: Most wireless sensor networks operate with very limited energy sources-their batteries, and hence their usefulness in real life applications is severely constrained. The challenging issues are how to optimize the use of their energy or to harvest their own energy in order to lengthen their lives for wider classes of application. Tackling these important issues requires a robust architecture that takes into account the energy consumption level of functional constituents and their interdependency. Without such architecture, it would be difficult to formulate and optimize the overall energy consumption of a wireless sensor network. Unlike most current researches that focus on a single energy constituent of WSNs independent from and regardless of other constituents, this paper presents an Energy Driven Architecture (EDA) as a new architecture and indicates a novel approach for minimising the total energy consumption of a WSN
11 citations
Dissertation•
12 Oct 2010
TL;DR: In this paper, the authors propose a methode non destructif in-situ de durabilite des materiaux cimentaires fonde sur l'instrumentation in situ de leur microstructure.
Abstract: Le controle non destructif in-situ de durabilite des materiaux cimentaires est essentiel a la prediction et la prevention des defauts de fonctionnement des constructions. Alors que les degradations, et donc la perte de durabilite, des materiaux cimentaires sont declenchees et controlees par les caracteristiques et les evolutions de leur microporosite, il n'existe pas a notre connaissance de methode non destructive d'instrumentation in-situ de la microporosite elle-meme. Nous proposons un concept innovant d'evaluation de la durabilite des materiaux cimentaires fonde sur l'instrumentation in-situ de leur microstructure. La methode repose sur l'investigation ultrasonore haute frequence de micropores individuels au moyen de micro-transducteurs ultrasoniques capacitifs (μ-cMUT) immerges en grand nombre dans le materiau. Le dispositif propose pour repondre aux multiples contraintes applicatives et technologiques est un μ-cMUT dont la plaque vibrante est constituee d'une couche mince de nanotubes de carbone monoparoi densement alignes. Nous avons traite la question de la pertinence de ce principe d'instrumentation en modelisant par un probleme elasto-acoustique microfluidique l'interaction entre la plaque vibrante d'un μ-cMUT et le fluide, air ou eau, contenu dans un pore de taille micrometrique. La specificite du modele reside dans la prise en compte du comportement dissipatif du fluide. La resolution de ce probleme couple a necessite le developpement d'une methode numerique ad-hoc. Nous avons constate numeriquement que la dissipation cause une diminution des frequences de resonance. La couche limite a une epaisseur importante par rapport a la taille du domaine. Les amplitudes de vibration des plaques sont particulierement sensibles au contenu des pores et a la geometrie des pores remplis d'eau. Nous en avons deduit que les μ-cMUT proposes pourraient etre pertinents dans les materiaux cimentaires pour le suivi de l'hydratation, pour la detection des degradations et le suivi de leur evolution. Pour etudier la faisabilite d'un μ-cMUT a nanotubes operationnel a haute frequence dans l'air et l'eau, nous avons tout d'abord realise par dielectrophorese des depots denses et minces de nanotubes bien alignes. Un des depots est monocouche, ce qui constitue une performance remarquable pour un depot par dielectrophorese. Nous avons ensuite suspendu les nanotubes, obtenant ainsi des membranes rigides et longues. L'epaisseur de ces membranes suspendues est particulierement faible et leur facteur de forme particulierement eleve par rapport a l'etat de l'art des cMUT. Nous avons enfin montre par vibrometrie laser que les membranes vibrent a basse frequence avec des amplitudes atteignant 5 nm pic-a-pic. Il s'agit a notre connaissance de la premiere mise en evidence de vibrations de nanotubes de carbone monoparoi par vibrometrie laser. Ces resultats demontrent une brique de base essentielle de l'etude complete de faisabilite du dispositif imagine. Ils indiquent aussi la faisabilite a court terme de microdetecteurs d'air pour le suivi de la microporosite gazeuse des materiaux cimentaires. En regroupant ainsi une etude numerique de pertinence et une etude technologique de faisabilite, la these constitue une contribution significative a la mise au point d'une nouvelle methode de suivi de durabilite de materiaux cimentaires fonde sur l'immersion au coeur du materiau d'un grand nombre de microcapteurs integrant des nanotechnologies
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