SearcharxivSearch

arXiv subjects

Suzan Bayhan

Publications and source records attributed to Suzan Bayhan.

13 recordsLinked to original sources

Beam-align: distributed user association for mmWave networks with multi-connectivity

Since the spectrum below 6 GHz bands is insufficient to meet the high bandwidth requirements of 5G use cases, 5G networks expand their operation to mmWave bands. However, operation at these bands has to cope with a high penetration loss and susceptibility to blocking objects. Beamforming and multi-connectivity (MC) can together mitigate these challenges. But, to design such an optimal user association scheme leveraging these two features is non-trivial and computationally expensive. Previous studies either considered a fixed MC degree for all users or overlooked beamforming. Driven by the question what is the optimal degree of MC for each user in a mmWave network, we formulate a user association scheme that maximizes throughput considering beam formation and MC. Our numerical analysis shows that there is no one-size-fits-all degree of optimal MC; it depends on the number of users, their rate requirements, locations, and the maximum number of active beams at a BS.Based on the optimal association, we design BEAM-ALIGN: an efficient heuristic with polynomial-time complexity O(|U|log|U|), where |U| is the number of users. Moreover, BEAM-ALIGN only uses local BS information - i.e. the received signal quality at the user. Differing from prior works, BEAM-ALIGN considers beamforming, multiconnectivity and line-of-sight probability. Via simulations, we show that BEAM-ALIGN performs close to optimal in terms of per-user capacity and satisfaction while it outperforms frequently-used signal-to-interference-and-noise-ratio based association schemes. We then show that BEAM-ALIGN has a robust performance under various challenging scenarios: the presence of blockers, rain, and clustered users.

cs.NI

On the resilience of cellular networks: how can national roaming help?

Cellular networks have become one of the critical infrastructures, as many services depend increasingly on wireless connectivity. Therefore, it is important to quantify the resilience of existing cellular network infrastructures against potential risks, ranging from natural disasters to security attacks, that might occur with a low probability but can lead to severe disruption of the services. In this paper, we combine models with public data from national bodies on mobile network operator (MNO) infrastructures, population distribution, and urbanity level to assess the coverage and capacity of a cellular network at a country scale. Our analysis offers insights on the potential weak points that need improvement to ensure a low fraction of disconnected population (FDP) and high fraction of satisfied population (FSP). As a resilience improvement approach, we investigate in which regions and to what extent each MNO can benefit from infrastructure sharing or national roaming, i.e., all MNOs act as a single national operator. As our case study, we focus on Dutch cellular infrastructure and model risks as random failures, correlated failures in a geographic region, and abrupt increase in the number of users. Our analysis shows that there is a wide performance difference across MNOs and geographic regions in terms of FDP and FSP. However, national roaming consistently offers significant benefits, e.g., up to 13% improvement in FDP and up to 55% in FSP when the networks function without any failures.

cs.NI

Impact of Power Consumption Models on the Energy Efficiency of Downlink NOMA Systems

While non-orthogonal multiple access (NOMA) improves spectral efficiency, it results in a complexity at the receivers due to successive interference cancellation (SIC). Prior studies on the energy efficiency of NOMA overlook the SIC overhead and rely on simplistic power consumption models (PCM). To fill this gap, we first introduce PCM-$κ$ that accounts for SIC-related power expenditure, where $κ$ represents the average power consumption per SIC layer. Then, to investigate the energy efficiency of NOMA and joint transmission (JT)-CoMP NOMA, we formulate a power allocation problem for maximizing the energy efficiency and consequently propose a global approach running at a centralized entity and a local algorithm running at a base station. We evaluate the energy efficiency using PCM-$κ$ and two PCMs commonly used in the literature. Numerical analysis suggests that using simplistic PCMs leads to a few orders of magnitude overestimation of energy efficiency, especially when the receivers have low rate requirements. Despite the superiority of JT-CoMP NOMA over conventional NOMA in finding a feasible power allocation, the difference in their energy efficiency is only marginal. Moreover, when conventional NOMA is feasible, the optimal solution for JT-CoMP NOMA converges to conventional NOMA and NOMA schemes favour the users with the best channel quality.

cs.NI

Perspectives on Negative Research Results in Pervasive Computing

Not all research leads to fruitful results; trying new ways or methods may surpass the state of the art, but sometimes the hypothesis is not proven or the improvement is insignificant. In a systems discipline like pervasive computing, there are many sources of errors, from hardware issues over communication channels to heterogeneous software environments. However, failure to succeed is not a failure to progress. It is essential to create platforms for sharing insights, experiences, and lessons learned when conducting research in pervasive computing so that the same mistakes are not repeated. And sometimes, a problem is a symptom of discovering new research challenges. Based on the collective input of the First International Workshop on Negative Results in Pervasive Computing (PerFail 2022), co-located with the 20th International Conference on Pervasive Computing and Communications (PerCom 2022), this paper presents a comprehensive discussion on perspectives on publishing negative results and lessons learned in pervasive computing.

cs.DC

Impact of Multi-connectivity on Channel Capacity and Outage Probability in Wireless Networks

Multi-connectivity facilitates higher throughput, shorter delay, and lower outage probability for a user in a wireless network. Considering these promises, a rationale policy for a network operator would be to implement multi-connectivity for all of its users. In this paper, we investigate whether the promises of multi-connectivity also hold in such a setting where all users of a network are connected through multiple links. In particular, we consider a network where every user connects to its k closest base stations. Using a framework of stochastic geometry and probability theory, we obtain analytic expressions for per-user throughput and outage probability of $k$-connectivity networks under several failure models. In contrast to the conclusions of previous research, our analysis shows that per-user throughput decreases with increasing k. However, multi-connected networks are more resilient against failures than single connected networks as reflected with lower outage probability and lead to higher fairness among the users. Consequently, we conclude that rather than implementing multi-connectivity for all users, a network operator should consider it for its users who would benefit from additional links the most, e.g., cell edge users.

cs.NI

EdgeDASH: Exploiting Network-Assisted Adaptive Video Streaming for Edge Caching

While edge video caching has great potential to decrease the core network traffic as well as the users' experienced latency, it is often challenging to exploit the caches in current client-driven video streaming solutions due to two key reasons. First, even those clients interested in the same content might request different quality levels as a video content is encoded into multiple qualities to match a wide range of network conditions and device capabilities. Second, the clients, who select the quality of the next chunk to request, are unaware of the cached content at the network edge. Hence, it becomes imperative to develop network-side solutions to exploit caching. This can also mitigate some performance issues, in particular for the scenarios in which multiple video clients compete for some bottleneck capacity. In this paper, we propose a network-side control logic running at a WiFi AP to facilitate the use of cached video content. In particular, an AP can assign a client station a different video quality than its request, in case the alternative quality provides a better utility. We formulate the quality assignment problem as an optimization problem and develop several heuristics with polynomial complexity. Compared to the baseline where the clients determine the quality adaptation, our proposals, referred to as EdgeDASH, offer higher video quality, higher cache hits, and lower stalling ratio which are essential for user's satisfaction. Our simulations show that EdgeDASH facilitates significant cache hits and decreases the buffer stalls only by changing the client's request by one quality level. Moreover, from our analysis, we conclude that the network assistance provides significant performance improvement, especially when the clients with identical interests compete for a bottleneck link's capacity.

cs.NI

OfdmFi: Enabling Cross-Technology Communication Between LTE-U/LAA and WiFi

Despite exhibiting very high theoretical data rates, in practice, the performance of LTE-U/LAA and WiFi networks is severely limited under cross-technology coexistence scenarios in the unlicensed 5GHz band. As a remedy, recent research shows the need for collaboration and coordination among co-located networks. However, enabling such collaboration requires an information exchange that is hard to realize due to completely incompatible network protocol stacks. We propose OfdmFi, the first cross-technology communication scheme that enables direct bidirectional over-the-air communication between LTE-U/LAA and WiFi with minimal overhead to their legacy transmissions. Requiring neither hardware nor firmware changes in commodity technologies, OfdmFi leverages the standard-compliant possibility of generating message-bearing power patterns, similar to punched cards from the early days of computers, in the time-frequency resource grid of an OFDM transmitter which can be cross-observed and decoded by a heterogeneous OFDM receiver. As a proof-of-concept, we have designed and implemented a prototype using commodity devices and SDR platforms. Our comprehensive evaluation reveals that OfdmFi achieves robust bidirectional CTC between both systems with a data rate of up to 84kbps, which is more than 125x faster than state-of-the-art.

cs.NI

Deep Learning for Cross-Technology Communication Design

Recently, it was shown that a communication system could be represented as a deep learning (DL) autoencoder. Inspired by this idea, we target the problem of OFDM-based wireless cross-technology communication (CTC) where both in-technology and CTC transmissions take place simultaneously. We propose DeepCTC, a DL-based autoencoder approach allowing us to exploit DL for joint optimization of transmitter and receivers for both in-technology as well as CTC communication in an end-to-end manner. Different from classical CTC designs, we can easily weight in-technology against CTC communication. Moreover, CTC broadcasts can be efficiently realized even in the presence of heterogeneous CTC receivers with diverse OFDM technologies. Our numerical analysis confirms the feasibility of DeepCTC as both in-technology and CTC messages can be decoded with sufficient low block error rate.

cs.NI

XZero: On Practical Cross-Technology Interference-Nulling for LTE-U/WiFi Coexistence

LTE-U/WiFi coexistence can be significantly improved by placing so-called coexistence gaps in space through cross-technology interference-nulling (CTIN) from LTE-U BS towards WiFi nodes. Such coordinated co-existence scheme requires, for the exchange of control messages, a cross-technology control channel (CTC) between LTE-U and WiFi networks which was presented recently. However, it is unclear how a practical CTIN operates in the absence of channel state information which is needed for CTIN but cannot be obtained from the CTC. We present XZero, the first practical CTIN system that is able to quickly find the suitable precoding configuration used for interference nulling without having to search the whole space of angular orientations. XZero performs a tree-based search to find the direction for the null beam(s) by exploiting the feedback received from the WiFi AP on the tested null directions. We have implemented a prototype of XZero using SDR platform for LTE-U and commodity hardware for WiFi and evaluated its performance in a large indoor testbed. Evaluation results reveal on average a reduction by 15.7 dB in interference-to-noise ratio at the nulled WiFi nodes when using a ULA with four antennas. Moreover, XZero has a sub-second reconfiguration delay which is up to 10x smaller as compared to naive exhaustive linear search.

cs.NI

The Future is Unlicensed: Coexistence in the Unlicensed Spectrum for 5G

5G has to fulfill the requirements of ultra-dense, scalable, and customizable networks such as IoT while increasing spectrum and energy efficiency. Given the diversity of envisaged applications and scenarios, one crucial property for 5G New Radio (NR) is flexibility: flexible UL/DL allocation, bandwidths, or scalable transmission time interval, and most importantly operation at different frequency bands. In particular, 5G should exploit the spectral opportunities in the unlicensed spectrum for expanding network capacity when and where needed. However, unlicensed bands pose the challenge of "coexisting networks", which mostly lack the means of communication for negotiation and coordination. This deficiency is further exacerbated by the heterogeneity, massive connectivity, and ubiquity of IoT systems and applications. Therefore, 5G needs to provide mechanisms to coexist and even converge in the unlicensed bands. In that regard, WiFi, as the most prominent wireless technology in the unlicensed bands, is both a key enabler for boosting 5G capacity and competitor of 5G cellular networks for the shared unlicensed spectrum. In this work, we describe spectrum sharing in 5G and present key coexistence solutions, mostly in the context of WiFi. We also highlight the role of machine learning which is envisaged to be critical for reaching coexistence and convergence goals by providing the necessary intelligence and adaptation mechanisms.

cs.NI

Coexistence Gaps in Space: Cross-Technology Interference-Nulling for Improving LTE-U/WiFi Coexistence

To avoid the foreseeable spectrum crunch, LTE operators have started to explore the option to directly use 5 GHz unlicensed spectrum band being used by IEEE 802.11 (WiFi). However, as LTE is not designed with shared spectrum access in mind, there is a major issue of coexistence with WiFi networks. Current coexistence schemes to be deployed at the LTE-U BS create coexistence gaps only in one domain (e.g., time, frequency, or space) and can provide only incremental gains due to the lack of coordination among the coexisting WiFi and LTE-U networks. Therefore, we propose a coordinated coexistence scheme which relies on cooperation between neighboring LTE-U and WiFi networks. Our proposal suggests that LTE-U BSs equipped with multiple antennas can create coexistence gaps in space domain in addition to the time domain gaps by means of cross-technology interference nulling towards WiFi nodes in the interference range. In return, LTE-U can increase its own airtime utilization while trading off slightly its antenna diversity. The cooperation offers benefits to both LTE-U and WiFi in terms of improved throughput and decreased channel access delay. More specifically, system-level simulations reveal a throughput gain up to 221% for LTE-U network and 44% for WiFi network depending on the setting, e.g., the distance between the two cell, number of LTE antennas, and WiFi users in the LTE-U BS neighborhood. Our proposal provides significant benefits especially for moderate separation distances between LTE-U/WiFi cells where interference from a neighboring network might be severe due to the hidden network problem.

cs.NI

Two Hops or More: On Hop-Limited Search in Opportunistic Networks

While there is a drastic shift from host-centric networking to content-centric networking, how to locate and retrieve the relevant content efficiently, especially in a mobile network, is still an open question. Mobile devices host increasing volume of data which could be shared with the nearby nodes in a multi-hop fashion. However, searching for content in this resource-restricted setting is not trivial due to the lack of a content index, as well as, desire for keeping the search cost low. In this paper, we analyze a lightweight search scheme, hop-limited search, that forwards the search messages only till a maximum number of hops, and requires no prior knowledge about the network. We highlight the effect of the hop limit on both search performance (i.e., success ratio and delay) and associated cost along with the interplay between content availability, tolerated waiting time, network density, and mobility. Our analysis, using the real mobility traces, as well as synthetic models, shows that the most substantial benefit is achieved at the first few hops and that after several hops the extra gain diminishes as a function of content availability and tolerated delay. We also observe that the return path taken by a response is on average longer than the forward path of the query and that the search cost increases only marginally after several hops due to the small network diameter.

cs.NI

Effects of Cooperation Policy and Network Topology on Performance of In-Network Caching

We model the cooperation policy with only two parameters -- search radius $r$ and number of copies in the network $N_{copy}$. These two parameters represent the range of cooperation and tolerance of duplicates. We show how cooperation policy impacts content distribution, and further illustrate the relation between content popularity and topological properties. Our work leads many implications on how to take advantage of topological properties in in-network caching strategy design.

cs.NI