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
TL;DR: This paper presents an on demand algorithm to discover the sensor network topology, where the node that receives the topology request collects all topology related information from each node in the network and constructs link information databases.
25 citations
19 Apr 2006
TL;DR: The findings are that i) local information is of course quite valuable in increasing protocol performance, and ii) it is possible to obtain high coverage and efficiency but one must then incur either increased delay or increased overhead.
Abstract: We investigate four performance metrics for randomized broadcast protocols on sensor networks: the fraction of nodes that receive the message (coverage), the number of first-time receivers per transmission (energy efficiency), the node-average normalized time till reception (per hop latency), and the average number of control messages per node (overhead). Our focus is to evaluate the extent to which the exchange of local information (either active or passive) can improve protocol performance. To this end we study via simulation three protocols from the literature that exploit local information (GOSSIP3 from [8], SPIN-1 from [10], and PUSH&PULL from [12])and compare their performance against the well known GOSSIP1 ([8]) protocol which does not employ any local information in making transmission decisions. Our findings are that i) local information is of course quite valuable in increasing protocol performance, and ii) it is possible to obtain high coverage and efficiency but one must then incur either increased delay or increased overhead. We study the strengths and weaknesses of the above protocols and propose the new SmartGossip protocol which combines several ideas from the above protocols, as well as several new mechanisms, to achieve superior performance.
25 citations
Cites background or methods from "Adaptive protocols for information ..."
...our attention on several of the above protocols which make use of information exchange; specifically the work in [8, 10, 12]....
[...]
...In this paper we study five protocols: i) GOSSIP1 [8], ii) GOSSIP3 [8], iii) SPIN-1 [10], iv) Push&Pull [12], and v) our...
[...]
...This information exchange is achieved through a variety of simple mechanisms, many of these ideas we have appropriated (with credit where due) from the proposed protocols in the literature, especially [8, 10, 12]....
[...]
...1999 [10] that employ negotation (exchange of local information) to reduce redundant transmissions....
[...]
...The networking community has proposed quite a few gossip variants; representative work includes SPIN for energy constrained networks [10], directional gossip [18], a two phase push-pull gossip [12], reliable multicast gossip [22], gossip with garbage collection [13], rumor routing [2], gossip with flooding and two-threshold gossip [8], parametric gossip [1], push-pull gossip [9], adaptive gossip [20], non-uniform gossip [23], peer to peer [4], and “shuffle” gossip [6]....
[...]
01 May 2017
TL;DR: This work analytically derives the closed form solution to the globally optimal consensus gain, which is characterized by the minimum mean square error for the estimation process, and demonstrates that the optimal consensusgain outperforms the suboptimal solution.
Abstract: Following recent advances in networked communication technologies, sensor networks have been employed in a broad range of applications at a lower cost than centrally supervised systems. Their major functionality is to track and monitor targets using various distributed estimation techniques. Specifically, the distributed Kalman Consensus Filter (KCF) fuses data from different sensor agents by achieving two objectives for each sensor: 1) locally estimating the state of the target; and 2) reaching a consensus of the state estimate between neighboring agents through communication. Although the KCF has been proven to have superior performance in terms of stability and scalability, it relies on approximated suboptimal consensus gain to avoid algorithmic complexity. Specifically, we seek to address this problem of suboptimality, and analytically derive the closed form solution to the globally optimal consensus gain, which is characterized by the minimum mean square error for the estimation process. Illustrative simulation results are presented to demonstrate that the optimal consensus gain outperforms the suboptimal solution.
25 citations
22 Oct 2007
TL;DR: This paper uses VPSQ over CRCP as diseminated data selection and evaluated the performance of the proposed approach in a simulator, using realistic traffic models obtained from Toyota Central R&D Lab.
Abstract: In this paper, we propose an efficient data exchange method for acquiring local traffic information where we use inter-vehicle ad-hoc communication with queries. In the proposed approach, each vehicle disseminates traffic information of its neighborhood and relays it within a few square kilometers. Traffic information of distant areas can be obtained by issuing queries and propagating them using inter-vehicle ad-hoc communication. This makes the time necessary for acquiring neighboring traffic information rather short, nevertheless we can still keep acquisition time of distant traffic information reasonable. The proposed data dissemination protocol CRCP has an autonomous packet collision avoidance mechanism by sensing data dissemination from neighboring vehicles. In this paper, we use VPSQ over CRCP as diseminated data selection. We have evaluated the performance of our proposed approach in a simulator, using realistic traffic models obtained from Toyota Central R&D Lab., Inc. Simulation results reveal the usefulness of the proposed approach.
25 citations
Cites background from "Adaptive protocols for information ..."
...In [3], the authors present a family of adaptive protocols that efficiently disseminate information in an energy-constrained sensor network....
[...]
16 Apr 2010
TL;DR: Improvement is made to the traditional K-mean algorithm, and a k value learning algorithm is proposed, using genetic algorithm to optimize the K value, and improve clustering performance.
Abstract: That traditional K-mean algorithm is a widely used clustering algorithm, with a wide application. In light of the disadvantage of K-mean algorithm, improvement is made to the traditional K-mean algorithm, a k value learning algorithm is proposed. Using genetic algorithm to optimize the K value, and improve clustering performance.
25 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