WWW.THESES.XLIBX.INFO
FREE ELECTRONIC LIBRARY - Theses, dissertations, documentation
 
<< HOME
CONTACTS



Pages:     | 1 |   ...   | 16 | 17 || 19 | 20 |   ...   | 39 |

«Carles Gómez Josep Paradells José E. Caballero Edita: Fundación Vodafone España Autores: Carles Gómez Montenegro* Universitat Politècnica de ...»

-- [ Page 18 ] --

i) topology control techniques based on the use of hierarchical networks, and ii) topology control techniques based on the use of dynamic transmission range adjustment. It must be noted, however, that while topology control may be integrated with other mechanisms (e.g. MAC or routing protocols), it is actually a cross-layer function and is not related with any layer in particular.

In the first case, there exists a hierarchy within the network whereby certain mechanisms do not employ all the nodes in the network. Instead, such mechanisms involve only a subset of nodes according to the network hierarchy. In addition, some special nodes may alleviate certain tasks of other nodes. In the second case, whether or not a network hierarchy exists, the transmission range is appropriately (and dynamically) tuned according to a particular goal. Since transmission and reception are two dominant components of energy consumption in a sensor node, transmission range adjustment is a relevant technique for meeting performance requirements in terms of parameters such as energy consumption and connectivity. Note that combinations of the two categories of topology control techniques may exist.

Topology control requires the use of topology control protocols, which aim at building and maintaining network topologies. Ideally, these protocols

Sensors Everywhere

should be asynchronous, fully distributed, and should use locally available information (i.e. information about the network should be obtained by a node by communicating only with its neighbours).

This chapter is organized as follows: Section 6.1 presents topology control techniques based on the use of hierarchical networks. Section 6.2 focuses on topology control techniques aimed at dynamically adjusting the transmission range of the WSN nodes. Finally, Section 6.3 focuses on topology control solutions for the construction and maintenance of faulttolerant topologies.

6.1. Topology control techniques based on hierarchical networks

The mechanisms for data transmission on a given network can make use of a flat approach (whereby all nodes are at the same level) or a hierarchical one (whereby nodes are organized into different hierarchical levels).

In a typical WSN for data collection, a flat network approach may lead to a reduced network lifetime. Let us assume that a multi-hop routing protocol (see Chapter 7) is used in all the WSN nodes for data delivery from the sensor nodes towards the sink. Since the nodes close to the sink would relay more traffic than those far from the sink, the former ones would rapidly become unavailable due to battery depletion. An opposite approach would be to assume that all sensor nodes can directly transmit their data to the sink. In this case, the nodes distant from the sink would run out of battery quickly, due to the use of higher transmission power.

One solution is to establish a hierarchy in the network based on the use of clusters. In a cluster-based network, nodes organize themselves into local clusters. One of the nodes of the cluster is selected as the cluster-head, which acts as the gateway of the cluster for communication between nodes that do not belong to the same cluster (see Fig. 6.1). The cluster-head may communicate with other cluster-heads (of other clusters) or may directly transmit data to a particular destination (e.g. a sink node). In data collection WSNs, a clusterhead may also perform data processing in order to minimize the redundancy of the information collected by the sensor nodes of the cluster.

–  –  –

Fig. 6.1. Nodes of a network organized into clusters. The cluster-head acts as a gateway for the nodes that belong to its cluster In WSN applications where the traffic is mainly between arbitrary nodes (e.g. as in building automation), clustering can also be useful for limiting the scope of certain mechanisms in order to avoid involving the whole network.

One example may be the transmission of routing protocol messages. In effect, clustering favours network scalability.

6.1.1. LEACH

The Low Energy Adaptive Clustering Hierarchy (LEACH) protocol [2] is an adaptive clustering protocol for data collection WSNs16. In this protocol, sensor nodes collect information and transmit it to the corresponding clusterhead. The latter carries out data fusion operations and then transmits the information directly to a sink node (see Fig. 6.2). While transmission from a cluster-head to the sink may require high transmission power (especially for cluster-heads distant to the sink), only a small percentage of nodes are elected as cluster-heads. The overall result is that network lifetime is significantly longer than that obtained without the use of clustering mechanisms. A key Note that the description of the MAC mechanisms used in LEACH can be found in

Chapter 4.

Sensors Everywhere

element in LEACH is that in order to avoid fast battery depletion of clusterheads, these cluster-heads are randomly chosen, taking into account the remaining energy at the nodes. On the other hand, sensor nodes attach themselves to the cluster that minimizes communication energy.

Fig. 6.2. Example of a network with LEACH. The cluster-heads receive data from the nodes of their clusters, and after being processed the data are transmitted by the cluster-heads directly to the sink LEACH operation is organized into rounds. Each round starts with an advertisement phase in which nodes elect themselves as cluster-heads with a certain probability. The algorithm used for cluster-head election takes into account the percentage of cluster-heads required for the network (which has to be set a priori) and whether a node has recently been a cluster-head or not. Once a node has become a cluster-head, it broadcasts an advertisement message to the other nodes. On the basis of the received signal strength of the advertisement, the sensor nodes decide to which cluster they will belong. Subsequent to this decision, each sensor node informs the cluster-head that it will be a member of the cluster. The cluster-head then creates a TDMA schedule for transmission of the sensor nodes (see Chapter 4). After receiving all the data, the cluster-head performs signal processing operations to avoid redundant information and transmits the data to the sink node. After a certain period of time, a new round starts.





–  –  –

6.2. Topology control techniques based on dynamic transmission range adjustment A taxonomy of topology control techniques based on dynamic transmission range adjustment is proposed in [1] (see Fig. 6.3). First, these techniques can be divided into homogeneous and non-homogeneous approaches. In the first case, nodes are assumed to use the same transmission range, while in the second one nodes may use different transmission ranges. In nonhomogeneous topology control, the topology can be computed using location information (assuming that the positions of the nodes are known), direction information (whereby nodes do not know their position, but they can estimate the relative direction of their neighbours) and neighbourbased information (where nodes know the identities of their neighbours and can order them according to parameters such as distance and link quality).

A brief overview of some types of the three categories is shown below.

Fig. 6.3. A taxonomy of topology control techniques based on dynamic transmission range assignment (reproduced from [1]) 6.2.1. Location-based topology control protocols The authors in [3] propose a distributed topology control algorithm that uses location information obtained by low-power GPS receivers. The algorithm minimizes the energy needed for communication with a central node.

–  –  –

Local Minimum Spanning Tree (LMST) [4] is a protocol that generates a strongly connected communication graph with a node degree17 bounded by 6, that is, high network connectivity is achieved with a maximum number of neighbours per node equal to 6. In LMST, each node builds its own Minimum Spanning Tree (MST) (i.e. the minimum topology that connects all the network nodes) and keeps one-hop on-tree nodes as its neighbours in the topology. LMST outperforms other protocols, such as [3], in terms of average node degree and node transmitting range. LMST assumes that the location of nodes is known (e.g. thanks to the use of a system like GPS).

6.2.2. Direction-based topology control protocols

Cone Based Topology Control (CBTC) [5] is a distributed topology control based on directional information. Each node transmits with minimum power such that there is at least one neighbour in every cone of angle α centred at the node. The authors demonstrate that connectivity is ensured if α ≤ 2π/3 and, if α ≤ π/2, every node in the final communication graph has a node degree of at most 6.

6.2.3. Neighbour-based topology control protocols

Neighbour-based topology control protocols are based on connecting each node to its k closest neighbours. The MobileGrid protocol [6] and the Local Information No Topology (LINT) protocol [7] try to keep the number of neighbours of a node within a range centred on an optimal value. The transmission range is tuned accordingly. These protocols estimate the number of neighbours by overhearing control and data messages, which does not generate control overhead but rather depends on the transmission activity of the nodes.

The k-NEIGH protocol [8] maintains the node degree at a value smaller than or equal to a given value k. A simulation-based study has shown that k=9 is sufficient to obtain high network connectivity for a range of node densities [8]. The same simulation results show that the topology generThe node degree is defined as the number of neighbours of a node.

–  –  –

ated by k-NEIGH is on average 20% more energy efficient than that generated by CBTC.

6.3. k-connectivity One of the main goals of topology control is the construction and maintenance of a connected network topology. This includes the problem of assuring a k-connected network topology, where k is the number of different paths between any two nodes. Such a topology would still assure connectivity between any two nodes, even if k-1 nodes became unavailable.

Path redundancy is indeed an important feature required in WSNs, which are subject to node unavailability (e.g. due to battery depletion), node mobility (in some scenarios) and the dynamics of radio propagation. Another relevant factor to take into consideration is the active and sleep time schedules that may be used by the WSN nodes, which may also affect network connectivity.

There exist some extensions to protocols like LMST and CBTC that offer k-connectivity [9, 10].

REFERENCES

[1] P. Santi, “Topology Control in Wireless Ad hoc and Sensor Networks”, ACM Computing Surveys, Vol. 37, No. 2, pp. 164–194, June 2005.

[2] W. Rabiner Heinzelman, A. Chandrakasan, H. Balakrishnan, “EnergyEfficient Communication Protocol for Wireless Microsensor Networks”, in proceedings of the 33rd Hawaii International Conference on System Sciences, Island of Maui, Hawaii, USA, January 2000.

[3] V. Rodoplu, T. Meng, “Minimum energy mobile wireless networks”, IEEE J. Selected Areas Communications. 17, 8, pp.1333–1344.

[4] N. Li, J. Hou, L. Sha, “Design and analysis of an mst-based topology control algorithm”, in Proceedings of the IEEE Infocom, pp. 1702–1712, 2003.

Sensors Everywhere

[5] R. Wattenhoffer, L. Li, P. Bahl, Y. Wang, “Distributed topology control for power efficient operation in multihop wireless ad hoc networks”, in Proceedings of IEEE Infocom., pp. 1388–1397, 2001.

[6] J. Liu, B. Li, “Mobilegrid: Capacity-aware topology control in mobile ad hoc networks”, in Proceedings of the IEEE International Conference on Computer Communications and Networks, pp. 570–574, 2002.

[7] R. Ramanathan, R. Rosales-Hain, “Topology control of multihop wireless networks using transmit power adjustment”, in Proceedings of IEEE Infocom, pp. 404–413, 2000.

[8] D. Blough, M. Leoncini, G. Resta, P. Santi, “The k-neighbors protocol for symmetric topology control in ad hoc networks”, in Proceedings of the ACM MobiHoc 03, pp. 141–152, 2003.

[9] N. Li, J. Hou, “Flss: a fault-tolerant topology control algorithm for wireless networks”, in Proceedings of ACM Mobicom, pp. 275–286, 2004.

[10] M. Bahramgiri, M. Hajiaghayi, V. Mirrokni, “Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multihop networks”, in Proceedings of the IEEE International Conference on Computer Communications and Networks, pp. 392–397, 2002.

–  –  –

7. Routing As in other types of wireless multi-hop networks, in WSNs, if the receiver is not within the transmission range of the sender, the sender can take advantage of intermediate nodes which can route the data towards the receiver. This reduces the amount of energy required to transmit data between two nodes. In addition, communication path redundancy is commonly present in WSNs to some extent, which provides reliability.

Network routing is the process of selecting a path for the relaying of a message from a source device to the intended destination.

Ideally, data should be routed through good paths. Routing protocols are in charge of finding and maintaining such paths. The constraints of WSNs pose a set of requirements for the routing protocols, which should aim at finding a good trade-off between a number of performance parameters, such as delivery ratio, latency and energy consumption. Scalability is particularly important, given the potential large number of nodes in a network and their memory and energy limitations.

This chapter focuses on routing protocols for WSNs. Section 7.1 presents various types of routing protocols which were designed for or are particularly suitable for WSNs. Section 7.2 focuses on adaptations of IETF Mobile Ad Hoc Network (MANET) routing protocols for WSNs.



Pages:     | 1 |   ...   | 16 | 17 || 19 | 20 |   ...   | 39 |


Similar works:

«Schauplatz – Umbesetzung, momentane Evidenz: Washington Square 1954 (André Kertész). Hans Blumenberg zum Geburtstag, ed. Michael Krüger, Akzente 37 (1990), S. 60-66. Annotierte Fassung ohne Abbildungen. INDIANERFRIEDHOF André Kertész, Washington Square, 1954 Anselm Haverkamp April is the cruellest month (The Waste Land, 1921) April sucks (Beavis and Butthead, 1995) The lamentable arch. Henry James ist ein paar Häuser weiter geboren worden, als die von ihm für jämmerlich befundene,...»

«FireWire Notebook Adapter Connect your iPod™, EN camcorder, FireWire®, and Sony® i.LINK® devices to FR your PC DE NL ES IT User Manual F5U513 FireWire Notebook Adapter Connect your iPod™, EN camcorder, FireWire®, and Sony® i.LINK® devices to your PC User Manual F5U513 Table of Contents Introduction Overview Specifications Package Contents Minimum System Requirements Installation Hardware Installation Windows 98 SE Driver Installation Windows ME Driver Installation Windows 2000/XP...»

«Government Best Practices for Mitigating Contractor Risk A simple yet powerful roadmap enables agencies to reduce risk and increase oversight of contractors WHITE PAPER Table of Contents Section I: Executive Summary Section II: The Challenge Facing Government Section III: Best Practices for Contractor Risk Management Section IV: Effective Contractor Risk Management Using Dun & Bradstreet. 9 Section V: Conclusion Mitigating Contractor Risk | 1 © 2009 Dun & Bradstreet Section I: Executive...»

«The value of income protection Important information CommInsure Protection is an insurance product which is offered through the Colonial Super Retirement Fund ABN 40 328 908 469 (the Fund). Colonial Mutual Superannuation Pty Ltd ABN 56 006 831 983 AFSL 235025 is the trustee of the Fund (Trustee) and the issuer of interests in the Fund. The Colonial Mutual Life Assurance Society Limited ABN 12 004 021 809 AFSL 235035 (CMLA) is responsible for the administration of the Fund and provides insurance...»

«13 Decision-Making in a Collaborative Writing Task ■ Merlyn Lee De La Salle University–Dasmarinas, Philippines ABSTRACT: Collaborative writing offers an authentic learning environment where students do not only develop their writing skills but also critical thinking and decision making skills. Despite studies conducted on collaboration (Leeser, 2004; Mabrito, 2006; Storch, 2005; Watanabe & Swain, 2007), few studies have focused on how students arrive at decisions, especially in an ESL...»

«precio tiguan nuevo precio tiguan nuevo Der neue Tiguan | tiguan.volkswagen.com Bestens vernetzt durch VW Car-Net: Jetzt konfigurieren vorbestellen! VW Tiguan Kompakt SUV | mobile.de VW Tiguan Bei uns vergleichen und das beste VW Tiguan Angebot finden. Volkswagen Tiguan, todas las versiones del El nuevo Volkswagen Tiguan estrena frontal y ayudas electrónicas en esta versión 2,0 litros de 140 Volkswagen Tiguan 2016, ya tiene precio Noticia Precio del nuevo Volkswagen Tiguan Precio del nuevo...»

«Publish detail Roman Numeral Analysis Of Mozart Sonata K284 books document, also Download PDF Roman Numeral Analysis Of Mozart Sonata K284 digital file ROMAN NUMERAL ANALYSIS OF MOZART SONATA K284 PDF Complete data published is really a hard copy manual thats printed ROMAN NUMERAL ANALYSIS OF MOZART SONATA K284 Document nicely bound, and functional. It operates as a reference manual skim the TOC or index, get the page, and stick to the directions detail by detail. The challenge using these...»

«UNIVERSIDAD NACIONAL DE LA MATANZA DEPARTAMENTO DE HUMANIDADES Y CIENCIAS SOCIALES INFORME FINAL DEL PROYECTO DE INVESTIGACION LA CONTRIBUCIÓN HERMENÉUTICA A LA TEORÍA SOCIAL Y A LOS ESTUDIOS CULTURALES A 107 2006-2007 EQUIPO DE INVESTIGACION RICARDO ETCHEGARAY (DIR) SILVIA CHORROARÍN ANDREA PAC (UNPA) PABLO ERRAMOUSPE RENATO OLIVIERI INTRODUCCIÓN En su investigación sobre los avances generados por la hermenéutica en las ciencias sociales, Zygmunt Bauman señala los aportes...»

«Welcome to the 2016 USATF Junior Outdoor Championships! USA Track & Field and Clovis Unified School District welcome you to the 2016 USATF Junior Outdoor Track & Field Championships. It is our goal to provide each athlete with an athletefriendly competition experience that is of the highest quality. We wish you the best of luck in your competition! This handbook will provide you with detailed operational procedures that are necessary for your success at the Championships. Please read all...»

«Table of Contents Cover Also by Lauren Oliver Title Page Copyright Chapter One Chapter Two Chapter Three Chapter Four Chapter Five Pandemonium: Now Pandemonium: Then Also Available from Lauren Oliver Also by Lauren Oliver Before I Fall Delirium For younger readers Liesl & Po HANA A Delirium Short Story Lauren Oliver www.hodder.co.uk First published in Great Britain in 2011 by Hodder & Stoughton An Hachette UK company Copyright (c) 2011 by Laura Schechter The right of Laura Schechter to be...»

«Thomson Reuters Corporate Responsibility Ratings (TRCRR) Rating and Ranking Rules and Methodologies AUGUST 2013 TABLE OF CONTENTS THE ESG DECISION TREE...3 I. GENERAL DESCRIPTION...6 II. THE RATINGS COMMITTEE..6 III. DATA SOURCES...7 IV. TIMING OF RATINGS UPDATES..7 V. ENVIRONMENTAL WEIGHTINGS..8 VI. ENVIRONMENTAL SCORING..9 VII. SOCIAL WEIGHTINGS...10 VIII. SOCIAL SCORING...11 IX. GOVERNANCE WEIGHTINGS..12 X. GOVERNANCE SCORING...13 XI. CONVERSION OF SCORES TO RATINGS..14 XII. ASSIGNING...»

«The effects of frequency of exposure, elaboration, and individual differences on incidental vocabulary learning Muna Alshehri Lancaster University Abstract Incidental vocabulary learning from meaning-focused input has received increased attention in second language acquisition research (Nation, 2007). However, few have investigated the role of oral input (listening) in acquiring word knowledge, especially in the case of young EFL learners. Therefore, the present study measured the short-term...»





 
<<  HOME   |    CONTACTS
2016 www.theses.xlibx.info - Theses, dissertations, documentation

Materials of this site are available for review, all rights belong to their respective owners.
If you do not agree with the fact that your material is placed on this site, please, email us, we will within 1-2 business days delete him.