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
Journal Article•
TL;DR: A low-energy, distributed, and concentric-zone-based data query mechanism that takes advantages of hierarchical ad hoc routing algorithms to enable a medical specialist to collect physiological data from mobile and/or remote patients and a transmission scheme among different zones with balance-based energy efficiency, which can extend network lifetime.
Abstract: In this paper, we use an integrated architecture that takes advantage of the low cost mobile sensor networks and 3G cellular networks to accommodate multimedia medical calls with differentiated Quality-of-Service (QoS) requirements. We propose a low-energy, distributed, and concentric-zone-based data query mechanism that takes advantages of hierarchical ad hoc routing algorithms to enable a medical specialist to collect physiological data from mobile and/or remote patients. The medical specialist uses cellular network to report patients' data to the medical center. Moreover, we propose a transmission scheme among different zones with balance-based energy efficiency, which can extend network lifetime. We evaluate the validity of our proposals through simulations and analyze their performance. Our results clearly indicate the energy efficiency of the proposed sensor network query algorithms and the efficiency of our multiclass medical call admission control scheme in terms of meeting the multimedia telemedicine QoS requirements.
31 citations
15 May 2009
TL;DR: An Agent Based Multipath Routing (ABMR) algorithm for wireless sensor network is proposed and is compared to non-agent based algorithm (NABMR) as well as to one of the recent multipath routing algorithm through an extensive set of experiments to show the effectiveness.
Abstract: Recently, mobile agents have been used to solve many problems in wireless sensor networks. They are usually transferred from a node to another to aggregate the sensed data and simplify the complexity of the routing algorithms. Intelligent agents can reduce the communication cost over a very low bandwidth links among the sensors. In this paper, we propose an Agent Based Multipath Routing (ABMR) algorithm for wireless sensor network. The algorithm considers many of the sensors and the monitored field parameters such as energy, reliability, and number of hops, as well as the data importance. The algorithm builds a reliable multiple paths from the source to the destination. The number of paths is selected based on the importance of the sensed data. Intelligent agents are designed to construct the multipath as well as to send the sensed data to its destination. To show the effectiveness of the proposed algorithm, ABMR is compared to non-agent based algorithm (NABMR) as well as to one of the recent multipath routing algorithm through an extensive set of experiments.
31 citations
Cites background from "Adaptive protocols for information ..."
...In sensor networks, nodes might be scheduled to go sleep mode; therefore, in order to keep the selected routes alive without any disconnectivity, a selected node is notified to stay awake till the end of the sending period....
[...]
08 Oct 2007
TL;DR: The hybrid clustering approach is an energy-efficient method that realizes consistent and balanced energy consumption in each node of a generated cluster to prevent repetitious set-up processes as in the LEACH method.
Abstract: The routing methods which used in the wireless sensor network deal with the clustering method to diminish the amount of data transmission from the energy efficiency view. However, the clustering methods cause several problems in energy consumption at the cluster head node. Dynamic clustering is a method which used to supplement a high energy consumption problem by distributing energy consumption through the re-selection of the cluster head node. But, this method changes cluster structure every time the cluster head node is re-selected, which causes energy consumption. Namely, the dynamic clustering method approaches examined in previous researches involve the repetitive processes of cluster head node selection. This consumes a high amount of energy during the set-up process of cluster generation. Consequently, this paper proposes the hybrid clustering method that fixes the cluster and selects the head node in a round-robin method. The hybrid clustering approach is an energy-efficient method that realizes consistent and balanced energy consumption in each node of a generated cluster to prevent repetitious set-up processes as in the LEACH method. The propriety of the proposed method is substantiated with a simulation experiment.
31 citations
TL;DR: This research proposes a sensor network middleware structure that automated production systems require that supports optimal or near-optimal multi-sensor deployment scheme and provides solutions for geometry-specific wireless microsensors deployment design.
31 citations
TL;DR: These protocols are the first reliable broadcasting protocols, other than blind flooding, based on covering three projections, covering particular points on intersection circles and covering intersection points of three spheres.
Abstract: We consider the broadcasting problem in sensor networks where the nodes have no prior knowledge of their neighbourhood. We describe several Area-based Beaconless Broadcasting Algorithms (ABBAs). In 2D, on receiving the packet (together with geographic coordinates of the sender), each node calculates the ratio P of its perimeter, along the circle of transmission radius, that is not covered by this and previous transmissions of the same packet. The node then sets or updates its timeout to be inversely proportional to P. If the perimeter becomes fully covered, the node cancels retransmissions. Otherwise, it retransmits at the end of the timeout interval. The protocol is reliable, that is, all nodes, connected to the source, are guaranteed to receive the packet, assuming an ideal MAC layer. We also describe three 3D-ABBAs, one of them being reliable. These three protocols are based on covering three projections, covering particular points on intersection circles and covering intersection points of three spheres. Our protocols are the first reliable broadcasting protocols, other than blind flooding.
31 citations
Cites methods from "Adaptive protocols for information ..."
...The method disseminates information quickly in a network with enough bandwidth and no loss prone links (Heinzelman et al., 1999)....
[...]
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