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: This work provides a simple but realistic model for smart dust, and presents various smart dust protocols for local detection and propagation that are simple enough to be implemented on real smart dust systems, and performs a rigorous average case analysis of their efficiency and energy consumption.
Abstract: Smart Dust is a set of a vast number of ultra-small fully autonomous computing and communication devices, with very restricted energy and computing capabilities, that co-operate to quickly and efficiently accomplish a large sensing task. Smart Dust can be very useful in practice, i.e., in the local detection of a remote crucial event and the propagation of data reporting its realization. In this work we make an effort towards the research on smart dust from an algorithmic point of view. We first provide a simple but realistic model for smart dust and present an interesting problem, which is how to propagate efficiently information on an event detected locally. Then we present various smart dust protocols for local detection and propagation that are simple enough to be implemented on real smart dust systems, and perform, under some simplifying assumptions, a rigorous average case analysis of their efficiency and energy consumption (and their interplay). This analysis leads to concrete results showing that our protocols are very efficient and robust. We also validate the analytical results by extensive experiments.
58 citations
Cites background from "Adaptive protocols for information ..."
...…the area and because particles do not move, there might not be any particle in that direction; (b) particles of sufficient remaining battery power may not be available in the right direction; (c) particles may temporarily “sleep” (i.e., not listen to transmissions) in order to save battery power....
[...]
05 Nov 2007
TL;DR: In this article, a reactive routing protocol called energy aware routing is proposed to provide a reliable transmission environment with low energy consumption, which can monitor a specific area and collect environmental data around a place.
Abstract: Applications of sensor networks have become an emerging technology, which can monitor a specific area and collect environmental data around a place. In recent years, low power wireless communication and the availability of cheap and small micro sensor nodes lead to enhanced developments of wireless sensor network applications in real society. The energy constraint inherent in the small battery powered nodes presents a considerable problem, and much effort is being put into reducing the power consumption. We introduce a reactive routing protocol called energy aware routing that is intended to provide a reliable transmission environment with low energy consumption. This protocol efficiently utilizes both the energy available in the node and quality of the link to identify the best possible route to the destination. Simulation results show that the energy aware routing scheme outperforms the existing schemes even in the presence of high node density and overcomes simultaneous packet forwarding
58 citations
21 Mar 2004
TL;DR: An energy balanced chain (EBC) which can efficiently prolong the sensor network lifetime by actively controlling the nodes' hop distances by adjusting the transmission power, so that nodes with higher traffic have a longer hop distance than nodes with lower traffic.
Abstract: With detection and monitoring requirements becoming more complicated and difficult, wireless sensor networks are envisioned to revolutionize the paradigm of collecting and processing information in diverse environments, such as on Mars' in-situ exploration. However, energy utilization by sensor nodes often impacts the application's life time due to limited battery capacity. One of the problems in energy utilization is that nodes near the base station lend to die earlier than other nodes because of their higher traffic. This paper suggests an energy balanced chain (EBC) which can efficiently prolong the sensor network lifetime by actively controlling the nodes' hop distances. In EBC, we formulate the energy balance optimization problem in terms of the segmentation space. By adjusting the transmission power, nodes with higher traffic have a longer hop distance than nodes with lower traffic. Further, numerical analysis results show that EBC performs significantly better than traditional hop-by-hop transmission.
58 citations
TL;DR: This paper describes existing DHT-based routing and data management protocols and includes a detailed classification of them and presents an analytical survey on applying DHT techniques in WSNs.
Abstract: Recent advances in Wireless Sensor Networks (WSN) have led to a great breakthrough in sensors design and features. These technological novelties have brought additional challenges to WSN. Sensornets are seeking for new approaches for efficient data routing and management. The last few years have witnessed the emergence of several approaches that build Distributed Hash Tables (DHTs) over WSN. DHTs are initially conceived for efficient data lookup in large-scale wired networks. The main objective of this combination is to manage location-independent data and nodes identification. DHT mapping over WSN brings however new challenges. This paper presents an analytical survey on applying DHT techniques in WSNs. It describes existing DHT-based routing and data management protocols and includes a detailed classification of them.
58 citations
06 Dec 2012
TL;DR: Simulation results show that the DHCS outperforms conventional clustering protocols in terms of energy conservation, network life time and network latency.
Abstract: Energy efficient data aggregation is one of the key research areas of wireless sensor networks (WSNs). Many clustering techniques have been proposed for topology maintenance and routing in these networks. In addition to this, these techniques are also beneficial in prolonging the network life time. Clustering protocols proposed in existing literature use a single Cluster Head (CH) for a group of nodes (Cluster). In these protocols, the CH performs a number of activities, such as data gathering, data aggregation and data forwarding. As a result, the CH depletes its energy quickly as compared to its member nodes. Hence, re-clustering is required frequently, which consumes considerable energy. This paper proposes an energy efficient Dual Head Clustering Scheme (DHCS) for WSNs. DHCS selects two different nodes within the cluster for cluster management and aggregation namely Cluster Head (CH) and Aggregator Head (AH) respectively. Simulation results show that the DHCS outperforms conventional clustering protocols in terms of energy conservation, network life time and network latency.
58 citations
Cites background from "Adaptive protocols for information ..."
...Moreover, Sensor protocol for Information via Negotiation (SPIN) operates in two phases, the negotiation phase and the resource adaptation phase [18]....
[...]
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