Literature Database Entry

shin2016analysis


Seungjae Shin, Uichin Lee, Falko Dressler and Hyunsoo Yoon, "Analysis of Cell Sojourn Time in Heterogeneous Networks with Small Cells," IEEE Communications Letters, vol. 20 (4), pp. 788-791, April 2016.

Abstract

Recently, heterogeneous networks with small cells have been widely used to increase the capacity of mobile systems. In such environments, accurate estimation of the mean cell sojourn time is critical for evaluating the performance of the network and its applications. It is especially important to analyze the cell sojourn times of mobile users as they reside in different network tiers: either macro-cell-only or small-cell-covered areas. But because small cells are deployed in an irregular manner, it is difficult to derive the analytical mean cell sojourn time in a macro-cell-only area. In this letter, we propose a novel approach to resolve this difficulty. We developed a simple but effective trick that approximates the heterogeneous network to a discrete grid so that it becomes tractable, making it possible to derive the analytical mean sojourn time in the macro-cell- only area. Simulation results confirm that the proposed method has excellent accuracy for general random walk mobility models including random waypoint, Brownian motion, tailored Brownian motion, and truncated Levy walk.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Seungjae Shin
Uichin Lee
Falko Dressler
Hyunsoo Yoon

BibTeX reference

@article{shin2016analysis,
    author = {Shin, Seungjae and Lee, Uichin and Dressler, Falko and Yoon, Hyunsoo},
    title = {{Analysis of Cell Sojourn Time in Heterogeneous Networks with Small Cells}},
    journal = {IEEE Communications Letters},
    pages = {788-791},
    volume = {20},
    number = {4},
    year = {2016},
    month = {April},
    publisher = {IEEE},
    doi = {10.1109/LCOMM.2016.2516003},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceeedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.