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
Patent•
13 Nov 2007TL;DR: In this article, an Internet Protocol (IP) router receives sensor data from at least one of a second IP router or an attached host sensor node, the sensor data distinct from link data of a network link.
Abstract: In one embodiment, a method comprises an Internet Protocol (IP) router receiving sensor data from at least one of a second IP router or an attached host sensor node, the sensor data distinct from link data of a network link; the IP router generating sensor information based on storing the sensor data with metadata describing reception of the sensor data by the IP router in a routing information base; and the IP router executing a routing operation based on the sensor information stored in the routing information base.
29 citations
01 Jan 2008
TL;DR: An Extended Internet Architecture for Low-Power Wireless Networks Design and Implementation and an extended Internet architecture for low- power wireless networks design and implementation are presented.
Abstract: An Extended Internet Architecture for Low-Power Wireless Networks Design and Implementation
29 citations
Cites background or methods from "Adaptive protocols for information ..."
...Alternative efforts rely on simple local rules, using probabilistic [107, 151] or adaptive [71] mechanisms to adjust transmission rates and suppress duplicates....
[...]
...Others protocols rely on probabilistic [107, 151] and adaptive [71] methods to avoid maintaining a forwarding topology....
[...]
15 Jun 2010
TL;DR: The formal model generates the trace to confirm how an attack is possible in the protocol, and it was found that INA attacks are addressed by Arrive protocol, which contradicts the claim of the developers of Arrive that it is immune to black hole attacks.
Abstract: Because of their low cost, small size, low resources and self-organizing nature a Wireless Sensor Network (WSN) is a potential solution in hostile environments including military applications. However, the broadcasting nature of radio transmission; their limited computing, power and communication resources; unattended and potentially hostile nature of the environment they operate in make WSNs prone to Denial of Service (DoS) attacks. Although many schemes have been proposed to address DoS attacks their effectiveness is yet to be proven. The traditional methods used (i.e. visual inspection, computer simulations and hardware implementations) can only detect errors but cannot verify that the whole system is error free. Therefore, new techniques to automatically determine the worst cases and hidden errors in WSNs are much desired. After an initial investigation using a formal verification which clearly shows that Arrive routing protocol is vulnerable to different DoS attacks, this paper proposes a method for its security. The finding contradicts the claim of the developers of Arrive that it is immune to black hole attacks. Several other DoS attacks were also found to be successful in Arrive routing protocol. The formal model generates the trace to confirm how an attack is possible in the protocol. However, it was found that INA attacks are addressed by Arrive protocol. To our best knowledge the results discussed in this paper have not been presented, proved or published before.
29 citations
Cites background or methods from "Adaptive protocols for information ..."
...However, in this paper UPPAAL [2] is used instead of Spin [5] for the modeling the protocol....
[...]
...The most noteworthy work is presented in [1] where the authors used Spin [5] to analyze the effect of some DoS attacks on ad-hoc routing protocols based on Dynamic Source Routing (Ardiadne and endairA)....
[...]
...For example, [12] discovered faults in TinySec and LEAP protocols; the formal analysis in [11] showed successful attacks in SNEP (SPINS) [9]; the work on [4] developed a new approach (Sledge method) based on Spin [5] and verified μTESLA [9] and LEAP [14] using this method....
[...]
TL;DR: A distance-based and low-energy adaptive clustering protocol to streamline the green issue of efficient energy utilization in WSNs and enhance the proposed protocol into the multi-hop-DISCPLN protocol to increase the lifetime of the network in terms of high throughput with minimum delay time and packet loss.
Abstract: A wireless sensor network (WSN) comprises small sensor nodes with limited energy capabilities. The power constraints of WSNs necessitate efficient energy utilization to extend the overall network lifetime of these networks. We propose a distance-based and low-energy adaptive clustering (DISCPLN) protocol to streamline the green issue of efficient energy utilization in WSNs. We also enhance our proposed protocol into the multi-hop-DISCPLN protocol to increase the lifetime of the network in terms of high throughput with minimum delay time and packet loss. We also propose the mobile-DISCPLN protocol to maintain the stability of the network. The modelling and comparison of these protocols with their corresponding benchmarks exhibit promising results.
29 citations
11 Mar 2011
TL;DR: Simulation result indicates that the algorithm effectively balances the network energy comsuption and prolongs the network life cycle compared with LEACH and PARA.
Abstract: In order to make good use of the limited energy, ant colony optimization (ACO) was applied to inter-cluster routing mechanism. An uneven clustering routing algorithm for Wireless Sensor Networks (WSNs) based on ant colony optimization (ACO) was proposed. The algorithm utilized the dynamic adaptability and optimization capabilities of the ant colony to get the optimum route between the cluster head. Meanwhile, it organized different cluter in different size based on the distance between cluster heads and sink node, and cluters closter to sink had smaller sizes than those farther away from the sink, thus the closer cluster heads could preserve energy for the inter-cluster data forwarding. Simulation result indicates that the algorithm effectively balances the network energy comsuption and prolongs the network life cycle compared with LEACH and PARA.
29 citations
Cites background or methods from "Adaptive protocols for information ..."
...One pioneering work in the literature is LEACH (LowEnergy Adaptive Clustering Hierarchy) [3], LEACH is an application specific data dissemination protocol that uses clustering to prolong the network lifetime....
[...]
...In this paper, we use the same energy model with paper[3], and wireless transmitter module can control the size of the transmit power, according to the distance between the nodes....
[...]
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