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: DOlphin and Whale Pod Routing protocol (DOW-PR) and another routing scheme (whale pod) in which multiple sinks are placed at water surface, but one sink is embedded inside the water and is physically connected with the surface sink through high bandwidth connection.
Abstract: Underwater Wireless Sensor Networks (UWSNs) have intrinsic challenges that include long propagation delays, high mobility of sensor nodes due to water currents, Doppler spread, delay variance, multipath, attenuation and geometric spreading. The existing Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) protocol considers the weighting depth of the two hops in order to select the next Potential Forwarding Node (PFN). To improve the performance of WDFAD-DBR, we propose DOlphin and Whale Pod Routing protocol (DOW-PR). In this scheme, we divide the transmission range into a number of transmission power levels and at the same time select the next PFNs from forwarding and suppressed zones. In contrast to WDFAD-DBR, our scheme not only considers the packet upward advancement, but also takes into account the number of suppressed nodes and number of PFNs at the first and second hops. Consequently, reasonable energy reduction is observed while receiving and transmitting packets. Moreover, our scheme also considers the hops count of the PFNs from the sink. In the absence of PFNs, the proposed scheme will select the node from the suppressed region for broadcasting and thus ensures minimum loss of data. Besides this, we also propose another routing scheme (whale pod) in which multiple sinks are placed at water surface, but one sink is embedded inside the water and is physically connected with the surface sink through high bandwidth connection. Simulation results show that the proposed scheme has high Packet Delivery Ratio (PDR), low energy tax, reduced Accumulated Propagation Distance (APD) and increased the network lifetime.
12 citations
Cites background from "Adaptive protocols for information ..."
..., Directed Diffusion [4], Two-Tier Data Dissemination [5], Gradient [6], Rumor routing [7], and Sensor Protocol Information via Negotiation (SPIN) [8], etc....
[...]
...VBF [9] Low Low Fair Fair Low n/a Low HH-VBF [11] Fair Fair Low Fair High n/a Fair ESEVBF [20] High Low High Fair High n/a High FBR [10] Fair High High Fair Fair n/a High DFR [13] Fair Fair Low Fair High n/a Fair Mutipath [15] Fair Fair Low Fair High Low Fair DBR [2] High High Low Fair High Fair High WDFAD [3] High Low Fair Fair High Fair High DOW-PR High Fair High Fair High Fair High Adaptive [7] High Fair Flexible Flexible Flexible n/a Fair ICRP [19] Fair Low Fair Fair Low High Low DUCS [17] Fair Low Fair Fair Low High Low HydroCast [18] High High Fair Fair Fair Fair High MCCP [10] Low Low High Fair Fair High Fair H2-DAB [31] High Fair Fair Fair Fair High Fair n/a: not applicable...
[...]
Dissertation•
04 Nov 2010TL;DR: It has been proved formally and using computer simulation that the RAEED can pacify these DoS attacks and the development of an innovative and simple defence technique with no additional hardware cost for deployment against wormhole and INA attacks.
Abstract: Wireless Sensor Networks (WSNs) have attracted considerable research attention in recent years because of the perceived potential benefits offered by self-organising, multi-hop networks consisting of low-cost and small wireless devices for monitoring or control applications in di±cult environments. WSN may be deployed in hostile or inaccessible environments and are often unattended. These conditions present many challenges in ensuring that WSNs work effectively and survive long enough to fulfil their functionalities. Securing a WSN against any malicious attack is a particular challenge. Due to the limited resources of nodes, traditional routing protocols are not appropriate in WSNs and innovative methods are used to route data from source nodes to sink nodes (base stations). To evaluate the routing protocols against DoS attacks, an innovative design method of combining formal modelling and computer simulations has been proposed. This research has shown that by using formal modelling hidden bugs (e.g. vulnerability to attacks) in routing protocols can be detected automatically. In addition, through a rigorous testing, a new routing protocol, RAEED (Robust formally Analysed protocol for wirEless sEnsor networks Deployment), was developed which is able to operate effectively in the presence of hello flood, rushing, wormhole, black hole, gray hole, sink hole, INA and jamming attacks. It has been proved formally and using computer simulation that the RAEED can pacify these DoS attacks. A second contribution of this thesis relates to the development of a framework to check the vulnerability of different routing protocols against Denial of Service(DoS) attacks. This has allowed us to evaluate formally some existing and known routing protocols against various DoS attacks iand these include TinyOS Beaconing, Authentic TinyOS using uTesla, Rumour Routing, LEACH, Direct Diffusion, INSENS, ARRIVE and ARAN protocols. This has resulted in the development of an innovative and simple defence technique with no additional hardware cost for deployment against wormhole and INA attacks. In the thesis, the detection of weaknesses in INSENS, Arrive and ARAN protocols was also addressed formally. Finally, an e±cient design methodology using a combination of formal modelling and simulation is propose to evaluate the performances of routing protocols against DoS attacks.
12 citations
Cites background or methods from "Adaptive protocols for information ..."
...Flat routing (Flooding [47], Gossiping [48], SPIN [47], TinyOS beaconing protocol [15], Directed Diffusion [42], Rumor routing [39], CADR [49], Energy-aware routing protocol [50], ACQUIRE [51], Gradient-Based Routing [52], SAFE [53], etc)...
[...]
...Models were initially developed and analysed using PROMELA and Spin [47, 196]....
[...]
...Spin [47, 196], Uppaal [197], PRISM [198, 199, 200] allow to verify not only the functional properties of a system (e....
[...]
...Flat routing (Flooding [47], Gossiping [48], SPIN [47], TinyOS beaconing protocol [15], Di- rected Diffusion [42], Rumor routing [39], CADR [49], Energy-aware routing protocol [50], ACQUIRE [51], Gradient-Based Routing [52], SAFE [53], etc) 2....
[...]
TL;DR: This article describes three types of results: self-organizing and distributed methods for maintaining and collecting data (using the concept of Hovering Data Clouds); adaptive data dissemination for traffic information systems; and methods for self-recognition of traffic jams.
Abstract: In recent years, tremendous progress has been made in understanding the dynamics of vehicle traffic flow and traffic congestion by interpreting traffic as a multiparticle system This helps to explain the onset and persistence of many undesired phenomena, for example, traffic jams It also reflects the apparent helplessness of drivers in traffic, who feel like passive particles that are pushed around by exterior forces; one of the crucial aspects is the inability to communicate and coordinate with other traffic participantsWe present distributed methods for solving these fundamental problems, employing modern wireless, ad-hoc, multi-hop networks The underlying idea is to use these capabilities as the basis for self-organizing methods for coordinating data collection and processing, recognizing traffic phenomena, and changing their structure by coordinated behavior The overall objective is a multi-level approach that reaches from protocols for local wireless communication, data dissemination, pattern recognition, over hierarchical structuring and coordinated behavior, all the way to large-scale traffic regulationIn this article, we describe three types of results: (i) self-organizing and distributed methods for maintaining and collecting data (using our concept of Hovering Data Clouds); (ii) adaptive data dissemination for traffic information systems; (iii) methods for self-recognition of traffic jams We conclude by describing higher-level aspects of our work
12 citations
Journal Article•
TL;DR: An inclusive review and present classification on the current routing sensor protoc ols, which are particularly designed for wireless sensor networks, and contrast and review the state-of-the-art m ultipath routing protocols that based on energy aware method, fault tolerance and QoS multipath routing.
Abstract: A sensor network basically comprises of low cost se nsor nodes which gather data from the environment a nd transmit them to sink, where they will be afterward processed. Owing to the high density of sensor nod es and restricted communication range, packet forwardi ng in sensor networks is regularly achieved through out the multi-hop data transmission. Consequently, rout ing in wireless sensor networks has been counted a significant field of research over the past decade. Thus, we present an inclusive review and present classification on the current routing sensor protoc ols, which are particularly designed for wireless s ensor networks. We emphasize the main motivation behind the development of each routing protocol category and clarify the operation of different protocols in detail related to energy issues, with emphasis on their advantages and disadvantages. Moreover, the current multipath routing approach is broadly used in wire less sensor networks in order to improve network performance such as load balancing, reliability, fault tolerance, bandwidth aggregation and QoS Improvement. Therefore, in this paper we highlight the notion of the multipath routing approach and its essential ch allenges, additionally the basic motivations for ut ilizing this technique in wireless sensor networks. In addi tion, we contrast and review the state-of-the-art m ultipath routing protocols that based on energy aware method , fault tolerance and QoS multipath routing. At the end of this paper, a characterized comparison has been forwarded on these methods based on the analysis outcome.
12 citations
Cites background from "Adaptive protocols for information ..."
...The rationale behind the designing of SPIN is the distribution of data of one sensor to every sensor node by predicting the sensor nodes are supposed to be base stations, thus preventing duplicate data and redundant data from being transmitted to next sensor or to the base stations by performing a sequences of negotiation messages before the real data transmission begins [55]....
[...]
TL;DR: A Materialized In-Network View (MINV) framework is proposed that precalculates aggregated data from clusters of sensor nodes as intermediate query results preserved in the network and made ready for queries, thus prolonging the lifetime of a sensor network.
Abstract: Wireless sensor networks composed of battery-powered sensor nodes are invaluable instruments for remote environment sensing. For sensor network applications, sensed readings are often collected in the form of aggregated data from a portion of a sensor network as requested by spatial aggregation queries. In a large distributed sensor network, queries can be issued from various locations at any time. Existing in-network query execution techniques execute queries independently that considerably overconsumes the precious energy of sensor nodes. As a result, the lifespan of a sensor network is inevitably shortened. In this paper, we propose a Materialized In-Network View (MINV) framework that precalculates aggregated data from clusters of sensor nodes as intermediate query results preserved in the network and made ready for queries. The executions of queries are performed as simple collections of these aggregated data. Thus, the quantities and sizes of messages transmitted among sensor nodes can be greatly reduced, thus prolonging the lifetime of a sensor network. Through extensive simulations, the effectiveness of our proposed framework is validated.
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