Search

Welcome to Volume 4 of IEEE Journal of Microwaves! In this issue, we bring you 11 quality papers: two invited and nine regular submissions. We also celebrate six of our Outstanding Reviewers of 2023 and announce our IEEE Journal of Microwaves 2022 Best Paper prize. Our author and reader pools continue to expand and our usage counts per article published now exceed 1530. All of our 232 published articles from 2021 to 2023 now appear on Clarivate's Web of Science and we are looking forward to possibly receiving an impact factor this July. Remember to take a look at our solicitation for papers that can fit into our Microwaves in Climate Change special issue, which we intend to release before the end of 2024.

Welcome to Volume 3 of IEEE Journal of Microwaves! In this issue we combine a complete set of regular contributions with Part 1 of a Microwave Theory and Technology Society 70th Anniversary commemoration, consisting of some twenty-one specially invited papers embodying this major milestone in the history of the organization. Several additional articles, including some major historic overviews, are to be released in our spring issue of JMW which contains Part 2 of this 70th Anniversary celebration. In order to make it possible to bring up all the anniversary issue papers contained in both parts one and two using a single database search, every special issue paper contains the index term: “MTT 70th Anniversary Special Issue.” The full set (covering two issues) of 70th anniversary papers can be accessed using a simple parenthesis-delineated search of the five-word phrase. Plans are also in place to combine all the on-line papers into a full-color print issue for distribution upon request. In addition to this very nice collection of quality papers, we celebrate six of our Outstanding Reviewers of 2021 and 2022 and announce our first IEEE Journal of Microwaves Best Paper prize.

In this paper, we show that the communication channel known as writing in memory with defective cells is a relevant information-theoretical model for a specific case of passive warden steganography when the sender embeds a secret message into a subset C of the cover object X without sharing C with the recipient. The set C, which is also called the selection channel, could be arbitrary, determined by the sender from the cover object using a deterministic, pseudo-random, or a truly random process. We call this steganography "writing on wet paper" and realize it using a simple variable-rate random linear code that gives the sender a convenient flexibility and control over the embedding process and is thus suitable for practical implementation. The importance of the wet paper scenario for covert communication is discussed within the context of adaptive steganography and perturbed quantization steganography. Heuristic arguments supported by tests using blind steganalysis indicate that the wet paper steganography provides improved steganographic security and is less vulnerable to steganalytic attacks compared with existing methods with shared selection channels. [ABSTRACT FROM PUBLISHER]

The article presents the discussion on considerable aspects of face-to-face human interactions remain difficult to relay. Topics include computer's ability capturing a human's emotion called affective sensing, alternatively called emotion sensing and more recently emotional artificial intelligence (emotional AI); and use of emotions in crowd and traffic management; to relaying emotions to and from the metaverse.

The article presents the discussion on sustainable urban development as populations rise and cities draw ever-larger populations. Topics include industrial Internet and Internet of Vehicles, smart energy systems, building management systems, cyber security; and presenting the technological advancement and challenges of smart cities and smart villages from the system design and implementation point of view.

Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers. [ABSTRACT FROM AUTHOR]

Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers. [ABSTRACT FROM AUTHOR]

The article discusses the telecommunication industry has evolved to provide services for new types of Internet of Things (IoT) devices in addition to basic mobile phone or internet services. Topics include the extended reality devices, sensors, and ground and aerial robots, to name a few. With the deployment of these new services, it is difficult for the wireless network to support ubiquitous connections with diverse quality-of-service (QoS) requirements.

The article reports that from the late 1970's onward, the global telecommunication industry has gone through several waves of regulatory and technological changes. Today, the very definition of telecommunication has changed. First, the traffic is no longer confined to voice and limited data services, but has become a fundamental pillar of the digital transformation that is affecting all aspects of our contemporary life.

In this correspondence, we compare the achievable throughput for the optimal strategy of dirty paper coding (DPC) to that achieved with suboptimal and lower complexity linear precoding techniques (zero-forcing and block diagonalization). Both strategies utilize all available spatial dimensions and therefore have the same multiplexing gain, but an absolute difference in terms of throughput does exist. The sum rate difference between the two strategies is analytically computed at asymptotically high SNR. Furthermore, the difference is not affected by asymmetric channel behavior when each user has a different average SNR. Weighted sum rate maximization is also considered. In the process, it is shown that allocating user powers in direct proportion to user weights asymptotically maximizes weighted sum rate. [ABSTRACT FROM AUTHOR]

The article offers information on the journal's call for feature topic (FT) proposals to complement its Series and Open Call publication tracks.

Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers. [ABSTRACT FROM AUTHOR]

We present the results of a comprehensive multi-pass analysis of visualization paper keywords supplied by authors for their papers published in the IEEE Visualization conference series (now called IEEE VIS) between 1990–2015. From this analysis we derived a set of visualization topics that we discuss in the context of the current taxonomy that is used to categorize papers and assign reviewers in the IEEE VIS reviewing process. We point out missing and overemphasized topics in the current taxonomy and start a discussion on the importance of establishing common visualization terminology. Our analysis of research topics in visualization can, thus, serve as a starting point to (a) help create a common vocabulary to improve communication among different visualization sub-groups, (b) facilitate the process of understanding differences and commonalities of the various research sub-fields in visualization, (c) provide an understanding of emerging new research trends, (d) facilitate the crucial step of finding the right reviewers for research submissions, and (e) it can eventually lead to a comprehensive taxonomy of visualization research. One additional tangible outcome of our work is an online query tool (http://keyvis.org/) that allows visualization researchers to easily browse the 3952 keywords used for IEEE VIS papers since 1990 to find related work or make informed keyword choices. [ABSTRACT FROM PUBLISHER]

In a series of papers by Pawlikowski and his team, they warned about a deep crisis of credibility in simulation studies for the performance evaluation of telecommunication networks. The goal of this article is to revisit the investigation on simulation credibility and to extend the previous research in this area by presenting the results of a comprehensive survey of over 8370 IEEE publications (2007?2009) on telecommunication networks which appeared in the proceedings of IEEE Transactions on Communications (TC), IEEE/ACM Transactions on Networking (TN), IEEE Infocom, IEEE ICC, and IEEE Globecom. These proceedings were selected based on their popularity and relevance to our study. Besides simulation credibility, we also report on the commonly used simulation tools and performance analysis methodology adopted by the authors of the surveyed papers. Our findings show that a significant number of authors did not provide information of the simulation tools used or, even when they did, there was not enough information about the CI or SE of simulation results presented in the surveyed papers. Thus, there is no significant change with respect to quality and credibility of the simulation studies revised and the deep crisis of credibility still remains. The research design most authors prefer is a hybrid one where both simulation and analytic methods are being used for network performance analysis. Finally, we provide guidelines for the best practice of using simulation tools for the performance evaluation of telecommunication networks. [ABSTRACT FROM PUBLISHER]

In this paper, we study the diversity-multiplexing-gain tradeoff (DMT) of wireless relay networks under the half-duplex constraint. It is often unclear what penalty if any, is imposed by the half-duplex constraint on the DMT of such networks. We study two classes of networks; the first class, called KPP(I) networks, is the class of networks with the relays organized in K parallel paths between the source and the destination. While we assume that there is no direct source-destination path, the K relaying paths can interfere with each other. The second class, termed as layered networks, is comprised of relays organized in layers, where links exist only between adjacent layers. [ABSTRACT FROM PUBLISHER]

We consider a variable-length source coding problem subject to local decodability constraints. In particular, we investigate the blocklength scaling behavior attainable by encodings of $r$ -sparse binary sequences, under the constraint that any source bit can be correctly decoded upon probing at most $d$ codeword bits. We consider both adaptive and non-adaptive access models, and derive upper and lower bounds that often coincide up to constant factors. Such a characterization for the fixed-blocklength analog of our problem, known as the bit probe complexity of static membership, remains unknown despite considerable attention from researchers over the last few decades. We also show that locally decodable schemes for sparse sequences are able to decode 0s (frequent source symbols) of the source with far fewer probes on average than they can decode 1s (infrequent source symbols), thus rigorizing the notion that infrequent symbols require high probe complexity, even on average. Connections to the fixed-blocklength model and to communication complexity are also briefly discussed. [ABSTRACT FROM AUTHOR]

This is Part II of the double-part Special Issue (SI) on Integrated Sensing and Communication (ISAC). This SI aims at bringing together contributions from both academia and industry to highlight the recent progress of ISAC, where sensing and communication (S $\$ $ C) functionalities are jointly designed to utilize wireless/hardware resources efficiently and to assist each other for mutual benefits. The 32 accepted articles of this SI are arranged into six groups, namely, 1) Fundamental Performance Bounds and Optimization, 2) Time-Frequency Signal Processing, 3) Spatial Signal Processing, 4) Networking and Resource Allocation, 5) ISAC With Emerging Communications Technologies, and 6) ISAC Applications. We kindly refer readers to Part I of this SI for a comprehensive overview written by the Guest Editorial Team, which provides both a bird’s eye view and technical details regarding state-of-the-art ISAC innovations. The contributions made by the papers in Part II are summarized as follows, which correspond to paper groups 4), 5), and 6). [ABSTRACT FROM AUTHOR]

The explosive growth of Internet-of-Things (IoT) applications such as smart cities and Industry 4.0 have led to drastic increase in demand for wireless bandwidth, hence motivating the rapid development of new techniques for enhancing spectrum utilization needed by new generation wireless communication technologies. Among others, dynamic spectrum access (DSA) is one of the most widely accepted approaches. In this paper, as an enhancement of existing works, we take into consideration of inter-node collaborations in a dynamic spectrum environment. Typically, in such distributed circumstances, intelligent dynamic spectrum access almost invariably relies on self-learning to achieve dynamic spectrum access improvement. Whereas, this paper proposes a DSA scheme based on deep reinforcement learning to enhance spectrum and access efficiency. Unlike traditional Q-learning-based DSA, we introduce the following to enhance the spectrum efficiency in dynamic IoT spectrum environments. First, deep double Q-learning is adopted to perform local self-spectrum-learning for IoT terminals in order to achieve better dynamic access accuracy. Second, to accelerate learning convergence, federated learning (FL) in edge nodes is used to improve the self-learning. Third, multiple secondary users, who do not interfere with each other and have similar operation condition, are clustered for federated learning to enhance the efficiency of deep reinforcement learning. Comparing with the traditional distributed DSA with deep learning, the proposed scheme has faster access convergence speed due to the characteristic of global optimization for federated learning. Based on this, a framework of federated deep reinforcement learning (FDRL) for DSA is proposed. Furthermore, this scheme preserves privacy of IoT users in that FDRL only requires model parameters to be uploaded to edge servers. Simulations are performed to show the effectiveness of theproposed FDRL-based DSA framework. [ABSTRACT FROM AUTHOR]

In one of the several manifestations, the future cellular networks are required to accommodate a massive number of devices, several orders of magnitude compared to today’s networks. At the same time, the future cellular networks will have to fulfill stringent latency constraints. To that end, one problem that is posed as a potential showstopper is extreme congestion for requesting uplink scheduling over the physical random access channel (PRACH). Indeed, such congestion drags along scheduling delay problems. In this paper, the use of self-organized device-to-device (D2D) clustering is advocated for mitigating PRACH congestion. To this end, this paper proposes two D2D clustering schemes, namely, random-based clustering and channel-gain-based clustering. Accordingly, this paper sheds light on random access within the proposed D2D clustering schemes and presents a case study based on a stochastic geometry framework. For the sake of objective evaluation, the D2D clustering is benchmarked by the conventional scheduling request procedure. Accordingly, this paper offers insights into useful scenarios that minimize the scheduling delay for each clustering scheme. Finally, this paper discusses the implementation algorithm and some potential implementation issues and remedies. [ABSTRACT FROM AUTHOR]

The December page is devoted to IEEE Communications Society Awards and the Awards Committee that receives the nominations and processes them to identify the recipients. ComSoc Awards are meant to honor colleagues who in some ways, either via scientific/technical contributions or exemplary services, have reached significant, widely recognized achievements in our telecommunications community. Owing to their high significance and value, they need to be awarded through a fair and transparent process, and this is the essential, yet difficult and heavy task of the Awards Committee. It is my pleasure to introduce Lajos Hanzo, the Chair of the IEEE Communications Society Awards Committee, who will describe the awards and the procedure followed by the Awards Committee. [ABSTRACT FROM PUBLISHER]

The 2010 Scott Helt Memorial Award was awarded to Bogdan Ciubotaru, Gabriel-Miro Muntean, and Gheorghita Ghinea for their paper, "Objective Assessment of Region of Interest-Aware Adaptive Multimedia Streaming Quality," which appeared in the IEEE Transactions on Broadcasting, vol. 55, pp. 202-212, June 2009. [ABSTRACT FROM AUTHOR]

It is well known that a priority for Communications Society (ComSoc) is to increase the activity in Chapters and student branches and to support initiative projects. One of the projects of the Tomsk Chapter is the annual All-Russia Student Paper Contest on Information Security, based on IEEE (Institute of Electrical and Electronics Engineers) rules, which was successfully held for the third time in April 2003. In connection with the establishment of the Siberian IEEE Section in February 2003, this contest was the first event in the Section with technical support from ComSoc. The suggestion to start the contest came from the Tomsk Chapter Chair, who motivated Tomsk State University of Control systems and Radioelectronics to start this crusade.

A substantial amount of research exists in the area of energy efficiency in communications and networking. In recognition of this fact, the IEEE Communications Society has decided to publish a series on Green Communications and Networking as three issues of the IEEE Journal On Selected Areas in Communications. The first issue of the Series was published in December 2015 with 39 papers. This second issue of the Series has 52 papers, covering a wide selection of topics. These topics can be characterized in five categories. The first category in this issue is cellular networks and consists of 15 papers. [ABSTRACT FROM AUTHOR]

A call for papers on the Institute of Electrical and Electronics Engineers (IEEE) Wireless Communications Letters (WCL), a joint publication of the IEEE Communications Society, the IEEE Signal Processing Society, and the IEEE Vehicular Technology Society, is presented.

Provides instructions and guidelines to prospective authors who wish to submit manuscripts. [ABSTRACT FROM PUBLISHER]

The article invites authors to submit papers related to security, trust, and privacy of developing parallel and distributed systems and also presents guidelines for submission.

Computer networks fundamentally changed the way we communicate and interact with each other. In fact, they now form the backbone of our modern societies. While early networks were merely a mechanism for exchanging data between end-hosts, current computer and telecommunication networks are way more than that. Compared to the early days of the networking not only the hardware of networks has changed fundamentally, but with it also the software deployed to control and manage these networks. To reduce the significant management cost of large networks, automated management, including autonomic computing and communications evolved. [ABSTRACT FROM PUBLISHER]

The article announces the call for papers for the 10th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Services (TELSIKS 2011) to be held on October 5-8, 2011 in Serbia, Niš.

A call for papers for the 10th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Services (TELSIKS) is presented.

This paper focuses on the design and evaluation of pragmatic schemes for delay-sensitive communication. Specifically, this contribution studies the operation of data links that employ incremental redundancy as a means to shield information bits from the degradation associated with unreliable channels. While this inquiry puts forth a general methodology, exposition centers around erasure channels because they are well suited for analysis. Nevertheless, the goal is to identify both structural properties and design guidelines that are broadly applicable. Conceptually, this paper leverages a methodology, termed sequential differential optimization, aimed at identifying near-optimal block sizes for hybrid ARQ. This technique is applied to erasure channels and it is extended to scenarios where throughput is maximized subject to a constraint on the feedback rate. The analysis shows that the impact of the coding strategy adopted and the propensity of the channel to erase symbols naturally decouple when maximizing throughput. Ultimately, block size selection is informed by approximate distributions on the probability of decoding success at every stage of the incremental transmission process. This novel perspective, which rigorously bridges hybrid automatic repeat request and coding, offers a computationally efficient framework to select code rates and blocklengths for incremental redundancy. These findings are supported through numerical results. [ABSTRACT FROM AUTHOR]

The testing of vehicular communication technologies, the study of urban mobility patterns, the evaluation of new traffic policies cannot dispense from vehicle mobility simulation. As is often the case, the larger the dataset, the better. Indeed, in recent years, many projects in the fields of mobility or vehicular communication have sought new traffic simulators with extended areas of investigation, possibly covering a whole city and its suburbs. In this spirit, we have modeled an urban traffic simulation in a 600-Km2 area in and around the Municipality of Turin, leveraging the SUMO tool. This paper aims at reporting in detail the methodology we followed in the creation of this dataset. Our results demonstrate that a complete modeling of such a wide area is possible at the expense of minor simplifications, reaching a very good level of approximation. [ABSTRACT FROM AUTHOR]

Blockchain technology is becoming the cornerstone for the development and deployment of other technologies like Federated Learning (FL) and the Internet of Things (IoT), as it plays a critical role in data sharing and incentives. Blockchains supports decentralization, data-privacy protection, security, and reliability. Assuring secure data sharing in mobile computing and FL is challenging because of untrustworthy participants and unknown data quality. Blockchain provides trust in decentralized environments without requiring trusted third parties. By using smart contracts, blockchain has been able to supporting rich decentralized applications. However, the scalability of blockchain is a challenge that prevents its wide adoption by high-performance applications. To address the blockchain scalability issue, various blockchain sharding technologies and off-chain solutions have been proposed. To improve the network throughput, blockchain sharding divides the entire network into several smaller parallel groups and exploits fast consensus algorithms in blockchain shards. Off-chain solutions, such as payment channel networks (PCNs), transfer the slow on-chain transactions to the off-chain environment, in which transactions can be accelerated. Without consensus and on-chain expensive operations, off-chain scalable solutions significantly reduce transaction costs and increase transaction throughput. This special issue aims to provide a forum for the presentation of state-of-the-art research approaches that advance the construction of intelligent blockchain systems. A total of 27 articles were accepted after a two-round rigorous review process. Based on their topics, we have grouped the accepted articles into four categories: blockchain-based federated learning systems, blockchain and the IoT, blockchain scalability, and high-performance blockchains. In what follows, we introduce these articles and their contributions. [ABSTRACT FROM AUTHOR]

In the future era of intelligent networks, communication technology and network architecture need to be further developed to provide users with high-quality services. The Space-Air-Ground Integrated Networks (SAGIN) is seen as a potential architecture to provide ubiquitous communication and drive the era of the intelligent global network. The space and air segments in SAGIN can assist in offloading traffic from the ground segment. However, in a highly dynamic and heterogeneous network like SAGIN, offloading decisions are easily affected by the incorporated/malicious nodes. How to ensure security and improve network performance becomes a critical problem. In this paper, we address the above problem by jointly using blockchain and federated reinforcement learning (FRL). Firstly, we propose a blockchain-based secure federated learning framework that combines topology information chain and model chain to assist traffic offloading. Then, we propose a node security evaluation and an enhanced practical byzantine fault tolerance (EPBFT) algorithm to secure the traffic offloading process. Furthermore, we describe the traffic offloading problem as a Markov decision problem (MDP) and employ the Blockchain-based Federated Asynchronous Advantage Actor-Critic (BFA3C) algorithm to solve this problem. Finally, the simulation results show that the BFA3C-based algorithm used in SAGIN with/without malicious nodes achieves superior performance in terms of latency and security. [ABSTRACT FROM AUTHOR]

Editorial. Discusses the changes in the publication of papers in the "IEEE Transactions on Microwave Theory and Techniques". Criteria for publication; Decision not to accept short papers.

With the proliferation of portable devices, the exponential growth of the global mobile traffic brings great challenges to the traditional communication networks and the traditional wireless communication technologies. In this context, converged networks and cache-based data offloading have drawn more and more attention based on the strong correlation of services. This paper proposes a novel popular services pushing and caching scheme by using converged overlay networks. The most popular services are pushed by terrestrial broadcasting networks. And they are cached in ${n}$ router-nodes with limited cache sizes. Each router-node only interconnects with its neighbor nodes. Users are served through the router’s WiFi link. If the services requested are cached in the routers, the user can be immediately responded; otherwise, the requests can be responded through the link from cellular stations to the router. In the proposed scheme, the cache size of the router, the maximum number of requests each router can serve, and the whole-time delay are limited. Three node-selecting and dynamic programming algorithms are adopted to maximize the equivalent throughput. Analytical and numerical results demonstrate that the proposed scheme is very effective. [ABSTRACT FROM AUTHOR]

Space-division multiplexing (SDM) technology is a promising candidate to achieve massive parallelism in optical fiber cables and overcome the capacity limitation of the conventional single-mode fiber (SMF). Among the several kinds of SDM fiber, a weakly coupled multicore fiber (MCF) is advantageous in that it can be easily upgraded for use in existing equipment and requires no complex signal processing for optical multi-input multi-output (MIMO). In this article, we discuss the progress and standardization activity of MCF technologies from the viewpoint of accelerating the practical application of SDM technology. We first describe the possible application areas of SDM fibers and then show the recent progress of the essential technologies to construct the MCF link: the MCF itself, its splicing and connectorization, and the input/output techniques. We also discuss the availability and deployability of MCF as a large-capacity transmission medium and detail the progress on establishing a new international standard for SDM technology, which includes both historical progress and more recent endeavors on the standardization of optical fiber cables and SDM technology in International Telecommunication Union Telecommunication Standardization Sector (ITU-T) and International Electrotechnical Commission (IEC). We close with a summary of MCF technology and its standardization activity with an eye to next-generation transmission systems and the long-term development of ultralarge capacity SDM transmission technology. [ABSTRACT FROM AUTHOR]

Emerging communication technologies allow to reconfigure the physical network topology at runtime, enabling demand-aware networks (DANs): networks whose topology is optimized toward the workload they serve. However, today, only little is known about the fundamental algorithmic problems underlying the design of such demand-aware networks. This paper presents the first bounded-degree, demand-aware network, $\textit {cl-DAN} $ , which minimizes both congestion and route lengths. The degree bound $\Delta $ is given as part of the input. The designed network is provably (asymptotically) optimal in each dimension individually: we show that there do not exist any bounded-degree networks providing shorter routes (independently of the load), nor do there exist networks providing lower loads (independently of the route lengths). The main building block of the designed $\textit {cl-DAN} $ networks are $\textit {ego-trees}$ : communication sources arrange their communication partners in an optimal tree, individually. While the union of these ego-trees forms the basic structure of $\textit {cl-DANs}$ , further techniques are presented to ensure bounded degrees (for scalability). [ABSTRACT FROM AUTHOR]

Recently, reconfigurable intelligent surface (RIS) has drawn much attention due to its capability of improving coverage and communication performance. The development of RIS-assisted communication technology relies on deep understanding of RIS channel characteristics. However, most of the existing investigations focus on the impact of RIS, ignoring the existence of local scatterers in the real propagation environment. The ideal propagation condition limits the accuracy and application of the developed channel model. In this paper, we aim to analyze the channel characteristics of RIS-assisted near-filed communication by considering different conditions of local scatterers. Specifically, we propose a three-dimensional (3D) RIS-assisted multiple-input multiple-output (MIMO) channel model based on a three-dimensional cylinder model, which considers line-of-sight, single-bounced at RIS (SBR) and double-bounced (DB) modes where radio waves reflect from RIS and scatterers near receiver. Based on the proposed channel model, we investigate some key statistical properties for SBR and DB propagation, including the time-frequency-space correlation function and Doppler power spectrum. From the simulation results, it is found that RIS element number, RIS horizontal and vertical locations, distribution of surrounding scatterers, and movement of Rx have significant impacts on channel characteristics. Finally, channel capacities of SBR and DB modes are calculated, where the large size and appropriate locations of RIS significantly improve the channel capacity of RIS-assisted communication. These numerical results and observations can be used for design of RIS-assisted near-field communication systems. [ABSTRACT FROM AUTHOR]

Downlink transmission into frequency-selective links experiencing different coherence bandwidths and coherence times has obvious practical relevance, but is often addressed via assuming for all users the coherence conditions corresponding to the fastest, most dispersive user. This paper demonstrates an alternative approach that directly exploits the differences between coherence bandwidth and coherence time of users under frequency-selective conditions, showing that it can lead to significant new efficiencies and gains. More specifically, we study a two-user downlink frequency-selective channel under three broad conditions of disparity between the link qualities: when the disparity is in coherence time, in coherence bandwidth, and in both coherence time and coherence bandwidth. Each of the coherence scenarios calls for a distinct treatment; for each, we provide an analysis demonstrating the gains in achievable rates due to exploiting coherence disparity. Numerical simulations demonstrate the advantages of the proposed schemes. [ABSTRACT FROM AUTHOR]

These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]

The objective of this special issue is to bring together the most updated research contributions addressing antennas for satellite communications (both spaceborne and user terminals), and propose new applications, solutions, and challenges for the future. [ABSTRACT FROM PUBLISHER]

The article discusses various reports about cooperative communications and networking, published within the issue.

Connected and automated vehicles will enable advanced traffic safety and efficiency applications thanks to the dynamic exchange of information between vehicles, and between vehicles and infrastructure nodes. Connected vehicles can utilize IEEE 802.11p for vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications. However, a widespread deployment of connected vehicles and the introduction of connected automated driving applications will notably increase the bandwidth and scalability requirements of vehicular networks. This paper proposes to address these challenges through the adoption of heterogeneous V2V communications in multi-link and multi-RAT vehicular networks. In particular, the paper proposes the first distributed (and decentralized) context-aware heterogeneous V2V communications algorithm that is technology and application agnostic, and that allows each vehicle to autonomously and dynamically select its communications technology taking into account its application requirements and the communication context conditions. This study demonstrates the potential of heterogeneous V2V communications, and the capability of the proposed algorithm to satisfy the vehicles’ application requirements while approaching the estimated upper bound network capacity. [ABSTRACT FROM AUTHOR]