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
25 Nov 2009
TL;DR: It is shown that it is possible to control data freshness without increasing overhead, and quantify the importance of topology in achieving timely dissemination.
Abstract: Epidemic-based communications, or 'gossiping', provides a robust and scalable method for maintaining a knowledge base in a sensor network faced with an unpredictable network environment. Since sensed information is often periodic in time, protocols should be able to manage multiple messages in an efficient way. We describe a mathematical model of gossiping dealing with multiple messages. We present simulation results that suggest the model can provide insights into the design and optimisation of sensor networks in the case of dissemination of periodically generated data. We show that it is possible to control data freshness without increasing overhead, and quantify the importance of topology in achieving timely dissemination.
12 citations
Cites background from "Adaptive protocols for information ..."
...Now the goal is not to understand the spreading of a disease, nor to elaborate strategies of preventing an outbreak; on the contrary, the aim is to obtain a high fraction of recovered nodes at the end of the process, possibly with a minimum amount of traffic....
[...]
06 Mar 2009
TL;DR: This work designs a congestion control mechanism at the source which reacts based on the sum of the node weights at each node, and shows that the protocol achieves congestion control along with energy saving.
Abstract: An efficient reliable sensor-to-sink data transport protocol will ensure that the sink can collect enough information and minimize energy consumption of data transport. It should be designed to adjust the reporting rates of sources and adapting to wireless communication conditions. We design a congestion control mechanism at the source which reacts based on the sum of the node weights at each node. In this scheme, each node passes its calculated weight upstream. Each node adds its current weight to that it received from a downstream node, and passes this information toward the upstream node. At the end, the source will receive the sum of all weight information from the corresponding downstream nodes and use the it for controlling rates. Each sensor node transmits the data with the adjusted rate. The sink node receives the time series for each sensor node. After collecting enough data, the sink node uses a clustering algorithm to partition sensor nodes according to the sending rates and similarity of data obtained. Then it sends out the cluster information to all sensor nodes and requires the sensor nodes within the same cluster to work alternatively to save energy. The nodes within a cluster adaptively enters into energy saving mode according to a random schedule. By simulation results, we show that our protocol achieves congestion control along with energy saving.
12 citations
01 Jan 2006
12 citations
07 May 2010
TL;DR: This paper with a routing algorithm to determine the optimal path of energy consumption viewpoint for information transfer from sensor nodes to base station with the data transmission is presented and multi-skip is presented.
Abstract: Sensor networks are composed of many sensors usually far from the region is available. Routing in wireless sensor networks for the transfer of information from sensor nodes to base station is especially important. Optimum consumption of energy is important requirements in wireless sensor networks because sensor systems typically use battery power. In this paper with a routing algorithm to determine the optimal path of energy consumption viewpoint for information transfer from sensor nodes to base station with the data transmission we have presented multi-skip. In this algorithm when a sensor felt event, the node that was in transmission radius of sensor and it had minimum distance to the main station as next step is selected and send to only one node is selected. Finally, the proposed algorithm compare with Gossiping and LGossiping algorithms as simulation results show the proposed algorithm has better performance.
12 citations
Cites background from "Adaptive protocols for information ..."
...Two sensors cover an overlapping geographic region and C gets same copy of data form these sensors [8]....
[...]
...However, this cause delays in propagation of data through the nodes [8]....
[...]
...Although flooding is very easy to implement, it has several drawbacks illustrated in figures 1 and 2 redrawn from [8]....
[...]
...Such drawbacks include implosion caused by duplicated messages sent to same node, overlap when two nodes sensing the same region send similar packets to the same neighbor and resource blindness by consuming large amount of energy without consideration for the energy constraints [8]....
[...]
01 Dec 2009
TL;DR: A Chain-based Fast Data Aggregation Algorithm Based on Suppositional Cells (CFDASC) is proposed, which attributed each node to one suppositional cell according to the node location information and accelerates the data aggregation process.
Abstract: It is important to gather sensed information with an energy efficient method in sensor networks Although data collection may save energy and improve information accuracy, it must get this at the cost of decreasing other performances, such as the delay increment This paper proposes a Chain-based Fast Data Aggregation Algorithm Based on Suppositional Cells (CFDASC) to solve this problem In this algorithm, we attributed each node to one suppositional cell according to the node location information The nodes which are in one suppositional cell act as the cluster head of data collection in turn, then the head gathers and transmits data along the cells chain to the sink node As a result, it accelerates the data aggregation process Simulation results also show that CFDASC algorithm performs better than PEGASIS algorithm by 5003% in average packet transmission delay, and takes the cost of tiny energy increment, only 607% than that in PEGASIS
12 citations
Cites methods from "Adaptive protocols for information ..."
...First kind is the routing protocol based on the inquiring, such as Directed Diffusion [2], Rumor Routing Protocol [3], SPIN [4] and etc....
[...]
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