Wireless Communications and Mobile Computing
Volume 2018 (2018), Article ID 3761075, 11 pages
https://doi.org/10.1155/2018/3761075

Research Article

Mobility-Centric Analysis of Communication Offloading for Heterogeneous Internet of Things Devices

Dmitry Kozyrev,1,2 Aleksandr Ometov,³ Dmitri Moltchanov,³ Vladimir Rykov,1,4 Dmitry Efrosinin,1,2 Tatiana Milovanova,¹ Sergey Andreev,³ and Yevgeni Koucheryavy³

¹RUDN University, Moscow, Russia
²V.A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences, Moscow, Russia
³Tampere University of Technology, Tampere, Finland
⁴Gubkin Russian State University of Oil and Gas, Moscow, Russia

Correspondence should be addressed to Aleksandr Ometov; aleksandr.ometov@tut.fi

Received 6 April 2018; Revised 30 June 2018; Accepted 12 July 2018; Published 5 August 2018

Academic Editor: Sudarshan Guruacharya

Copyright © 2018 Dmitry Kozyrev et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

Today, the number of interconnected Internet of Things (IoT) devices is growing tremendously followed by an increase in the density of cellular base stations. This trend has an adverse effect on the power efficiency of communication, since each new infrastructure node requires a significant amount of energy. Numerous enablers are already in place to offload the scarce cellular spectrum, thus allowing utilization of more energy-efficient short-range radio technologies for user content dissemination, such as moving relay stations and network-assisted direct connectivity. In this work, we contribute a new mathematical framework aimed at analyzing the impact of network offloading on the probabilistic characteristics related to the quality of service and thus helping relieve the energy burden on infrastructure network deployments.

1. Introduction and Motivation

The uncontrollable growth in the numbers of interconnected Internet of Things (IoT) devices has a tremendously adverse effect on the existing wireless networks [1]. It has been recently shown that there are more than four million base stations (BSs) each consuming an average of 2.3MWh per month [2], and the volume of newly deployed BSs is growing exponentially, especially in the developing counties. Such an extreme energy consumption burden has its influence on the energy costs, greenhouse effect, and global impact on climate in general [3].

One of the ways to control the increase in the numbers of newly deployed BSs is to efficiently utilize the existing system infrastructure [4] by, e.g., attempting to switch between the radio technologies instead of “densifying” the deployment area [5]. This paradigm is known as heterogeneous networking [6] as part of the next-generation (5G) systems and beyond. However, seamless implementation of this approach is associated with many practical difficulties, e.g., when the existing infrastructure is owned by different service providers.

Another potential enabler of green communication is device-to-device (D2D) connectivity [7, 8]. This technique allows reducing power consumption and improving network capacity and throughput by utilizing, e.g., unlicensed wireless spectrum controlled by the operator [9]. Basically, a mobile device equipped with two or more radio interfaces has an opportunity to utilize short-range wireless links to communicate with its neighboring nodes by reaching common goals, like data caching, edge computing, coverage extension, etc. [10]. As cellular spectrum remains expensive in terms of capacity and energy, it could be freed with D2D offloading, thus enabling green communication [11]. In this regime, the cellular network is only responsible for controlling the connection between the user equipment (UE) devices.

One more way to improve the communication quality is based on the use of unmanned aerial vehicles (UAVs). Historically, UAVs have already demonstrated their applicability for weather monitoring, forest fire detection, traffic control, etc. [12, 13]. Among the many applications, the use of UAVs for achieving high data-rate wireless communication is expected to play an essential role in future wireless systems. In fact, UAV-aided wireless communication becomes a promising solution to provide wireless connectivity for devices without infrastructure coverage [14]. There has been recent interest in utilizing aerial access points (AAPs) mounted on drones, which could be utilized for offering on-demand connectivity in cases of imminent network overload. Further, AAPs may also be utilized to support the scenarios of Public Protection and Disaster Relief (PPDR) where the connectivity is unavailable due to an unpredictable situation [15].

In addition, a recent exciting trend that overtakes the market is a broad penetration of wearable devices, such as AR-glasses, smart watches, heart rate monitors, and many others. The functions of those are mostly related to human condition monitoring. Note that wearable devices typically have smaller form-factors and thus are limited in terms of computation and energy, which substantiates a natural step of employing one of the devices as a gateway for delivering wearables-generated data to the cloud. Most commonly, a smartphone is utilized as this more powerful node [16].

In this paper, we assess the architecture of (beyond-) 5G systems where a mobile user is equipped with many wearable devices that are continuously exchanging data with the surrounding nodes as well as the cloud via a gateway node. For this purpose, the conventional cellular infrastructure is typically employed, augmented with a D2D-based caching-enabled relay or utilizing other heterogeneous networking solutions. In our scenario, an AAP is further used together with D2D communication to achieve the ultimate goal of offloading the existing cellular network as much as possible. Here, the AAP is expected to provide a control link to the D2D pairs located within the overloaded area of interest, thus relieving the limited cellular spectrum to some extent. This work proposes a new mathematical model to evaluate the probabilistic characteristics of the proposed system architecture.

The rest of the paper is organized as follows. Our system model of the considered scenario is introduced in Section 2. This model is solved for the performance metrics of interest in Section 3. An example illustrating the applicability of the proposed approach is offered in Section 4. The last section concludes the paper.

2. System Model

2.1. Deployment Model

Consider a city square with a mass event (e.g., a concert) in progress, which is shown in Figure 1. The area of interest has a certain number of heterogeneous UEs acting as gateways for their proximate wearable devices and is partially covered by the AAP’s connectivity providing aid in communication offloading via D2D link management. New mobile UE can arrive in the cell according to a stochastic process and leave it after a certain random time due to user mobility. All objects in the cell can disseminate their content of interest by utilizing the D2D links.

Figure 1: Joint operation of conventional and aerial cells serving D2D links.

Since the AAP coverage within the area of interest is limited and potentially provided by the event holders, wireless connectivity outside of this zone is only available through the conventional infrastructure links. The primary goal of the network in the considered scenario is to offload as many communication sessions as possible onto the direct links, thus enabling more power efficient content dissemination. Note that the D2D capacity regarding the quality of service is constrained due to a limited number of channels in one collision domain; i.e., one can estimate the number of D2D pairs that can operate simultaneously under the AAP coverage for a given application.

Since the conventional metrics in such a scenario are well studied in numerous works [17, 18], the primary focus of this paper is set on less popular performance indicators. First, we consider connection unavailability, i.e., a situation where one of UE nodes intends to connect to another UE over a D2D link but that second UE is already occupied or a certain UE attempts to reach another device outside of the cell but there are no more available D2D links. Another metric of interest is the probability of a connection to be discarded, i.e., when one of the UE nodes leaves the AAP coverage while still having an active connection with another UE inside the same cell.

2.2. Mobility Model

We assume that the initial UE positions follow a Poisson point process (PPP) in with the spatial density of . Let , where is the probability of a session initiation over the interval . It is the temporal intensity of the arrival process from a single UE. Using the superposition property of the point processes, we note that the session arrival process is Poisson with the intensity of sessions per second [19], where is the area of the zone of interest. The choice of the UE that initiates a session is random. Hence, the geometric locations of users associated with a session are distributed uniformly within the AAP’s coverage area [20].

To capture the mobility behavior, we assume that humans move according to a random direction model (RDM, [21]), since it characterizes the essentials of random movement while still allowing for a tractable analysis. According to the RDM formulation, the UE first chooses its direction of movement uniformly within and then travels in the selected direction for an exponential amount of time with the parameter at the constant speed of .

2.3. Model Formalization

We assess the AAP service process by utilizing a queuing system model illustrated in Figure 2. We assume that sessions exist in the system, while there is a certain external flow of impatient heterogeneous sessions, which arrive from the outside of the system according to a Poisson process. Consider that the regular users can connect directly over D2D, while the external users may employ both the infrastructure and the D2D connections.

Figure 2: Proposed queuing model.

We also assume that the AAP-served UE arrivals follow a marked point process:

where is the arrival time of user and is the UE type, . The service times of type- UE, i.e., the duration of an active session initiated by the -th UE, and are all random variables with the cumulative distribution function (CDF):

Each external session requires exactly one server. The duration of time spent by the -th user in the D2D service zone is a random variable with the CDF:

A session is lost during service if the corresponding UE leaves the cell before this session is completed. An arriving session is lost when there are no vacant servers (channels) at the time of its arrival. Finally, a session can be lost if the distance between the communicating users becomes higher than a specified value. We remind that, for the introduced model, we are interested in the performance metrics that characterize the reliability of the system. Primarily, we derive the following parameters: session loss probability, system unavailability, and reliability of a connection.

3. Performance Analysis

In this section, we analyze the proposed system. First, we follow a stochastic geometry approach to characterize the input parameters. Then, we proceed by assessing the specified queuing system for the performance metrics of interest.

3.1. System Parametrization

To completely parametrize our model, we need to provide the following input parameters: (i) distribution of the time interval between UE entries into the D2D service zone, (ii) distribution of the time spent in the D2D service area, (iii) probability that UE having an active D2D session is going to leave the D2D zone before this session ends.

Following [22], the time distribution between the cases when the UE moving according to the RDM model and being initially distributed uniformly in a certain area of interest hits a certain subspace follows an exponential distribution. Note that this result holds when the mean run length in the RDM model, , is at least of the zone of interest; see [22] for more details. Recall that the stationary distribution of UEs moving in a certain zone is uniform [21].

To determine the parameter of an exponential distribution, we consider an area increment of the D2D service zone that corresponds to the unit speed . Assuming a circularly shaped D2D service zone and recalling that the direction of the UE movement is distributed uniformly in , we have the following approximation for the temporal intensity of users entering the D2D service zone:

where is the spatial intensity of UE in the area of interest and is the radius of the D2D service zone. Observe that the factor accounts for a fraction of UEs moving towards the D2D service zone.

The exact distribution of time spent by the UE moving according to the RDM in a certain enclosed subspace is unknown even for simple configurations of the subspace [23]. In this case, the common procedure is to use a diffusion approximation with a suitable diffusion coefficient [24]. However, taking into account our assumptions regarding the mean run length and the diameter of the D2D service zone, we observe that in most cases the UE crosses the D2D service zone without changes in its direction. The length of a random chord, , which specifies the distance traveled within the D2D service zone, is given by [25]

with the mean value of , where is the radius of the D2D service zone. The distribution of time spent in the D2D service zone is obtained by scaling the pdf by the movement speed [26], which leads to

where is the time spent in the D2D service zone.

Finally, we require the probability that the UE leaves the D2D service zone before its active session expires. We have two cases to consider: (i) the session has been initiated before entering the D2D service area and (ii) the session has been initiated when the UE is already in the service area. In the former case, owning to the memoryless property, we do not need to track the backward recurrence time of the session and the sought probability is , where is the service duration. Since and are independent, by employing a convolution we obtain

which can be produced with a numerical integration.

Let us now determine the probability that the UE leaves the D2D service zone before its session is completed given that it was initiated after entering the zone, . Observe that since a session is assumed to be initiated randomly and should progress over the time the UE spends in the D2D service zone, it is distributed uniformly over . Then, the forward recurrent time that the UE spends in the zone once its session was initiated at the time instant is [26]

where is the CDF of time spent by the UE in the D2D service zone, which is given by

Substituting (9) into (8), we obtain

The unconditional pdf of time that the UE spends in the D2D coverage zone after initiating its session is given by

Further, the sought probability is given by

which can be produced with a numerical integration.

3.2. Problem Setting

To solve the problem formulated above, we introduce the system state space . Let us denote the system state by the following triplet:

where is the number of infrastructure controlled UEs, is the number of occupied channels, and is the vector of states of the UE. The value of is set according to the following rules: (i) when the -th user does not have any ongoing sessions; (ii) when the -th UE is currently connected to the -th UE directly; and (iii) when the -th UE utilizes one of the infrastructure links.

The overall state space is then defined as a set of triplets: . We introduce a random process evolving over , which enters the state if the system at time is in the state . We also introduce the state probabilities of the system and the steady-state probabilities . The steady-state distribution of this process is characterized by linear equations in the following form:

where is the vector of ones of the appropriate size and is the infinitesimal generator of the Markov process. One may solve it by using the conventional techniques; see, e.g., [27].

4. A Numerical Example

To demonstrate the applicability of the proposed model, consider the simplest case without the pure infrastructure connected UEs, when

(i)the users arrive into the system according to a Poisson flow of intensity ;(ii)the distribution of the sojourn time of any user in the cell is exponential with the parameter :

(iii)the process of contacts between the users is also Poisson with the intensity of ;(iv)the duration of the user sessions has an exponential distribution with the parameter :

(v)only infrastructure links are available for the connections.

We also assume full control of the D2D links as managed by the network operator. To characterize the system behavior, consider a two-dimensional stochastic process with the state space:

where is the number of users in the system and is the number of occupied D2D links. The state space of the process is demonstrated in Figure 3 together with its transition graph.

Figure 3: Transition graph of the process .

The subsets and represent a single state, the subsets and contain two states, the subsets and contain three states, and only for the number of states is equal to four. Note that in case where the servers and/or users are heterogeneous, to describe the system behavior with a Markov process, the subsets of states with a fixed number of users in the system should be detailed in order to show the configuration of the busy servers. With the help of the constructed stochastic process , we will study the quality-of-service (QoS) metrics in the considered system, i.e., the probability of a connection loss (when a user with no ongoing session leaves the service area), the probability of connection unavailability (when there are no vacant channels in the system), and the average number of busy channels.

Under the given assumptions, the process may be considered as Markov, and its transition intensities have the following forms:

(1) is the transition intensity from the state to the state , which occurs when a user enters the system.(2) is the transition intensity from the state to the state , which occurs when a user with no ongoing session leaves the system.(3) is the transition intensity from the state to the state , which occurs when a user with an ongoing session leaves the system.(4) is the transition intensity from the state to the state , which occurs when a user with no ongoing session initiates a session.(5) is the transition intensity from the state to the state , which occurs when a user with an ongoing session ends this session.

Consider the state . Since channels are occupied by exactly users (2 users are connected via a single D2D link), the number of users with no ongoing session is , the number of users with an ongoing session is , and the number of possible ways to choose a pair of users out of nonbusy users to initiate a session is . Therefore, we arrive at the following expressions for the transition intensities:

where for , for , for , and for .

The process transition intensity matrix has the following blockwise structure

where the -th blockwise row corresponds to the subset of states for which users are present in the system, describes the output from this subset to the subset with users in the system, describes the transitions inside the subset with users in the system, and contains the output intensities from the subset to the subset . Transition matrices for the considered example are as follows:

Further, for , the matrices have the form

where the diagonal elements are

The blockwise form of the matrix represents the steady-state probability (s.s.p.) vector in the blockwise form of the appropriate dimensions that provides . Hence, the balance equations may be represented as

with the normalizing condition

where is a column-vector, while its components are equal to .

By using for , we arrive at

Further, we multiply (34) by as

with the following birth-and-death s.s.p. equation:

For , this gives us

However, the same equalities can be obtained from (34), thus confirming it for :

The solution to this system of equations for all with the normalizing condition (35) and with is

which is a Poisson distribution of the number of users in the system.

In order to calculate the probabilities of interest, there is a need to evaluate , which requires a more detailed analysis. To achieve this goal, the process on the separate subset of states should be considered as . Taking into account and its transition graph (see Figure 3), it is clear that each of the subsets contains only one state; hence, the corresponding probabilities are given with (41) as

For the subsets , the process is a birth-death process with the birth and death (see Figure 3) intensities. Therefore, the detailed balance equations may be utilized to establish the results for :

additionally for

at least for all , and

For the probabilities of the subsets , by taking into account (41) and using the notation , the following expressions for the probabilities for can be derived:

For , the following holds:

where

Based on the above set of probabilities, it is possible to calculate the sought QoS characteristics, such as the following.

(1)Probability of a connection loss due to leaving the AAP coverage area by one of the users: Here, a loss of connection occurs in case where the process transitions from the state to the state , which is only possible for the states with and . Hence, the connection loss may be derived as

 The plots of the loss probabilities versus the parameters and are given in Figure 4. Since the parameter is defined as a ratio between the session initiation intensity and the intensity of the session termination flow , the physical meaning of this parameter is the channel load. The parameter is the system load factor (or traffic load), which can be interpreted as a relative rate of populating the cell by the outside users. Then, it is obvious that, at the zero level of , i.e., when no users are entering the cell, the connection loss probability remains zero for any value of the parameter . However, as the system load factor increases, the probability also grows, as it can be observed in Figure 4: the higher the value of the parameter is, the steeper the curve of on becomes. This behavior is easily explained by the fact that both parameters affect the occupation intensity for the free channels, which are limited in their number, by the users entering the cell. Since the users leave the cell regardless of whether they occupy the server (channel) or not, the probability of a connection loss increases with the growth of either parameter.(2)Probability that D2D channels are currently occupied is

 while the mean number of busy channels is

 and the connection unavailability intensity is .(3)Probability of a connection unavailability state is possible to derive only if the number of users is not less than . Hence, the probability of a connection unavailability becomes

 while the intensity of unavailable connections is .

Figure 4: Probability versus different values of and .

The plots for the unavailability probabilities versus the parameters and are displayed in Figure 5. The behavior of the curves of the connection unavailability probability is similar in many ways to that of , as directly correlates with the parameters and . If the value of any of the associated parameters is zero, the probability of a connection unavailability is also zero, since either the system lacks users (parameter ), or there are no users willing to initiate a connection session, i.e., zero loads on the channels (parameter ). As each of these parameters grows, the probability to have an available unoccupied channel for establishing another connection between the activating users decreases.

Figure 5: Probability versus different values of and .

The considered model admits useful generalizations that may include different types of heterogeneous users, different types of input processes for the outside users, and different mechanisms of their service.

5. Conclusion

In today’s wireless networks, multiple enablers are available to offload the expensive cellular spectrum, thus allowing utilization of more efficient short-range radio technologies for user content dissemination. This work proposed a novel mathematical framework that enables assessing the impact of network offloading on the probabilistic characteristics related to the quality of service. We demonstrated that our developed model may be employed when an aerial access point conducts D2D link management based on the channel and system loads. The results reported useful knowledge of connection unavailability and connection loss probabilities.

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

The publication was supported by the Ministry of Education and Science of the Russian Federation (Project no. 2.882.2017/4.6).

References

M. Z. Shakir, K. A. Qaraqe, H. Tabassum, M.-S. Alouini, E. Serpedin, and M. Imran, “Green heterogeneous small-cell networks: Toward reducing the CO2 emissions of mobile communications industry using uplink power adaptation,” IEEE Communications Magazine, vol. 51, no. 6, pp. 52–61, 2013.

C. Gao, X. Sheng, J. Tang, W. Zhang, S. Zou, and M. Guizani, “Joint mode selection, channel allocation and power assignment for green device-to-device communications,” in Proceedings of IEEE International Conference on Communications (ICC), pp. 178–183, Sydney, NSW, June 2014.

B. Lee, “Energy Efficiency Gain of Cellular Base Stations with Large-Scale Antenna Systems for Green Information and Communication Technology,” Sustainability, vol. 9, no. 7, p. 1123, 2017.

T. Zhou, N. Jiang, D. Qin, Z. Liu, and C. Li, “Joint Cell Selection and Activation for Green Communications in Ultra-Dense Heterogeneous Networks,” in Proceedings of the 2017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC), pp. 32–37, Guangzhou, China, July 2017.

U. Siddique, H. Tabassum, E. Hossain, and D. I. Kim, “Wireless backhauling of 5G small cells: challenges and solution approaches,” IEEE Wireless Communications Magazine, vol. 22, no. 5, pp. 22–31, 2015.

V. Jungnickel, K. Manolakis, W. Zirwas et al., “The role of small cells, coordinated multipoint, and massive MIMO in 5G,” IEEE Communications Magazine, vol. 52, no. 5, pp. 44–51, 2014.

J. An, K. Yang, J. Wu, N. Ye, S. Guo, and Z. Liao, “Achieving Sustainable Ultra-Dense Heterogeneous Networks for 5G,” IEEE Communications Magazine, vol. 55, no. 12, pp. 84–90, 2017.

A. H. Sakr, H. Tabassum, E. Hossain, and D. I. Kim, “Cognitive spectrum access in device-to-device-enabled cellular networks,” IEEE Communications Magazine, vol. 53, no. 7, pp. 126–133, 2015.

S. Andreev, J. Hosek, T. Olsson et al., “A unifying perspective on proximity-based cellular-assisted mobile social networking,” IEEE Communications Magazine, vol. 54, no. 4, pp. 108–116, 2016.

X. Lin, J. G. Andrews, A. Ghosh, and R. Ratasuk, “An overview of 3GPP device-to-device proximity services,” IEEE Communications Magazine, vol. 52, no. 4, pp. 40–48, 2014.

E. Yaacoub, H. Ghazza, and M.-S. Alouini, “A game theoretic framework for green hetnets using D2D traffic offload and renewable energy powered base stations,” Game Theory Framework Applied to Wireless Communication Networks, pp. 333–367, 2015.

G. Pajares, “Overview and current status of remote sensing applications based on unmanned aerial vehicles (UAVs),” Photogrammetric Engineering and Remote Sensing, vol. 81, no. 4, pp. 281–329, 2015.

L. Wang, B. Hu, and S. Chen, “Energy Efficient Placement of a Drone Base Station for Minimum Required Transmit Power,” IEEE Wireless Communications Letters, pp. 1–1, 2018.

K. Gomez, S. Kandeepan, M. M. Vidal et al., “Aerial base stations with opportunistic links for next generation emergency communications,” IEEE Communications Magazine, vol. 54, no. 4, pp. 31–39, 2016.

T. J. Tanzi, M. Chandra, J. Isnard, D. Camara, O. Sebastien, and F. Harivelo, “Towards “drone-based” disaster management: future application scenarios,” ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences, vol. III-8, pp. 181–189, 2016.

G. Aloi, G. Caliciuri, G. Fortino et al., “Enabling IoT interoperability through opportunistic smartphone-based mobile gateways,” Journal of Network and Computer Applications, vol. 81, pp. 74–84, 2017.

K. Gomez, A. Hourani, L. Goratti, R. Riggio, S. Kandeepan, and I. Bucaille, “Capacity evaluation of Aerial LTE base-stations for public safety communications,” in Proceedings of the European Conference on Networks and Communications, EuCNC, pp. 133–138, France, July 2015.

S. Chandrasekharan, S. Kandeepan, R. J. Evans et al., “Clustering approach for aerial base-station access with terrestrial cooperation,” in Proceedings of the IEEE Globecom Workshops, GC Wkshps 2013, pp. 1397–1402, USA, December 2013.

J. F. Kingman, Poisson processes, vol. 3 of Oxford Studies in Probability, The Clarendon Press, Oxford University Press, New York, 1993.

D. Moltchanov, “Distance distributions in random networks,” Ad Hoc Networks, vol. 10, no. 6, pp. 1146–1166, 2012.

P. Nain, D. Towsley, B. Liu, and Z. Liu, “Properties of random direction models,” in Proceedings of the Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., pp. 1897–1907, Miami, FL, USA.

R. Groenevelt, P. Nain, and G. Koole, “The message delay in mobile ad hoc networks,” Performance Evaluation, vol. 62, no. 1-4, pp. 210–228, 2005.

G. H. Weiss and R. J. Rubin, “Random Walks: Theory and Selected Applications,” in Advances in Chemical Physics, Advances in Chemical Physics, pp. 363–505, John Wiley & Sons, Inc., Hoboken, NJ, USA, 1982.

S. Redner, A Guide to First-Passage Processes, Cambridge University Press, Cambridge, UK, 2001.

A. M. Mathai, An introduction to geometrical probability, vol. 1 of Statistical Distributions and Models with Applications, Gordon and Breach Science Publishers, Amsterdam, 1999.

S. M. Ross, Introduction to probability models, Elsevier/Academic Press, Amsterdam, Eleventh edition, 2014.

G. Bolch, S. Greiner, H. de Meer, and K. S. Trivedi, Queueing networks and Markov chains, A Wiley-Interscience Publication, John Wiley & Sons, Inc., 1998.