scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Adaptive protocols for information dissemination in wireless sensor networks

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.

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI
30 Nov 2006
TL;DR: This paper presents partial network coding (PNC) as a generic tool for wireless sensor networks, and proves that the performance of PNC is quite close to NC, except for a sub-linear overhead on storage and communications.
Abstract: Wireless sensor networks have been widely used for surveillance in harsh environments. In many such applications, the environmental data are continuously sensed, and data collection by a server is only performed occasionally. Hence, the sensor nodes have to temporarily store the data, and provide easy and on-hand access for the most updated data when the server approaches. Given the expensive server-to-sensor communications, the large amount of sensors and the limited storage space at each tiny sensor, continuous data collection becomes a challenging problem. In this paper, we present partial network coding (PNC) as a generic tool for the above applications. PNC generalizes the existing network coding (NC) paradigm, an elegant solution for ubiquitous data distribution and collection. Yet, PNC enables efficient storage replacement for continuous data, which is a major deficiency of the conventional NC. We prove that the performance of PNC is quite close to NC, except for a sub-linear overhead on storage and communications. We then address a set of practical concerns toward PNC-based continuous data collection in sensor networks. Its feasibility and superiority are further demonstrated through simulation results.

89 citations

Journal ArticleDOI
TL;DR: This paper proposes a general framework based on the principles of epidemic theory, for vulnerability analysis of current broadcast protocols in wireless sensor networks, and develops a common mathematical model for the propagation that incorporates important parameters derived from the communication patterns of the protocol under test.
Abstract: While multi-hop broadcast protocols, such as Trickle, Deluge and MNP, have gained tremendous popularity as a means for fast and convenient propagation of data/code in large scale wireless sensor networks, they can, unfortunately, serve as potential platforms for virus spreading if the security is breached. To understand the vulnerability of such protocols and design defense mechanisms against piggy-backed virus attacks, it is critical to investigate the propagation process of these protocols in terms of their speed and reachability. In this paper, we propose a general framework based on the principles of epidemic theory, for vulnerability analysis of current broadcast protocols in wireless sensor networks. In particular, we develop a common mathematical model for the propagation that incorporates important parameters derived from the communication patterns of the protocol under test. Based on this model, we analyze the propagation rate and the extent of spread of a malware over typical broadcast protocols proposed in the literature. The overall result is an approximate but convenient tool to characterize a broadcast protocol in terms of its vulnerability to malware propagation. We have also performed extensive simulations which have validated our model.

89 citations


Additional excerpts

  • ...Ç...

    [...]

Journal ArticleDOI
01 Mar 2004
TL;DR: This work proposes an energy-efficient level-based hierarchical system that compromises between the energy consumption and shortest path route by utilizing number of neighbors of a sensor and its level in the hierarchical clustering.
Abstract: In a distributed sensor network, large number of sensors deployed which communicate among themselves to self-organize a wireless ad hoc network. We propose an energy-efficient level-based hierarchical system. We compromise between the energy consumption and shortest path route by utilizing number of neighbors (NBR) of a sensor and its level in the hierarchical clustering. In addition, we design a Secure Routing Protocol for Sensor Networks (SRPSN) to safeguard the data packet passing on the sensor networks under different types of attacks. We build the secure route from the source node to sink node. The sink node is guaranteed to receive correct information using our SRPSN. We also propose a group key management scheme, which contains group communication policies, group membership requirements and an algorithm for generating a distributed group key for secure communication.

88 citations


Cites background from "Adaptive protocols for information ..."

  • ...Sensors in the field form clusters to reduce the consumption of the energy in the network [7, 11]....

    [...]

  • ...This concern is due to the fact that sensor nodes are vulnerable to energy depletion [5, 6, 7], intrusions and attacks [5, 8] and node and link failures [1, 3]....

    [...]

Journal ArticleDOI
TL;DR: This paper proposes to reduce the communication overhead of broadcasting algorithm for one-to-one model by applying the concepts of planar graphs such as RNG (relative neighborhood graphs) and connected dominating sets determined by internal nodes.
Abstract: In a multihop wireless network, each node has a transmission radius and is able to send a message to one of its neighbors (one-to-one) or all of its neighbors (one-to-all) that are located within the radius. In a broadcasting task, a source node needs to send the same message to all the nodes in the network. In this paper, we propose to reduce the communication overhead of broadcasting algorithm for one-to-one model by applying the concepts of planar graphs such as RNG (relative neighborhood graphs) and connected dominating sets determined by internal nodes. Regular message exchanges between neighbors, which include location updates or signal strengths, suffice to maintain these structures, and they therefore do not impose additional communication overhead. In internal node based broadcasting, messages are forwarded on the edges that connect two internal nodes, and on edges that connect each non-internal node with its closest internal node. A neighbor elimination scheme is added to the internal node concept, to improve its performance. Similarly, only edges in a planar subgraph may be used for retransmissions. The reduction in communication overhead for broadcasting task, with respect to existing methods, is measured experimentally. The number of retransmissions is reduced to about 50% for sparse networks and to about 5% for dense networks, and the overhead with respect to ideal solution is up to 20% (for 100 nodes).

87 citations

Journal ArticleDOI
28 Apr 2015-Sensors
TL;DR: This paper proposes a multi-agent framework that enables each sensor node to build a cooperative neighbour set based on past routing experience and can be used to assist many existing routing approaches to improve their routing performance.
Abstract: Wireless sensor networks (WSNs) have been widely investigated in recent years. One of the fundamental issues in WSNs is packet routing, because in many application domains, packets have to be routed from source nodes to destination nodes as soon and as energy efficiently as possible. To address this issue, a large number of routing approaches have been proposed. Although every existing routing approach has advantages, they also have some disadvantages. In this paper, a multi-agent framework is proposed that can assist existing routing approaches to improve their routing performance. This framework enables each sensor node to build a cooperative neighbour set based on past routing experience. Such cooperative neighbours, in turn, can help the sensor to effectively relay packets in the future. This framework is independent of existing routing approaches and can be used to assist many existing routing approaches. Simulation results demonstrate the good performance of this framework in terms of four metrics: average delivery latency, successful delivery ratio, number of live nodes and total sensing coverage.

86 citations


Cites background from "Adaptive protocols for information ..."

  • ...[12,13] proposed a family of adaptive protocols, called sensor protocols for information via negotiation (SPIN)....

    [...]

References
More filters
Proceedings ArticleDOI
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

Proceedings ArticleDOI
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]....

    [...]

Proceedings ArticleDOI
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]....

    [...]

Proceedings ArticleDOI
01 Dec 1987
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....

    [...]

Journal ArticleDOI
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