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: A new clustering method for WSN with heterogeneous node types which selects cluster heads considering not only the transmission power and residual energy of each node but also those of its adjacent nodes is proposed.
Abstract: Wireless Sensor Networks (WSNs) are gradually moving toward the adoption of clustered heterogeneous designs, incorporating a mixture of variety kinds of sensor nodes with different radio coverage and battery capacity. Compared with homogeneous networks, heterogeneous networks are able to reduce the initial cost of the network or prolong the network lifetime. The architecture and routing protocol for this type of heterogeneous WSN should be energy aware in order to prolong the lifetime of the network. However, most of the existing clustering methods consider only initial energy of the sensor nodes and ignore the non-uniform energy drainage caused by many-to-one traffic near sink and/or cluster heads in heterogeneous network environment. In this paper, we propose a new clustering method for WSN with heterogeneous node types which selects cluster heads considering not only the transmission power and residual energy of each node but also those of its adjacent nodes. Simulation experiments show that the proposed method increases network lifetime by 80% and 60% more than that of the CC and HEED, respectively.
10 citations
18 Dec 2010
TL;DR: An alternate routing protocol, MS-SPIN, is proposed, which incorporates the best features of SPIN while also addressing the security issue, and the implementation of MS- SPIN in NS2 has shown that, for a larger number of nodes, its energy performance characteristics are comparable to those of SPin while providing security features.
Abstract: Recent technological advancements in the field of nanotechnology have increased the computation power of the wireless nodes while adhering to the energy constraints This has made the use of the Wireless Sensor Networks (WSNs), more widespread, used in applications such as area monitoring, industrial monitoring, vehicle detection or military monitoring Sensor nodes have made it possible to collect data even in hostile environments, but because of the severe security and energy constraints faced by sensor networks, their deployment on a large scale is still a tricky job A secure energy efficient routing algorithm is thus the need of the hour SPIN, Sensor Protocol for Information via Negotiation, is one of the widely used energy efficient routing protocol in WSNs that completely ignores the security aspect This paper involves proposing an alternate routing protocol, MS-SPIN, which incorporates the best features of SPIN while also addressing the security issue The implementation of MS-SPIN in NS2 has shown that, for a larger number of nodes, its energy performance characteristics are comparable to those of SPIN while providing security features
10 citations
Cites methods from "Adaptive protocols for information ..."
...This paper involves proposing an alternate routing protocol, MS-SPIN, which incorporates the best features of SPIN while also addressing the security issue....
[...]
05 May 2014
TL;DR: A novel context-free decision model is put forward that allows fast communication decision by considering complex network attributes in large teams by putting forward a heuristic model to estimate thosecomplex network attributes from robots' local view.
Abstract: Sharing information is critical to multi-robot team coordination when robots are widely deployed in a dynamic and partially observable environment. To be efficient, robots should balance well between broadcasting information and reserving limited bandwidth so that only the right information should be broadcast to the interested receivers. Robots' communication decision is normally modeled as a multi-agent decision theoretical problem. However, when the team expands to very large, the solution is classified as NEXP-COMPLETE. In this paper, in addition to building heuristic approaches to solve the decision theoretical problem based on the information context to be broadcast, we put forward a novel context-free decision model that allows fast communication decision by considering complex network attributes in large teams. Similar to human society, information should be broadcast if the action can make a good information coverage in the team. We analyze how complex network attributes can improve communication in a broadcast network. By putting forward a heuristic model to estimate those complex network attributes from robots' local view, we can build decision models either from robots' experiences or from their local incoming communications. Finally, we incorporate our algorithm in well-known information sharing algorithms and the results manifest the feasibility of our design.
10 citations
12 Oct 2009
TL;DR: This work identifies a unique privacy issue in mobility control protocols that discloses the physical location of the sink node to intruders in WSNs, and proposes a new privacy preserving scheme that effectively hid the sink location via anonymity.
Abstract: As the technology of mobile sensors advances, mobilitycontrol becomes a viable option that can be utilized to minimize energy consumption in wireless sensor networks (WSNs). A mobility control protocol re-deploys mobile sensors to optimal positions to minimize energy consumption for communication. We identify a unique privacy issue in mobility control protocols that discloses the physical location of the sink node to intruders in WSNs. To protect the sink node, we propose a new privacy preserving scheme to secure mobility control protocols against attacks that locate and sabotage the sink node. The privacy preservingscheme obfuscates the sink location with dummy sink nodes. Analysis shows that the scheme can effectively hidethe sink location via anonymity. The scheme can also be easily integrated into current mobility control protocols without raising much additional overhead. The performance simulation and analysis show that, with the sink node well-protected, mobility control protocols achieve similar performance as original protocols.
10 citations
Cites background from "Adaptive protocols for information ..."
...In this paper, we identified a unique privacy issue in mobility control that discloses the physical location of the sink node to intruders in WSNs....
[...]
...I. INTRODUCTION As mobility becomes readily available to wireless sensor networks (WSNs) [1], studies on using mobility as a control mechanism to minimize energy consumption [2]–[6] have been conducted....
[...]
...Section VI summarizes related privacy research in WSNs. Finally, Section VII concludes the paper....
[...]
...We inspect several major routing protocols in WSNs [10], [11] and find that this security requirement can be satisfied....
[...]
...However, many security schemes of authentication, encryption and key management were proposed in the past, which can be deployed in WSNs to protect mobility control....
[...]
01 Jan 2013
TL;DR: Wireless sensor network led to many new protocols where energy awareness is vital consideration, and this paper surveys on data.
Abstract: Wireless sensor network led to many new protocols where energy awareness is vital consideration. This paper surveys on data
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