Relevant bibliographies by topics / Decentralized wireless communications

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers
  5. Reports

Academic literature on the topic 'Decentralized wireless communications'

Author: Grafiati
Published: 4 June 2021
Last updated: 14 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Decentralized wireless communications.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Decentralized wireless communications"

1

Moshksar, Kamyar, and Amir K. Khandani. "Decentralized Wireless Networks: Spread Spectrum Communications Revisited." IEEE Transactions on Information Theory 60, no. 5 (2014): 2576–93. http://dx.doi.org/10.1109/tit.2014.2310391.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Lifeng, Celimuge Wu, Tsutomu Yoshinaga, Xianfu Chen, Tutomu Murase, and Yusheng Ji. "Multihop Data Delivery Virtualization for Green Decentralized IoT." Wireless Communications and Mobile Computing 2017 (2017): 1–9. http://dx.doi.org/10.1155/2017/9805784.

Full text
Abstract:
Decentralized communication technologies (i.e., ad hoc networks) provide more opportunities for emerging wireless Internet of Things (IoT) due to the flexibility and expandability of distributed architecture. However, the performance degradation of wireless communications with the increase of the number of hops becomes the main obstacle in the development of decentralized wireless IoT systems. The main challenges come from the difficulty in designing a resource and energy efficient multihop communication protocol. Transmission control protocol (TCP), the most frequently used transport layer protocol for achieving reliable end-to-end communications, cannot achieve a satisfactory result in multihop wireless scenarios as it uses end-to-end acknowledgment which could not work well in a lossy scenario. In this paper, we propose a multihop data delivery virtualization approach which uses multiple one-hop reliable transmissions to perform multihop data transmissions. Since the proposed protocol utilizes hop-by-hop acknowledgment instead of end-to-end feedback, the congestion window size at each TCP sender node is not affected by the number of hops between the source node and the destination node. The proposed protocol can provide a significantly higher throughput and shorter transmission time as compared to the end-to-end approach. We conduct real-world experiments as well as computer simulations to show the performance gain from our proposed protocol.
APA, Harvard, Vancouver, ISO, and other styles
3

Selvan, Senthamil, and Wahidabanu . "Collective Network Channel Decentralized Fountain Design Codes for Safe Communication in VANET Network." International Journal of Engineering & Technology 7, no. 3.12 (2018): 779. http://dx.doi.org/10.14419/ijet.v7i3.12.16500.

Full text
Abstract:
Wireless sensor network is noticed as bulk aggregation of slender sensor knobs that can characterize themselves in a decentralized system. Wireless communications assist these trades to increase plant knowledge by acquiring additional measurements from processes and apparatus when wired communication would be infeasible. The merits of the space diversity and transmit nature of wireless transmissions to adopt combined accession in which node transmit the host, that recover the lost host with long credibility by overhearing the transmission of its acquaintance.Article represents an indicating flexible unified management. On the basis of regular set code, the aspect of overall managed flexible WSN activity, local action conversion is protected.
APA, Harvard, Vancouver, ISO, and other styles
4

Jiang, Miao, Yiqing Li, Qi Zhang, Guangchi Zhang, and Jiayin Qin. "Decentralized Blockchain-Based Dynamic Spectrum Acquisition for Wireless Downlink Communications." IEEE Transactions on Signal Processing 69 (2021): 986–97. http://dx.doi.org/10.1109/tsp.2021.3052830.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lin, Fu-Tian, Chu-Sing Yang, Tien-Wen Sung, and Bi-jar Lin. "Decentralized Mobile Sensor Navigation for Hole Healing Policy in Wireless Hybrid Sensor Networks." International Journal of Future Generation Communication and Networking 6, no. 6 (2013): 143–50. http://dx.doi.org/10.14257/ijfgcn.2013.6.6.15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lucas-Estañ, M., Miguel Sepulcre, Theofanis Raptis, Andrea Passarella, and Marco Conti. "Emerging Trends in Hybrid Wireless Communication and Data Management for the Industry 4.0." Electronics 7, no. 12 (2018): 400. http://dx.doi.org/10.3390/electronics7120400.

Full text
Abstract:
With the fast-paced realization of the Industry 4.0 paradigm, completely centralized networking solutions will no longer be sufficient to meet the stringent requirements of the related industrial applications. Besides requiring fast response time and increased reliability, they will necessitate computational resources at the edge of the network, which demands advanced communication and data management techniques. In this paper, we provide an overview of the network communications and data management aspects for the Industry 4.0. Our global perspective is to understand the key communication and data management challenges and peculiarities for the effective realization of the fourth industrial revolution. To address these challenges, this paper proposes hybrid communications management and decentralized data distribution solutions supported by a hierarchical and multi-tier network architecture. The proposed solutions combine local and decentralized management with centralized decisions to efficiently use the available network resources and meet the requirements of Industry 4.0 applications. To this end, the distributed management entities interact in order to coordinate their decisions and ensure the correct operation of the whole network. Finally, the use of Radio Access Network (RAN) slicing is proposed to achieve the required flexibility to efficiently meet the stringent and varying communication and data management requirements of industrial applications.
APA, Harvard, Vancouver, ISO, and other styles
7

Liang, Hao, Bong Jun Choi, Weihua Zhuang, and Xuemin Shen. "Stability Enhancement of Decentralized Inverter Control Through Wireless Communications in Microgrids." IEEE Transactions on Smart Grid 4, no. 1 (2013): 321–31. http://dx.doi.org/10.1109/tsg.2012.2226064.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Schuetz, S., K. Zimmermann, G. Nunzi, S. Schmid, and M. Brunner. "Autonomic and decentralized management of wireless access networks." IEEE Transactions on Network and Service Management 4, no. 2 (2007): 96–106. http://dx.doi.org/10.1109/tnsm.2007.070905.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

FUKUDA, Y., and Y. OIE. "Decentralized Access Point Selection Architecture for Wireless LANs." IEICE Transactions on Communications E90-B, no. 9 (2007): 2513–23. http://dx.doi.org/10.1093/ietcom/e90-b.9.2513.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

El-Sherif, Amr A., and Amr Mohamed. "Decentralized Throughput Maximization in Cognitive Radio Wireless Mesh Networks." IEEE Transactions on Mobile Computing 13, no. 9 (2014): 1967–80. http://dx.doi.org/10.1109/tmc.2013.82.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Decentralized wireless communications"

1

Ge, Feng. "Software Radio-Based Decentralized Dynamic Spectrum Access Networks: A Prototype Design and Enabling Technologies." Diss., Virginia Tech, 2009. http://hdl.handle.net/10919/29981.

Full text
Abstract:
Dynamic spectrum access (DSA) wireless networks focus on using RF spectrum more efficiently and dynamically. Significant progress has been made during the past few years. For example, many measurements of current spectrum utilization are available. Theoretical analyses and computational simulations of DSA networks also abound. In sharp contrast, few network systems, particularly those with a decentralized structure, have been built even at a small scale to investigate the performance, behavior, and dynamics of DSA networks under different scenarios. This dissertation provides the theory, design, and implementation of a software radio-based decentralized DSA network prototype, and its enabling technologies: software radio, signal detection and classification, and distributed cooperative spectrum sensing. By moving physical layer functions into the software domain, software radio offers an unprecedented level of flexibility in radio development and operation, which can facilitate research and development of cognitive radio (CR) and DSA networks. However, state-of-the-art software radio systems still have serious performance limitations. Therefore, a performance study of software radio is needed before applying it in any development. This dissertation investigates three practical issues governing software radio performance that are critical in DSA network development: RF front end nonlinearity, dynamic computing resource allocation, and execution latency. It provides detailed explanations and quantitative results on SDR performance. Signal detection is the most popular method used in DSA networks to guarantee non-interference to primary users. Quickly and accurately detecting signals under all possible conditions is challenging. The cyclostationary feature detection method is attractive for detecting primary users because of its ability to distinguish between modulated signals, interference, and noise at a low signal-to-noise ratio (SNR). However, a key issue of cyclostationary signal analysis is the high computational cost. To tackle this challenge, parallel computing is applied to develop a cyclostationary feature based signal detection method. This dissertation presents the methodâ s performance on multiple signal types in noisy and multi-path fading environments. Distributed cooperative spectrum sensing is widely endorsed to monitor the radio environment so as to guarantee non-interference to incumbent users even at a low SNR and under hostile conditions like shadowing, fading, interference, and multi-path. However, such networks impose strict performance requirements on data latency and reliability. Delayed or faulty data may cause secondary users to interfere with incumbent users because secondary users could not be informed quickly or reliably. To support such network performance, this dissertation presents a set of data process and management schemes in both sensors and data fusion nodes. Further, a distributed cooperative sensor network is built from multiple sensors; together, the network compiles a coherent semantic radio environment map for DSA networks to exploit available frequencies opportunistically. Finally, this dissertation presents the complete design of a decentralized and asynchronous DSA network across the PHY layer, MAC layer, network layer, and application layer. A ten-node prototype is built based on software radio technologies, signal detection and classification methods, distributed cooperative spectrum sensing systems, dynamic wireless protocols, and a multi-channel allocation algorithm. Systematic experiments are carried out to identify several performance determining factors for decentralized DSA networks.<br>Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
2

Perlaza, Samir. "Le Partage du Spectre dans les Réseaux Décentralisés Auto-Configurables : Une approche par la Théorie des Jeux." Phd thesis, Ecole nationale supérieure des telecommunications - ENST, 2011. http://tel.archives-ouvertes.fr/tel-00667124.

Full text
Abstract:
Les travaux de cette thèse s'inscrivent tous dans la thématique " traitement du signal pour les réseaux de communications distribués ". Le réseau est dit distribué au sens de la décision. Dans ce cadre, le problème générique et important que nous avons approfondi est le suivant. Comment un terminal, qui a accès à plusieurs canaux de communications, doit-il répartir (de manière autonome) sa puissance d'émission entre ses canaux et l'adapter dans le temps en fonction de la variabilité des conditions de communications ? C'est le problème de l'allocation de ressources adaptative et distribuée. Nous avons développé 4 axes de travail qui ont tous conduits à des réponses originales à ce problème ; la forte corrélation entre ces axes est expliquée dans le manuscrit de thèse. Le premier axe a été l'alignement opportuniste d'interférence. Un des scénarios de référence est le cas où deux couples émetteur-récepteur communiquent en interférant (sur la même bande, en même temps, au même endroit, ...), où les 4 terminaux sont équipés de plusieurs antennes et où un émetteur est contraint de ne pas (ou peu) interférer sur l'autre (canal à interférence dit MIMO). Nous avons conçu une technique d'émission de signal multi-antennaire qui exploite l'observation-clé suivante et jamais exploitée auparavant: même lorsqu'un émetteur est égoïste au sens de ses performances individuelles, celui-ci laisse des ressources spatiales (dans le bon espace de signal et que nous avons identifié) vacantes pour l'autre émetteur. L'apport en performances en termes de débit par rapport aux meilleurs algorithmes existants a été quantifié grâce à la théorie des matrices aléatoires et des simulations Monte Carlo. Ces résultats sont particulièrement importants pour le scénario de la radio cognitive en milieu dense. Dans un second temps, nous avons supposé que tous les émetteurs d'un réseau sont libres d'utiliser leurs ressources de manière égoïste. Les ressources sont données ici par les canaux fréquentiels et la métrique individuelle de performance est le débit. Ce problème peut être modélisé par un jeu dont les joueurs sont les émetteurs. Une de nos contributions a été de montrer que ce jeu est un jeu de potentiel, ce qui est fondamental pour la convergence des algorithmes distribués et l'existence d'équilibre de Nash. De plus, nous avons montré l'existence d'un paradoxe de Braess : si l'espace d'optimisation d'un joueur grandit, les performances individuelles et globales peuvent s'en trouver réduites. Cette conclusion a une conséquence pratique immédiate : il peut y a voir intérêt de restreindre le nombre de canaux fréquentiels utilisables dans un réseau à interférence distribué. Dans le jeu précédent, nous avions constaté que les algorithmes distribués d'allocation de ressources (les algorithmes d'apprentissage par renforcement typiquement) demandent un grand nombre d'itérations pour converger vers un état stable tel qu'un équilibre de Nash. Nous avons ainsi proposé un nouveau concept de solution d'un jeu, à savoir l'équilibre de satisfaction ; les joueurs ne modifient pas leur action, même si celle-ci ne maximise pas leur gain, pourvu qu'un niveau minimal de performance soit atteint. Nous avons alors développé une méthodologie d'étude de cette solution (existence, unicité, convergence, ...). Une de nos contributions a aussi été de donner des algorithmes d'apprentissage qui convergent vers cette solution en un temps fini (et même court génériquement). De nombreux résultats numériques réalisés dans des scénarios imposés par Orange ont confirmé la pertinence de cette nouvelle approche. Le quatrième axe de travail a été la conception de nouveaux algorithmes d'apprentissage qui convergent vers des solutions de type équilibre logit, epsilon-équilibre ou équilibre de Nash. Notre apport a été de montrer comment modifier les algorithmes existants pour que ceux-ci évitent les phénomènes de cycles et convergent vers un équilibre présélectionné au départ de la dynamique. Une idée importante a été d'introduire une dynamique d'apprentissage de la fonction métrique de performances en couplage avec la dynamique principale qui régit l'évolution de la distribution de probabilité sur les actions possibles d'un joueur. Le cadre de ces travaux est parfaitement réaliste d'un point de vue informatif au niveau des terminaux en pratique. Il est montré une voie possible pour améliorer l'efficacité des points de convergence, ce qui constitue un problème encore ouvert dans ce domaine.
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Lu. "Decentralized cooperative communication for wireless relaying networks." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 202 p, 2009. http://proquest.umi.com/pqdweb?did=1885757461&sid=5&Fmt=2&clientId=8331&RQT=309&VName=PQD.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Topham, Debra Ann. "Decentralised wireless data dissemination for vehicle-to-vehicle communications." Thesis, University of Birmingham, 2012. http://etheses.bham.ac.uk//id/eprint/3335/.

Full text
Abstract:
This thesis is concerned with inter-vehicle communications supporting the deployment of future safety-related applications. Through use case analysis of the specific communica- tions requirements of safety related and traffic efficiency applications, a data dissemination framework is proposed that is able to meet the various message delivery requirements. More specifically, this thesis focuses on the subset of the proposed framework, which provides geocasting, i.e. addressing a geographical area on the road network, and local zone connectivity, providing neighbour awareness, for safety related applications. The enabling communications technology for inter-vehicle communications based on IEEE 802.11 wireless local area network devices and the associated lack of reliability it presents for the distribution of safety messages in broadcast mode, form the main topic of this thesis. A dissemination scheme for safety related inter-vehicular communication applica- tions, using realistic vehicular traffic patterns, is proposed, implemented and evaluated to demonstrate mechanisms for efficient, reliable and timely delivery of safety messages over an unreliable channel access scheme. The original contribution of this thesis is to propose a novel data dissemination protocol for vehicular environments, capable of simultaneously achieving significant economy of messaging, whilst maintaining near 100% reliable message delivery in a timely manner for a wide variety of highway traffic flow scenarios, ranging from sparsely, fragmented networks to dense, congested road networks. This is achieved through increased protocol complexity in inferring and tracking each vehicular node’s local environment, coupled with implementing adaptation to both local data traffic intensity and vehicular density. Adaptivity is achieved through creating and employing an empirical channel access delay model and embedding the stochastic delay distribution in decisions made at the network layer; this method of adaptivity is novel in itself. Moreover, unnecessary retransmissions arising from the inherent uncertainty of the wireless medium are suppressed through a novel three-step mechanism.
APA, Harvard, Vancouver, ISO, and other styles
5

Yackoski, Justin. "High performance medium access control protocols for decentralized wireless networks using local coordination." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 156 p, 2009. http://proquest.umi.com/pqdweb?did=1833647411&sid=1&Fmt=2&clientId=8331&RQT=309&VName=PQD.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Asgharimoghaddam, H. (Hossein). "Decentralized coordinated transceiver design with large antenna arrays." Master's thesis, University of Oulu, 2013. http://urn.fi/URN:NBN:fi:oulu-201310161794.

Full text
Abstract:
The benefits of MIMO technology have made it a solution for the present and future wireless networking demands. Increasing the number of antennas is an intuitive approach for boosting the network capacity; however, processing load and implementation limitations put a practical bound on this goal. Recently a solution known as massive MIMO has shown that a very large antenna array at the base station can simplify the processing, in a way that even matched filter (MF) can be used for detection purpose. The ultimate performance of massive MIMO can be achieved only under some optimistic assumptions about the channel and hardware deployment. In practice, there are some restrictions that do not allow the ultimate performance for a massive MIMO system. Under some realistic assumptions, an efficient use of all the resources becomes important in a way that the application of simple algorithms like MF and zero forcing (ZF) becomes questionable. Thus, in this thesis work, more efficient approach based on optimal minimum power beamforming is considered as the benchmark. The idea is to investigate the behavior of this algorithm and the performance differences with respect to some sub-optimal methods when the system dimensions grow large. Two solutions for the minimum power beamforming are reviewed (SOCP and uplink-downlink duality). The solution that is on focus is based on the second order cone programming (SOCP). Intercell interference(ICI) plays a critical role in the SOCP algorithm as it couples the sub-problems at the base stations. Thus, a large dimension approximation for the optimal ICI, using random matrix theory tools, is derived which tackles both of the processing simplification and the backhaul exchange rate reduction goals. This approximation allows derivation of an approximated optimal intercell interference based on the channel statistics that results a procedure for decoupling the subproblems at base stations. The comparison between the SOCP algorithm and the sub-optimal methods is carried out via simulation. The results show that the performance gap with respect to the sub-optimal methods grows when correlation between the antenna elements at the BS side increase. In a network simulation with 7 cell and 28 users, this gap remains significant even with 100 antennas at the BS side. These performance differences justify the application of more complex algorithms like SOCP for a MIMO system with a large antenna array when the practical restrictions are taken into account.
APA, Harvard, Vancouver, ISO, and other styles
7

Gottipati, Naga Sravani. "Design and Implementation of Communication Platform for Autonomous Decentralized Systems." Thesis, University of North Texas, 2010. https://digital.library.unt.edu/ark:/67531/metadc33156/.

Full text
Abstract:
This thesis deals with the decentralized autonomous system, in which individual nodes acting like peers, communicate and participate in collaborative tasks and decision making processes. An experimental test-bed is created using four Garcia robots. The robots act like peers and interact with each other using user datagram protocol (UDP) messages. Each robot continuously monitors for messages coming from other robots and respond accordingly. Each robot broadcasts its location to all the other robots within its vicinity. Robots do not have built-in global positioning system (GPS). So, an indoor localization method based on signal strength is developed to estimate robot's position. The signal strength that the robot gets from the nearby wireless access points is used to calculate the robot's position. Trilateration and fingerprint are some of the indoor localization methods used for this purpose. The communication functionality of the decentralized system has been tested and verified in the autonomous systems laboratory.
APA, Harvard, Vancouver, ISO, and other styles
8

Tunaru, Iulia. "Physical layer secret key generation for decentralized wireless networks." Thesis, Rennes 1, 2015. http://www.theses.fr/2015REN1S081/document.

Full text
Abstract:
Dans cette thèse on s’est intéressé aux méthodes de génération de clés secrètes symétriques en utilisant la couche physique ultra large bande impulsionnelle (IR-UWB). Les travaux ont été réalisés selon trois axes, les deux premiers concernant la communication point-à-point et le dernier, les communications coopératives. Tout d’abord, la quantification des signaux typiques IR-UWB (soit directement échantillonnés, soit estimés) a été investiguée, principalement du point de vue du compromis entre la robustesse (ou réciprocité) des séquences binaires obtenues et leur caractère aléatoire. Différents algorithmes de quantification valorisant l’information temporelle offerte par les canaux IR-UWB pour améliorer ce compromis ont alors été proposés. Ensuite, des études concernant les échanges publics nécessaires à l’étape de réconciliation (visant la correction d’éventuels désaccords entre les séquences binaires générées de part et d’autre du lien) ont montré qu’il était possible d’être plus robuste face aux attaques passives en utilisant des informations de plus haut niveau, inhérentes à cette technologie et disponibles à moindre coût (ex. via une estimation précise du temps de vol aller-retour). Finalement, une nouvelle méthode a été développée afin d’étendre les schémas de génération de clé point-à-point à plusieurs nœuds (trois dans nos études) en utilisant directement la couche physique fournie par les liens radio entre les nœuds<br>Emerging decentralized wireless systems, such as sensor or ad-hoc networks, will demand an adequate level of security in order to protect the private and often sensitive information that they carry. The main security mechanism for confidentiality in such networks is symmetric cryptography, which requires the sharing of a symmetric key between the two legitimate parties. According to the principles of physical layer security, wireless devices within the communication range can exploit the wireless channel in order to protect their communications. Due to the theoretical reciprocity of wireless channels, the spatial decorrelation property (e.g., in rich scattering environments), as well as the fine temporal resolution of the Impulse Radio - Ultra Wideband (IR-UWB) technology, directly sampled received signals or estimated channel impulse responses (CIRs) can be used for symmetric secret key extraction under the information-theoretic source model. Firstly, we are interested in the impact of quantization and channel estimation algorithms on the reciprocity and on the random aspect of the generated keys. Secondly, we investigate alternative ways of limiting public exchanges needed for the reconciliation phase. Finally, we develop a new signal-based method that extends the point-to-point source model to cooperative contexts with several nodes intending to establish a group key
APA, Harvard, Vancouver, ISO, and other styles
9

Bazco, Nogueras Antonio. "Fundamental Limits and Algorithms in Decentralized and Cooperative Wireless Networks." Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS172.

Full text
Abstract:
La coopération en réseau est connue pour apporter des gains multiplicatifs sous certaines hypothèses idéales. Cependant, les réseaux sans-fil actuels font face à de nombreuses contraintes, telles que des contraintes de délai serrées ou des liaisons de retour à débit limité. L'impact sur la performance de la transgression des hypothèses idéales a suscité un grand intérêt dans le milieu de la recherche. Néanmoins, l'accent a été mis sur des situations dans lesquelles l'information imparfaite est partagée par tous les nœuds, ce qui n'est pas réalisable dans de nombreux scénarios. Cette thèse vise à mettre en lumière la performance des environnements coopératifs dans lesquels l'information disponible à chaque nœud peut être différente. Nous nous concentrons sur le réseau distribué MIMO. Ce réglage se caractérise par avoir un partage parfait des données d'information et un partage imparfait des informations du canal. Nous caractérisons la métrique des degrés de liberté, qui est une approximation de la capacité à un SNR élevé. La contribution est double, puisque nous fournissons à la fois des schémas réalisables qui surpassent considérablement les solutions de la littérature et des limites supérieures qui illustrent jusqu'à quelle échelle l'environnement distribué est affecté par rapport au partage parfait. Une deuxième perspective consiste à limiter la transmission au paradigme du zéro-forçage et à analyser le taux à un SNR élevé pour comprendre si les pertes de performance dues à la décentralisation peuvent être calculées avec précision. Nous proposons un nouveau système de zéro-forçage adapté à la configuration décentralisée qui atteint asymptotiquement le taux centralisé<br>Network cooperation is known to bring multiplicative gains under certain ideal assumptions. However, current wireless settings cope with many challenging constraints, as tight delay constraints, fast-changing channels, or rate-limited backhaul links. The topic of analyzing how the non-fulfillment of the ideal hypotheses impacts the performance has generated great interest in the research community. Nevertheless, the main focus has been on settings in which the imperfect information is shared by all the nodes, which is not feasible in many scenarios. This thesis aims for shedding light on the performance of cooperative settings in which the information available at each node may be different. We focus on the distributed Network MIMO. This setting is characterized by two main aspects: The perfect sharing of the user's information data and the imperfect sharing of the channel information. We start by characterizing the Degrees-of-Freedom metric of the setting, which is an approximation of the capacity at high SNR. The contribution is twofold, as we provide both achievable schemes that considerably outperform the solutions in the literature and upper-bounds that illustrate up to which scale the distributed setting is harmed with respect to the perfect-sharing setting. The second perspective consists in restricting the transmission to the conventional paradigm of Zero-Forcing and analyzing the achievable rate at high SNR to understand whether the performance losses from decentralized information can be accurately calculated. We propose a novel zero-forcing scheme tailored to the decentralized configuration that asymptotically attains the centralized rate
APA, Harvard, Vancouver, ISO, and other styles
10

Bai, Chumeng. "Evaluation and Improvement of Decentralized Congestion Control for Multiplatooning Application." Thesis, KTH, Radio Systems Laboratory (RS Lab), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-232849.

Full text
Abstract:
Platooning has the potential to be a breakthrough in increasing road capacity and reducing fuel consumption, as it allows a chain of vehicles to closely follow each other on the road. When the number of vehicles increases, platoons will follow one another in what is referred to as multiplatooning. Many Cooperative Intelligent Transportation Systems (C-ITS) applications rely on periodically exchanged beacons among vehicles to improve traffic safety. However, as the number of connected vehicles increases, the network may become congested due to periodically exchanged beacons. Therefore, without some congestion control method, safety critical messages such as Cooperative Awareness Messages (CAMs) may not be delivered on time in high vehicle density scenarios. Both the European Telecommunications Standards Institute (ETSI) and the Institute of Electrical and Electronics Engineers (IEEE) have been working on different standards to support vehicular communication. ETSI dened the Decentralized Congestion Control (DCC) mechanism which adapts transmission parameters (message rate, transmit data rate, and transmit power, etc.) to keep channel load under control. ETSI DCC utilizes a three-state machine with RELAXED, ACTIVE, and RESTRICTIVE states. In this thesis, we implemented this three-state machine by adapting the message rate based on the channel busy ratio (CBR). We name this message-rate based three-state machine DCC-3. DCC-3 has the ability to control channel load; however, it has unfairness and instability problems due to the dramatic parameter changes between states. Therefore, we divided the ACTIVE state of DCC-3 into ve sub-states, and refer to this as DCC-7. We benchmarked DCC-3 against static beaconing (STB), dynamic beaconing (DynB), LInear MEssage Rate Integrated Control (LIMERIC), and DCC-7 using different evaluation metrics with different numbers of platoons. Our results from the Plexe simulator demonstrate that DCC-7 has the best performance when considering all evaluation metrics, including CBR, Inter-reception time (IRT), collisions, safe time ratio, and fairness. Furthermore, we found using transmit power control could greatly improve the performance of CBR and collision rates.<br>Platooning (fordonskonvojer) har potential att bli ett genombrott i öka vägkapaciteten och minska bränsleförbrukning, eftersom det tillåter en kedja av fordon att noga följa varandra på vägen. När antalet fordon ökar, kommer att plutoner följa varandra i vad som benämns multiplatooning (konvoj av fordonskonvojer). Många kooperativ intelligenta transportsystem (C-ITS) tillämpningar förlitar sig på regelbundet utbytte beacons bland fordon att förbättra traffiksäkerheten. Dock som antalet uppkopplade fordon ökar, kan nätverket bli överbelastat på grund av regelbundet utbytte beacons. Utan någon trängsel kontrollmetod, får därför säkerhet kritiska meddelanden såsom kooperativ medvetenhet meddelanden (CAMs) inte levereras i tid i höga fordon densitet scenarier. Både Europeiska institutet för telekommunikationsstandarder (ETSI) och Institute el och elektroniska tekniker (IEEE) har arbetat på olika standarder för att stödja vehicular kommunikation. ETSI definieras den decentraliserade överbelastning kontroll (DCC) mekanism som anpassar överföring parametrar (meddelande hastighet, överföra datahastighet och sändningseffekt, etc.) för att hålla kanalen belastningen under kontroll. ETSI DCC använder en tre-state maskin med RELAXED, ACTIVE och RESTRICTIVE stater. I denna avhandling har genomfört vi denna tre-state maskin genom att anpassa meddelande hastighet baserat på kanal upptagen förhållandet (CBR). Vi nämna detta meddelande-hastighet baserat tre-state machine DCC-3. DCC-3 har förmågan att kontrollera kanal belastning; Det har dock otillbörlighet och instabilitet problem på grund av de dramatiska parameterändringar mellan stater. Därför vi indelat det ACTIVE tillståndet för DCC-3 i fem undertillstånd och hänvisar till detta som DCC-7. Vi benchmarkade DCC-3 mot statiska leda (STB), dynamisk leda (DynB), linjära MEssage Rate integrerad kontroll (LIMERIC) och DCC-7 med olika utvärdering statistik med olika antal plutoner. Våra resultat från Plexe simulator visar att DCC-7 har bästa prestanda när man överväger alla utvärdering statistik, inklusive CBR, mellan receptionen tid (IRT), kollisioner, säker tid baserat och rättvisa. Vi fann dessutom använda Sändareffektstyrning kan avsevärt förbättra prestanda för CBR och kollision priser.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Decentralized wireless communications"

1

Law, Yee Wei, Ricardo Corin, Sandro Etalle, and Pieter H. Hartel. "A Formally Verified Decentralized Key Management Architecture for Wireless Sensor Networks." In Personal Wireless Communications. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39867-7_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Giannakis, Georgios B., Qing Ling, Gonzalo Mateos, Ioannis D. Schizas, and Hao Zhu. "Decentralized Learning for Wireless Communications and Networking." In Splitting Methods in Communication, Imaging, Science, and Engineering. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-41589-5_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Aminev, D. A., R. F. Azizov, and D. Yu Kudryavtsev. "Relative Navigation for Node of Wireless Decentralized Network." In Communications in Computer and Information Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-30843-2_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ikeda, Shinichi, Tatsuhiro Tsuchiya, and Tohru Kikuno. "A Decentralized Scheme for Network-Aware Reliable Overlay Construction." In Information Networking. Advances in Data Communications and Wireless Networks. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11919568_95.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Babaie, Shahram, Ali Ranjideh Rezaie, and Saeed Rasouli Heikalabad. "DFDM: Decentralized Fault Detection Mechanism to Improving Fault Management in Wireless Sensor Networks." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21984-9_56.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Xiangyang, Peisheng Zhu, and Donghong Xie. "J-Divergence Based Decentralized Power Allocation Scheme for Distributed Detection in Wireless Sensor Networks." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54522-1_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ruffo, Giancarlo, Rossano Schifanella, and Enrico Ghiringhello. "A Decentralized Recommendation System Based on Self-organizing Partnerships." In NETWORKING 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11753810_52.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hausheer, David, and Burkhard Stiller. "PeerMint: Decentralized and Secure Accounting for Peer-to-Peer Applications." In NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11422778_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gong, Yu, Yifei Wei, Qiao Li, Lianping Zhang, and Xiaojun Wang. "A Decentralized Multi-agent Reinforcement Learning Approach for Resource Sharing and Allocation in Renewable Energy Powered Wireless Networks." In Communications in Computer and Information Science. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-8101-4_57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Buratti, Chiara, Marco Martalò, Roberto Verdone, and Gianluigi Ferrari. "Decentralized Detection in IEEE 802.15.4 Wireless Sensor Networks." In Signals and Communication Technology. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-17490-2_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Decentralized wireless communications"

1

Prasad, Archiki, Vishal Jain, and Sharayu Moharir. "Decentralized Age-of-Information Bandits." In 2021 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2021. http://dx.doi.org/10.1109/wcnc49053.2021.9417301.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Weber, Tobias, Andreas Ahrens, and Shiyang Deng. "Decentralized Interference Cancellation in Mobile Radio Networks." In 2007 IEEE Wireless Communications and Networking Conference. IEEE, 2007. http://dx.doi.org/10.1109/wcnc.2007.409.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Oualhaj, Omar Ait, Amr Mohamed, Mohsen Guizani, and Aiman Erbad. "Blockchain Based Decentralized Trust Management framework." In 2020 International Wireless Communications and Mobile Computing (IWCMC). IEEE, 2020. http://dx.doi.org/10.1109/iwcmc48107.2020.9148247.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mhamdi, Halima, Ahmed Zouinkhi, and Hedi Sakli. "Smart contracts for decentralized vehicle services." In 2021 International Wireless Communications and Mobile Computing (IWCMC). IEEE, 2021. http://dx.doi.org/10.1109/iwcmc51323.2021.9498954.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Hongfei, and Steven D. Blostein. "Communication-Efficient Decentralized Change Detection for Cognitive Wireless Networks." In GLOBECOM 2015 - 2015 IEEE Global Communications Conference. IEEE, 2014. http://dx.doi.org/10.1109/glocom.2014.7417236.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Hongfei, and Steven D. Blostein. "Communication-Efficient Decentralized Change Detection for Cognitive Wireless Networks." In GLOBECOM 2015 - 2015 IEEE Global Communications Conference. IEEE, 2015. http://dx.doi.org/10.1109/glocom.2015.7417236.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Junior, Jose Geraldo R., Miguel Elias M. Campista, and Luis Henrique M. K. Costa. "A Decentralized Traffic Monitoring System based on vehicle-to-infrastructure communications." In 2013 IFIP Wireless Days (WD). IEEE, 2013. http://dx.doi.org/10.1109/wd.2013.6686522.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zhong, Xu, and Yu Zhou. "Establishing and Maintaining Wireless Communication Coverage Among Multiple Mobile Robots via Fuzzy Control." In ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-47989.

Full text
Abstract:
This paper addresses the critical issue of establishing and maintaining desired wireless communication connectivity in a team of collaborative mobile robots, which is highly demanded for reliable functioning of multi-robot systems but challenging in realistic environments. The signal propagation of wireless communications among mobile robots is affected by not only the transmission power and distance but also obstacles and other environmental conditions as well as robot movement, which result in signal loss, attenuation, multi-path fading and shadowing. Consequently, the communication condition among mobile robots in a physical environment is usually unstable, and it is difficult to accurately predict the actual communication ranges of robots. We propose a decentralized control strategy which, based on perceived link quality, adopts fuzzy control to accommodate the fluctuating communication condition, and approach and maintain desired and reliable communication connections among neighboring robots. The effectiveness of the proposed scheme has been verified in several simulated environments with different signal propagation conditions based on a probabilistic signal propagation model.
APA, Harvard, Vancouver, ISO, and other styles
9

Hammi, Mohamed Tahar, Patrick Bellot, and Ahmed Serhrouchni. "BCTrust: A decentralized authentication blockchain-based mechanism." In 2018 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2018. http://dx.doi.org/10.1109/wcnc.2018.8376948.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zhou, Xiangyun, Meixia Tao, and Rodney A. Kennedy. "Cooperative jamming for secrecy in decentralized wireless networks." In ICC 2012 - 2012 IEEE International Conference on Communications. IEEE, 2012. http://dx.doi.org/10.1109/icc.2012.6364148.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Decentralized wireless communications"

1

Veeravalli, Venugopal. Decentralized Dynamic Decision Making and Its Applications to Wireless Communications. Defense Technical Information Center, 2000. http://dx.doi.org/10.21236/ada405457.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Decentralized wireless communications' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography