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
02 Oct 2003
TL;DR: A new programming model for a network of embedded systems, called Spatial Views, targeting its dynamic, space-sensitive and resource-restrained characteristics is presented, and iterative programming over a dynamic collection of nodes identified by the physical spaces they are in and the services they provide.
Abstract: Networks of embedded systems, in the form of cell phones, PDAs, wearable computers, and sensors connected through wireless networking technology, are emerging as an important computing platform The ubiquitous nature of such a platform promises exciting applications This paper presents a new programming model for a network of embedded systems, called Spatial Views, targeting its dynamic, space-sensitive and resource-restrained characteristics The core of the proposed model is iterative programming over a dynamic collection of nodes identified by the physical spaces they are in and the services they provide Hidden in the iteration is execution migration as the main collaboration paradigm, constrained by user specified limits on resource usage such as response time and energy consumption A Spatial Views prototype has been implemented, and first results are reported
13 citations
Additional excerpts
...Our work is correlated to recent work on sensor networks[12, 20, 6, 16, 19] in that they all target ad hoc networks of wireless devices with limited resources....
[...]
TL;DR: Even though many efforts have been made, data dissemination in WSNs still needs some more work to embrace the new techniques and improve the efficiency and practicability further.
Abstract: Wireless sensor networks (WSNs) have been applied in a variety of application areas. Most WSN systems, once deployed, are intended to operate unattended for a long period. During the lifetime, it is necessary to fix bugs, reconfigure system parameters, and upgrade the software in order to achieve reliable system performance. However, manually collecting all nodes back and reconfiguring through serial connections with computer is infeasible since it is labor-intensive and inconvenient due to the harsh deploying environments. Hence, data dissemination over multi-hop is desired to facilitate such tasks. This survey discusses the requirements and challenges of data dissemination in WSNs, reviews existing work, introduces some relevant techniques, presents the metrics of the performance and comparisons of the state-of-the-art work, and finally suggests the possible future directions in data dissemination studies. This survey elaborates and compares existing approaches of two categories: structure-less schemes and structure-based schemes, classified by whether or not the network structure information is used during the disseminating process. In existing literatures, different categories have definite boundary and limited analysis on the trade-off between different categories. Besides, there is no survey that discusses the emerging techniques such as Constructive Interference (CI) while these techniques have the chance to change the framework of data dissemination. In a word, even though many efforts have been made, data dissemination in WSNs still needs some more work to embrace the new techniques and improve the efficiency and practicability further.
13 citations
Cites background from "Adaptive protocols for information ..."
...Negotiation was firstly proposed in SPIN[30-31]....
[...]
...Negotiation-Based SPIN[30-31] Guaranteed Moderate Large MOAP[32] Guaranteed Moderate Large Deluge[33] Guaranteed Moderate Large MNP[34] Guaranteed Moderate Moderate ECD[35] Guaranteed Moderate Large ReMo[36] Guaranteed Moderate Moderate...
[...]
TL;DR: In this paper, the authors proposed a lightweight, provably secure identity-based online/offline signature technique (IBOOST) and its extension for massive devices in 5G-WSNs using fractional chaotic maps.
Abstract: The fifth-generation (5G) wireless network is commercialized. The need to integrate massive devices in 5G and wireless sensor networks (WSN) to provide several convenient services for network users becomes imperative. However, there are growing concerns that 5G-WSNs pose new security threats to sensitive user information. User authentication and key agreement have been provided for secure end-to-end communication. However, stricter security techniques are required as billions of massive devices are being networked to collect and process complex user data in real-time. Therefore, anonymous authentication and authorization are highly coveted for privacy preservation and prevention of unlawful exploitation of user data. However, guaranteeing data integrity, authentication, and non-repudiation require special-purpose identity-based signature techniques that are quite difficult to design in practice. In order to address this problem, this paper proposes a lightweight, provably secure identity-based online/offline signature technique (IBOOST) and its extension for massive devices in 5G-WSNs using fractional chaotic maps. The IBOOST scheme achieves multi-time use of offline storage at a lower processing time. Therefore, the signer can reuse the offline pre-stored information in a polynomial time. This makes our IBOOST superior to the existing online/offline signature techniques that allow only a single signature. Additionally, the new technique enables the pre-registration process with a secret key, and no secret key is required in the offline stage. Also, the proposed IBOOST proves to be secure in the random oracle unforgeability under the chosen message attack (UF-IBS-CMA). Finally, the IBOOST and its enhanced version (A-IBOOST) give the lowest computational costs compared to several contending techniques. Therefore, the proposed IBOOST shows superior security and performance with better computational overhead than the preliminary techniques.
13 citations
01 Dec 2010
TL;DR: Simulation modeling is used to investigate the dependency of this cluster head percentage on the network node density, and shows that this percentage is not universal for all network settings, and is indeed dependent on the density.
Abstract: Wireless sensors are promising and revolutionary technology. The sensor devices are typically deployed in large number to form a communication network for monitoring the physical environment. These devices are battery powered and the lifetime of the device is dependent on the battery's life. Once the battery's energy is depleted, the node is considered dead and is no longer part of the network. Recharging the sensors' batteries is not feasible, and in some cases, is completely impossible. Due to their severe energy constraints and redundancy in sensed data, hierarchal architectures are usually suggested for these networks. These architectures have proven effective in extending the network life several folds. The LEACH network routing protocol is the first protocol to use clustering for energy conservation in Wireless Sensor Networks. LEACH designers observe that there is an ideal percentage of nodes that need to be cluster heads to achieve optimal energy performance. For their work and performance analysis they selected 5% as the number of cluster heads in the netwok. The majority of routing protocols for WSNs follow LEACH and use clustering for energy performance optimization. Most of these protocols have taken the 5% percentage of cluster head as their ideal working setting, without independently qualifying this assumption. In this work, we use simulation modeling to investigate the dependency of this cluster head percentage on the network node density. Our results show that this percentage is not universal for all network settings, and is indeed dependent on the density. These findings will add to the challenging task of WSNs hierarchical networking protocols design.
13 citations
Additional excerpts
...To address the energy challenge, several protocols have been proposed for wireless sensor networks [6], [7], [4], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17]....
[...]
18 Dec 2007
TL;DR: The MSSSN architecture provides scalability, extends sensor lifetime by letting them operate with limited transmission range and provides connectivity between isolated regions of sensor nodes.
Abstract: We propose a two-layer mobile sink and static sensor network (MSSSN) architecture for large scale wireless sensor networks. The top layer is a mobile ad hoc network of resource-rich sink nodes while the bottom layer is a network of static resource- constrained sensor nodes. The MSSSN architecture can be implemented at a lower cost with the currently available IEEE 802.11 devices that only use a single half-duplex transceiver. Each sink node is assigned a particular region to monitor and collect data. A sink node moves to the vicinity of the sensor nodes (within a few hops) to collect data. The collected data is exchanged with peer mobile sinks. Thus, the MSSSN architecture provides scalability, extends sensor lifetime by letting them operate with limited transmission range and provides connectivity between isolated regions of sensor nodes. In order to provide fault tolerance, more than one mobile sink could be collecting data from a given region or a mobile sink could collect data from more than one region. In the later half of the paper, we discuss several open research issues that need to be addressed while implementing the MSSSN architecture.
13 citations
Cites methods from "Adaptive protocols for information ..."
...The number of nodes in LEACH clusters is such that the number of hops between any two nodes in a cluster is at most 2....
[...]
...In LEACH, the role of cluster head has to be frequently rotated among all sensor nodes....
[...]
...Our hierarchical approach in MSSSN is drastically different from the cluster-head approach used in some of the well-known protocols like LEACH [6]....
[...]
...Our hierarchical approach in MSSSN is drastically different from the cluster-head approach used in some of the well-known protocols like LEACH [14]....
[...]
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