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: A modified version of SPIN protocol named SPIN-MI is proposed and its performance with traditional SPin-BC protocol using broadcast communication is compared and the result shows that not only the problem of “Blind Forwarding” and “Data Unaccessibility” in SPIN have been solved, but also extended the network life time and quick response to request is made.
Abstract: Data transmission in wireless domain is one of the major challenges in wireless sensor networks (WSN). Efficient use of energy and time is major field of research in wireless sensor networks; different routing protocols have been proposed to overcome these problems. In this paper we proposed a modified version of SPIN protocol named SPIN-MI and compared its performance with traditional SPIN-BC protocol using broadcast communication. We simulate it from two aspects using C and MATLAB: The consumption of energy and the number of alive nodes in the sensor networks. The simulation result shows that not only the problem of “Blind Forwarding” and “Data Unaccessibility” in SPIN those have been solved, but also extended the network life time and quick response to request is made.
10 citations
07 Dec 2005
TL;DR: Through simulation evaluations, it is shown that QoS-GBP is very scalable and guarantees minimum delay, and accommodates seamlessly such network changes, including the presence of actors and mobile nodes in heterogeneous sensor networks.
Abstract: We present QoS Geometric Broadcast Protocol (QoS-GBP), a novel broadcasting protocol for heterogeneous wireless ad hoc and sensor networks. While broadcasting is a very energy-expensive protocol, it is also widely used as a building block for a variety of other network layer protocols. Therefore, reducing the energy consumption by optimizing broadcasting is a major improvement in heterogenous sensor networking. QoS-GBP is a distributed algorithm where nodes make local decisions on whether to transmit based on a geometric approach. QoS-GBP enables a tradeoff among the need for neighborhood information (communication overhead) and the delay. QoS-GBP is scalable to the change in network size, node type, node density and topology. QoS-GBP accommodates seamlessly such network changes, including the presence of actors and mobile nodes in heterogeneous sensor networks. Through simulation evaluations, we show that QoS-GBP is very scalable and guarantees minimum delay.
10 citations
Cites background from "Adaptive protocols for information ..."
...Though, this simple mechanism reduces the number of redundant transmissions, there is still a lot of scope for improvement....
[...]
22 Mar 2017
TL;DR: This chapter describes the evolution of, and state of the art in, energy‐efficient techniques for wirelessly communicating networks of embedded computers, such as those found in wireless sensor network (WSN), Internet of Things (IoT) and cyberphysical systems (CPS) applications.
Abstract: This chapter describes the evolution of, and state of the art in, energy‐efficient techniques for wirelessly communicating networks of embedded computers, such as those found in wireless sensor network (WSN), Internet of Things (IoT) and cyberphysical systems (CPS) applications. Specifically, emphasis is placed on energy efficiency as critical to ensuring the feasibility of long lifetime, low‐maintenance and increasingly autonomous monitoring and control scenarios. A comprehensive summary of link layer and routing protocols for a variety of traffic patterns is discussed, in addition to their combination and evaluation as full protocol stacks.
10 citations
Cites background from "Adaptive protocols for information ..."
...SPIN can significantly decrease the network traffic by elimi‐ nating redundant data....
[...]
...Both SPIN and RR scored the lowest mark for energy efficiency—one out of four—in the survey on routing protocols [56], due to their low packet delivery rate and not being energy aware when disseminating the data....
[...]
...proposed a family of Sensor Protocols for Information via Negotiation (SPIN) [74]....
[...]
...A node running SPIN, upon receiving a new message, broadcasts an advertising message containing meta‐data of the received message....
[...]
...Heinzelman et al. proposed a family of Sensor Protocols for Information via Negotiation (SPIN) [74]....
[...]
01 Jan 2002
TL;DR: In this paper, the authors describe a web-based Educational Marketplace that matches student requests for learning materials to available and appropriate resources, and address technical issues such as: I) resource acquisition and data mining techniques to facilitate access to large-scale educational repositories.
Abstract: We describe a web-based Educational MarketPlace that matches student requests for learning materials to available and appropriate resources. We address technical issues such as: I) resource acquisition and data mining techniques to facilitate access to large-scale educational repositories: 2) negotiation. contract execution and verification of instructional resources. and 3) digital repository testbeds to evaluate agent behavior. Societal issues include understanding web-based educational interactions. individual learning processes and organizational dynamics in the distributed. digital instructional realm. The Educational MarketPlace is different from other Internet spaces in that it requires independent scoring of resources and certification of teaching. This chapter discusses these issues and the open learning environment where a learner has choices: it describes how the Internet might replace the existing education monopoly and help dissolve the cottage industry of education in which a teacher handcrafts materials fixed by space and time.
10 citations
01 Dec 2011
TL;DR: An efficient data-gathering protocol (EDAP) is proposed to address this problem by using a Virtual Sink node nearby the sources, which plays the role of sink node and broadcasts local interest messages and routes gathered data toward destination.
Abstract: Directed Diffusion (DD) uses data aggregation to suppress data overhead however there is no guarantee that paths from nearby sources join after a few hops. In this paper, an efficient data-gathering protocol (EDAP) is proposed to address this problem by using a Virtual Sink (VS) node nearby the sources, which plays the role of sink node and broadcasts local interest messages and routes gathered data toward destination. Also, multiple paths are constructed between VS and the sink node, which leads to load-balancing, and increase in the lifetime of the network. Simulation results show that in EDAP a significant amount of energy can be saved and the network lifetime will be increased considerably.
10 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