Controlo de acesso ao meio em comunicações veiculares de tempo-real

Despite several preventive measures, the number of roadway accidents is still very high, being considered even a problem of public health by some entities. This thesis has as global purpose of contributing to the reduction of that number of accidents, and consequent fatalities, by using safety-related applications that use communication among vehicles. In particular, the primary goal is guaranteeing that communication between users in vehicular environments is done with appropriate time bounds to transfer safety-critical information. In detail, it is studied how to manage the scheduling of message’s transmissions (medium access control - MAC), in order to define precisely who will communicate and when is the appropriate instant. The preferable situation where a communication infrastructure is present with full coverage (RSUs) is also studied, from which medium access control is defined precisely, and vehicles (OBUs) become aware of medium utilization. Also, sporadic situations (e.g., absence of RSUs) are studied in which the communication network is “ad hoc” and solely formed by the current vehicles. It is used the recently WAVE / IEEE 802.11p standard, specific for vehicular communications, and it is proposed a TDMA based solution, with appropriate coordination between RSUs in order to effectively disseminate a critical safety event. It is taken into account two different ways of choosing the instant for the initial broadcast, and both cases are compared. In case there is no infrastructure available, methods are derived to minimize communication medium access collisions, and to maximize the available bandwidth. The results reflect the total end-to-end delay, and show that adequate times are attained, and meet with the requisites for the type of applications being considered. Also, enhancements are obtained when using the alternate choice for the initial broadcast instant.Apesar de diversas medidas preventivas, o número de acidentes rodoviários continua a ser muito elevado, sendo mesmo considerado uma questão de saúde pública por algumas entidades. Esta tese tem como objetivo geral contribuir para a redução desse número de acidentes, e consequentes fatalidades, através da utilização de aplicações de segurança que envolvem comunicação entre veículos. Em particular, o objetivo principal é garantir que a comunicação entre utentes, em ambientes veiculares, seja efetuada com limites temporais apropriados à transferência de informações críticas. De forma mais detalhada, é estudada a gestão do escalonamento das transmissões (controlo de acesso ao meio – MAC) que irá definir quem vai comunicar e quando o pode fazer. São estudadas situações (desejadas) onde há uma infra-estrutura de comunicações com cobertura integral (RSUs), a partir da qual se faz a coordenação do acesso ao meio pelos veículos (OBUs), e situações (esporádicas, por ausência de RSU) em que a rede de comunicação é “ad hoc” e apenas constituída pelos veículos presentes. Utiliza-se a recente norma WAVE / IEEE 802.11p, específica para comunicações veiculares, e propõe-se uma solução baseada em TDMA, com coordenação apropriada entre RSUs para disseminação efetiva de um evento crítico de segurança. A escolha do instante para o broadcast inicial do evento de segurança também é tida em conta, e são comparados dois casos distintos. No caso da ausência de infraestrutura, derivam-se métodos para minimizar colisões no acesso ao meio de comunicação, e maximizar a largura de banda disponível. Os resultados refletem o atraso total end-to-end, mostrando tempos apropriados para os requisitos das aplicações em causa, e evidenciando melhorias aquando da escolha alternativa para o instante do broadcast inicial.Programa Doutoral em Engenharia Eletrotécnic

Cooperative routing for collision minimization in wireless sensor networks

Cooperative communication has gained much interest due to its ability to exploit the broadcasting nature of the wireless medium to mitigate multipath fading. There has been considerable amount of research on how cooperative transmission can improve the performance of the network by focusing on the physical layer issues. During the past few years, the researchers have started to take into consideration cooperative transmission in routing and there has been a growing interest in designing and evaluating cooperative routing protocols. Most of the existing cooperative routing algorithms are designed to reduce the energy consumption; however, packet collision minimization using cooperative routing has not been addressed yet. This dissertation presents an optimization framework to minimize collision probability using cooperative routing in wireless sensor networks. More specifically, we develop a mathematical model and formulate the problem as a large-scale Mixed Integer Non-Linear Programming problem. We also propose a solution based on the branch and bound algorithm augmented with reducing the search space (branch and bound space reduction). The proposed strategy builds up the optimal routes from each source to the sink node by providing the best set of hops in each route, the best set of relays, and the optimal power allocation for the cooperative transmission links. To reduce the computational complexity, we propose two near optimal cooperative routing algorithms. In the first near optimal algorithm, we solve the problem by decoupling the optimal power allocation scheme from optimal route selection. Therefore, the problem is formulated by an Integer Non-Linear Programming, which is solved using a branch and bound space reduced method. In the second near optimal algorithm, the cooperative routing problem is solved by decoupling the transmission power and the relay node se- lection from the route selection. After solving the routing problems, the power allocation is applied in the selected route. Simulation results show the algorithms can significantly reduce the collision probability compared with existing cooperative routing schemes

MAC/PHY Co-Design of CSMA Wireless Networks Using Software Radios.

In the past decade, CSMA-based protocols have spawned numerous network standards (e.g., the WiFi family), and played a key role in improving the ubiquity of wireless networks. However, the rapid evolution of CSMA brings unprecedented challenges, especially the coexistence of different network architectures and communications devices. Meanwhile, many intrinsic limitations of CSMA have been the main obstacle to the performance of its derivatives, such as ZigBee, WiFi, and mesh networks. Most of these problems are observed to root in the abstract interface of the CSMA MAC and PHY layers --- the MAC simply abstracts the advancement of PHY technologies as a change of data rate. Hence, the benefits of new PHY technologies are either not fully exploited, or they even may harm the performance of existing network protocols due to poor interoperability. In this dissertation, we show that a joint design of the MAC/PHY layers can achieve a substantially higher level of capacity, interoperability and energy efficiency than the weakly coupled MAC/PHY design in the current CSMA wireless networks. In the proposed MAC/PHY co-design, the PHY layer exposes more states and capabilities to the MAC, and the MAC performs intelligent adaptation to and control over the PHY layer. We leverage the reconfigurability of software radios to design smart signal processing algorithms that meet the challenge of making PHY capabilities usable by the MAC layer. With the approach of MAC/PHY co-design, we have revisited the primitive operations of CSMA (collision avoidance, carrier signaling, carrier sensing, spectrum access and transmitter cooperation), and overcome its limitations in relay and broadcast applications, coexistence of heterogeneous networks, energy efficiency, coexistence of different spectrum widths, and scalability for MIMO networks. We have validated the feasibility and performance of our design using extensive analysis, simulation and testbed implementation.PHDComputer Science & EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/95944/1/xyzhang_1.pd

部分重複チャネル割当を用いた無線メッシュネットワークの展開法に関する研究

Tohoku University加藤寧課

Mobile Ad hoc Networking: Imperatives and Challenges

Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self-organize into arbitrary and temporary, "ad-hoc" network topologies, allowing people and devices to seamlessly internetwork in areas with no pre-existing communication infrastructure, e.g., disaster recovery environments. Ad hoc networking concept is not a new one, having been around in various forms for over 20 years. Traditionally, tactical networks have been the only communication networking application that followed the ad hoc paradigm. Recently, the introduction of new technologies such as the Bluetooth, IEEE 802.11 and Hyperlan are helping enable eventual commercial MANET deployments outside the military domain. These recent evolutions have been generating a renewed and growing interest in the research and development of MANET. This paper attempts to provide a comprehensive overview of this dynamic field. It first explains the important role that mobile ad hoc networks play in the evolution of future wireless technologies. Then, it reviews the latest research activities in these areas, including a summary of MANET\u27s characteristics, capabilities, applications, and design constraints. The paper concludes by presenting a set of challenges and problems requiring further research in the future