Many security protocols are built as the composition of an application-layer protocol and a secure transport protocol, such as TLS. There are many approaches to proving the correctness of such protocols. One popular approach is verification by abstraction, in which the correctness of the application-layer protocol is proven under the assumption that the transport layer satisfies certain properties, such as confidentiality. Following this approach, we adapt the strand spaces model in order to analyse application-layer protocols that depend on an underlying secure transport layer, including unilaterally authenticating secure transport protocols, such as unilateral TLS. Further, we develop proof rules that enable us to prove the correctness of application-layer protocols that use either unilateral or bilateral secure transport protocols. We then illustrate these rules by proving the correctness of WebAuth, a single-sign-on protocol that makes extensive use of unilateral TLS. In this thesis we also present a full proof of the model's soundness. In particular, we prove that, subject to a suitable independence assumption, if there is an attack against the application-layer protocol when layered on top of a particular secure transport protocol, then there is an attack against the abstracted model of the application-layer protocol. In contrast to existing work in this area, the independence assumption consists of eight statically-checkable conditions, meaning that it can be checked statically, rather than having to consider all possible runs of the protocol. Lastly, we extend the model to allow protocols that consist of an arbitrary number of layers to be proven correct. In this case, we prove the correctness of the intermediate layers using the high-level strand spaces model, by abstracting away from the underlying transport-layers. Further, we extend the above soundness results in order to prove that the multi-layer approach is sound. We illustrate the effectiveness of our technique by proving the correctness of a couple of simple multi-layer protocols.

The field of automation and smart devices is currently expanding. As most devices require wireless communication, the market for low budget, low power radios is growing rapidly. Many applications, such as the remote control of machines, have real time requirements with minimal latency. In this report, the market of wireless chips in the sub-GHz region has been investigated in order to give Syntronic AB an insight of the current market. Several key features such as range, data rate and output power were ranked among the available chips. To provide Syntronic with a marketing tool when reaching out to customers in the remote control field, a demonstration prototype (demo) was implemented using one of the radio chips from the list. The demo shows real time requirements with low latency between two wireless nodes. The first node takes movement data from a computer mouse and transmits it to the other node controlling an array of light emitting diodes (LEDs). This report contains the selection of radio configurations, design of a new wireless communications protocol, and implementation of the system in hardware and software. Measurements show a latency of 3.6 ms and a range of approximately 450 m which is regarded satisfactory.

International Telemetering Conference Proceedings / October 28-31, 1996 / Town and Country Hotel and Convention Center, San Diego, California / The Global Positioning System (GPS) is a very accurate, all-weather, world wide three dimensional navigation system and it has been used in almost every field related to positioning and navigation. This paper presents a new application of GPS technology - personal positioning and navigation system. It combines VP ONCORE receiver OEM (Original Equipment Manufacture) board and an intelligent system controller, with a keyboard and a programmable LCD as its peripherals. This system can realize rich navigation functions and satisfy the need of personal use.

International Telemetering Conference Proceedings / October 23-26, 2000 / Town & Country Hotel and Conference Center, San Diego, California / Combating harsh and unpredictable channel environments is a part of the design of any in-situ communication system (i.e. rover to lander, rover to orbiter, etc.). Channel characteristics can range from simple additive white Gaussian noise (AWGN) channels to more bursty fading channels found in rover to orbiter links (i.e. canyon scenarios and typical orbiter passes around mountain ranges). A combination of forward error correction and automatic repeat request (ARQ) schemes are commonly used to provide a more robust communications link. ARQ enhances the communication link particularly for bursty fading channels. Go-Back-N is a commonly used ARQ scheme and is an option in the newly developed Consultative Committee for Space Data Systems (CCSDS) Proximity-1 Link protocol [7], a data link layer protocol targeted specifically for in-situ applications. Optimization of frame sizes and retransmission persistence of the ARQ scheme require a good analytical model of how the scheme performs over various channel conditions. In this paper, an analytical framework for modeling the COP-1 protocol is presented for both AWGN channels along with bursty fading channels. A Gilbert-Elliot two-state Markov model is used to model a bursty fading channel.

International Telemetering Conference Proceedings / October 27-30, 1997 / Riviera Hotel and Convention Center, Las Vegas, Nevada / NASA’s use of high bandwidth packetized Consultative Committee for Space Data Systems (CCSDS) telemetry in the Earth Observing System (EOS) mission presents a great challenge to ground data system developers. The EOS mission calls for high data rate interfaces and small packet sizes which would dramatically increase the real-time workload on ground packet processing systems. NASA’s Goddard Space Flight Center (GSFC) has been developing packet processing subsystems for over a decade. This paper will discuss the design of a high-rate telemetry test system and a simulation software package. The system will support CCSDS telemetry formats and perform frame synchronization, error detection and correction, packet reassembly and sorting, error checking, and data set creation. In addition, a highly automated operation environment is designed to minimize human intervention in control and monitoring, and data distribution. The design is based on a Very Large Scale Integration (VLSI) Level Zero Processing (LZP) System technologies, VLSI telemetry data simulation and processing functional components, Object-Oriented Design methodologies, C++ programming environment, shareware and Open Software Foundation (OSF)/Motif-based Graphical User Interfaces (GUI).

International Telemetering Conference Proceedings / October 22-25, 2001 / Riviera Hotel and Convention Center, Las Vegas, Nevada / The Consultative Committee for Space Data Systems (CCSDS) is defining a CCSDS File Delivery Protocol (CFDP) capable of use between systems of multiple endpoints. A number of prototype CFDP implementations have been developed and some interoperability tests performed over UDP links. This paper reports on a study of CFDP running over more realistic packet telecommand and packet telemetry links. An integrated test system was constructed by adapting existing commercial and prototype software. This was used to study a number of scenarios which are likely to be important in early operational use of CFDP in space. This approach has been found to be useful both for testing a protocol during its development and specification and for verifying the impact of new approaches to Space Missions.

Transmission Control Protocol (TCP) is considered one of the most important protocols in the Internet. An important mechanism in TCP is the congestion control mechanism which controls TCP sending rate and makes TCP react to congestion signals. Nowadays in heterogeneous networks, TCP may work in networks with some links that have lossy nature (wireless networks for example). TCP treats all packet loss as if they were due to congestion. Consequently, when used in networks that have lossy links, TCP reduces sending rate aggressively when there are transmission (non-congestion) errors in an uncongested network. One solution to the problem is to discriminate between errors; to deal with congestion errors by reducing TCP sending rate and use other actions for transmission errors. In this work we investigate the problem and propose a solution using an end-to-end error discriminator. The error discriminator will improve the current congestion window mechanism in TCP and decide when to cut and how much to cut the congestion window. We have identified three areas where TCP interacts with drops: congestion window update mechanism, retransmission mechanism and timeout mechanism. All of these mechanisms are part of the TCP congestion control mechanism. We propose changes to each of these mechanisms in order to allow TCP to cope with transmission errors. We propose a new TCP congestion window action (CWA) for transmission errors by delaying the window cut decision until TCP receives all duplicate acknowledgments for a given window of data (packets in flight). This will give TCP a clear image about the number of drops from this window. The congestion window size is then reduced only by number of dropped packets. Also, we propose a safety mechanism to prevent this algorithm from causing congestion to the network by using an extra congestion window threshold (tthresh) in order to save the safe area where there are no drops of any kind. The second algorithm is a new retransmission action to deal with multiple drops from the same window. This multiple drops action (MDA) will prevent TCP from falling into consecutive timeout events by resending all dropped packets from the same window. A third algorithm is used to calculate a new back-off policy for TCP retransmission timeout based on the network's available bandwidth. This new retransmission timeout action (RTA) helps relating the length of the timeout event with current network conditions, especially with heavy transmission error rates. The three algorithms have been combined and incorporated into a delay based error discriminator. The improvement of the new algorithm is measured along with the impact on the network in terms of congestion drop rate, end-to-end delay, average queue size and fairness of sharing the bottleneck bandwidth. The results show that the proposed error discriminator along with the new actions toward transmission errors has increased the performance of TCP. At the same time it has reduced the load on the network compared to existing error discriminators. Also, the proposed error discriminator has managed to deliver excellent fairness values for sharing the bottleneck bandwidth. Finally improvements to the basic error discriminator have been proposed by using the multiple drops action (MDA) for both transmission and congestion errors. The results showed improvements in the performance as well as decreases in the congestion loss rates when compared to a similar error discriminator.

<p>Mobile communication systems are experiencing a huge growth. While traditional communication paradigms deal with fixed networks, mobility raises a new set of questions, techniques, and solutions. This work focuses on wireless sensor networks (WSNs) where each node is a mobile device. The main objectives of this thesis have been to develop algorithms and protocols enabling WSNs with a special interest in overcoming mobility support limitations of standards such as Bluetooth and Zigbee. The contributions of this work may be divided in four major parts related to mobility support. The first part describes the implementation of local positioning services in Bluetooth since local positioning is not supported in Bluetooth v1.1. The obtained results are used in later implemented handover algorithms in terms of deciding when to perform the handover. Moreover local positioning information may be used in further developed routing protocols. The second part deals with handover as a solution to overcome the getting out of range problem. Algorithms for handover have been implemented enabling mobility in Bluetooth infrastructure networks. The principal achievement in this part is the significant reduction of handover latency since sensor cost and quality of service are directly affected by this parameter. The third part solves the routing problems originated with handovers. The main contribution of this part is the impact of the Bluetooth scatternet formation and routing protocols, for multi-hop data transmissions, in the system quality of service. The final part is a comparison between Bluetooth and Zigbee in terms of mobility support. The main outcome of this comparison resides on the conclusions, which can be used as a technology election guide.</p><p>The main scientific contribution relies on the implementation of a mobile WSN with Bluetooth v1.1 inside the scope of the ”Multi Monitoring Medical Chip (M3C) for Homecare Applications” European Union project (Sixth Framework Program (FP6) Reference: 508291) offering multi-hop routing support and improvements in handover latencies with aid of local positioning services.</p>

The principle of parsimonious modelling of Internet traffic states that a minimal number of descriptors should be used for its characterization. Until early 1990s, the conventional Markovian models for voice traffic had been considered suitable and parsimonious for data traffic as well. Later with the discovery of strong correlations and increased burstiness in Internet traffic, various self-similar count models have been proposed. But, in fact, such models are strictly mono-fractal and applicable at coarse time scales, whereas Internet traffic modelling is about modelling traffic at fine and coarse time scales; modelling traffic which can be mono and multi-fractal; modelling traffic at interarrival time and count levels; modelling traffic at access and core tiers; and modelling all the three structural components of Internet traffic, that is, packets, flows and sessions. The philosophy of this thesis can be described as: “the renewal of renewal theory in Internet traffic modelling”. Renewal theory has a great potential in modelling statistical characteristics of Internet traffic belonging to individual users, access and core networks. In this thesis, we develop an Internet traffic modelling framework based on fractal renewal processes, that is, renewal processes with underlying distribution of interarrival times being heavy-tailed. The proposed renewal framework covers packets, flows and sessions as structural components of Internet traffic and is applicable for modelling the traffic at fine and coarse time scales. The properties of superposition of renewal processes can be used to model traffic in higher tiers of the Internet hierarchy. As the framework is based on renewal processes, therefore, Internet traffic can be modelled at both interarrival times and count levels.

2 pp. / This fact sheet briefly describes the research protocol of the San Carlos Apache Tribe reservation.