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
05 Jul 2008
TL;DR: Both general and routing-specific constraints and requirements that have to be satisfied during the design of wireless sensor networks are presented and the need for emergence of efficient protocols, especially those related to network layer, is stressed.
Abstract: In this paper, both general and routing-specific constraints and requirements that have to be satisfied during the design of wireless sensor networks are presented. The need for emergence of efficient protocols, especially those related to network layer, is stressed. A classification of the state-of-the-art routing techniques is also presented along with a benchmarking evaluation in terms of power requirements and range enhancement for ldquoruggedrdquo wireless sensor networks.
12 citations
Cites background from "Adaptive protocols for information ..."
...Improved sensing accuracy by distributed processing of large quantities of sensing information is also feasible through multi-hop communication [4]....
[...]
01 Jan 2012
TL;DR: A set of heuristics for automating the addition of recovery actions to distributed protocols on various network topologies is developed and it turns out that local reasoning about deadlocks and livelocks is possible for an interesting class of protocols whose proof of stabilization is otherwise complex.
Abstract: Self-stabilization is a property of a distributed system such that, regardless of the legitimacy of its current state, the system behavior shall eventually reach a legitimate state and shall remain legitimate thereafter. The elegance of self-stabilization stems from the fact that it distinguishes distributed systems by a strong fault tolerance property against arbitrary state perturbations. The difficulty of designing and reasoning about self-stabilization has been witnessed by many researchers; most of the existing techniques for the verification and design of self-stabilization are either brute-force, or adopt manual approaches non-amenable to automation.
In this dissertation, we first investigate the possibility of automatically designing self-stabilization through global state space exploration. In particular, we develop a set of heuristics for automating the addition of recovery actions to distributed protocols on various network topologies. Our heuristics equally exploit the computational power of a single workstation and the available parallelism on computer clusters. We obtain existing and new stabilizing solutions for classical protocols like maximal matching, ring coloring, mutual exclusion, leader election and agreement.
Second, we consider a foundation for local reasoning about self-stabilization; i.e., study the global behavior of the distributed system by exploring the state space of just one of its components. It turns out that local reasoning about deadlocks and livelocks is possible for an interesting class of protocols whose proof of stabilization is otherwise complex. In particular, we provide necessary and sufficient conditions — verifiable in the local state space of every process — for global deadlock- and livelock-freedom of protocols on ring topologies. Local reasoning potentially circumvents two fundamental problems that complicate the automated design and verification of distributed protocols: (1) state explosion and (2) partial state information. Moreover, local proofs of convergence are independent of the number of processes in the network, thereby enabling our assertions about deadlocks and livelocks to apply on rings of arbitrary sizes without worrying about state explosion.
12 citations
01 Jan 2002
TL;DR: This work proposes a new conceptual approach to minimize the communication and Therefore, the overall energy consumption by separating the traditionally used radio in sensor nodes into two radios: control radio and data radio.
Abstract: Wireless sensor networks (WSNs) are networked embedded systems where each unit generally consists of the following six components: sensors, memory, power supply, processor, communication unit, and actuators. WSNs will provide the bridge between the Internet and the physical world due to their ability to observing and controlling the physical world in real-time. Since most of the current WSNs use batteries as their energy source, energy consumption is the main design and operational constraint of sensor networks. Specifically, energy consumed by communication equipment is the dominating component of energy consumption. In order to address this problem, we propose a new conceptual approach to minimize the communication and Therefore, the overall energy consumption by separating the traditionally used radio in sensor nodes into two radios: control radio and data radio. Control radio is used for frequent, low volume, short packet communication and to coordinate operation of data radios. Data radio is used for high latency, high volume, and large packet sensor data transmission. The preliminary studies show the high potential effectiveness of the approach.
12 citations
21 Mar 2004
TL;DR: Analysis of performance variation and measuring the after-effects of the threats to a sensor network i.e. threat of node failures, attack on nodes etc show that robustness and fault-tolerance of the sensor network topologies comes as a trade-off with the vulnerability of the network topology to various threats.
Abstract: Current security mechanisms in ad-hoc sensor networks do not guarantee reliable and robust network functionality. Even with these mechanisms, the sensor nodes could be made nonoperational by malicious attackers or physical break-down of the infrastructure. Measurement of the network characteristics in a 'threat' of network failure is essential to understand the behavior of these networks. The two main contributions of this paper are the analysis of performance variation and measuring the after-effects of the threats to a sensor network i.e. threat of node failures, attack on nodes etc. Two metrics, connectivity cost and dis-connectivity co-efficient; the former studies the variation in performance when a network topology is subject to different threats, while the later measures the impact of the threat(s) on the sensor network. Simulations are performed on dynamic network models vulnerable to adversarial and non-adversarial threats as in any practical deployment scenario. Results show that robustness and fault-tolerance of the sensor network topologies comes as a trade-off with the vulnerability of the network topologies to various threats.
12 citations
Cites background from "Adaptive protocols for information ..."
...Hence the primary goal of protocol designers has been to develop energy-efficient protocols [2], [5], [ 6 ], [7]....
[...]
...Like many cluster topologies [5],[ 6 ], the cluster-heads are dynamically rotated to increase the average lifetime of the network....
[...]
...Some details on clustered topologies can be found in [5], [ 6 ]....
[...]
...These metrics are analyzed for node failures in the two most common kinds of network models, the clustered topology [5],[ 6 ] and unclustered topology [2]....
[...]
04 May 2008
TL;DR: The paper presents a ready-to-use security assessment framework for wireless sensor networks (WSNs) that uses actual responses of the entities to assign numerical values for security assessment of WSNs.
Abstract: The paper presents a ready-to-use security assessment framework for wireless sensor networks (WSNs). The parameters in the proposed security assessment framework perform independent security assessment of WSNs and of their applications. Our proposed framework uses actual responses of the entities (such as nodes, communication link and network response) to assign numerical values for security assessment of WSNs. The method for calculating the optimal values for each security parameter of the framework is also discussed. Our proposed framework is designed to avoid unwanted impacts of the complexities of security algorithms, communication protocols and strong cryptography. Usually, the complexity of algorithms disguises the actual assessment of the WSN, but the independence of the proposed framework from these security-disguising objects makes this framework better than other assessment frameworks in terms of scalability.
12 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