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
15 May 2009
TL;DR: A new cluster-based method is proposed that can reduce the average energy consumption in each round using a new method for data packet transmission to BS through the following modifications.
Abstract: Wireless Sensor Networks (WSN) are set of thousands or more micro sensor nodes that one of the most important constraints of them is their limited energy. Since these nodes have very small dimensions, so their needed energy is provided by small and limited energy batteries. Therefore, the problem of energy reduction will be one of the biggest challenges in these networks. In this paper, we will propose a new cluster-based method that can reduce the average energy consumption in each round using a new method for data packet transmission to BS . In this method, all normal nodes and all cluster heads (CHs) use a tree structure for transmit their data packets toward the cluster heads and BS respectively. In fact, the energy consumption is reduced in contrast to LEACH through the following modifications. 1) minimization of hop lengths which are necessary to transmission of data packets inside the clusters 2) via continuously data aggregation in and out of the clusters 3) the selection of the nearest cluster head to the BS for transmission of final data packet toward the BS in each round. Simulation results show that the new algorithm decreases the average energy consumption of sensor network in contrast to LEACH.
10 citations
Cites background or methods from "Adaptive protocols for information ..."
...Figure.4, shows this matter for LEACH and proposed algorithms....
[...]
...So, we can get a specific energy saving for our proposed method in all manners in comparison to LEACH ....
[...]
...But in proposed algorithm, we reduce the energy consumption through the minimization of traversed distances and therefore the increase of dimensions could not affect the energy consumption so much....
[...]
18 Jul 2012
TL;DR: Three adaptive multihop broadcast protocols, which assign a broadcasting probabilities to the mobile nodes, determining them from the network parameters, are presented, which generate significantly less duplicates while giving a faster coverage of the nodes than the other examined protocols.
Abstract: In line with traditional communication systems, more and more attention is given to autonomous, self-organized networks with no central infrastructure, based on peer-to-peer communication, like mobile ad hoc networks. Designing multihop broadcast protocols for ad hoc networks is a complex problem as the task of these protocols is to disseminate messages in a network effectively while avoiding unnecessary use of resources. To solve this problem, this paper presents three adaptive multihop broadcast protocols, which assign a broadcasting probabilities to the mobile nodes, determining them from the network parameters (like the degrees of the nodes, distance of the nodes from each other). The presented novel 3-phase handshake gossiping protocols, the DBHG, the VBHG and the AVBHG generate significantly less duplicates while giving a faster coverage of the nodes than the other examined protocols.
10 citations
Cites background from "Adaptive protocols for information ..."
...It is a variation of the SPIN [14] dissemination protocol....
[...]
30 Jun 2011
TL;DR: This chapter presents a survey of the most well known protocols for WSN, and presents discussion of routing protocols of WSN and classification of these protocols according to data traffic models.
Abstract: A WSN is composed of a large number of sensor nodes that are communicating using a wireless medium. The sensor nodes are deployed in the environment to be monitored in ad hoc structure. In WSN, there is sink node that collects data from all sensors, and usually not all nodes hear all other nodes. WSN is considered a multi-hop network. Although a WSN is a wireless multi-hop network, the ease of deployment of sensor nodes, the system lifetime, the data latency, and the quality of the network distinguish WSN from traditional multi-hop wireless networks. These features must be taken into account when designing different protocols that control the operation of WSN such as MAC protocols and routing protocols. Therefore, Many MAC and Routing protocols are proposed for WSN. These protocols take into account the distinguished features of WSN. Moreover, Cross layer design protocols are proposed for WSN. In cross layer design protocols, different layers interact to optimize the performance of the WSN protocol. In this chapter, we will present a survey of the most well known protocols for WSN. A survey of the most well-known MAC protocols is presented in section 0. Section 0 presents discussion of routing protocols of WSN and classification of these protocols according to data traffic models. The routing protocols are also classified as: data centric protocols, hierarchical protocols, location-based protocols and QoS-aware protocols. In section 0, we will present some cross layer design protocols for WSN. A summery of the cross layer design protocols is presented at the end of the section.
10 citations
08 Dec 2008
TL;DR: Results show that the proposed distributed edge detection technique provides accurate perimeters for all sensed phenomena within a wireless sensor network even in the presence of irregularly shaped phenomena.
Abstract: The ability to geometrically represent sensed phenomena within a wireless sensor network can provide a more concise view than enumeration of all nodes identifying a phenomenon. A more concise view of sensed data can reduce the communication and energy costs of data analysis and extend the lifetime of the network. We propose a distributed edge detection technique that identifies connected perimeters for sensed phenomena within wireless sensor networks. The technique operates in arbitrarily deployed wireless sensor networks, such as those containing connectivity holes, and is capable of correctly identifying the perimeters of irregularly shaped phenomena. We implemented our technique and conducted extensive experiments; results show that our technique provides accurate perimeters for all sensed phenomena within a wireless sensor network even in the presence of irregularly shaped phenomena.
10 citations
TL;DR: A preliminary assessment of epidemic-domain inspired approaches to model the information survivability in UWSNs shows that epidemic models can be used to devise solutions enabling the information to survive, once the maximal compromising power of an attacker is estimated.
10 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