100 research outputs found
Performance improvement in mobile ad-hoc networks.
The objective of this research is to enhance the network performance under realistic mobile ad-hoc networks environments without modification of the standard. Overview of this research is summarized as follows:
First, a packet-fragmentation technique to improve network throughput under the worst channel
conditions is proposed. While the conventional packet-fragmentation technique research focuses only on random-bit errors, the proposed technique employs both random bit errors and hidden-node collisions. The analytical models based on Markov-chain model shows that the optimal fragmentation technique can effectively reduce the number of retransmissions caused by both collisions from hidden nodes and corrupted packets by random bit errors, and eventually improving throughput in noisy VANETs channels.
As a second contribution, a dynamic service-channel allocation (DSCA) scheme is proposed to maximize the network throughput by dynamically assigning different service channels to the users. The theoretical analysis in this thesis will consider wireless access in the vehicular environment (WAVE) protocol, which is the main characteristic of the vehicular ad-hoc networks standard (the IEEE 802.11p).
To summarize, the main contribution of this research is that two schemes will improve the network throughput significantly without modification of the standard. Therefore, there is no implementation issue to deploy the proposed schemes in real devices.PhDCommittee Chair: Copeland, John; Committee Co-Chair: Chang, Yusun; Committee Member: Ammar, Mostafa; Committee Member: Beyah, Raheem; Committee Member: Owen, Henry; Committee Member: Taylor, Davi
Tiheiden Wi-Fi verkkojen optimointi Markov-ketjumallien ja simuloidun jäähdytyksen avulla
Currently, the demand for wireless communication capacity is rising rapidly due to challenging applications such as video streaming and the emerging Internet of things. In meeting these ambitious requirements, the most important factor is predicted to be network densification, which refers to increasing the geographical density of simultaneously communicating devices. A natural choice for implementing dense networks is the wireless local area network technology Wi-Fi, characterized by being cheap and easy to deploy.
Network density aggravates the harmful effects of interference and causes scarcity of free transmission bandwidth. To counter this, dense networks need radio resource management algorithms.
This thesis presents a Wi-Fi radio resource management algorithm, which jointly optimizes access point channels, user association and transmission power. It estimates future throughput using a continuous time Markov chain based model, and finds solutions maximizing this estimate via a discrete search metaheuristic called simulated annealing.
The algorithm is validated through a wide range of simulations where for instance network density is varied. The algorithm is found to be highly versatile, yielding good performance in all scenarios. Moreover, the general design approach places few restrictions on further algorithm improvement and extension. Markov chain modeling, although accurate in an idealized setting, turns out to be inaccurate with real-world Wi-Fi, with a simpler model offering similar accuracy but lighter computational load.Nykyisin vaatimukset langattoman tiedonsiirron kapasiteetille ovat voimakkaassa kasvussa johtuen haastavista sovelluksista kuten videon suoratoistosta ja tulossa olevasta esineiden Internetistä. Näiden vaatimusten täyttämiseksi tärkein keino on langattomien tiedonsiirtoverkkojen tihentäminen, mikä tarkoittaa yht’aikaa samalla maantieteellisellä alueella kommunikoivien laitteiden määrän kasvattamista. Luonnollinen valinta tiheiden verkkojen toteuttamiseen on langattomien lähiverkkojen teknologia Wi-Fi, jonka etuja ovat edullisuus ja asennuksen helppous.
Langattoman verkon tiheys lisää haitallista interferenssiä ja aikaansaa pulaa vapaista lähetystaajuuksista. Näiden ongelmien ratkaisemiseksi tarvitaan radioresurssien hallinta-algoritmeja.
Tässä työssä suunnitellaan Wi-Fiä varten radioresurssien hallinta-algoritmi, joka optimoi samanaikaisesti tukiasemien kanavia, käyttäjien allokaatiota tukiasemille sekä lähetystehoja. Se estimoi tulevia tiedonsiirtonopeuksia jatkuvan ajan Markov-ketjuihin pohjautuvan mallin avulla ja löytää tämän estimaatin maksimoivia ratkaisuja hyödyntämällä diskreettiä hakumenetelmää nimeltä simuloitu jäähdytys.
Algoritmi validoidaan käyttäen monipuolista joukkoa simulaatioita, jossa vaihtelee esimerkiksi verkon tiheys. Algoritmi osoittautuu erittäin monipuoliseksi, sillä sen suorituskyky on hyvä kaikissa simulaatioskenaarioissa. Käytetyn lähestymistavan etuna on myös se, että se asettaa varsin vähän rajoituksia algoritmin jatkokehitykselle. Markov-ketjumallit osoittautuvat todellisen Wi-Fin tapauksessa epätarkoiksi, vaikka ne idealisoidussa ympäristössä ovatkin tarkkoja. Käy ilmi, että yksinkertaisemmalla mallilla saadaan vastaava tarkkuus, mutta laskentatehoa tarvitaan vähemmän
Channel Access Management in Data Intensive Sensor Networks
There are considerable challenges for channel access in Data Intensive Sensor Networks - DISN, supporting Data Intensive Applications like Structural Health Monitoring. As the data load increases, considerable degradation of the key performance parameters of such sensor networks is observed. Successful packet delivery ratio drops due to frequent collisions and retransmissions. The data glut results in increased latency and energy consumption overall. With the considerable limitations on sensor node resources like battery power, this implies that excessive transmissions in response to sensor queries can lead to premature network death. After a certain load threshold the performance characteristics of traditional WSNs become unacceptable. Research work indicates that successful packet delivery ratio in 802.15.4 networks can drop from 95% to 55% as the offered network load increases from 1 packet/sec to 10 packets/sec. This result in conjunction with the fact that it is common for sensors in an SHM system to generate 6-8 packets/sec of vibration data makes it important to design appropriate channel access schemes for such data intensive applications.In this work, we address the problem of significant performance degradation in a special-purpose DISN. Our specific focus is on the medium access control layer since it gives a fine-grained control on managing channel access and reducing energy waste. The goal of this dissertation is to design and evaluate a suite of channel access schemes that ensure graceful performance degradation in special-purpose DISNs as the network traffic load increases.First, we present a case study that investigates two distinct MAC proposals based on random access and scheduling access. The results of the case study provide the motivation to develop hybrid access schemes. Next, we introduce novel hybrid channel access protocols for DISNs ranging from a simple randomized transmission scheme that is robust under channel and topology dynamics to one that utilizes limited topological information about neighboring sensors to minimize collisions and energy waste. The protocols combine randomized transmission with heuristic scheduling to alleviate network performance degradation due to excessive collisions and retransmissions. We then propose a grid-based access scheduling protocol for a mobile DISN that is scalable and decentralized. The grid-based protocol efficiently handles sensor mobility with acceptable data loss and limited overhead. Finally, we extend the randomized transmission protocol from the hybrid approaches to develop an adaptable probability-based data transmission method. This work combines probabilistic transmission with heuristics, i.e., Latin Squares and a grid network, to tune transmission probabilities of sensors, thus meeting specific performance objectives in DISNs. We perform analytical evaluations and run simulation-based examinations to test all of the proposed protocols
Multi-Agent Reinforcement Learning for Connected and Automated Vehicles Control: Recent Advancements and Future Prospects
Connected and automated vehicles (CAVs) have emerged as a potential solution
to the future challenges of developing safe, efficient, and eco-friendly
transportation systems. However, CAV control presents significant challenges,
given the complexity of interconnectivity and coordination required among the
vehicles. To address this, multi-agent reinforcement learning (MARL), with its
notable advancements in addressing complex problems in autonomous driving,
robotics, and human-vehicle interaction, has emerged as a promising tool for
enhancing the capabilities of CAVs. However, there is a notable absence of
current reviews on the state-of-the-art MARL algorithms in the context of CAVs.
Therefore, this paper delivers a comprehensive review of the application of
MARL techniques within the field of CAV control. The paper begins by
introducing MARL, followed by a detailed explanation of its unique advantages
in addressing complex mobility and traffic scenarios that involve multiple
agents. It then presents a comprehensive survey of MARL applications on the
extent of control dimensions for CAVs, covering critical and typical scenarios
such as platooning control, lane-changing, and unsignalized intersections. In
addition, the paper provides a comprehensive review of the prominent simulation
platforms used to create reliable environments for training in MARL. Lastly,
the paper examines the current challenges associated with deploying MARL within
CAV control and outlines potential solutions that can effectively overcome
these issues. Through this review, the study highlights the tremendous
potential of MARL to enhance the performance and collaboration of CAV control
in terms of safety, travel efficiency, and economy
Cross-layer optimizations in multi-hop ad hoc networks
Unlike traditional wireless networks, characterized by the presence of last-mile, static and
reliable infrastructures, Mobile ad Hoc Networks (MANETs) are dynamically formed by
collections of mobile and static terminals that exchange data by enabling each other's
communication. Supporting multi-hop communication in a MANET is a challenging
research area because it requires cooperation between different protocol layers (MAC,
routing, transport). In particular, MAC and routing protocols could be considered
mutually cooperative protocol layers. When a route is established, the exposed and
hidden terminal problems at MAC layer may decrease the end-to-end performance
proportionally with the length of each route. Conversely, the contention at MAC layer
may cause a routing protocol to respond by initiating new routes queries and routing table
updates.
Multi-hop communication may also benefit the presence of pseudo-centralized virtual
infrastructures obtained by grouping nodes into clusters. Clustering structures may
facilitate the spatial reuse of resources by increasing the system capacity: at the same
time, the clustering hierarchy may be used to coordinate transmissions events inside the
network and to support intra-cluster routing schemes. Again, MAC and clustering
protocols could be considered mutually cooperative protocol layers: the clustering
scheme could support MAC layer coordination among nodes, by shifting the distributed
MAC paradigm towards a pseudo-centralized MAC paradigm. On the other hand, the
system benefits of the clustering scheme could be emphasized by the pseudo-centralized
MAC layer with the support for differentiated access priorities and controlled contention.
In this thesis, we propose cross-layer solutions involving joint design of MAC, clustering
and routing protocols in MANETs.
As main contribution, we study and analyze the integration of MAC and clustering
schemes to support multi-hop communication in large-scale ad hoc networks. A novel
clustering protocol, named Availability Clustering (AC), is defined under general nodes'
heterogeneity assumptions in terms of connectivity, available energy and relative
mobility. On this basis, we design and analyze a distributed and adaptive MAC protocol,
named Differentiated Distributed Coordination Function (DDCF), whose focus is to
implement adaptive access differentiation based on the node roles, which have been
assigned by the upper-layer's clustering scheme. We extensively simulate the proposed
clustering scheme by showing its effectiveness in dominating the network dynamics,
under some stressing mobility models and different mobility rates. Based on these results,
we propose a possible application of the cross-layer MAC+Clustering scheme to support
the fast propagation of alert messages in a vehicular environment.
At the same time, we investigate the integration of MAC and routing protocols in large
scale multi-hop ad-hoc networks. A novel multipath routing scheme is proposed, by
extending the AOMDV protocol with a novel load-balancing approach to concurrently
distribute the traffic among the multiple paths. We also study the composition effect of a
IEEE 802.11-based enhanced MAC forwarding mechanism called Fast Forward (FF),
used to reduce the effects of self-contention among frames at the MAC layer. The
protocol framework is modelled and extensively simulated for a large set of metrics and
scenarios.
For both the schemes, the simulation results reveal the benefits of the cross-layer
MAC+routing and MAC+clustering approaches over single-layer solutions
Performance Optimization in Wireless Local Area Networks
Wireless Local Area Networks (WLAN) are becoming more and more important
for providing wireless broadband access. Applications and networking
scenarios evolve continuously and in an unpredictable way, attracting the
attention of academic institutions, research centers and industry. For designing
an e cient WLAN is necessary to carefully plan coverage and to
optimize the network design parameters, such as AP locations, channel assignment,
power allocation, MAC protocol, routing algorithm, etc... In this
thesis we approach performance optimization in WLAN at di erent layer
of the OSI model. Our rst approach is at Network layer. Starting from
a Hybrid System modeling the
ow of tra c in the network, we propose a
Hybrid Linear Varying Parameter algorithm for identifying the link quality
that could be used as metric in routing algorithms. Go down to Data Link,
it is well known that CSMA (Carrier Sense Multiple Access) protocols exhibit
very poor performance in case of multi-hop transmissions, because of
inter-link interference due to imperfect carrier sensing. We propose two novel
algorithms, that are combining Time Division Multiple Access for grouping
contending nodes in non-interfering sets with Carrier Sense Multiple Access
for managing the channel access behind a set. In the rst solution, a game
theoretical study of intra slot contention is introduced, in the second solution
we apply an optimization algorithm to nd the optimal degree between
contention and scheduling. Both the presented solutions improve the network
performance with respect to CSMA and TDMA algorithms. Finally we
analyze the network performance at Physical Layer. In case of WLAN, we
can only use three orthogonal channels in an unlicensed spectrum, so the frequency
assignments should be subject to frequent adjustments, according to
the time-varying amount of interference which is not under the control of the
provider. This problem make necessary the introduction of an automatic network
planning solution, since a network administrator cannot continuously
monitor and correct the interference conditions su ered in the network. We
propose a novel protocol based on a distributed machine learning mechanism
in which the nodes choose, automatically and autonomously in each time
slot, the optimal channel for transmitting through a weighted combination
of protocols
Contrôle de Congestion dans les Réseaux Véhiculaires
Cette thèse analyse la possibilité d'utiliser des communications sans fil inter-véhiculaires pour améliorer la sécurité routière. Les performances du nouveau réseau ainsi créé (réseau ad-hoc véhiculaire) sont étudiées analytiquement et par des simulations dans un environnement réaliste. La thèse se concentre surtout sur des scénarios avec une forte densité de véhicules. Dans ce cas, l'accès au support devient un problème essentiel, en principal pour les applications de sécurité routière qui nécessitent une qualité de service élevée pour fonctionner dans un tel contexte. Ce travail montre que la version actuelle du standard IEEE 802.11, proposé comme méthode d'accès dans les réseaux véhiculaires, ne peut pas résoudre ce problème de passage à l'échelle pour supporter correctement les applications de sécurité routière. Plusieurs améliorations possibles sont analysées, liées à l'utilisation optimale de certains paramètres du protocole comme la taille de la fenêtre de contention ou bien le seuil de détection de la porteuse. Des nouveaux mécanismes adaptatifs visant ces paramètres sont proposés et les améliorations ainsi obtenues sont non-négligeables. Finalement, une nouvelle méthode d'accès est définie, en tenant compte des caractéristiques des applications de sécurité routière. Toujours basée sur des techniques CSMA, cette technique donne des résultats largement supérieurs à la version standard actuelle. ABSTRACT : The equipment of vehicles with wireless communication devices in order to improve road safety is a major component of a future intelligent transportation system. The success and availability of IEEE 802.11-based products make this technology the main competitor for the Medium Access Control (MAC) layer used in vehicle-to-vehicle communication. The IEEE 802.11p amendment has been specially designed in this special context of wireless access in vehicular environments. However, as all the other approaches based on Carrier Sense Multiple Access (CSMA), this protocol presents scalability problems, which leads to poor performance in high density scenarios, quite frequent in the case of a vehicular ad hoc network (VANET). This thesis studies the congestion control problem in the context of safety vehicular communications, with a special focus on the back-off mechanism and the carrier sense function. First of all, a number of important characteristics presented by the safety messages are discovered and understood by the means of an analytical framework. Second, the lessons learned from the analytical study are put into practice with the design of two adaptive mechanisms (one for the contention window and the other one for the carrier sense threshold) that take into account the local vehicular density. These mechanisms remain simple, but highly efficient, while also being straightforward to integrate in IEEE 802.11 devices. Finally, by taking into account the most important properties of a safety VANET, a new CSMA-based MAC protocol is proposed. This new access method, named Safety Range CSMA (SR-CSMA), relies on the idea that collisions can not be avoided in a high density network. However, by increasing the number of simultaneous transmissions between geographically distant nodes, SR-CSMA manages to better protect the immediate neighborhood, the most important area for safety applications
- …