DOCSLIB.ORG

Sistemas Informáticos Curso 2005-06 Sistema De Autoconfiguración Para

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Sistemas Informáticos Curso 2005-06 Sistema De Autoconfiguración Para Sistemas Informáticos Curso 2005-06 Sistema de Autoconfiguración para Redes Ad Hoc Miguel Ángel Tolosa Diosdado Adam Ameziane Dirigido por: Profª. Marta López Fernández Dpto. Sistemas Informáticos y Programación Grupo de Análisis, Seguridad y Sistemas (GASS) Facultad de Informática Universidad Complutense de Madrid AGRADECIMIENTOS: Queremos agradecer la dedicación de la profesora Marta López Fernández, Directora del presente Proyecto de Sistemas Informáticos, y del resto de integrantes del Grupo de Análisis, Seguridad y Sistemas (GASS) del Departamento de Sistemas Informáticos y Programación de la Universidad Complutense de Madrid, y de forma muy especial a Fabio Mesquita Buiati y a Javier García Villalba, Miembro y Director del citado Grupo, respectivamente, por el asesoramiento y las facilidades proporcionadas para el buen término de este Proyecto. 2 Índice RESUMEN ....................................................................................................................... 5 ABSTRACT ..................................................................................................................... 6 PALABRAS CLAVE....................................................................................................... 7 1-INTRODUCCIÓN....................................................................................................... 8 1.1- MOTIVACIÓN ......................................................................................................... 8 1.2 – OBJETIVO .............................................................................................................. 9 1.3- ESTRUCTURA DE LA MEMORIA........................................................................ 9 1-INTRODUCCIÓN ........................................................................................................ 8 2 -AUTOCONFIGURACIÓN EN REDES AD HOC ............................................... 10 2.1- HISTORIA .............................................................................................................. 10 2.2- VISIÓN GENERAL DE LAS REDES AD HOC................................................... 11 2.2.1- CARACTERÍSTICAS ......................................................................................... 12 2.2.2- CLASIFICACIÓN ............................................................................................... 13 2.2.3- APLICACIONES................................................................................................. 14 2.2.4- VENTAJAS.......................................................................................................... 15 2.2.5- DESVENTAJAS .................................................................................................. 16 2.2.6 - ENCAMINAMIENTO........................................................................................ 17 2.2.6.1- CARACTERÍSTICAS ESPERADAS .............................................................. 17 2.2.6.2 - MÉTRICAS POSIBLES .................................................................................. 18 2.2.6.3 - ESQUEMAS BÁSICOS DEL PROTOCOLO DE ENCAMINAMIENTO. ... 18 2.2.6.4 CLASIFICACIÓN DE LOS ALGORITMOS DE ENCAMINAMIENTO. ...... 19 2.2.6.5- DESCRIPCIÓN DE ALGUNOS PROTOCOLOS USADOS.......................... 20 2.2.6.6- COMPARACIÓN ENTRE PROTOCOLOS .................................................... 25 2.3 – DESCRIPCIÓN DEL PROBLEMA DE AUTOCONFIGURACIÓN.................. 27 2.4 – NECESIDADES DEL PROTOCOLO DE AUTOCONFIGURACIÓN............... 28 2.5 – CLASIFICACIÓN DE LOS PROTOCOLOS....................................................... 30 2.5.1 – EN CUANTO AL PROCESO DE AUTOCONFIGURACIÓN ........................ 30 2.5.2 – EN CUANTO AL PROCESO DE DETECCIÓN DE DIRECCIONES DUPLICADAS........................................................................................................... 30 2.6 – TRABAJOS RELACIONADOS........................................................................... 32 2.6.1 - IP ADDRESS AUTOCONFIGURATION FOR AD HOC NETWORKS......... 32 2.6.2 – AD HOC IP ADDRESS AUTOCONFIGURATION ........................................ 32 3 2.6.3 - IP ADDRESS ASSIGNMENT IN A MOBILE AD HOC NETWORK............. 33 2.6.4 – MANETconf: CONFIGURATION OF HOST IN A MANET.......................... 34 2.6.5 – PASSIVE DUPLICATE ADDRESS DETECTION IN MOBILE AD HOC NETWORKS.............................................................................................................. 34 2.7 – MÉTRICAS PARA LA EVALUACIÓN DEL RENDIMIENTO ........................ 36 2.7.1 – COMPARACIÓN DE RENDIMIENTO ........................................................... 37 3 - ESPECIFICACION DEL PROTOCOLO............................................................ 39 3.1 - OBJETIVOS .......................................................................................................... 39 3.2 – FUNCIONAMIENTO........................................................................................... 40 3.2.1 – INICIALIZACIÓN DE LA RED AD HOC....................................................... 41 3.2.2 – ASOCIACIÓN DE UNA DIRECCIÓN IP A UN NUEVO NODO.................. 41 3.2.3 – SALIDA DE NODOS ........................................................................................ 43 3.2.3.1 – SALIDA FÁCIL.............................................................................................. 44 3.2.3.2 – SALIDA BRUSCA ......................................................................................... 45 3.2.4 – PROCESO DE SINCRONIZACIÓN................................................................. 46 3.2.5 – PERDIDA DE MENSAJES ............................................................................... 46 3.2.6 - PARTICIÓN Y FUSIÓN DE REDES ................................................................ 47 3.3 - MENSAJES Y ESTRUCTURAS DE DATOS DEL PROTOCOLO.................... 49 3.3.1 - ESTRUCTURA DE DATOS Y TABLAS UTILIZADAS................................. 49 3.3.2 – FORMATO DE LOS MENSAJES .................................................................... 50 3.3.2.1 - ADDR_REQ .................................................................................................... 51 3.3.2.10 - NODE_DOWN_REP..................................................................................... 61 3.3.2.11 - HELLO........................................................................................................... 62 3.3.2.2 - ADDR_REP ..................................................................................................... 52 3.3.2.3 - SERVER_POLL .............................................................................................. 53 3.3.2.4 - IP_ASSIGNED ................................................................................................ 54 3.3.2.5 - IP_ASSIGMENT_OK...................................................................................... 55 3.3.2.6 - NODE_UP........................................................................................................ 56 3.3.2.7 - NODE_UP_REP .............................................................................................. 57 3.3.2.8 - GRACEFUL_DEPARTURE ........................................................................... 59 3.3.2.9 - NODE_DOWN ................................................................................................ 60 3.3.3 - TEMPORIZADORES UTILIZADOS ................................................................ 63 3.4 – EJEMPLO ILUSTRATIVO DEL PROTOCOLO ................................................ 65 3.4.1 – INICIALIZACIÓN DE LA RED CON 3 NODOS............................................ 65 4 3.4.2 – ASIGNACIÓN DE UNA DIRECCIÓN IP A UN NODO ENTRANTE........... 65 3.4.3 – SALIDA FACIL DE UN NODO ....................................................................... 66 3.4.4 – FALLO DE UN NODO Y RECUPERACIÓN DE DIRECCIONES IP............ 67 4 – IMPLEMENTACIÓN DEL PROTOCOLO ....................................................... 68 4.1 – CONFIGURACIÓN DEL ENTORNO ................................................................. 68 4.1.1 – CONFIGURACION FÍSICA ............................................................................. 68 4.1.2 – CONFIGURACIÓN LÓGICA........................................................................... 68 4.2 - HERRAMIENTAS UTILIZADAS........................................................................ 69 4.2.1 – LENGUAJE DE PROGRAMACIÓN C ............................................................ 69 4.2.2 - LINUX ................................................................................................................ 69 4.2.3 - DHCP .................................................................................................................. 70 4.2.4 - LIBNET............................................................................................................... 70 4.2.5 - LIBPCAP ............................................................................................................ 70 4.2.6 – WIRELESS EXTENSIONS FOR LINUX......................................................... 71 4.3 – DEFINICIÓN Y ESPECIFICACIÓN DE LOS ESTADOS DEL PROTOCOLO 73 4.3.1 – ESTADOS DE ENTRADA DE NODOS........................................................... 73 4.3.1.1 – ESTADOS DEL NODO CLIENTE. ............................................................... 73 4.3.1.2 – ESTADOS DEL NODO SERVIDOR............................................................. 75 4.3.1.3 – ESTADOS DEL RESTO DE
Load more

Recommended publications
  • Implementing MACA and Other Useful Improvements to Amateur Packet Radio for Throughput and Capacity
    Implementing MACA and Other Useful Improvements to Amateur Packet Radio for Throughput and Capacity John Bonnett – KK6JRA / NCS820 Steven Gunderson – CMoLR Project Manager TAPR DCC – 15 Sept 2018 1 Contents • Introduction – Communication Methodology of Last Resort (CMoLR) • Speed & Throughput Tests – CONNECT & UNPROTO • UX.25 – UNPROTO AX.25 • Multiple Access with Collision Avoidance (MACA) – Hidden Terminals • Directed Packet Networks • Brevity – Directory Services • Trunked Packet • Conclusion 2 Background • Mission County – Proverbial: – Coastline, Earthquake Faults, Mountains & Hills, and Missions – Frequent Natural Disasters • Wildfires, Earthquakes, Floods, Slides & Tsunamis – Extensive Packet Networks • EOCs – Fire & Police Stations – Hospitals • Legacy 1200 Baud Packet Networks • Outpost and Winlink 2000 Messaging Software 3 Background • Mission County – Proverbial: – Coastline, Earthquake Faults, Mountains & Hills, and Missions – Frequent Natural Disasters • Wildfires, Earthquakes, Floods, Slides & Tsunamis – Extensive Packet Networks • EOCs – Fire & Police Stations – Hospitals • Legacy 1200 Baud Packet Networks • Outpost and Winlink 2000 Messaging Software • Community Emergency Response Teams: – OK Drills – Neighborhood Surveys OK – Triage Information • CERT Form #1 – Transmit CERT Triage Data to Public Safety – Situational Awareness 4 Background & Objectives (cont) • Communication Methodology of Last Resort (CMoLR): – Mission County Project: 2012 – 2016 – Enable Emergency Data Comms from CERT to Public Safety 5 Background &
    [Show full text]
  • Reservation - Time Division Multiple Access Protocols for Wireless Personal Communications
    tv '2s.\--qq T! Reservation - Time Division Multiple Access Protocols for Wireless Personal Communications Theodore V. Buot B.S.Eng (Electro&Comm), M.Eng (Telecomm) Thesis submitted for the degree of Doctor of Philosophy 1n The University of Adelaide Faculty of Engineering Department of Electrical and Electronic Engineering August 1997 Contents Abstract IY Declaration Y Acknowledgments YI List of Publications Yrt List of Abbreviations Ylu Symbols and Notations xi Preface xtv L.Introduction 1 Background, Problems and Trends in Personal Communications and description of this work 2. Literature Review t2 2.1 ALOHA and Random Access Protocols I4 2.1.1 Improvements of the ALOHA Protocol 15 2.1.2 Other RMA Algorithms t6 2.1.3 Random Access Protocols with Channel Sensing 16 2.1.4 Spread Spectrum Multiple Access I7 2.2Fixed Assignment and DAMA Protocols 18 2.3 Protocols for Future Wireless Communications I9 2.3.1 Packet Voice Communications t9 2.3.2Reservation based Protocols for Packet Switching 20 2.3.3 Voice and Data Integration in TDMA Systems 23 3. Teletraffic Source Models for R-TDMA 25 3.1 Arrival Process 26 3.2 Message Length Distribution 29 3.3 Smoothing Effect of Buffered Users 30 3.4 Speech Packet Generation 32 3.4.1 Model for Fast SAD with Hangover 35 3.4.2Bffect of Hangover to the Speech Quality 38 3.5 Video Traffic Models 40 3.5.1 Infinite State Markovian Video Source Model 41 3.5.2 AutoRegressive Video Source Model 43 3.5.3 VBR Source with Channel Load Feedback 43 3.6 Summary 46 4.
    [Show full text]
  • A Survey on Aloha Protocol for Iot Based Applications
    ISSN: 2277-9655 [Badgotya * et al., 7(5): May, 2018] Impact Factor: 5.164 IC™ Value: 3.00 CODEN: IJESS7 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY A SURVEY ON ALOHA PROTOCOL FOR IOT BASED APPLICATIONS Shikha Badgotya*1 & Prof.Deepti Rai2 *1M.Tech Scholar, Department of EC, Alpine Institute of Technology,, Ujjain (India) 2H.O.D, Department of EC, Alpine Institute of Technology, Ujjain (India) DOI: 10.5281/zenodo.1246995 ABSTRACT With the emergence of IoT based applications in industries and automation, protocols for effective data transfer was the foremost need. The natural choice was a random access protocol like ALOHA which could be incorporated in the ultra narrowband ISM band framework because of its simplicity and lack of overhead. Pure ALOHA faced the limitation of greater rate of collisions among the packets of data and also there was higher level of frame delays. Slotted ALOHA overcame these limitations to some extent in which the transfer of data takes place after channel polling. Though the drawbacks of PURE ALOHA are somewhat resolved in Slotted ALOHA, still some redundant transmissions and delay of frames exist. The present proposed work puts forth an efficient mechanism for Slotted ALOHA which implements polling of channel that is non persistent in nature to reduce the probability of collisions considerably. Further it presents a channel sensing methodology also for prevention of burst errors. Interleaving serves to be useful in case of burst errors and helps in preserving useful information. The survey should pave the path for IoT based applications working on an ultra narrowband architecture.
    [Show full text]
  • Evaluating Lora Physical As a Radio Link Technology for Use in a Remote-Controlled Electric Switch System for a Network Bridge
    Evaluating LoRa Physical as a Radio Link Technology for use in a Remote-Controlled Electric Switch System for a Network Bridge Radio-Node Abdullahi Aden Hassan / Rasmus Karlsson Källqvist KTH ROYAL INSTITUTE OF TECHNOLOGY ELECTRICAL ENGINEERING AND COMPUTER SCIENCE Acknowledgments We would like to thank our academic mentor Anders Västberg for helping us with the process of writing and carrying through this degree project, answering all of our questions, and for proof reading this report. We would like to thank Amin Azari for showing genuine interest in our project and for answering some math questions we had when calculating the radio link budget, and for discovering that the formula in a book we were using had a printing error which was initially causing our results to be wrong. Thank you to fellow students Michael Henriksson and Sebastian Kullengren for a thorough opposition to this report and for much helpful feedback in keeping the text readable and scientific. Thank you to Björn Pehrson for representing AMPRNet Sweden and giving us the opportunity to work on this project, financing the system prototype and for giving helpful feedback. Finally, we would like to thank program director Bengt Molin for teaching us much of what we know of embedded systems and for lending us equipment used in the development of the hardware prototype. i Abstract This report explores the design of a system for remotely switching electronics on and off within a range of at least 15 km, to be used with battery driven radio nodes for outdoor Wi-Fi network bridging. The application of the network bridges are connecting to remote networks, should Internet infrastructure fail during an emergency.
    [Show full text]
  • Medium Access Control Layer
    Telematics Chapter 5: Medium Access Control Sublayer User Server watching with video Beispielbildvideo clip clips Application Layer Application Layer Presentation Layer Presentation Layer Session Layer Session Layer Transport Layer Transport Layer Network Layer Network Layer Network Layer Univ.-Prof. Dr.-Ing. Jochen H. Schiller Data Link Layer Data Link Layer Data Link Layer Computer Systems and Telematics (CST) Physical Layer Physical Layer Physical Layer Institute of Computer Science Freie Universität Berlin http://cst.mi.fu-berlin.de Contents ● Design Issues ● Metropolitan Area Networks ● Network Topologies (MAN) ● The Channel Allocation Problem ● Wide Area Networks (WAN) ● Multiple Access Protocols ● Frame Relay (historical) ● Ethernet ● ATM ● IEEE 802.2 – Logical Link Control ● SDH ● Token Bus (historical) ● Network Infrastructure ● Token Ring (historical) ● Virtual LANs ● Fiber Distributed Data Interface ● Structured Cabling Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 5: Medium Access Control Sublayer 5.2 Design Issues Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 5: Medium Access Control Sublayer 5.3 Design Issues ● Two kinds of connections in networks ● Point-to-point connections OSI Reference Model ● Broadcast (Multi-access channel, Application Layer Random access channel) Presentation Layer ● In a network with broadcast Session Layer connections ● Who gets the channel? Transport Layer Network Layer ● Protocols used to determine who gets next access to the channel Data Link Layer ● Medium Access Control (MAC) sublayer Physical Layer Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 5: Medium Access Control Sublayer 5.4 Network Types for the Local Range ● LLC layer: uniform interface and same frame format to upper layers ● MAC layer: defines medium access ..
    [Show full text]
  • New Gateways (PDF
    Packet Network Notice Rev: 28-Nov-2011 Date: Nov 28, 2011 From: Santa Clara County ARES/RACES Packet Committee Subject: Packet Network Update – New AMPRnet and E-mail gateways Attention: All ECs, AECs, MACs and other Santa Clara County Packet Users This Packet Network Notice contains important information which affects your ability to access and use the county packet backbone. This update covers the following topics: • New AMPRnet Gateway • New E-mail Gateway Please read this information thoroughly and pass along to any packet users in your local area. New AMPRnet Gateway The AMPRnet is an AMateur Packet Radio network consisting of packet radio BBSs located worldwide. Local networks of BBSs are interconnected to other local networks through gateways. These gateways use IP-in-IP tunnels to connect to each other. AMPRnet IP addresses are allocated from the IP address block of 44.0.0.0/8. Once a BBS or local network of BBSs is connected to AMPRnet, each of the BBSs can reach any other BBS on the AMPRnet, and vice-versa. For example, in the State of Michigan, each county has a local network of one or more BBSs. Each county is connected to all other counties (and to the rest of the world) with AMPRnet connections. Here in California, we can use AMPRnet connections to reach other counties which do not have a radio path to our network. We have just started to reach out to other counties to work on making those connections. There are two primary uses for this connectivity: 1) Messaging: Messages can now be addressed to anyone at any of the AMPRnet BBSs with a simple and standard Internet-style address format: [email protected].
    [Show full text]
  • On-Demand Routing in Multi-Hop Wireless Mobile Ad Hoc Networks
    Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320–088X IJCSMC, Vol. 2, Issue. 7, July 2013, pg.317 – 321 RESEARCH ARTICLE ON-DEMAND ROUTING IN MULTI-HOP WIRELESS MOBILE AD HOC NETWORKS P. Umamaheswari 1, K. Ranjith singh 2 1Periyar University, TamilNadu, India 2Professor of PGP College, TamilNadu, India 1 [email protected]; 2 [email protected] Abstract— An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any preexisting network infrastructure or centralized administration. Routing protocols used in ad hoc networks must automatically adjust to environments that can vary between the extremes of high mobility with low bandwidth, and low mobility with high bandwidth. This thesis argues that such protocols must operate in an on-demand fashion and that they must carefully limit the number of nodes required to react to a given topology change in the network. I have embodied these two principles in a routing protocol called Dynamic Source Routing (DSR). As a result of its unique design, the protocol adapts quickly to routing changes when node movement is frequent, yet requires little or no overhead during periods in which nodes move less frequently. By presenting a detailed analysis of DSR’s behavior in a variety of situations, this thesis generalizes the lessons learned from DSR so that they can be applied to the many other new routing protocols that have adopted the basic DSR framework. The thesis proves the practicality of the DSR protocol through performance results collected from a full-scale 8 node tested, and it demonstrates several methodologies for experimenting with protocols and applications in an ad hoc network environment, including the emulation of ad hoc networks.
    [Show full text]
  • ECE 158A: Lecture 13
    ECE 158A: Lecture 13 Fall 2015 Random Access and Ethernet! Random Access! Basic idea: Exploit statistical multiplexing Do not avoid collisions, just recover from them When a node has packet to send Transmit at full channel data rate No a priori coordination among nodes Two or more transmitting nodes ⇒ collision Random access MAC protocol specifies: How to detect collisions How to recover from collisions Key Ideas of Random Access Carrier sense Listen before speaking, and don’t interrupt Check if someone else is already sending data and wait till the other node is done Collision detection If someone else starts talking at the same time, stop Realize when two nodes are transmitting at once by detecting that the data on the wire is garbled Randomness Don’t start talking again right away Wait for a random time before trying again Aloha net (70’s) First random access network Setup by Norm Abramson at the University of Hawaii First data communication system for Hawaiian islands Hub at University of Hawaii, Oahu Alohanet had two radio channels: Random access: Sites sending data Broadcast: Hub rebroadcasting data Aloha Signaling Two channels: random access, broadcast Sites send packets to hub (random) If received, hub sends ACK (random) If not received (collision), site resends Hub sends packets to all sites (broadcast) Sites can receive even if they are also sending Questions: When do you resend? Resend with probability p How does this perform? Will analyze in class, stay tuned…. Slot-by-slot Aloha Example
    [Show full text]
  • Examining Ambiguities in the Automatic Packet Reporting System
    Examining Ambiguities in the Automatic Packet Reporting System A Thesis Presented to the Faculty of California Polytechnic State University San Luis Obispo In Partial Fulfillment of the Requirements for the Degree Master of Science in Electrical Engineering by Kenneth W. Finnegan December 2014 © 2014 Kenneth W. Finnegan ALL RIGHTS RESERVED ii COMMITTEE MEMBERSHIP TITLE: Examining Ambiguities in the Automatic Packet Reporting System AUTHOR: Kenneth W. Finnegan DATE SUBMITTED: December 2014 REVISION: 1.2 COMMITTEE CHAIR: Bridget Benson, Ph.D. Assistant Professor, Electrical Engineering COMMITTEE MEMBER: John Bellardo, Ph.D. Associate Professor, Computer Science COMMITTEE MEMBER: Dennis Derickson, Ph.D. Department Chair, Electrical Engineering iii ABSTRACT Examining Ambiguities in the Automatic Packet Reporting System Kenneth W. Finnegan The Automatic Packet Reporting System (APRS) is an amateur radio packet network that has evolved over the last several decades in tandem with, and then arguably beyond, the lifetime of other VHF/UHF amateur packet networks, to the point where it is one of very few packet networks left on the amateur VHF/UHF bands. This is proving to be problematic due to the loss of institutional knowledge as older amateur radio operators who designed and built APRS and other AX.25-based packet networks abandon the hobby or pass away. The purpose of this document is to collect and curate a sufficient body of knowledge to ensure the continued usefulness of the APRS network, and re-examining the engineering decisions made during the network's evolution to look for possible improvements and identify deficiencies in documentation of the existing network. iv TABLE OF CONTENTS List of Figures vii 1 Preface 1 2 Introduction 3 2.1 History of APRS .
    [Show full text]
  • 6.02 Notes, Chapter 15: Sharing a Channel: Media Access (MAC
    MIT 6.02 DRAFT Lecture Notes Last update: November 3, 2012 CHAPTER 15 Sharing a Channel: Media Access (MAC) Protocols There are many communication channels, including radio and acoustic channels, and certain kinds of wired links (coaxial cables), where multiple nodes can all be connected and hear each other’s transmissions (either perfectly or with some non-zero probability). This chapter addresses the fundamental question of how such a common communication channel—also called a shared medium—can be shared between the different nodes. There are two fundamental ways of sharing such channels (or media): time sharing and frequency sharing.1 The idea in time sharing is to have the nodes coordinate with each other to divide up the access to the medium one at a time, in some fashion. The idea in frequency sharing is to divide up the frequency range available between the different transmitting nodes in a way that there is little or no interference between concurrently transmitting nodes. The methods used here are the same as in frequency division multiplexing, which we described in the previous chapter. This chapter focuses on time sharing. We will investigate two common ways: time division multiple access,orTDMA , and contention protocols. Both approaches are used in networks today. These schemes for time and frequency sharing are usually implemented as communica­ tion protocols. The term protocol refers to the rules that govern what each node is allowed to do and how it should operate. Protocols capture the “rules of engagement” that nodes must follow, so that they can collectively obtain good performance.
    [Show full text]
  • Mind the Uppercase Letters
    Integration of APRS Network with SDI Tomasz Kubik1,2, Wojciech Penar1 1 Wroclaw University of Technology 2 Wroclaw University of Environmental and Life Sciences Abstract. From the point of view of large information systems designers the most important thing is a certain abstraction enabling integration of heterogeneous solutions. Abstraction is associated with the standardization of protocols and interfaces of appropriate services. Behind this façade any device or sensor system may be hidden, even humans recording their measurements. This study presents selected topics and details related to two families of standards developed by OGC: OpenLS and SWE. It also dis- cusses the technical details of a solution built to intercept radio messages broadcast in the APRS network with telemetric information and weather conditions as payload. The basic assumptions and objectives of a prototype system that integrates elements of the APRS network and SWE are given. Keywords: SWE, OpenLS, APRS, SDI, web services 1. Introduction Modern measuring devices are no longer seen as tools for qualitative and quantitative measurements only. They have become parts of highly special- ized solutions, used for data acquisition and post-processing, offering hardware and software interfaces for communication. In the construction of these solutions the latest technologies from various fields are employed, including optics, precision mechanics, satellite and information technolo- gies. Thanks to the Internet and mobile technologies, several architectural and communication barriers caused by the wiring and placement of the sensors have been broken. Only recently the LBS (Location-Based Services) entered the field of IT. These are information services, available from mo- bile devices via mobile networks, giving possibility of utilization of a mobile This work was supported in part by the Polish Ministry of Science and Higher Edu- cation with funds for research for the years 2010-2013.
    [Show full text]
  • Linux Networking-HOWTO
    Linux Networking−HOWTO: Linux Networking−HOWTO: Table of Contents Linux Networking−HOWTO:............................................................................................................................1 Author: Joshua Drake poet@linuxports.com...........................................................................................1 1.Introduction...........................................................................................................................................1 2.Document History.................................................................................................................................1 3.How to use this HOWTO......................................................................................................................1 4.General Information about Linux Networking.....................................................................................1 5.Generic Network Configuration Information.......................................................................................1 6.Ethernet Information.............................................................................................................................2 7.IP Related Information..........................................................................................................................2 8.Advanced Networking with Kernel 2.2................................................................................................2 9.Using common PC hardware................................................................................................................2
    [Show full text]