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
27 Feb 2009
TL;DR: It is proved that under the formal security framework proposed by Acs et al, by using a mathematically rigorous proof technique, S-SPIN is secure if the MAC scheme is secure against existential forgery attack.
Abstract: In this paper, we present a provably secure routing protocol for wireless sensor networks, called S-SPIN (Secure-SPIN), that is a security extension of SPIN. The MAC scheme is introduced to guarantee the correctness and integrity of the messages. And we prove that under the formal security framework proposed by Acs et al, by using a mathematically rigorous proof technique, S-SPIN is secure if the MAC scheme is secure against existential forgery attack.
17 citations
Cites background from "Adaptive protocols for information ..."
...B. SPIN Routing Protocol SPIN (Sensor Protocols for Information via Negotiation) is a family of adaptive protocols, which efficiently disseminates information in an energy-constrained wireless sensor network....
[...]
...SPIN (Sensor Protocols for Information via Negotiation) [5, 6] is a family of negotiation-based information dissemination protocols....
[...]
01 Jan 2003
TL;DR: An energy dissipation model is presented that is used to simulate the behavior of a sensor node in terms of energy consumption and the performance of the prediction-based approaches with a naive one in which no prediction is used.
Abstract: The key challenge in the design of wireless sensor networks is maximizing their lifetime. The information about the amount of available energy in each part of the network is called the energy map and can be useful to increase the lifetime of the network. In this paper, we address the problem of constructing the energy map of a wireless sensor network using prediction-based approaches. We also present an energy dissipation model that is used to simulate the behavior of a sensor node in terms of energy consumption. Simulation results compare the performance of the prediction-based approaches with a naive one in which no prediction is used. The results show that the prediction-based approaches outperform the naive in a variety of parameters. Resumo. O maior desafio enfrentado no projeto de redes de sensores sem fio e maximizar o seu tempo de vida. A informacao sobre a quantidade de energia disponivel em cada parte da rede e chamada de mapa de energia e este mapa pode ser util para maximizar o tempo de vida da rede. Neste artigo, e avaliado o problema da construcao do mapa de energia para redes de sensores sem fio utilizando abordagens baseadas em predicao. Um modelo de dissipacao de energia tambem e apresentado e utilizado para simular o comportamento de um nodo sensor em termos do consumo de energia. Resultados de simulacao comparam o desempenho das abordagens baseadas em predicao com uma abordagem simples na qual nenhuma predicao e utilizada. Os resultados mostram que para uma variedade de parâmetros, as abordagens baseadas em predicao sao mais eficazes que as abordagens simples.
17 citations
Additional excerpts
...In [ Heinzelman et al., 1999 ] and [Kulik et al., 1999], it is presented a family of adaptive protocols, called SPIN (Sensor Protocols for Information via Negotiation), that efficiently disseminates information among sensors in an energyconstrained wireless sensor network....
[...]
TL;DR: Simulation results demonstrate that the proposed energy-efficient, constant-time, randomized scheme, called Coverage-Adaptive raNdom SEnsor sElection (CANSEE), leads to a significant conservation of energy with a small trade-off between coverage and data reporting latency, yet providing the required data reporting capability.
Abstract: In wireless sensor networks, different applications feature different requirements in terms of such performance metrics as sensing coverage and data reporting latency. In most applications, it is usually sufficient to provide a Desired Sensing Coverage (DSC) lower than full coverage at any instance with the guarantee that the whole area will eventually be covered within a specified delay bound. Due to the fact that these applications are also expected to run for longer periods of time and at the same time battery recharging and replacement are costly, energy consumption in wireless sensor networks should be minimized while achieving the application goals. In this article, we propose a novel framework for application-specific data gathering which exploits a trade-off between coverage and latency, thereby minimizing energy consumption and extending the network lifetime. The proposed energy-efficient, constant-time, randomized scheme, called Coverage-Adaptive raNdom SEnsor sElection (CANSEE), selects a subset of k sensors to report at each round so as to fulfill the application-specific requirement of desired sensing coverage and bounded latency, instead of always guaranteeing full coverage and minimum latency. We present a probabilistic model to estimate: (i) the connectivity of those selected k sensors and the number of additional sensors needed to guarantee connectivity; (ii) a lower bound on k in each round; and (iii) the probability of almost surely having k data reporters using the Chernoff bound. The immediate event detection capability achieved by the proposed CANSEE scheme is also analyzed to compare the performance of our framework with other data gathering schemes that allow 100p coverage. Simulation results demonstrate that our framework leads to a significant conservation of energy (and thus extended network lifetime) with a small trade-off between coverage and data reporting latency, yet providing the required data reporting capability.
17 citations
Journal Article•
TL;DR: This paper has made an attempt to verify the inherent properties of two existing clustering routing protocols such as LEACH and LEACH-C in depth by using NetSim Simulator.
Abstract: The tremendous growth of Wireless Sensor Network (WSN) in various applications such as military, defence, civil, health care, agriculture etc. has created a lot of interest among the research community for past few years. WSNs have several characteristics and constraints. Routing, Fusion, Localization is the key factors and very crucial issues that need to be considered due to the severe energy constraints. So, efficient energy management is the biggest challenge for the enhancement of the network lifetime. Many studies have been proven to extend the lifetime of the WSN. Among these, clustering based routing protocols have achieved a significant position to utilize the energy efficiently and effectively. LEACH is the most fundamental clustering based energy efficient distributed routing protocol that provides a long platform to the researchers to compare, extend, modify, analyse with other clustering routing protocols. LEACH-C is another centralized cluster-based routing protocol which is closely related to LEACH protocol. Even though few articles present the comparison result of these two protocols briefly using NS-2 Simulator, as of our knowledge, it has not been analysed more with NetSim Simulator. So, in this paper, we have made an attempt to verify the inherent properties of two existing clustering routing protocols such as LEACH and LEACH-C in depth by using NetSim Simulator.
17 citations
TL;DR: The BSC-MAC protocol presents an adaptive approach for energy efficiency and determines the nodes on the network as root and source nodes and manages a sleep schedule according to these structures.
17 citations
Cites background from "Adaptive protocols for information ..."
...Therefore SPIN encounters possible problems in flooding and produces a solution for them [8]....
[...]
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