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 generic data model is proposed to enable logical views over data streams so that the proposed query engine can see tuples of virtual relations flowing through the WSN and a SQL-like query language is introduced, which enables users to express declarative queries and dynamically change parameters in queries' clauses.
22 citations
Cites background from "Adaptive protocols for information ..."
...Usually, these approaches organize sensors in routing trees [5,7,8]....
[...]
30 Aug 2006
TL;DR: A new network lifetime definition is presented and an energy-aware routing scheme with the node relay willingness for wireless sensor networks is proposed, which considers not only to route packets through sensor nodes that have sufficient energy reserves, but also to routes through light-loaded nodes.
Abstract: Energy efficiency has been known as the most significant problem in all facets of the wireless sensor network operations. For energy-aware routing scheme for the wireless sensor networks, it is necessary to use sub-optimal paths occasionally to increase the survivability of networks. In this paper, we present a new network lifetime definition and formulate the energy-aware routing problem with defined network lifetime. And then we propose an energy-aware routing scheme with the node relay willingness for wireless sensor networks. It considers not only to route packets through sensor nodes that have sufficient energy reserves, but also to route packets through light-loaded nodes. Simulation results show that the proposed routing algorithm can achieve longer network lifetime than that of the routing algorithm only considering the energy reserves
22 citations
Cites background from "Adaptive protocols for information ..."
...Early algorithms on the data-centric routing such as SPIN [13] and directed diffusion [15] save energy by the data negotiation and the redundant data elimination....
[...]
01 Jan 2008
TL;DR: A sample of existing energy-efficient cluster-based and QoS-aware routing protocols are surveyed and their key features are highlighted, including strengths and weaknesses.
Abstract: Recent developments in wireless communications have enabled the development of low-cost, low-power wireless sensor networks (WSN) with wide applicability, including environment and vehicle-health monitoring. Minimizing energy consumption and hence maximizing the life time of the network are key requirements in the design of optimum sensor networking protocols and algorithms. Several routing protocols with different objectives have already been proposed for energy-efficient WSN applications. This paper surveys a sample of existing energy-efficient cluster-based and QoS-aware routing protocols and highlights their key features, including strengths and weaknesses
22 citations
Cites background from "Adaptive protocols for information ..."
...SPIN [ 5 ] and directed diffusion [6] are examples of flat routing protocols....
[...]
01 Oct 2018
TL;DR: To begin with, the potential sensor systems applications are investigated, and later on, an audit of variables influencing the plan of sensor systems is given.
Abstract: Wireless sensor network (WSN) alludes to a gathering of spatially scattered and committed sensors for observing and recording the physical states of nature and arranging the gathered information at a local area. This network uses an immense number of sensors. To begin with, the potential sensor systems applications are investigated, and later on, an audit of variables influencing the plan of sensor systems is given.
22 citations
Cites background from "Adaptive protocols for information ..."
...Some of them are listed as follows [3,4,5,6,7,8,9,10,11,13,14,15,19,22,23,24]: 1) Monitoring conditions that affect plantation 2) Monitoring conditions for irrigation 3) Tracking movements of small animals, birds, and insects 4) Biological/Chemical detection 5) Precision Agriculture 6) Detecting forest fires 7) Flood Detection 8) Study of pollution 9) Monitoring marine and atmospheric contexts...
[...]
Proceedings Article•
01 Jan 2006TL;DR: A conclusive study of different routing schemes used in routing characteristic of wireless sensor networks and each of the routing schemes and algorithms has the common objective of trying to extend the lifetime of the sensor network.
Abstract: Wireless sensor networks illustrate enormous potential for increasing the information availability to people in many consumer and industrial applications such as smart buildings, target tracking, data collection, rescue missions, national security, monitoring disaster prone areas, managing inventories, monitoring health care, environmental studies, and home security . Much research effort has been made in the field of wireless sensor networks, in both academia and industry igniting the thrust to realize its unlimited applicability in various application fields. The network topology in a WSN may change drastically since nodes can be added and removed easily. The data from sensor nodes is gathered by the sink. The sink may be connected to the outside world thorough Internet or satellite. Sensor nodes will be scattered over a sensor field, so the locations of sensor nodes in the field cannot be predetermined. This paper continued from the previous part classifies the key routing techniques used in sensor networks. Each routing technique is studied in terms of resource usage, efficiency, applicability and scalability and the most challenging research directions are outlined. We provide a a conclusive study of different routing schemes used in routing characteristic of wireless sensor networks. Each of the routing schemes and algorithms has the common objective of trying to extend the lifetime of the sensor network.
22 citations
Cites background or methods from "Adaptive protocols for information ..."
...[1] Jamil Ibriq, Imad Mahgoub,"Cluster-Based Routing in Wireless Sensor Networks:: Issues and Challenges", Proceedings of the 2004 Symposium on Performance Evaluation of Computer and Telecommunication Systems- SPECTS, July 25-29 2004 [2] W....
[...]
...Sensor Protocols for Information via Negotiation- SPIN [2] intend to disseminate data towards the sink using negotiations....
[...]
...The SPIN family of protocols includes several schemes with minor modifications on the actual proposal [2]....
[...]
...However, there are some shortcomings in this scheme which dissipate the limited resources of the sensor nodes [2]....
[...]
...Performance evaluation of SPIN [2] demonstrates that SPIN is more energy-efficient than flooding or gossiping while distributing data at the same rate or faster than these protocols....
[...]
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