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
01 Nov 2005
TL;DR: A survey on communication protocols for WSNs with a particular emphasis on the lower protocol layers, giving a particular focus to the MAC (Medium Access Control) sub-layer since it has a prominent influence on some relevant requirements that must be satisfied by WSN protocols, such as energy consumption, time performance and scalability.
Abstract: Wireless Sensor Networks (WSNs) have been attracting increasing interests in the development of a new generation of embedded systems with great potential for many applications such as surveillance, environment monitoring, emergency medical response and home automation. However, the communication paradigms in Wireless Sensor Networks differ from the ones attributed to traditional wireless networks, triggering the need for new communication protocols and mechanisms. In this Technical Report, we present a survey on communication protocols for WSNs with a particular emphasis on the lower protocol layers. We give a particular focus to the MAC (Medium Access Control) sub-layer, since it has a prominent influence on some relevant requirements that must be satisfied by WSN protocols, such as energy consumption, time performance and scalability. We overview some relevant MAC protocol solutions and discuss how they tackle the trade-off between the referred requirements.
18 citations
01 Jan 2001
TL;DR: This dissertation addresses the applications, which are enabled by combining results from ubiquitous computing, mobile networks, and Voice over IP technologies and support for enabling users and applications to adapt to a more diverse communication environment, with a novel approach that provides interaction between representations of people, devices, and resources.
Abstract: This dissertation addresses the applications, which are enabled by combining results from ubiquitous computing, mobile networks, and Voice over IP (VoIP) technologies and support for enabling users and applications to adapt to a more diverse communication environment. The cost to transmit digital information end-to-end is dropping dramatically, along with a tremendous increase in the available bandwidth in access networks for both fixed and wireless access. These trends have been accelerated by the large-scale deployment of broadband networks, which are an ideal base for adding wireless LAN extensions, providing order of magnitude increases in wireless bandwidth in comparison to the projected third-generation wireless networks. This motivates their complementary use in order to meet new user demand, and quickens the pace of on-going deregulation and separation of roles regarding provisioning of network access, services, and transport. Furthermore, short-range radio-link technologies facilitate new ways of interaction both between people & devices and between devices. The price/performance of end-user electronics drops along with a tremendous increase in computational power; this increased processing power can be used to deal with the increasingly diverse wireless infrastructure in an optimal way. Furthermore, these developments which have created affordable communication between users, computational devices, and resources have also removed a number of the limitations on the kind of services that were previously possible. We are now able to build new classes of end-user applications solely on top of IP (in particular where wireless access is involved). While a number of requirements on the network have been relaxed, this raises new questions, not only about which applications are enabled, but also about how users, mobile artifacts, and virtual objects can negotiate for services with a minimum of a-priori, shared knowledge, which also enables these entities to adapt to a diverse wireless communication infrastructure and available resources. These new requirements that are placed on the infrastructure, call for completely rethinking established service architectures for public mobile networks. This rethinking is expected to have far-reaching implications on how actors in the converging computing and communications industries will deliver services, and what services they will deliver. The dissertation first examines the feasibility of delivering mobile multimedia over wireless links with end-to-end IP connectivity. This is followed by an analysis of different service architectures for delivering these services and the necessary properties of a open model for describing, managing, using, and exchanging service components. A novel approach, called a ‘Mobile Interactive Space’, is presented that provides interaction between representations of people, devices, and resources, connected by ubiquitous communication. The research leading to this doctorate has created new network and system level models for building applications in which the new requirements and design-rules can be mapped, along with a synthesized protocol and specification language for describing, managing, using, and exchanging service components in a ‘Mobile Interactive Space’. An analysis of the implications of the above approach for new business models is presented, along with results from experiments giving evidence of the feasibility of the design of the architecture and its components, and for building solutions that deliver the new services and enable users to cope with a heterogeneous and deregulated communication environment. Finally, I discuss some topics for continued work regarding questions that were unearthed by the dissertation or for which no conclusive answer could be given.
18 citations
Cites background from "Adaptive protocols for information ..."
...In his dissertation [103], George Liu shows how location information can be distributed in optimal ways in mobile networks, thus providing important input concerning effective ways to disseminate mobile service knowledge, which can be combined efficient strategies for locating application data across service discovery domains [30] or dissemination [93]....
[...]
01 Jan 2002
TL;DR: A new routing protocol called Stream Enabled Routing (SER) is proposed to allow the sources choose the routes based on the instruction given by the sinks, and it also takes into account the available energy of the sensor nodes.
Abstract: As the number of communication components can be integrated into a single chip increases, the possibility of high volume but low cost sensor nodes is realizable in the near future. Each sensor node can be designed to perform a single or multiple sensing operations, e.g., detecting temper- ature, seismic activity, object movement, and environmen- tal pollution. As a result, a routing protocol must provide the quality of service (QoS) needed by the sensor nodes. A new routing protocol called Stream Enabled Routing(SER) is proposed to allow the sources choose the routes based on the instruction given by the sinks. It also takes into account the available energy of the sensor nodes. Also, SER allows the sink to give new instruction to the sources without setting up another path. Sources are the sensor nodes in the sensor field that are performing the sensing task. As a result, an interactive user-to-sources communication is achieved. In addition, the routing protocol is shown mathematically to perform well in the sensor network environment.
17 citations
Cites background or methods from "Adaptive protocols for information ..."
...15 SER Flooding SPIN1 Gossiping 0 200 400 600 800 1000 1200 Average Number of Nodes Participate in Routing Different Protocols A ve ra ge N um be r of N od es P ar tic ip at e in R ou tin g Fig....
[...]
...We also verified by simulations that the SER protocol is more energy efficient than flooding, SPIN1, and gossiping protocols....
[...]
...The reason for the low performance of SPIN1 protocol as compared to flooding protocol is because SPIN1 protocol uses a handshake of ADV, REQ, and DATA messages in a wireless network, where the node density is high, and nodes that are not interested in the broadcast overhear the handshake messages....
[...]
...The SER protocol is compared to the flooding, gossiping, and SPIN1 [5] protocols in Section IV....
[...]
...Since flooding, SPIN1, and gossiping protocols use data dissemination approach to send data from the source to the sink, the energy of the network is depleted faster than when SER protocol is used....
[...]
21 Jul 2010
TL;DR: This paper applies a formal framework which can automatically verify different wireless routing protocols against DoS attacks exhaustively against a secure ad-hoc routing protocol ARAN, which employs public cryptographic signatures as a defense against attacks.
Abstract: Due to broadcast transmission and unattended nature, and hostile environments a variety of denial of service (DoS) attacks are possible in both Wireless Sensor Networks (WSNs) and ad-hoc networks. We have developed a formal framework which can automatically verify different wireless routing protocols against DoS attacks exhaustively. In this paper we apply our formal framework against a secure ad-hoc routing protocol ARAN, which employs public cryptographic signatures as a defense against attacks. Our framework confirmed that ARAN is still vulnerable to different DoS attacks such as black hole, INA and wormhole. The framework also traces back the reason(s) as to why and how the attacks were successful.
17 citations
Cites background from "Adaptive protocols for information ..."
...The modelling tools we employ, UPPAAL [2] and SPIN [5], can generate the trace confirming how and why a particular attack was successful in a given protocol....
[...]
...Different hidden attacks have been discovered using formal modelling e.g. [12] discovered faults in TinySec and LEAP protocols; the formal analysis in [11] disclosed successful attacks in SNEP, which is the basic component of the security protocol ’Security Protocols for Sensor Networks’ (SPINS); the work on [3] developed a new approach Sledge and verified µTESLA and LEAP protocols using this method....
[...]
...The most noteworthy work is presented in [1] where the authors used SPIN [4] to analyse the effect of some DoS attacks on ad-hoc routing protocols based on Dynamic Source Routing (Ardiadne and endairA)....
[...]
TL;DR: An end-to-end multiservice network application spanning the network management layer, optical layer, switching/routing layer, services layer, and other layers is described, which incorporates the functional elements of intelligence into computational modules and inter connects the modules into networks and hierarchies that have spatial, logical, and temporal properties.
Abstract: The term network intelligence is widely used in the field of communication networks. A number of new and potentially limiting concepts and products based on the concept of network intelligence have been introduced, including smart flows, intelligent routing, and intelligent web switching. Many intelligent systems focus on a specific service, function, or device, and do not provide true end-to-end network intelligence. True network intelligence requires more than a set of disconnected elements; it requires an interconnecting and functionally coupled architecture that enables the various functional levels to interact and communicate with each other. We propose a uniform framework for understanding end-to-end communication network intelligence (CNI), which is defined as the ability of a network to act appropriately in a changing environment. We consider an appropriate action to be one that increases the optimal and efficient use of network resources in delivering services, and we define success as the achievement of behavior subgoals that support the service provider's ultimate goals, which are defined external to the network system. The framework presented incorporates the functional elements of intelligence into computational modules and interconnects the modules into networks and hierarchies that have spatial, logical, and temporal properties. Based on the framework proposed, we describe an end-to-end multiservice network application spanning the network management layer, optical layer, switching/routing layer, services layer, and other layers.
17 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