La croissance explosive des réseaux sans fil et l’augmentation du nombre de dispositifs sans fil ont soulevé de nombreuses difficultés techniques dans la planification et l’analyse de ces réseaux. Nous utilisons la modélisation continue, utile pour la phase initiale de déploiement et l’analyse à grande échelle des études régionales du réseau. Nous étudions le problème de routage dans les réseaux ad hoc, nous définissons deux principes d’optimisation du réseau: le problème de l’utilisateur et du système. Nous montrons que les conditions d’optimalité d’un problème d’optimisation construit d’une manière appropriée coïncide avec le principe de l’optimisation de l’utilisateur. Pour fonctions de coût différentes, nous résolvons le problème de routage pour les antennes directionnelles et omnidirectionnelles. Nous trouvons également une caractérisation des voies du coût minimum par l’utilisation extensive du Théorème de Green dans le cas d’antennes directionnelles. Dans de nombreux cas, la solution se caractérise par une équation aux dérivés partielles. Nous proposons l’analyse numérique par éléments finis qui donne les limites de la variation de la solution par rapport aux données. Lorsque nous permettons la mobilité des origines et destinations, on trouve la quantité optimale de relais actif. Dans les réseaux MIMO, nous montrons que, même lorsque la chaîne offre un nombre infini de degrés de liberté, la capacité est limitée par le rapport entre la taille du réseau d’antennes, la station de base, la position des mobiles et la longueur d’onde du signal. Nous constatons également l’association optimale mobile pour différentes politiques et distributions des utilisateurs. / The growing number of wireless devices and wireless systems present many challenges on the design and operation of these networks. We focus on massively dense ad hoc networks and cellular systems. We use the continuum modeling approach, useful for the initial phase of deployment and to analyze broad-scale regional studies of the network. We study the routing problem in massively dense ad hoc networks, and similar to the work of Nash, and Wardrop, we define two principles of network optimization: user- and system-optimization. We show that the optimality conditions of an appropriately constructed optimization problem coincides with the user-optimization principle. For different cost functions, we solve the routing problem for directional and omnidirectional antennas. We also find a characterization of the minimum cost paths by extensive use of Green’s theorem in directional antennas. In many cases, the solution is characterized by a partial differential equation. We propose its numerical analysis by finite elements method which gives bounds in the variation of the solution with respect to the data. When we allow mobility of the origin and destination nodes, we find the optimal quantity of active relay nodes. In Network MIMO systems and MIMO broadcast channels, we show that, even when the channel offers an infinite number of degrees of freedom, the capacity is limited by the ratio between the size of the antenna array at the base station and the mobile terminals position and the wavelength of the signal. We also find the optimal mobile association for the user- and system-optimization problem under different policies and distributions of the users.

The future success of communication networks hinges on the ability to overcome the mismatch between requested quality of service (QoS) and limited network resources. Spectrum is a natural resource that cannot be replenished and therefore must be used efficiently. On the other hand, energy efficiency (EE) is also becoming increasingly important as battery technology has not kept up with the growing requirements stemming from ubiquitous multimedia applications. The qualities of wireless channels vary with both time and user. We use channel state information (CSI) to dynamically assign wireless resources to users to improve spectral and energy efficiency. We first investigate a series of general treatments of exploiting CSI in a distributed way to control the medium access to maximize spectral efficiency for networks with arbitrary topologies and traffic distributions. As the first step, we propose decentralized optimization for multichannel random access (DOMRA), which uses local CSI and two-hop static neighborhood information to achieve performance comparable with the global optimal channel-aware Aloha. The generic framework developed in DOMRA proved to be very useful in improving cellular networks as well. We develop cochannel interference avoidance (CIA) medium access control (MAC), which is optimized by DOMRA, to mitigate the downlink severe cochannel interference that is usually experienced by cell-edge users. Aloha-based schemes have low channel utilization efficiency because of the collision of entire data frames. We further develop channel-aware distributed MAC (CAD-MAC), which avoids collision through signaling negotiation ahead of data transmission. CAD-MAC completely resolves the contention of networks with arbitrary topologies, achieves throughput close to centralized schedulers, and is robust to any channel uncertainty. Then we address energy-efficient wireless communications while emphasizing orthogonal frequency multiple access (OFDMA) systems. We first discover the global optimal energy-efficient link adaptation in frequency-selective channels using the strict quasiconcavity of energy efficiency functions. This link adaptation optimally balances the power consumption of electronic circuits and that of data transmission on each subchannel. The global optimal energy-efficient transmission can be obtained using iterative operations, which may be complex to be implemented in a practical system. Besides, running iterative algorithms consumes additional energy. Hence, we further develop a closed-form link adaptation scheme, which performs close to the global optimum. Besides, since subchannel allocation in OFDMA systems determines the energy efficiency of all users, we develop closed-form resource allocation approaches that achieve near-optimal performance too. In an interference-free environment, a tradeoff between EE and spectral efficiency (SE) exists, as increasing transmit power always improves SE but not necessarily EE. We continue the investigation in interference-limited scenarios and show that since increased transmit power also brings higher interference to the network, SE is not necessarily higher and the tradeoff is improved. Especially, in interference-dominated regimes, e.g., local area networks, both spectral- and energy-efficient communications desire optimized time-division protocols and the proposed DOMRA, CIA-MAC, and CAD-MAC can be used to improve both spectral and energy efficiency.

Currently there is ongoing research in the field of Mobile Ad-hoc Networks (MANET) for several different scenarios. Research has focused on topology related challenges such as routing mechanisms or addressing systems, as well as security issues like traceability of radio communication or encryption. In addition, there are very specific research interests such as the effects of directional antennas for MANETs or optimized transmission techniques for minimal power consumption or range optimization. Unmanned aerial vehicles (UAVs), and unmanned aerial systems (UAS) in general, need wireless systems in order to communicate. Current UAS are very flexible and allow for a wide spectrum of mission profiles by means of utilizing different UAVs, according to the requirements at hand. Each mission poses special needs and requirements on the internal and external UAS communication and special mission scenarios calling for UAV swarms increase the complexity and require specialized communication solutions. UAS have specific needs not provided by the general research, but are, on the other hand, to diversified to make much use of narrowly focused developments; UAS form a sufficiently large research area for application of MANETs to be considered as an independent group with specialized needs worthy of tailored implementations of MANET principles. MANET research has not tackled a general approach to UAS although some sources show specific applications involving UAVS. This work presents some new aspects for the development of of ad-hoc wireless networks for UAVs and UAS and focuses on their specialties and needs. A general framework for MANET development is proposed. Furthermore, the proposed specific evaluation scenarios provide for a UAS focused comparison of MANET performance.

In this thesis, we are concerned with content dissemination in mobile ad hoc networks. The scope of content dissemination is limited by network capacity, and sometimes the price to be paid for securing faster delivery. In the first part of the thesis, we address the issue of finding the maximum throughput that a mobile ad-hoc network can support. We have assumed that there is no price involved, and all nodes work as a team. The problem of determining the capacity region has long been known to be NP-hard even for stationary nodes. Mobility introduces an additional dimension of complexity because nodes now also have to decide when they should initiate route discovery. Since route discovery involves communication and computation overhead, it should not be invoked very often. On the other hand, mobility implies that routes are bound to become stale, resulting in sub-optimal performance if routes are not updated. We attempt to gain some understanding of these effects by considering a simple one-dimensional network model. The simplicity of our model allows us to use stochastic dynamic programming (SDP) to find the maximum possible network throughput with ideal routing and medium access control (MAC) scheduling. Using the optimal value as a benchmark, we also propose and evaluate the performance of a simple threshold-based heuristic. Unlike the optimal policy which requires considerable state information, the proposed heuristic is simple to implement and is not overly sensitive to the threshold value. We find empirical conditions for our heuristic to be near-optimal. Also, network scenarios when our heuristic does not perform very well are analyzed. We provide extensive numerical analysis and simulation results for different parameter settings of our model. Interestingly, we observe that in low density network the average throughput can first decrease with mobility, and then increase. This motivates us to study a mobile ad-hoc network when it is sparse and in a generalized environment, such as when movement of nodes is in a two-dimension plane. Due to sparseness, there are frequent disruptions in the connections and there may not be any end-to-end connection for delivery. The mobility of nodes may be used for carrying the forwarded message to the destination. This network is also known as a delay tolerant network. In the rest part of the thesis, we consider the relay nodes to be members of a group that charges a price for assisting in message transportation. First, we solve the problem of how to select first relay node when only one relay node can be chosen from a given number of groups. Next, we solve two problems, namely price-constrained delay minimization, and delay-constrained price optimization.

Mobile Ad-hoc Network (MANET) is a group of mobile devices that can form a network, interconnect and share resources without the use of any fixed network infrastructure or centralised management. MANET is exposed to security attacks because of its fundamental characteristics such as open medium, dynamic topology and lack of central monitoring. The black hole attack is one example of the attacks MANET is exposed to. In black hole attack, a malicious node misleadingly claims to have an updated route to the destination node, absorbs and drops the packets that are supposed to be forwarded to the destination node. The common MANET reactive routing protocols are Ad-hoc on-demand Distance Vector (AODV) and Dynamic Source Routing (DSR). These protocols are easily attacked by the black hole during the route discovery process. This research therefore studies black hole attack in detail and assesses the performance of AODV and DSR under black hole attack. The work is achieved by simulating the two protocols under regular operation and under black hole attack using Network Simulator 2 (NS-2). The protocols are analysed using packet delivery ratio, throughput and end-to-end delay as performance metrics. The research further compares the black hole attack solutions that have been previously proposed and determines the solution that performs better than others. The simulation results show that MANET under normal operating environment out performs MANET attacked by black hole, and that AODV is more vulnerable to black hole attack than DSR. The comparison study of the existing black hole attack solutions show that SAODV is the best effective black hole attack removal technique. But when considering the solution that brings no negative impact to the normal operation of the network, IDSAODV is the best solution. / Computing / M. Sc. (Computer Science)

Orientador: Paulo Cardieri / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e Computação / Made available in DSpace on 2018-08-06T17:02:09Z (GMT). No. of bitstreams: 1 Mignaco_AndreGustavo_M.pdf: 1003880 bytes, checksum: e71bd78fe77a5cd7d4f324c8bc14791b (MD5) Previous issue date: 2005 / Resumo: As redes de sensores sem fio têm merecido atenção especial nos últimos anos graças às suas características intrínsecas que as tornam atrativas em diversas aplicações, como em atividades industriais, de monitoramento de meio ambientes e segurança, entre outros. As mesmas características que tornam atrativas as redes de sensores sem fio fazem a análise do seu desempenho dificultoso. Diversos conceitos de medida da capacidade de redes ad hoc em geral têm sido propostos, incluindo a capacidade de transporte e a eficiência de informação. Nesta dissertação é introduzida uma variação do conceito de eficiência de informação, denominada eficiência de informação agregada, que leva em conta a habilidade da rede em reutilizar o canal de comunicação espacialmente. É apresentada uma análise da eficiência de informação agregada de uma rede de sensores sem fio em diversos cenários, utilizando-se diferentes modelagens da rede sem fio. Os resultados mostram que o meio em que a rede é empregada tem grande importância no seu desempenho, podendo ser decisivo na escolha do esquema de modulação a ser empregado. Também foi observado que transmitir em curtas distâncias é mais vantajoso que transmitir em longas distâncias na maioria dos casos / Abstract: Wireless sensor networks have deserved special attention in the last years due to their intrinsic characteristics that become them attractive in various applications, such as in the industrial activities, in the environment monitoring and security, among others. The same characteristics that become the wireless sensor networks attractive make hard the analysis of their performance. Many concepts of measure of capacities of ad hoc networks have been proposed, including the transport capacity and the information efficiency. In this dissertation is introduced a variation of the concept of information efficiency, called aggregated information efficiency, that takes into account the ability of the network in reusing spatially the communication channel. It is presented an analysis of the aggregated information efficiency of a wireless ad hoc network in many scenarios, where are used different models of the wireless network. The results show that the environment where the network is employed has a big importance in its performance, and it can be decisive in the choice of the modulation scheme to be used. Also was observed that to transmit in short distances is better than do it in longer ones in the majority of the cases / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica

[EN] In recent years, advances in wireless technologies and improved sensing and computational capabilities have led to a gradual transition towards Intelligent Transportation Systems (ITS) and related applications. These applications aim at improving road safety, provide smart navigation, and eco-friendly driving. Vehicular Ad hoc Networks (VANETs) provide a communication structure for ITS by equipping cars with advanced sensors and communication devices that enable a direct exchange of information between vehicles. Different types of ITS applications rely on two types of messages: periodic beacons and event-driven messages. Beacons include information such as geographical location, speed, and acceleration, and they are only disseminated to a close neighborhood. Differently from beacons, event-driven messages are only generated when a critical event of general interest occurs, and it is spread within a specific target area for the duration of the event. The reliability of information exchange is one of the main issues for vehicularcommunications since the safety of people on the road is directly related to the effectiveness of these transmissions. A Medium Access Control (MAC) protocol must guarantee reliable beacon broadcasting within deadline bounds to all vehicles in the neighbourhood, thereby providing them timely notifications about unsafe driving conditions or other hazardous events. Moreover, infotainment and comfort applications require reliable unicast transmissions that must be taken into account. However, high node mobility, highly dynamic topology, and lack of a central control unit, are issues that make the design of a reliable MAC protocol for vehicular environments a very difficult and challenging task, especially when efficient broadcasting strategies are required. The IEEE 802.11p MAC protocol, an approved amendment to the IEEE 802.11 standard, is a random access protocol that is unable to provide guaranteed delay bounds with sufficient reliability in vehicular scenarios, especially under high channel usage. This problem is particularly serious when implementing (semi-) automated driving applications such as platooning, where inter-vehicle spacing is drastically reduced, and the control loop that manages and maintains the platoon requires frequent, timely and reliable exchange of status information (beacons). In this thesis novel protocols compatible with the IEEE 802.11 and 802.11p standards are proposed in order to optimally adjust the contention window size for unicast applications in Mobile Ad hoc Networks (MANETs) and VANETs. Experimental tests comparing our proposals to existing solutions show that the former are able to improve the packet delivery ratio and the average end-to-end delay for unicast applications. Concerning efficient message diffusion (broadcast) in VANET environments, we proposed token-based MAC solutions to improve the performance achieved by existing 802.11p driving safety applications in different vehicular environments, including highway, urban, and platooning scenarios. Experimental results show that the proposed solutions clearly outperform 802.11p when delay-bounded beacons and event notifications must be delivered. / [ES] Recientemente, los avances en las tecnologías inalámbricas y las mejoras en términos de capacidades de sensorización y computación de los dispositivos electrónicos, han dado lugar a una transición gradual hacia servicios y aplicaciones de los Sistemas Inteligentes de Transporte (ITS). Estas aplicaciones tienen como objetivo mejorar la seguridad vial, proporcionar una navegación inteligente, y promover la conducción eco-eficiente. Las redes vehiculares ad hoc (VANETs) proporcionan una infraestructura de comunicaciones para ITS al equipar los coches con sensores avanzados y dispositivos de comunicación que permiten el intercambio directo de información entre vehículos. Los diferentes tipos de aplicaciones ITS se basan en dos tipos de mensajes: mensajes periódicos conocidos como beacons y mensajes asociados a eventos. Los mensajes periódicos incluyen información relativa a la ubicación geográfica, la velocidad y la aceleración, entre otros, y sólo son distribuidos entre los vehículos vecinos. A diferencia de estos beacons, los mensajes asociados a eventos sólo se generan cuando se produce un evento crítico de interés general, el cual se propaga dentro del área de interés de dicho evento y mientras éste siga activo. La fiabilidad del intercambio de información es uno de los principales problemas para las comunicaciones vehiculares, debido principalmente a que las aplicaciones de seguridad dependen directamente de la eficacia de estas transmisiones. Un protocolo de Control de Acceso al Medio (MAC) debe garantizar la difusión fiable de información a todos los vehículos vecinos dentro de unos límites máximos de retardo, proporcionándoles las notificaciones oportunas respecto a condiciones de conducción inseguras y otros eventos peligrosos. Por otra parte, las aplicaciones de información y entretenimiento, así como las aplicaciones orientadas al confort, también requieren transmisiones fiables extremoa-extremo. Sin embargo, la alta movilidad de los vehículos, la variabilidad de la topología, así como la falta de una unidad central de control, son factores que hacen que el diseño de un protocolo MAC fiable para entornos vehiculares sea una tarea especialmente compleja, especialmente cuando son necesarias estrategias de difusión eficientes. El protocolo MAC IEEE 802.11p, una modificación ya aprobada al estándar IEEE 802.11 original para entornos de comunicación vehiculares, es un protocolo de acceso que no es capaz de garantizar unos límites de retardo con la fiabilidad necesaria para estos entornos, especialmente en escenarios de alta utilización del canal inalámbrico. Este problema es particularmente importante a la hora de implementar aplicaciones de conducción (semi-)automática, como el caso de grupos de vehículos donde la separación entre vehículos se reduce drásticamente, y el sistema de control que gestiona y mantiene el grupo requiere de un intercambio frecuente de información fiable y acotado en retardo. En esta tesis se proponen nuevos protocolos MAC compatibles con los estándares IEEE 802.11 y 802.11p basados en el ajuste del tamaño de la ventana de contención para aplicaciones unicast en rede MANETs y VANETs. Los resultados experimentales obtenidos comparando nuestras propuestas con las soluciones existentes muestran que los protocolos propuestos son capaces de mejorar la tasa de entrega de paquetes y el retardo medio extremo-a-extremo para aplicaciones unicast. En lo que respecta a la difusión eficiente de mensajes broadcast en entornos VANET, se han propuesto soluciones MAC basadas en el uso de tokens que mejoran las prestaciones de aplicaciones de conducción segura basadas en el estándar 802.11p, tanto en autopistas, zonas urbanas, y escenarios con grupos de vehículos. Los resultados experimentales muestran que las soluciones propuestas superan claramente al protocolo 802.11p cuando es necesario entregar mensajes y notificaciones de eventos con restricc / [CA] Recentment, els avan en les tecnologies sense fils i les millores en termes de capacitats de sensorització i computació dels dispositius electrònics, han donat lloc a una transició gradual cap a serveis i aplicacions dels sistemes intelligents de transport (ITS). Aquestes aplicacions tenen com a objectiu millorar la seguretat vial, proporcionar una navegació intelligent, i promoure la conducció ecoeficient. Les xarxes vehiculars ad hoc (VANET) proporcionen una infraestructura de comunicacions per a ITS, ja que equipen els cotxes amb sensors avançats i dispositius de comunicació que permeten l'intercanvi directe d'informació entre vehicles. Els diversos tipus d'aplicacions ITS es basen en dos classes de missatges: missatges periòdics coneguts com a beacons i missatges associats a esdeveniments. Els missatges periòdics inclouen informació relativa a la ubicació geogràfica, la velocitat i l'acceleració, entre uns altres, i només són distribuïts entre els vehicles veïns. A diferència d'aquests beacons, els missatges associats a esdeveniments només es generen quan es produeix un esdeveniment crític d'interès general, el qual es propaga dins de l àrea d'interès d'aquest esdeveniment i mentre aquest seguisca actiu. La fiabilitat de l'intercanvi d'informació és un dels principals problemes per a les comunicacions vehicular, principalment perquè les aplicacions de seguretat depenen directament de l'eficàcia d'aquestes transmissions. Un protocol de control d'accés al medi (MAC) ha de garantir la difusió fiable d'informació a tots els vehicles veïns dins d'uns límits màxims de retard, i proporcionar-los les notificacions oportunes respecte a condicions de conducció insegures i altres esdeveniments perillosos. D'altra banda, les aplicacions d'informació i entreteniment, com també les aplicacions orientades al confort, també requereixen transmissions fiables extrema-extrem. No obstant això, l'alta mobilitat dels vehicles, la variabilitat de la topologia, i la falta d'una unitat central de control, són factors que fan que el disseny d'un protocol MAC fiable per a entorns vehiculars siga una tasca especialment complexa, especialment quan són necessàries estratègies de difusió eficients. El protocol MAC IEEE 802.11p, una modificació ja aprovada a l'estàndard IEEE 802.11 original per a entorns de comunicació vehiculars, és un protocol d'accés que no és capa garantir uns límits de retard amb la fiabilitat necessària per a aquests entorns, especialment en escenaris d'alta utilització del canal sense fil. Aquest problema és particularment important a l'hora d'implementar aplicacions de conducció (semi)automàtica, com el cas de grups de vehicles en què la separació entre vehicles es redueix dràsticament, i el sistema de control que gestiona i manté el grup requereix un intercanvi freqüent d'informació fiable i delimitat en retard. En aquesta tesi es proposen nous protocols MAC compatibles amb els estàndards IEEE 802.11 i 802.11p basats en l'ajust de les dimensions de la finestra de contenció per a aplicacions unicast en xarxes MANET i VANET. Els resultats experimentals obtinguts comparant les nostres propostes amb les solucions existents mostren que els protocols proposats són capa de millorar la taxa de lliurament de paquets i el retard mitjà extrem-a-extrem per a aplicacions unicast. Pel que fa a la difusió eficient de missatges broadcast en entorns VANET, s'han proposat solucions MAC basades en l'ús de tokens que milloren les prestacions d'aplicacions de conducció segura basades en l'estàndard 802.11p, tant en autopistes, zones urbanes, i escenaris amb grups de vehicles. Els resultats experimentals mostren que les solucions proposades superen clarament el protocol 802.11p quan cal lliurar missatges i notificacions d'esdeveniments amb restriccions de latència. / Balador, A. (2016). Design and Evaluation of Efficient Medium Access Control Solutions for Vehicular Environments [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/64073

Thesis (MSc)--Stellenbosch University, 2012. / ENGLISH ABSTRACT: This thesis explores two key aspects of wireless ad hoc networks. The first aspect concerns the topic of stimulating cooperation between nodes in a wireless ad hoc network. The functionality of a wireless ad hoc network depends entirely on the willingness of nodes to relay messages on behalf of other nodes. Network functionality depends on ensuring cooperation between nodes, so that each node benefits from continued participation in the network. This suggests an important question: how can cooperation among individual nodes be managed to improve overall wireless ad hoc network performance? The second aspect explored in this thesis concerns the concept of optimal resource utilisation. Wireless ad hoc networks are characterised by limited bandwidth and energy resources, which facilitates deployment in situations in which traditional infrastructure based networks are not practical. This suggests another important question: how can the use of the limited energy and bandwidth resources of wireless ad hoc networks be optimised? This research relies on the concept of a credit-based market economy. Nodes in simulated ad hoc networks use credits to pay for the cost of sending their own traffic and earn credits by forwarding traffic on behalf of other nodes. We show that a credit-based market economy approach can be employed to stimulate and regulate cooperation between nodes in a wireless ad hoc network. We show that this approach can be implemented in a simple decentralised manner and that it has several variants depending on which node is considered to be paying for the service, what the price of each service should be and how we route packets around the network using information derived from the credit-based economy. This thesis demonstrates that several variants of a credit-based scheme can be implemented in a packet based simulator and that these variants result in the stable operation of the network and improve the overall performance. The credit-based mechanisms also show significant improvement to network performance in resource constrained conditions and represent an effective means for optimising limited energy and bandwidth resource. The effectiveness of the credit-based mechanisms increases as the load on the networks increases. / AFRIKAANSE OPSOMMING: Hierdie tesis ondersoek twee belangrike aspekte van draadlose ad hoc-netwerke. Die eerste aspek het betrekking op die onderwerp van 'n stimulerende samewerking tussen die nodusse in 'n draadlose ad hoc-netwerk. Dat die network funksioneer hang daarvan af om samewerking tussen die nodusse te verseker sodat elke nodus voordeel put uit voortgesette deelname in die netwerk. Dit dui op 'n belangrike vraag: Hoe kan die samewerking tussen die individuele nodusse bestuur word om die prestasie van 'n draadlose ad hoc-netwerk te verbeter? Die tweede aspek wat in hierdie tesis ondersoek word, behels die konsep van optimale hulpbronbenutting. Draadlose ad hoc-netwerke word gekenmerk deur beperkte bandwydte- en energie-hulpbronne, wat ontplooiing bewerkstellig in situasies waar tradisionele infrastruktuur-gebaseerde netwerke nie practise moontlik is nie. Dit dui op 'n ander belangrike vraag: Hoe kan die gebruik van die beperkte energie- en bandwydte-hulpbronne van draadlose ad hoc-netwerke optimaal bestuur word? Hierdie navorsing berus op die konsep van 'n krediet-gebaseerde markekonomie. Nodusse in gesimuleerde ad hoc-netwerke gebruik krediete om te betaal vir die versending van hul eie verkeer en nodusse verdien krediete deur die verkeer van ander nodusse aan te stuur. Ons wys dat die benadering van 'n krediet-gebaseerde markekonomie gebruik kan word om die samewerking tussen die nodusse in 'n draadlose ad hoc-netwerk te stimuleer en te reguleer. Ons wys dat hierdie benadering geïmplementeer kan word op 'n eenvoudige gedesentraliseerde wyse. Ons ondersoek verskeie variasies van die benadering, na gelang van watter nodus oorweeg word om vir die diens te betaal, wat die prys van elke diens moet wees en hoe inligting afgelei van die krediet-gebaseerde ekonomie gebruik kan word om pakkies in die netwerk te roeteer. Hierdie tesis toon dat verskeie variante van 'n krediet-gebaseerde skema geïmplementeer kan word in 'n netwerksimulator en dat hierdie variante die stabiele bedryf van en algehele verbetering in die prestasie van die network tot gevolg het. Die krediet-gebaseerde meganismes toon 'n beduidende verbetering in hulpbronbenutting en netwerkprestasie in omgewings met beperkte hulpbronne en verteenwoordig 'n doeltreffende manier om die beperkte energie- en bandwydte-hulpbronne optimaal te benut. Laastens, die doeltreffendheid van die krediet-gebaseerde meganismes word verhoog as die las op die netwerke word verhoog.

ITC/USA 2005 Conference Proceedings / The Forty-First Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2005 / Riviera Hotel & Convention Center, Las Vegas, Nevada / An ad hoc network is a group of wireless nodes which do not rely on any fixed infrastructure. Hosts cooperate by forwarding packets for each other to communicate with nodes that are out of the radio transmission range. We propose a new routing algorithm that is based on the concept of multipoint relay nodes (MPR). The main focus of the Trust Level Routing protocol is the reliability and survivability of the network by applying costs to each MPR candidate. The cost calculation is based on the delay incurred, energy available at the MPR node, energy spent during transmission and number of packets sent on each link. We highlight the vulnerabilities in current link state routing algorithms and propose the use of light weight encryption algorithms to achieve a dependable routing algorithm. Network simulator (ns-2) is used to compare the protocol performance to other existing link state routing protocols.

Vehicular ad hoc Networks (VANETs) allow vehicles to form a self-organized network. VANETs are likely to be widely deployed in the future, given the interest shown by industry in self-driving cars and satisfying their customers various interests. Problems related to Mobile ad hoc Networks (MANETs) such as routing, security, etc.have been extensively studied. Even though VANETs are special type of MANETs, solutions proposed for MANETs cannot be directly applied to VANETs because all problems related to MANETs have been studied for small networks. Moreover, in MANETs, nodes can move randomly. On the other hand, movement of nodes in VANETs are constrained to roads and the number of nodes in VANETs is large and covers typically large area. The following are the contributions of the thesis. Secure, authenticated, privacy preserving message dissemination in VANETs: When vehicles in VANET observe phenomena such as accidents, icy road condition, etc., they need to disseminate this information to vehicles in appropriate areas so the drivers of those vehicles can take appropriate action. When such messages are disseminated, the authenticity of the vehicles disseminating such messages should be verified while at the same time the anonymity of the vehicles should be preserved. Moreover, to punish the vehicles spreading malicious messages, authorities should be able to trace such messages to their senders when necessary. For this, we present an efficient protocol for the dissemination of authenticated messages. Incentive-based architecture for vehicular cloud: Due to the advantages such as exibility and availability, interest in cloud computing has gained lot of attention in recent years. Allowing vehicles in VANETs to store the collected information in the cloud would facilitate other vehicles to retrieve this information when they need. In this thesis, we present a secure incentive-based architecture for vehicular cloud. Our architecture allows vehicles to collect and store information in the cloud; it also provides a mechanism for rewarding vehicles that contributing to the cloud. Privacy preserving message dissemination in VANETs: Sometimes, it is sufficient to ensure the anonymity of the vehicles disseminating messages in VANETs. We present a privacy preserving message dissemination protocol for VANETs.