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: The problems that need to be solved and some proposals in the industrial domain are presented and possible wireless LAN solutions are described and checked for suitability.
24 citations
01 Jan 2005
TL;DR: This thesis presents Aqueduct, a robust and efficient protocol for propagating dynamic code updates through a heterogeneous WSN for dynamic reprogramming of sensor applications and sensor operating systems.
Abstract: Date The final copy of this thesis has been examined by the signatories, and we find that both the content and the form meet acceptable presentation standards of scholarly work in the above mentioned discipline. Dynamic reprogramming of sensor applications and sensor operating systems is emerging as a critical function required by in situ wireless sensor networks. This ability to remotely patch or upgrade software in deployed sensor nodes via the wireless network is complicated by the increasing trend towards heterogeneity in WSN hardware platforms, sensor operating systems, and role-based differentiation, e.g. between aggre-gators and leaf sensor nodes. Current protocols such as Deluge focus on propagating the same code image to a network of homogeneous sensor nodes. Naive approaches to adapt such protocols for heterogeneity are largely inefficient. This thesis presents Aqueduct , a robust and efficient protocol for propagating dynamic code updates through a heterogeneous WSN. iv Acknowledgements Richard Han and Anmol Sheth provided suggestions and critiques for my protocol designs over many weekly discussions. Anmol Sheth helped with researching related work and analyzing data. David Lyle and James Carlson were members of my project team when we investigated Deluge for CSCI 5573: Advanced Operating Systems.
24 citations
01 Jan 2009
TL;DR: The main objective of this chapter is to review and evaluate the most representative MA-based middleware proposals for autonomic data fusion tasks in WSNs and evaluate their relevant strengths and shortcomings.
Abstract: Mobile agents (MAs) are referred to as autonomous application programs with the inherent ability to move from node to node towards a goal completion. In the context of wireless sensor networks (WSNs), MAs may be used by network administrators in the process of combining data and knowledge from different sources aiming at maximizing the useful information content. MAs have been initially developed to replace the client/server model which exhibits many disadvantages, particularly in WSN environments (e.g.heavy bandwidth usage and excessive energy expenditure). The most promising advantages of MAs in WSN environments include decreased usage of the wireless spectrum (large volumes of raw sensory data are filtered at the source) and energy consumption, increased reliability due to their inherent support for disconnected operations, their ability of cloning themselves to enable parallel execution of similar tasks, etc. The main objective of this chapter is to review and evaluate the most representative MA-based middleware proposals for autonomic data fusion tasks in WSNs and evaluate their relevant strengths and shortcomings. Although the chapter’s focus is on autonomic data fusion tasks, other applications fields that may benefit from the MAs distributed computing paradigm are identified. Open research issues in this field are also discussed.
24 citations
Cites background from "Adaptive protocols for information ..."
...Other related works [21, 23, 33, 34] aim at reducing the energy expended by SNs during the process of data fusion....
[...]
01 Jan 2013
TL;DR: This paper studies the various security issues and security threats in WSNs, gives brief description of some of the protocols used to achieve security in the network and compares the proposed methodologies analytically.
Abstract: A wireless sensor network typically consists of large number of low-cost densely deployed sensor nodes that have strictly constrained sensing, computation, and communication capabilities. Because of resource restricted sensor nodes, it is necessary to reduce the amount of information transmission so that average lifetime of sensor and thus the bandwidth consumption are improved. As wireless sensor networks are typically deployed in remote and hostile environments to transmit sensitive data, sensor nodes are in danger of node compromise attacks and security issues like data confidentiality and integrity are terribly necessary. Therefore, in this paper we have explored general security threats in wireless sensor network and made an extensive study to categorize available data gathering protocols and analyze possible security threats on them.
23 citations
Cites background from "Adaptive protocols for information ..."
...Protocols that will be classified beneath this class are: Flooding [40], gossip mongering [40], Directed Diffusion [18], SPIN [20], Rumor Routing [21], The Minimum Cost Forwarding Protocol [32], Energy Aware Routing [24] etc. 1) Doable attacks on flat based mostly routing protocols In flat routing nodes got to exchange hullo packets among themselves to get neighbours for charring out digital communication....
[...]
...Existing information gathering protocol may be classified into four totally different classes supported the network structure and protocol operation: flat (Flooding [40], gossip mongering [40], Directed Diffusion [18], Rumor Routing [21], SPIN [20], Energy Aware Routing [24], etc), class-conscious (LEACH [37],PEGASIS[22], TEEN[23], QCCA[4], TREPSI[11], TCDGP[6], APTEEN[25], SOP[26], TTDD[27], etc), location (GAF[33], MECN [41], SMECN[34], GEAR[35], SPAN[28], etc) based mostly routing protocols and network flow or quality of service (QoS) aware routing (SAR[36], CEDAR[42], SPEED[5] etc)....
[...]
...Protocols that will be classified beneath this class are: Flooding [40], gossip mongering [40], Directed Diffusion [18], SPIN [20], Rumor Routing [21], The Minimum Cost Forwarding Protocol [32], Energy Aware Routing [24] etc....
[...]
01 Jan 2005
TL;DR: The proposed new content networks, called semantic content-sensitive networks, offer desirable features such as support for content-proximity searches and the use of small routing tables.
Abstract: In this article we describe a taxonomy for content networks and suggest new architectures for such networks. In recent years, many types of content networks have been developed in various contexts, including peer-to-peer networks [8][12][16][27][31][37][49], cooperative Web caching [3][47], content distribution networks [2][7][10], subscribe-publish networks [6][52], and content-based sensor networks [14][21][22]. For each context, there have been numerous architectural approaches with various design objectives. Our taxonomy attempts to formulate a design space for both existing and future content networks and to identify design points of interest. The proposed new content networks, called semantic content-sensitive networks, offer desirable features such as support for content-proximity searches and the use of small routing tables.
23 citations
Cites background from "Adaptive protocols for information ..."
...Finally, content networks that use content-oblivious placement can be highly fault-tolerant, because the contents and their copies can be placed anywhere and routes to their current locations are learned dynamically....
[...]
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