The emergence of portable terminals in work and living environments is accelerating the progression of wireless networks. A wireless ad hoc network is a new network concept where users establish peer-to-peer communication among themselves independently, in their small area. Since the wireless medium is a shared resource, it becomes an important design issue to efficiently allocate bandwidth among users. MAC (Medium Access Control) layer arbitrates the channel access to the wireless medium and is also responsible for bandwidth allocation to different users, therefore a large amount of research has been conducted on various MAC protocols for ad hoc wireless networks. This dissertation begins with a survey of existing wireless MAC protocols. The survey includes protocols designed for different network generations and topologies, classifying them based on architecture and mode of operation. Next, we concentrate on the MAC protocols proposed for distributed wireless networks. We propose a new MAC protocol based on a token-passing strategy; which not only incorporates the advantages of the guaranteed access scheme into the distributed type of wireless networks, but also the data rate and delay level QoS guarantees. Data rate QoS provides fairness into sharing of the channel, while delay level QoS introduces a flexible prioritized access to channels by adjusting transmission permission to the current network traffic activities. A simulation model for the protocol is developed and delay and throughput performance results are presented. To examine the efficiency and performance of the proposed MAC scheme in an ad hoc wireless environment, it is incorporated into the Bluetooth structured network. The model is then simulated in the Bluetooth environment and performance results are presented. Furthermore, an analytical model is proposed and an approximate delay analysis conducted for the proposed MAC scheme. Analytical results are derived and compared with results obtained from computer simulations. The dissertation concludes with suggestions for improvements and future work. / Thesis (M.Sc.-Engineering)-University of Natal, 2003.

This research is motivated by the recent developments in the Internet Engineering Task Force (IETF) to support seamless integration of moving networks deployed in vehicles to the global Internet. The effort, known as Network Mobility (NEMO), paves the way to support high-speed Internet access in mass transit systems, e.g. trains; buses; ferries; and planes; through the use of on-board mobile routers embedded in the vehicle. One of the critical research challenges of this vision is to achieve high-speed and reliable back-haul connectivity between the mobile router and the rest of the Internet. The problem is particularly challenging due to the fact that a mobile router must rely on wireless links with limited bandwidth and unpredictable quality variations as the vehicle moves around. In this thesis, the multi-homing concept is applied to approach the problem. With multi-homing, mobile router has more than one connection to the Internet. This is achieved by connecting the mobile router to a diverse array of wireless access technologies (e.g., GPRS, CDMA, 802.11, and 802.16) and/or a multiplicity of wireless service providers. While the aggregation helps addressing the bandwidth problem, quality variation problem can be mitigated by employing advanced traffic engineering techniques that dynamically control inbound and outbound traffic over multiple connections. More specifically, the thesis investigates traffic engineering solutions for mobile networks that can effectively address the performance objectives, e.g. maximizing profit for mobile network operator; guaranteeing quality of service for the users; and maintaining fair access to the back-haul bandwidth. Traffic engineering solutions with three different levels of control have been investigated. First, it is shown, using detailed computer simulation of popular applications and networking protocols(e.g., File Transfer Protocol and Transmission Control Protocol), that packet-level traffic engineering which makes decisions of which Internet connection to use for each and every packet, leads to poor system throughput. The main problem with packet-based traffic engineering stems from the fact that in mobile environment where link bandwidths and delay can vary significantly, packets using different connections may experience different delays causing unexpected arrivals at destinations. Second, a maximum utility flow-level traffic engineering has been proposed that aims to maximize a utility function that accounts for bandwidth utilization on the one hand, and fairness on the other. The proposed solution is compared against previously proposed flow-level traffic engineering schemes and shown to have better performance in terms of throughput and fairness. The third traffic engineering proposal addresses the issue of maximizing operator?s profit when different Internet connections have different charging rates, and guaranteeing per user bandwidth through admission control. Finally, a new signaling protocol is designed to allow the mobile router to control its inbound traffic.

The SOAP Service Description Language (SSDL) is a SOAP-centric language for describing Web Service contracts. SSDL focuses on message abstraction as the building block for creating service-oriented applications and provides an extensible range of protocol frameworks that can be used to describe and formally model Web Service interactions. SSDL's natural alignment with service-oriented design principles intuitively suggests that it encourages the creation of applications that adhere to this architectural paradigm. Given the lack of tools and empirical data for using SSDL as part of Web Services-based SOAs, we identified the need to investigate its practicability and usefulness through empirical work. To that end we have developed Soya, a programming model and runtime environment for creating and executing SSDL-based Web Services. On the one hand, Soya provides straightforward programming abstractions that foster message-oriented thinking. On the other hand, it leverages contemporary tooling (i.e. Windows Communication Foundation) with SSDL-related runtime functionality and semantics. In this thesis, we describe the design and architecture of Soya and show how it makes it possible to use SSDL as an alternative and powerful metadata language without imposing unrealistic burdens on application developers. In addition, we use Soya and SSDL in a case study which provides a set of initial empirical results with respect to SSDL's strengths and drawbacks. In summary, our work serves as a knowledge framework for better understanding message-oriented Web Service development and demonstrates SSDL's practicability in terms of implementation and usability.

The future Internet will need to cater for an increasing number of powerful devices and entire groups of networks to roam in heterogeneous access networks. The current approach towards meeting such requirements, which is to retrofit mobility solutions to different layers of the protocol stack, has given rise to an increasingly fragmented network control layer. Furthermore, retrofitting solutions in an ad-hoc manner to the protocol stack does not provide consistent support from the network to different applications. This lack of a common control layer for facilitating roaming in heterogeneous networking environments represents a crucial challenge both technically and from a user perspective. To this end, a novel mobility architecture forms the basis and the first part of this dissertation. The work on investigating current network mobility solutions and improving these solutions if deemed necessary, in order to reuse within the novel mobility architecture constitutes the second part of this dissertation. The IETF standard protocol for network mobility was implemented and its performance was analysed on a real networking environment. This enabled to identify problems in the standard which affect the handover and routing performance. To address the identified routing and protocol header overheads of the standard network mobility protocol a novel optimal routing framework, OptiNets was proposed. To address the handover latency issues, optimizations to IPv6 network attachment were incorporated and also an access technology independent multiple interface Make-Before-Break handover mechanism was proposed. The viability of the OptiNets framework and the handover optimizations were demonstrated by analysis and by implementation. A more general external factor that affects the performance of mobile networks which is bandwidth scarcity of Wireless Wide Area Networks was addressed, by proposing a bandwidth fuelling architecture for on-board mobile networks. The feasibility of the bandwidth fuelling architecture was analysed by implementing a prototype and evaluating its performance.

Network programming is one of the most important applications in Wireless Sensor Networks as It provides an efficient way to update program Images running on sensor nodes without physical access to them. Securing these updates, however, remains a challenging and important issue, given the open deployment environment of sensor nodes. Though several security schemes have been proposed to impose the authenticity and Integrity protection on network programming applications, they are either energy Inefficient as they tend to use digital signature or lacks the data confidentiality. In addition, due to the absence of secure memory management in the current sensor hardware, the attacker could inject malicious code into the program flash by exploiting buffer overflow In the memory despite the secure code dissemination. The contribution of this thesis Is to provide two software-based security protocols and one hardware-based remote attestation protocol for network programming application. Our first protocol deploys multiple one-way key chains for a multi-hop sensor network. The scheme Is shown to be lower In computational, power consumption and communication costs yet still able to secure multi??hop propagation of program images. Our second protocol utilizes an Iterative hash structure to the data packets in network programming application, ensuring the data confidentiality and authenticity. In addition, we Integrated confidentiality and DoS-attack-resistance in a multi??hop code dissemination protocol. Our final solution is a hardware-based remote attestation protocol for verification of running codes on sensor nodes. An additional piece of tamper-proof hardware, Trusted Platform Module (TPM), is imposed into the sensor nodes. It secures the sensitive information (e.g., the session key) from attackers and monitors any platform environment changes with the Internal registers. With these features of TPM, the code Injection attack could be detected and removed when the contaminated nodes are challenged in our remote attestation protocol. We implement the first two software-based protocols with Deluge as the reference network programming protocol in TinyOS, evaluate them with the extensive simulation using TOSSIM and validate the simulation results with experiments using Tmote. We implement the remote attestation protocol on Fleck, a sensor platform developed by CSIRO that Integrates an Atmel TPM chip.

Network programming is one of the most important applications in Wireless Sensor Networks as It provides an efficient way to update program Images running on sensor nodes without physical access to them. Securing these updates, however, remains a challenging and important issue, given the open deployment environment of sensor nodes. Though several security schemes have been proposed to impose the authenticity and Integrity protection on network programming applications, they are either energy Inefficient as they tend to use digital signature or lacks the data confidentiality. In addition, due to the absence of secure memory management in the current sensor hardware, the attacker could inject malicious code into the program flash by exploiting buffer overflow In the memory despite the secure code dissemination. The contribution of this thesis Is to provide two software-based security protocols and one hardware-based remote attestation protocol for network programming application. Our first protocol deploys multiple one-way key chains for a multi-hop sensor network. The scheme Is shown to be lower In computational, power consumption and communication costs yet still able to secure multi??hop propagation of program images. Our second protocol utilizes an Iterative hash structure to the data packets in network programming application, ensuring the data confidentiality and authenticity. In addition, we Integrated confidentiality and DoS-attack-resistance in a multi??hop code dissemination protocol. Our final solution is a hardware-based remote attestation protocol for verification of running codes on sensor nodes. An additional piece of tamper-proof hardware, Trusted Platform Module (TPM), is imposed into the sensor nodes. It secures the sensitive information (e.g., the session key) from attackers and monitors any platform environment changes with the Internal registers. With these features of TPM, the code Injection attack could be detected and removed when the contaminated nodes are challenged in our remote attestation protocol. We implement the first two software-based protocols with Deluge as the reference network programming protocol in TinyOS, evaluate them with the extensive simulation using TOSSIM and validate the simulation results with experiments using Tmote. We implement the remote attestation protocol on Fleck, a sensor platform developed by CSIRO that Integrates an Atmel TPM chip.

Diss. (sammanfattning) Uppsala : Univ., 2003. / Härtill 6 uppsatser.

Thesis (M.S.)--Florida State University, 2005. / Advisor: Dr. Bruce A. Harvey, Florida State University, College of Engineering, Dept. of Electrical and Computer Engineering. Title and description from dissertation home page (viewed June 10, 2005). Document formatted into pages; contains vii, 73 pages. Includes bibliographical references.

Traditionally, real-time communication, such as voice calls, has run on separate, closed networks. Of all the limitations that these networks had, the ability of malicious attacks to cripple communication was not a crucial one. This situation has changed radically now that real-time communication and data have merged to share the same network. The objective of this project is to investigate the securing of softswitches with functionality similar to Private Branch Exchanges (PBX) from malicious attacks. The focus of the project will be a practical investigation of how to secure ILANGA, an ASTERISK-based system under development at Rhodes University. The practical investigation that focuses on ILANGA is based on performing six varied experiments on the different components of ILANGA. Before the six experiments are performed, basic preliminary security measures and the restrictions placed on the access to the database are discussed. The outcomes of these experiments are discussed and the precise reasons why these attacks were either successful or unsuccessful are given. Suggestions of a theoretical nature on how to defend against the successful attacks are also presented.

With the increase in bandwidth, more widespread distribution of media, and increased capability of mobile devices, multimedia streaming has not only become feasible, but more economical in terms of space occupied by the media file and the costs involved in attaining it. Although much attention has been paid to peer to peer media streaming over the Internet using HTTP and RTSP, little research has focussed on the use of the Bluetooth protocol for streaming audio and video between mobile devices. This project investigates the feasibility of Bluetooth as a protocol for audio and video streaming between mobile phones using the J2ME platform, through the analysis of Bluetooth protocols, media formats, optimum packet sizes, and the effects of distance on transfer speed. A comparison was made between RFCOMM and L2CAP to determine which protocol could support the fastest transfer speed between two mobile devices. The L2CAP protocol proved to be the most suitable, providing average transfer rates of 136.17 KBps. Using this protocol a second experiment was undertaken to determine the most suitable media format for streaming in terms of: file size, bandwidth usage, quality, and ease of implementation. Out of the eight media formats investigated, the MP3 format provided the smallest file size, smallest bandwidth usage, best quality and highest ease of implementation. Another experiment was conducted to determine the optimum packet size for transfer between devices. A tradeoff was found between packet size and the quality of the sound file, with highest transfer rates being recorded with the MTU size of 668 bytes (136.58 KBps). The class of Bluetooth transmitter typically used in mobile devices (class 2) is considered a weak signal and is adversely affected by distance. As such, the final investigation that was undertaken was aimed at determining the effects of distance on audio streaming and playback. As can be expected, when devices were situated close to each other, the transfer speeds obtained were higher than when devices were far apart. Readings were taken at varying distances (1-15 metres), with erratic transfer speeds observed from 7 metres onwards. This research showed that audio streaming on the J2ME platform is feasible, however using the currently available class of Bluetooth transmitter, video streaming is not feasible. Video files were only playable once the entire media file had been transferred.