scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Adaptive protocols for information dissemination in wireless sensor networks

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.

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI
01 Dec 2017
TL;DR: The simulation results have clearly shown that the proposed Kangaroo Method-based adaptive routing protocol excels regarding energy consumption in wireless sensor networks, and resulting in an extension of lifetime for the network.
Abstract: We offer in the present paper a novel routing protocol for wireless sensor networks by using the hybrid between leach protocol and a heuristic method to reduce sensor energy consumption. We propose Kangaroo Method-based (KM-based) adaptive routing protocol uses the optimal path to transmit data from cluster head nodes to base station to achieve good performance in terms of lifetime of network in WSN. The proposed KM-based approach is based on LEACH, called LEACH-KANG. The simulation results have clearly shown that our proposed protocol excels regarding energy consumption in wireless sensor networks, and resulting in an extension of lifetime for the network. We simulated the proposed technique compared with LEACH algorithm using MATLAB environment.

11 citations


Cites background from "Adaptive protocols for information ..."

  • ...SPIN (Sensor Protocols for Information via Negotiation)[4] is one of adaptive protocols proposed to overcome the resource ignorance problem faced in the flooding technique by using negotiation and adaptation to available resources....

    [...]

  • ...SPIN uses three types of messages: ADV, REQ, and DATA....

    [...]

  • ...This category includes Directed Diffusion [3], SPIN [4], Rumor Routing [5] and EBRP [6]....

    [...]

Proceedings ArticleDOI
25 Mar 2008
TL;DR: Simulation results show that SERENA enables us to maximize network lifetime while increasing the number of user messages delivered and improves the node energy consumption distribution and maximizes the energy efficiency of wireless ad hoc and sensor networks.
Abstract: In wireless ad hoc and sensor networks, an analysis of the node energy consumption distribution shows that the largest part is due to the time spent in the idle state. This result is at the origin of SERENA, an algorithm to SchEdule RoutEr Nodes Activity. SERENA allows router nodes to sleep, while ensuring end-to-end communication in the wireless network. It is a localized and decentralized algorithm assigning time slots to nodes. Any node stays awake only during its slot and the slots assigned to its neighbors, it sleeps the remaining time. Simulation results show that SERENA enables us to maximize network lifetime while increasing the number of user messages delivered. We quantify the slot reuse and evaluate the impact of the frame size on network performance. We then study how to dimension buffers at the router nodes. Finally, we show how SERENA improves the node energy consumption distribution and maximizes the energy efficiency of wireless ad hoc and sensor networks.

11 citations

Dissertation
03 Aug 2005

11 citations


Cites background from "Adaptive protocols for information ..."

  • ...Die eenvoud van die protokol verlaag die vereiste rekenkundige prosessering en terselfdertyd maak dit hierdie protokol een van die enkeles wat geen hardeware voorvereistes vir nodusse inhou om te kan funksioneer nie. v List of Abbreviations ADC analogue to digital converter AES advanced encryption standard AODV ad hoc on demand distance vector BATR balanced aggregation tree routing CPU central processing unit CSMA carrier sense multiple access CSMA-CA carrier sense multiple access with collision avoidance DARPA Defense Advanced Research Projects Agency DSN distributed sensor networks DSSS direct sequence spread spectrum FFD full function device FHSS frequency-hopping spread spectrum GBR gradient-based routing GHz gigahertz GPS global positioning system HAR hierarchy-based anycast routing HEAR-SN hierarchical energy-aware routing for sensor networks IEEE Institute of Electrical and Electronic Engineers IP Internet protocol kB kilobyte kbps kilobits per second L2CAP logical link control and adaptation protocol LAN local area network LEACH low energy adaptive clustering hierarchy LMP link manager protocol vi MAC medium access control mAh milliamp hour Mbps megabits per second MCFA minimum cost forwarding algorithm MECN minimum energy communication network MEMS micro electro-mechanical systems MHz megahertz MIT Massachusetts Institute of Technology PHY physical RAM random access memory RFD reduced function device RISC reduced instruction set computer SEER simple energy efficient routing SMECN small minimum energy communication network SOSUS sound surveillance system SPIN sensor protocols for information via negotiation TDMA time division multiple access TEDS transducer electronic data sheets TTL time to live TUV Vienna University of Technology UCLA University of California, Los Angeles UWB ultrawideband WANET wireless ad hoc network WINS wireless integrated network sensors WLAN wireless local area network WPAN wireless personal area network WSN wireless sensor network WSSN wireless self-sustaining sensor network vii Table of Contents 1....

    [...]

  • ...The flat routing protocols that have been proposed in the literature generally either require an excessive number of messages for data transfer ([4], [5], [6], [7], [8]), are computationally complex [9], require sensor nodes to have certain physical capabilities ([10], [9], [11]) or require a certain network structure ([10], [11], [12]) for the protocol to function....

    [...]

  • ...2 Sensor Protocols for Information via Negotiation Sensor protocols for information via negotiation (SPIN) [4] was one of the first routing protocols to be proposed for WSNs....

    [...]

01 Jan 2001
TL;DR: These measurements indicate a high per-packet overhead, indicating that packet aggregation might be able to reduce that overhead and show that the application-independent packet aggregation mechanism yields substantial transmission power savings for workloads that frequently send small packets, such as Web workloads.
Abstract: Mobile computing relies on low-power communication. Since ad-hoc networks are often idle, many researchers have investigated mechanisms to reduce idle power. This paper presents power measurements on current IEEE 802.11b network cards and discusses physical and link layer power control mechanisms for transmission power. Specifically, we characterize the influence of bit-rate, transmission power, and packet size on total power consumption. These measurements indicate a high per-packet overhead, indicating that packet aggregation might be able to reduce that overhead. Packet aggregation combines multiple smaller packets into a larger packet. Our experiments show that our application-independent packet aggregation mechanism yields substantial transmission power savings for workloads that frequently send small packets, such as Web workloads.

11 citations


Cites background from "Adaptive protocols for information ..."

  • ...In [22], the authors consider the general problem of disseminating information for limited energy ad hoc networks of sensors....

    [...]

Proceedings ArticleDOI
05 Jul 2009
TL;DR: This paper presents a novel family of wireless sensor routing protocols, the Self-Selecting Reliable Path Routing Protocol Family (SSRPF), that address all three of the afore-mentioned challenges.
Abstract: Routing protocols for Wireless Sensor Networks (WSN) face three major performance challenges. The first one is an efficient use of bandwidth that minimizes the transfer delay of packets between nodes to ensure the shortest end-to-end delay for packet transmission from source to destination. The second challenge is the ability to maintain data flow around permanent and transient node or link failures ensuring the maximum delivery rate of packets from source to destination. The final challenge is to efficiently use energy while maximizing delivery rate and minimizing end-to-end delay. Protocols that establish a permanent route between source and destination send packets from node to node quickly, but suffer from costly route recalculation in the event of any node or link failures. Protocols that select the next hop at each node on the traversed path suffer from a delay required to make such selection. The way in which a protocol repairs routes determines the number of packets lost by each failure and ultimately affects the energy used for communication. This paper presents a novel family of wireless sensor routing protocols, the Self-Selecting Reliable Path Routing Protocol Family (SSRPF), that address all three of the afore-mentioned challenges.

11 citations


Cites methods from "Adaptive protocols for information ..."

  • ...Traditional wired approaches such as AODV [7], MintRoute [8], and Directed Diffusion [9] do a good job of quickly forwarding packets especially when the network has a low rate of node or link failures; however, when this is not the case, then either packet losses uncontrollably increase or a costly repair routine is frequently evoked....

    [...]

  • ...Traditional wired approaches such as AODY [7], MintRoute [8], and Directed Diffusion [9] do a good job of quickly forwarding packets especially when the network has a low rate of node or link failures; however, when this is not the case, then either packet losses uncontrollably increase or a costly repair routine...

    [...]

References
More filters
Proceedings ArticleDOI
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

Proceedings ArticleDOI
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]....

    [...]

Proceedings ArticleDOI
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]....

    [...]

Proceedings ArticleDOI
01 Dec 1987
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....

    [...]

Journal ArticleDOI
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