Made available in DSpace on 2016-06-02T19:06:08Z (GMT). No. of bitstreams: 1 5463.pdf: 18006027 bytes, checksum: 047b84b38eb03b475dacbf51b7bf50b1 (MD5) Previous issue date: 2013-07-31 / Financiadora de Estudos e Projetos / Vehicular ad-hoc networks (VANETs) are networks capable of establishing communications between vehicles and road-side units. VANETs could be employed in data transmission applications. However, due to vehicle mobility, VANETs present intermittent connectivity, making message transmission a challenging task. Due to the lack of an end-to-end connectivity, messages are forwarded from vehicle to vehicle and stored when it is not possible to retransmit. Additionally, in order to improve delivery probability, messages are replicated and disseminated over the network. However, message replication may cause high network overhead and resource usage. As result, considerable research e_ort has been devoted to develop algorithms for speci_c scenarios: low, moderate and high connectivity. Nevertheless, algorithms projected for scenarios with a speci_c connectivity lack the ability to adapt to situations with zones presenting diferent node density. This lack of adaptation may negatively a_ect the performance in application such as data transmission in cities. This masters project proposes develops a method to automatically adapt message replication routing algorithms to diferent node density scenarios. The proposed method is composed of three phases. The first phase collects data from message retransmission events using a standard routing algorithms. The second phase consists in training a decision tree classifier based on the collected data. Finally, in the third phase the trained classifier is used to determine whether a message should be retransmitted or not based on the local node density. Therefore, the proposed method allows routing algorithms to query the trained classifier to decide if a message should be retransmitted. The proposed method was evaluated with real movement traces in order to improve Spray and Wait and Epidemic routing algorithms. Results indicate that the proposed method may contribute to performance enhancement. / As VANETs são redes de veículos com capacidade de estabelecer comunicações sem fio entre veículos e com equipamentos nas estradas. Estas redes poderiam ser usadas para a transferência de dados de diversas aplicações. No entanto, devido á mobilidade dos veículos, as VANETs apresentam conectividade intermitente entre os nós, dificultando a transmissão de mensagens. Ante a impossibilidade de ter conectividade de fim a fim, as mensagens são encaminhadas progressivamente de veículo em veículo, e armazenadas quando não houver a possibilidade de retransmitir. Adicionalmente, para incrementar a probabilidade de entrega, as mensagens são replicadas e disseminadas pela rede. Não obstante, a replicação de mensagens pode gerar alta sobrecarga de rede e alto consumo de recursos. Por causa disto, projetaram-se algoritmos para cenários específicos de: baixa, moderada e alta conectividade. Estes algoritmos, quando aplicados em ambientes de zonas de diferente densidade de nós,como cidades, podem diminuir o seu desempenho pela falta da capacidade de se adaptar a diferentes condições de conectividade. Contudo, neste trabalho foi desenvolvido um método para adaptar o comportamento dos algoritmos de roteamento por replicação de mensagens a diferentes situações de conectividade segundo a densidade das zonas onde se movimentam os nós retransmissores. O método consiste em três fases. Na primeira, são coletados os dados dos eventos de repasse de mensagens utilizando o algoritmo de roteamento padrão. Na segunda fase, utilizam-se os dados coletados para treinar um classificador baseado em _arvores de decisão. Na _ultima fase, o classificador é então empregado para determinar se uma situação de repasse de mensagem _e favorável segundo a densidade de nós. Desta forma, os algoritmos de roteamento podem decidir se repassar ou não uma mensagem com o suporte do classificador. Esta abordagem foi avaliada com traces de movimentos reais, para aprimorar o desempenho dos algoritmos de roteamento Spray and Wait e Epidemic. Os resultados dos experimentos realizados revelam que esta abordagem pode contribuir para o aprimoramento do desempenho.

Mobility-Based Routing Overhead Management in Reconfigurable Wireless Ad Hoc Networks Routing Overheads are the non-data message packets whose roles are establishment and maintenance of routes for data packets as well as neighbourhood discovery and maintenance. They have to be broadcasted in the network either through flooding or other techniques that can ensure that a path exists before data packets can be sent to various destinations. They can be sent reactively or periodically to neighbours so as to keep nodes updated on their neighbourhoods. While we cannot do without these overhead packets, they occupy much of the limited wireless bandwidth available in wireless networks. In a reconfigurable wireless ad hoc network scenario, these packets have more negative effects, as links need to be confirmed more frequently than in traditional networks mainly because of the unpredictable behaviour of the ad hoc networks. We therefore need suitable algorithms that will manage these overheads so as to allow data packet to have more access to the wireless medium, save node energy for longer life of the network, increased efficiency, and scalability. Various protocols have been suggested in the research area. They mostly address routing overheads for suitability of particular protocols leading to lack of standardisation and inapplicability to other protocol classes. In this dissertation ways of ensuring that the routing overheads are kept low are investigated. The issue is addressed both at node and network levels with a common goal of improving efficiency and performance of ad hoc networks without dedicating ourselves to a particular class of routing protocol. At node level, a method hereby referred to as "link availability forecast", that minimises routing overheads used for maintenance of neighbourhood, is derived. The targeted packets are packets that are broadcasted periodically (e.g. hello messages). The basic idea in this method is collection of mobility parameters from the neighbours and predictions or forecasts of these parameters in future. Using these parameters in simple calculations helps in identifying link availabilities between nodes participating in maintenance of networks backbone. At the network level, various approaches have been suggested. The first approach is the cone flooding method that broadcasts route request messages through a predetermined cone shaped region. This region is determined through computation using last known mobility parameters of the destination. Another approach is what is hereby referred as "destination search reverse zone method". In this method, a node will keep routes to destinations for a long time and use these routes for tracing the destination. The destination will then initiate route search in a reverse manner, whereby the source selects the best route for next delivery. A modification to this method is for the source node to determine the zone of route search and define the boundaries within which the packet should be broadcasted. The later method has been used for simulation purposes. The protocol used for verification of the improvements offered by the schemes was the AODV. The link availability forecast scheme was implemented on the AODV and labelled AODV_LA while the network level implementation was labelled AODV_RO. A combination of the two schemes was labelled AODV_LARO.

When in physical proximity, data can be directly exchanged between the mobile devices people carry - for example over Bluetooth. If people cooperate to store, carry and forward messages on one another's behalf, then an opportunistic network may be formed, independent of any fixed infrastructure. To enable performant routing within opportunistic networks, use of social network information has been proposed for social network routing protocols. But the decentralised and cooperative nature of the networks can however expose users of such protocols to privacy and security threats, which may in turn discourage participation in the network. In this thesis, we examine how to mitigate privacy and security threats in opportunistic networks while maintaining network performance. We first demonstrate that privacy-aware routing protocols are required in order to maintain network performance while respecting users' privacy preferences. We then demonstrate novel social network routing protocols that mitigate specific threats to privacy and security while maintaining network performance.

Recent research has shown that several spectrum bands are mostly underutilised. To resolve the issue of underutilisation of spectrum bands across the networks, the concept of Cognitive Radio (CR) technology was envisaged. The CR technology allows Secondary Users (SUs) to acquire opportunistic access to large parts of the underutilised spectrum bands on wireless networks. In CR networks, SUs may scan and identify the vacant channels in the wireless spectrum bands and then dynamically tune their receivers to identify vacant channels and transmitters, and commence communication among themselves without causing interference to Primary/Licensed Users (PUs). Despite the developments in the eld of CR technology, recent research shows that still there are many challenges unaddressed in the eld. Thus, there is a need to reduce additional handshaking over control and data channels, to minimise large sized control frames and to introduce reliable channel selection process and maintenance of SUs' communication when PUs return to a licensed channel. A fundamental challenge a ecting this technology is the identi cation of reliable Data Channels (DCHs) for SUs communication among available channels and the continuation of communication when the PU returns. This doctoral research investigates in detail how to resolve issues related to the protocol design for Cognitive Radio Networks (CRNs) on Medium Access Layers (MAC) for Ad-Hoc networks. As a result, a novel Reliable and Energy e cient Cognitive Radio multi-channel MAC protocol (RECR-MAC) for Ad-Hoc networks is proposed to overcome the shortcomings mentioned. After discussing the background, operation and architecture of CR technology, this research proposes numerous platforms and testbeds for the deployment of personal and commercial applications of the CRNs. Side by side, optimised control frames and a reduced number of handshakes over the CCH are suggested to extend the transmitting time for data communication. In addition, the reliable channel selection process is introduced instead of random selection of DCHs for successful data communication among the SUs. In RECR-MAC, the objective of every SU is to select reliable DCHs, thereby ensuring high connectivity and exchanging the successful data frames across the cognitive network. Moreover, the selection criteria of the DCHs are based on multiple factors, such as an initial selection based on the maximum free time recorded by the SUs over the DCH channel ranking, which is proportional to the number of positive/negative acknowledgements, and the past history of DCHs. If more than two DCHs have an equal value during the second, third and following iterations, then the DCHs are selected based upon the maximum free time. The priorities of the DCHs are then assigned based on Reliable Data Channels, that is, RDCH 1, RDCH 2, RDCH 3, and RDCH 4 respectively (where RDCH 1 and RDCH 2 have the highest priority, DRCH 3 and RDCH 4 have the next priority, and so on). The impacts of channel selection process and Backup Data Channel (BDC) over the proposed RECR-MAC protocol are analysed in combination with comparative benchmark CR-MAC protocols based on the timing diagrams proposed. Finally, the RECR-MAC protocol is validated by using a MATLAB simulator with PU impact over the DCHs, both with and without BDC, and by comparing results, such as communication time, transmitting energy and throughput, with benchmark CR-MAC protocols.

Thesis (MScEng (Electrical and Electronic Engineering))--Stellenbosch University, 2008. / A WSN (wireless sensor network) consists of a collection of small, low power electronic devices that can sense their environment and communicate with each other in order to send data to a base station for logging and monitoring. Research done on WSNs has increased rapidly over the past few years, as the necessary RF hardware has become cheaper and smaller. The wealth of information and hardware available in this field has made it possible to design and deploy networks for a multitude of monitoring purposes, on almost any terrain, without an existing telecommunication infrastructure. This thesis presents research into some major aspects of WSNs and the implementation of a test system with wireless sensor motes, that can be used for environmental monitoring, conservation purposes, impact studies, early warning systems for floods, fires etc. The system also has a wide range of possible uses in agriculture, as more data and better control over crops can increase yield. The power constraint of sensor nodes is one of the biggest concerns, as batteries can be depleted quickly and render a system useless. For this reason, work was focused on reducing power consumption of the hardware by means of various methods. Power use was also simulated very successfully, giving a accurate way of predicting node lifetime with a variety of battery types. The system was implemented on the Tmote Sky hardware platform using the open source sensor network operating system, TinyOS.

Thesis (MScEng (Electrical and Electronic Engineering))--Stellenbosch University, 2008. / In this thesis the design of a low-cost ad hoc network for short distance data acquisition applications with low data arrival intervals will be presented. The focus is on cost reduction by replacing the traditional high power radios with low-power RF transceivers. The conventional way of using multiple stationary repeater towers (depending on the network) is also replaced by using an ad hoc con guration, where each individual station also serves as a repeater station to adjacent stations. This approach reduces network design time enormously, seeing that the network is able to con gure itself. By using this auto-routing multi-hop approach, data acquisition points are no longer restricted to the reception areas of base stations. A CSMA contention protocol is used for the data communication. Current models used to model this protocol are dependent on various assumptions. In the research reported in this thesis, a statistical study of the collision probability is performed and the results used to expand the current CSMA models. Inter-dependent characteristics of this model are also further enhanced to provide a more realistic model. A simulink model of the particular CSMA protocol is also designed. Both the mathematical- and the simulink models provide relatively good predictions when compared to actual measured results

Thesis (MScEng (Electrical and Electronic Engineering))--University of Stellenbosch, 2006. / An ad-hoc network encompasses the cooperative engagement of a collection of mobile nodes that are free to move and communicate with each other wirelessly without the required intervention of any centralized access point or existing infrastructure. The advantage of such a network lies in it’s robustness, adaptiveness, the fact that its self-configurable and that it becomes somewhat indestructible due to it’s decentralized nature. But such a network layout simultaneously introduces many complex network management issues which are normally taken care of inherently by a rigid network architecture. The biggest challenge faced by any such protocol is the fact that it needs to be scalable, must maintain a decent stable data throughput, all whilst performing it’s own continuous network management and associated routing algorithms. These mobile nodes need a complex, scalable, compact and essentially realtime algorithm for maintaining an up to date representation of the overall network layout, yet without clogging the system’s communications channels with too much overhead traffic, and drastically lowering the effective data throughput. Since each mobile node only has a limited communications range each node also needs very advanced routing capabilities which will allow it to track who is currently within communications range, and at the same time allow the node to create multihop paths to distant destination nodes, thus connecting nodes which cannot directly communicate. This report follows the development process of both the software needed to successfully conceptualize, simulate and test the protocol, as well as the hardware needed as proof of concept. It highlights and discusses the various design choices / considerations made in development of such a protocol, the strong- and weakpoints of the developed protocol, as well as providing several possibilities to further evolve the developed protocol.

Thesis (MScEng (Electrical and Electronic Engineering))--University of Stellenbosch, 2010. / Please refer to full text for abstract.

In urban search and rescue (USAR) operations, there is a considerable amount of danger faced by rescuers. The use of mobile robots can alleviate this issue. Coordinating the search effort is made more difficult by the communication issues typically faced in these environments, such that communication is often restricted. With small numbers of robots, it is necessary to break communication links in order to explore the entire environment. The robots can be viewed as a broken ad hoc network, relying on opportunistic contact in order to share data. In order to minimise overheads when exchanging data, a novel algorithm for data exchange has been created which maintains the propagation speed of flooding while reducing overheads. Since the rescue workers outside of the structure need to know the location of any victims, the task of finding their locations is two parted: 1) to locate the victims (Search Time), and 2) to get this data outside the structure (Delay Time). Communication with the outside is assumed to be performed by a static robot designated as the Command Station. Since it is unlikely that there will be sufficient robots to provide full communications coverage of the area, robots that discover victims are faced with the difficult decision of whether they should continue searching or return with the victim data. We investigate a variety of search techniques and see how the application of biological foraging models can help to streamline the search process, while we have also implemented an opportunistic network to ensure that data are shared whenever robots come within line of sight of each other or the Command Station. We examine this trade-off between performing a search and communicating the results.

Les techniques de communication coopératives ont été proposées pour améliorer la qualité des signaux reçus par les terminaux sans fil grâce au principe de diversité spatiale. Cette propriété est obtenue par une duplication du signal, envoyé par l’émetteur au niveau d’un terminal relais situé entre l’émetteur et le récepteur. Les travaux de recherche menés en communications coopératives concernent deux domaines principaux: certains traitent la transmission physique alors que d’autres sont étudient l’interaction de la couche physique avec les couches protocolaires supérieures, en particulier les niveaux MAC (Medium Access Control) et réseau. Si ces domaines de recherche sont généralement séparés, des études conjointes s’avèrent nécessaires pour obtenir des systèmes coopératifs implantables. C’est dans ce contexte que se situent les travaux de la thèse avec, comme cadre applicatif, les réseaux ad hoc. En premier lieu, dans la mesure où il n’existe pas de modèle complet de système coopératif, un cadre de modélisation original est proposé pour représenter le fonctionnement d’un système coopératif, sa mise en place et son fonctionnement. Une caractéristique du modèle est de faire abstraction des couches protocolaires. Cette façon de procéder permet d’analyser de façon similaire différentes solutions proposées dans la littérature. De plus, ce modèle facilite la conception de solutions coopératives, en particulier la conception du processus de mise en place du système de coopération qui initialise les rôles de relais, destinataire et source en fonctionnement coopératif. Le modèle de système coopératif est utilisé pour la conception d’une solution de transmission coopérative adaptative où le relais agit en tant que proxy entre la source et le destinataire. L’intérêt de notre proposition, ProxyCoop, par rapport à d’autres propositions, est d’être compatible avec le protocole IEEE 802.11 que ce soit dans son mode de base ou dans son mode optionnel. Pour chaque trame, le mode de transmission à la source est dynamiquement défini soit en mode proxy coopératif soit en mode non coopératif, et ce en fonction de la réception ou la non réception d’un acquittement du destinataire. Les résultats de simulation montrent, sous certaines conditions, une amélioration des performances en termes de nombre de trames effectivement reçues. Le nombre de retransmissions dues à des trames reçues erronées est diminué, et les transmissions en mode multi saut, coûteuses en temps et en bande passante sont également diminuées. Les conditions favorables à la coopération sont dépendantes de la qualité et de l’accessibilité du canal. Une méthode pour la mise en place du système coopératif est également proposée. Elle repose sur l’utilisation d’un protocole standard de routage pour réseaux ad hoc, AODV. Les évaluations de performances indiquent que la mise en place du système de coopération coûte peu en termes de bande passante, les performances du système (mise en place et fonctionnement) sont supérieures à celles d’un système non-coopératif, pour des conditions données. Finalement, l’application de la solution proposée à un réseau ad hoc spécifique, un réseau maillé (mesh) conforme au standard IEEE 802.11s illustre où et comment déployer la solution proposée. / Cooperative communication techniques have been proposed in order to improve the quality of the received signals at the receivers by using the diversity added by duplication of signals sent by relay terminals situated between each transmission pair. Researches related to cooperative communication can be categorized into two fields; Cooperative transmissions and Cooperative setup. The first research field concerns with cooperative transmission techniques in the physical layer while the second research field concerns with issues on inter-layer interaction between cooperative transmissions in the physical layer to protocols in the upper layers (especially the MAC layer and the network layer). These research topics have been separately concerned but, for implementations, they have to work together. Since there is not any existing common frame work to describe entire functions in cooperative communication, we proposed an original framework of cooperative network at the system level called “Cooperative Network Model”. The model does not reflect the protocol layering; thus, we can generalize the cooperation process and obtain an analysis that is available for many solutions. For validity, the proposed model can clearly illustrate and systematically describe existing cooperative setup protocols. In addition, the proposed cooperative network model facilitates us to find and to solve problems in cooperative designs; especially in cooperative setup, which is in charge on the initiation of the terminal’s role (i.e., a source, a relay, and a destination terminal). Thus, we believe that this model can facilitate the design and updating of existing and future propositions in this domain. The cooperative network protocol is used to design an adaptive cooperative transmission called Proxy Cooperative Transmission. In contrast to other adaptive cooperative transmission techniques, our proposition is compatible to both of the basic access mode and the optional access mode of IEEE 802.11 Medium Access Control (MAC) protocol. The transmission mode for each data frame is adaptively switched between a proxy cooperative mode and a non-cooperative mode based on the absence of acknowledge (ACK) frame. Simulation results show that transmission performance is improved by decreasing the number of re-transmissions due to frame errors; thus, chances of multi-hop mode transitions that are costly in time and bandwidth are alleviated. Then, in order to fulfill ProxyCoop communications in part of cooperative setup, we propose a cooperative setup method called “Proxy Cooperative Setup”. The proposition is based on a routing standard protocol for ad hoc networks, AODV, so that it could be easily deployed. The impacts of ProxyCoopSetup when it works with ProxyCoop transmissions have been studied. From simulation results, it shows that ProxyCoop transmissions with ProxyCoopSetup has similar performance to the ProxyCoop transmissions without ProxyCoopSetup. Finally, when the implementation of the proxy cooperative communication and how it can be integrated on existing networks have been considered, it is shown that the design of proxy cooperative communication is also valuable for the 802.11s WLAN Mesh Network environments.