Search arXivSearch

arXiv · 1306.0944

An Exact Path-Loss Density Model for Mobiles in a Cellular System

Abstract

In trying to emulate the spatial position of wireless nodes for purpose of analysis, we rely on stochastic simulation. And, it is customary, for mobile systems, to consider a base-station radiation coverage by an ideal cell shape. For cellular analysis, a hexagon contour is always preferred mainly because of its tessellating nature. Despite this fact, largely due to its intrinsic simplicity, in literature only random dispersion model for a circular shape is known. However, if considered, this will result an unfair nodes density specifically at the edges of non-circular contours. As a result, in this paper, we showed the exact random number generation technique required for nodes scattering inside a hexagon. Next, motivated from a system channel perspective, we argued the need for the exhaustive random mobile dropping process, and hence derived a generic close-form expression for the path-loss distribution density between a base-station and a mobile. Last, simulation was used to reaffirm the validity of the theoretical analysis using values from the new IEEE 802.20 standard.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mouhamed Abdulla, Yousef R. Shayan. 2013-06-04. An Exact Path-Loss Density Model for Mobiles in a Cellular System. https://doi.org/10.1145/1641776.1641797

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT