Mobile Information Systems
Volume 2017 (2017), Article ID 2409830, 10 pages
https://doi.org/10.1155/2017/2409830

Research Article

Sliding Window Based Feature Extraction and Traffic Clustering for Green Mobile Cyberphysical Systems

Jiao Zhang,1,2 Li Zhou,1,3 Angran Xiao,⁴ Sai Zeng,⁵ Haitao Zhao,¹ and Jibo Wei¹

¹College of Electronic Science and Engineering, National University of Defense Technology, Changsha, China
²Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China
³Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory, Shijiazhuang, China
⁴Department of Mechanical Engineering Technology, New York City College of Technology, City University of New York, Brooklyn, NY 11201, USA
⁵IBM Thomas J. Watson Research Center, Yorktown Heights, NY 10598, USA

Correspondence should be addressed to Li Zhou; zhouli2035@nudt.edu.cn

Received 16 February 2017; Accepted 4 May 2017; Published 30 May 2017

Academic Editor: Jun Cheng

Copyright © 2017 Jiao Zhang 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.

Both the densification of small base stations and the diversity of user activities bring huge challenges for today’s heterogeneous networks, either heavy burdens on base stations or serious energy waste. In order to ensure coverage of the network while reducing the total energy consumption, we adopt a green mobile cyberphysical system (MCPS) to handle this problem. In this paper, we propose a feature extraction method using sliding window to extract the distribution feature of mobile user equipment (UE), and a case study is presented to demonstrate that the method is efficacious in reserving the clustering distribution feature. Furthermore, we present traffic clustering analysis to categorize collected traffic distribution samples into a limited set of traffic patterns, where the patterns and corresponding optimized control strategies are used to similar traffic distributions for the rapid control of base station state. Experimental results show that the sliding window is more superior in enabling higher UE coverage over the grid method. Besides, the optimized control strategy obtained from the traffic pattern is capable of achieving a high coverage that can well serve over 98% of all mobile UE for similar traffic distributions.

1. Introduction

The rising demands for network resources and quality of service are forcing operators of wireless cellular networks to continuously add capacities to their networks. One of the means to do so is densification: deploying heterogeneous networks with a multitude of smaller base stations, such as picobase stations and femtobase stations [1–4]. Such a heterogeneous network will be significantly more complex than today’s system and hence will require more effective state control strategies to achieve energy efficient coverage. The control strategy decides the active or sleep state of each base station in the network. If all base stations were active when the traffic demand is low, the unnecessary energy consumption can be significant [5, 6]. On the other hand, excessively frequent switching on/off the base stations is not practical, considering the control precision, protocol limitation, and lifespan of the stations. Therefore, the control strategy of a heterogeneous network must be optimized to reduce energy consumption, while maintaining its QoS including coverage, response time, and spectral efficiency.

To determine an optimized state control strategy for a network, it is necessary to capture its traffic distribution, that is, the geographical distribution of mobile UE in the network [7]. Uniform Poisson modeling method was presented based on IMT-advanced evaluation guidelines in [8]. Although very popular, this method is less effective when representing the heterogeneous user activities and geographical characteristics of the network using only Poisson point processes. References [9, 10] modeled traffic distribution using a two-dimensional sub-Poisson point process in order to capture the heterogeneity; that is, a perfect lattice and a random perturbation were applied to generate sub-Poisson UE distribution. A thorough review of point processes was presented in [11], in which clustering properties of point processes in space are compared. In [12], Mirahsan et al. introduced a heterogeneous traffic modeling method that allows statistical adjustment. This method is continuously scalable from uniform to heterogeneous point process.

Optimization algorithms were developed to determine control strategies while satisfying a set of conflicting requirements such as coverage and energy efficiency. In [13], a nonlinear integer programming method was used to determine optimized control strategy. In [14], Lorincz et al. used an efficient linear integer programming method. In [15], Jung et al. presented a two-step optimization algorithm that identified the minimal set of base stations needed to maintain coverage and analyzed the bandwidth and power allocation of each base station to minimize energy consumption. Minimax algorithm was adopted in the development of a distributed base stations switch-off method in [16], while the optimization problem was solved using time-consuming exhaustive search method. In [17], Al-Kanj et al. proposed a green radio network planning approach which jointly optimized the number of active base stations and the base station on/off switching strategies. It is worth noting that most of the optimization approaches considered only the traffic distribution at a certain time. Monitoring the dynamic traffic distributions and controlling base stations in a real-time manner are not yet achieved. Mobile cyberphysical systems (MCPSs) were presented for this purpose.

A MCPS is a combination of computation and communication systems. It is capable of sensing, processing, and responding to the dynamic changes of traffic distribution of a network [18–21]. MCPS inherits many essential and important characteristics of traditional cyberphysical system (CPS) [22], such as intelligent network, interaction between human and MCPS, and computation with physical process [23]. It is also capable of integrating wireless sensor network (WSN) and cloud environment. For the tasks requiring more resources than what is available locally, MCPS gives customers rapid access to other WSN and clouds [24]. In a MCPS, mobile UE, such as smart phones and tablets, acts like cyber terminals with storages and processing capabilities. Sensors in the system like GPS and Bluetooth collect physical data such as the geographical positions of UE in the system and their receiving power from the surrounding base stations [25, 26]. The data is transmitted to the computational backbone of MCPS, the clouds. The clouds analyze the data to determine optimal control strategies for base stations, resource allocation, and network scheduling.

In [27], we presented a green MCPS. To maximize the energy efficiency of the network, a heuristic method was developed to determine the control strategy according to the dynamic traffic distributions. The two major components of the green MCPS are introduced in this paper: Modeling: we use a sliding window approach to extracting the overlapped features from traffic distributions; Optimization: a traffic clustering algorithm is presented to classify all the samples of traffic distributions into a set of traffic patterns. The patterns and corresponding optimized control strategies will be used to handle new traffic distributions collected in real time.

The remainder of the paper is organized as follows. The framework of the green MCPS is explained in Section 2. The feature extraction and traffic clustering algorithms are introduced in detail in Section 3. A set of experiments are presented to validate the algorithms in Section 4. Section 5 concludes the paper.

2. Green MCPS Framework

The framework of the green MCPS is shown in Figure 1. It consists of two processes, online and off-line.

Figure 1: A green mobile cyberphysical system framework.

The off-line process is a learning process. Its input is a set of traffic distributions sampled at different times when the network is deployed. The outputs of this process are a set of traffic patterns and the corresponding optimized control strategies of the base stations. When the off-line process starts, a set of traffic distribution samples have been collected at various times and saved in the database of the system. Each sample contains the geographical locations of all mobile UE in the 2-dimensional target region at certain time. It must be noted that we must collect enough samples in order to capture the characteristics of the network’s traffic distribution during its daily operation. These samples are then transferred to the feature extraction module, in which if the target region is partitioned into equal-sized areas, a feature vector with a dimension equal to the number of areas is used to represent the UE densities in each area. The detailed feature extraction algorithm will be explained in the next section. After that, the feature vectors are transferred to a clustering module in order to group all traffic distribution samples into a certain number of traffic patterns using the clustering algorithm, as introduced in the following section. Each pattern is a traffic distribution that represents a group of samples with similar characteristics of geographical distribution. Each pattern has an optimal control strategy for the target region. The optimized strategy is decided using a heuristic method as introduced in previous papers [27]. The traffic patterns and the corresponding control strategies are stored to the database.

The online process starts when a new traffic distribution is identified. In this case, the system starts the feature extraction module to extract and represent its distribution feature into a feature vector. Then the vector is imported into a classifier, which acts as a decision-making tool that is capable of matching the sample with the traffic patterns according to the Euclidean distance between feature vectors [28]. If the Euclidean distance of the new feature vector is with a defined range from that of a pattern, the sample is matched to the pattern and the corresponding control strategy is used to control the base stations of the new sample. Therefore, the control strategies of the new distribution can be rapidly obtained. If there is no match, the new sample will be stored into the database waiting for the next matching.

3. Feature Extraction and Traffic Clustering Algorithms

3.1. Feature Extraction Using Sliding Window

If we partition a 2-dimensional target region into equal-sized grids, that is, unit grid, and count the amount of mobile UE within each grid, we can represent the characteristics of the traffic distribution into a feature vector. However, elements of the feature vector are always independent of each other. Since the detail of the feature vector is limited by the grid size, the unit grid method is not effective in capturing the clustering characteristics of the traffic distribution.

The high density distribution of mobile UE forms cluster, a common and critical distribution form to affect the coverage and QoS of heterogeneous networks [7]. In order to effectively capture the clustering characteristics and detect changes in traffic distribution, we propose a new method to represent traffic distribution. We use a sliding window with a sliding step smaller than the length of the window instead of using even grids. Using a traffic distribution as shown in Figure 2 as an example, the feature matrix captured using red grids is . A square sliding window is defined as being as large as grids, shown as the blue cell in Figure 2, and a sliding step size is the same as the grid size. The sliding window slides from left to right until it reaches the right end of the region. Then the window slides down one step and scans from left to right. The process stops when the whole target region is scanned, and the resulting matrix is . It can be seen that a cluster is formed in the target region. This clustering feature is represented by element 7 of matrix , while four elements (7, 7, 8, and 9) of matrix b reserve the paradigm of this cluster similarly. If there are clusters of UE distributions, the sliding window method creates the feature matrix with more elements to depict the clustering distribution, which has the advantage of reserving the integrity of clustering distribution in case of the loss of a cluster in the process of feature extraction. In the sliding window method, both the window size and sliding step size are important design parameters.

Figure 2: Feature extraction example.

Given a sample of traffic distribution in a region with area , it contains mobile UE and the coordinate of mobile UE is , . In order to extract the clustering characteristics, we partition the target region into equal-sized grids, and the size of grid is . The size of the sliding window and sliding step size are given as the integer multiple of for the convenience of data processing, denoted as (, is a set of positive integers) and (, ). Besides, the sliding step size should be smaller than the window size; both of them should be smaller than the target region. That is, . If a window needs to slide times to cover the length of the region , we have

In general, is a small integer. Given , and are

where a small integer is added to ensure that , and it is usually assigned manually. In fact, the optimal value of and can only be determined after numerical experiments. With the above variables, the feature extraction method is presented as shown in Algorithm 1.

Input: the number of mobile UEs , the coordinates of mobile UEs and the area of the region.

Output: Traffic distribution feature matrix , feature matrix

     (1) Determine the value of and .

     (2) for   do

     (3)     calculate the row and the columns of mobile UE in grids by

            and .

     (4)     count the number of mobile UEs in the grid , and .

     (5) end for

     (6) for  do

     (7)         for   do

     (8)             count the number of mobile UEs in the window , and .

     (9)         end for

     (10) end for

Algorithm 1: The feature extraction using sliding window.

In Algorithm 1, is defined to keep both and from becoming 0, and its value is infinitesimal. Matrix is the traffic distribution feature matrix obtained using grids. Matrix is obtained using the sliding window method.

Subsequently, we convert matrix to feature vector with elements by array rearrangement; this function is implemented using the function of MATLAB. In the off-line process, after conducting feature extraction for traffic distribution samples, we obtained feature vector set , which will be transferred to the following clustering module. In order to process data conveniently, we normalize these vectors.

3.2. Traffic Clustering

Traffic clustering module categorizes all traffic distributions samples into a limited set of traffic patterns. Clustering is an unsupervised classification approach, which is capable of analyzing the internal characteristic and mutual relationship of objects without label [29, 30]. The -means clustering is a well-known algorithm for classification based on the distance measurement and the squared error [31, 32]. Nevertheless, it has significant shortcomings, including predetermined number of clusters, unguaranteed global optimum, and being sensitive to noises. -medoids algorithm [33] uses the medians of a cluster as its centroid to reduce the influence of noises. Kernel -means algorithm is presented in [34], which transforms original features set of objects into a higher-dimensional space to make objects more separable. Spectral clustering method performs dimensionality reduction using Laplacian eigenmap [35]. Other advanced clustering algorithms include iterative self-organizing data analysis technique (ISODATA), Gaussian mixture (GM), and density based spatial clustering of applications with noise (DBSCAN). Considering the computation complexity and multidimensional features of the traffic distributions, we decide to combine the -means and the spectral clustering algorithm presented in [36] to analyze the internal similarity of traffic distribution vectors. The process of traffic clustering primarily comprises two parts, the determination of optimal number of traffic patterns and the classification of all traffic distribution vectors, as presented in Algorithm 2.

Input: Feature vectors of all traffic distribution samples .

Output: Traffic patterns .

    (1) Normalize Feature vectors to .

     (2) Determine the number of traffic patterns by the average silhouette method.

     (3) Construct an affinity matrix with Gaussian kernel function, in which

             holds for and .

     (4) Define the diagonal degree matrix . Normalize the affinity to , and .

     (5) Compute the first eigenvectors of . Construct a matrix .

     (6) Construct a matrix from by normalizing the rows of to norm 1, and .

     (7) Treating each row of as a point, cluster them into traffic patterns by -means.

     (8) Assign the original feature vector of traffic distribution sample to traffic pattern according

            to the assigned label of the row of the matrix .

     (9) Compute the features of traffic patterns, and .

Algorithm 2: The traffic clustering algorithm.

In Algorithm 2, the optimal number of traffic patterns is decided using the average silhouette method. The silhouette value measures how well a sample lies within its cluster comparing to other clusters [37]. In order to obtain the silhouette value of each sample, we classify all samples into clusters at first, where is a variable quantity. For each sample , let be the average dissimilarity of to all other samples within the same cluster, and the average dissimilarity of sample can be defined as the average of the distance from to all other samples within the same cluster. denotes the lowest average dissimilarity of to any other sample in other clusters. Then, the silhouette value can be obtained by combining and .

From the above definition, it can be seen that for each sample .

is close to 1 for , which indicates that sample is well clustered because represents how dissimilar is to its own cluster. When is around zero for , sample is on the border of two clusters. The worst situation takes place when is close to −1 when , meaning that the sample is misclassified. Furthermore, the average silhouette is the average of silhouette of all samples for a traffic pattern; it shows how tightly all samples are grouped in the cluster and, hence, evaluates clustering validity. If there are too many or too less clusters, some narrow silhouette may occur; thus it is used to determine the optimal number of clusters. It is believed that an optimal number of traffic patterns is the one at which the average silhouette is maximized over a range of values for [38].

In order to obtain the optimal traffic patterns, the spectral clustering method [36] is applied. First, an affinity matrix is formed, where is the Euclidean distance between and , and  is the scaling parameter that determines the speed of the affinity matrix falling off. Then, the selection of eigenvectors of leads to the feature dimensionality reduction. Finally, -means algorithm is adopted to assort all traffic distribution samples into various traffic patterns.

After traffic clustering, the optimal control strategy for each pattern is decided using the method presented in our previous work [27]. Briefly, considering the constraint conditions of the UE association, the received signal to interference and noise ratio (SINR) of UE, and capacity of base station, the optimal control strategy maximizes the energy efficiency of a traffic pattern. Assume that UE is scattered in the region under traffic pattern and base stations are deployed as well. The UE associate is denoted as , in which represents that UE is () or is not () associated with base station under traffic pattern . The SINR of UE from base station is denoted as . represents the maximum amount of servable UE for base stations . For each traffic pattern, the control strategy is represented using vector , where denotes that the state of base station is active () or sleep (). Hence, the optimal control model can be formulated as follows:

where is the transmission rate calculated using . denotes the power amplifier inefficiency factor. represents the total transmit power. is the circuit power consumption of active base station and is the circuit power consumption when it is in sleep mode. A heuristic algorithm is adopted to solve the problem, and the states of all base stations, the number of active base stations, and the association of UE with base stations can be obtained eventually [27].

4. Simulation Results and Discussions

The presented method is demonstrated using a 1600 m × 1600 m target region. In order to verify the efficacy of the presented method in different traffic distributions, we create 1000 different traffic distributions including three distribution models:

(i)A function in MATLAB is used to generate a complete random distribution (Poisson).(ii)A perfect lattice and a random perturbation [10] are used to generate a uniform distribution (sub-Possion).(iii)Thomas process [11] is used to generate a clustered distribution (sub-Possion).

Each of these traffic distribution samples consists of a random amount of UE between 250 and 650. In order to differentiate the samples, the difference of the UE numbers between any two samples is at least 50. 113 base stations are in cochannel deployment in a two-tier heterogeneous cellular network, including one macro base station and 112 small base stations. In addition, other major network parameters, such as the bandwidth and transmission power of base stations, bit error rate, and outage probability, are set referring to [27].

According to the optimal control strategy, the amount of mobile UE served by the active base stations in each sample is counted. Hence, we select the rate of UE coverage as the performance metric of green MCPS.

where is the amount of mobile UE served by the active base stations and is the total mobile UE in the target region. According to [27], the UE coverage for a traffic pattern should be more than 98% in order to satisfy the required QoS. In this paper, we believe 98% or higher coverage is a “good coverage."

We start by estimating an optimal number of traffic patterns. The sliding window size is predefined as ( is the size of a grid) and the sliding step size is . The average silhouettes of 1000 traffic distribution samples for different number of traffic patterns and different partition grids are illustrated in Figure 3.

Figure 3: Average silhouettes value for different number of traffic patterns.

It is observed that the average silhouettes value achieves their peak over a range of possible value for from 1 to 30. Thus, the optimal number of traffic patterns can be determined as the corresponding value of at the peak. That is, the optimal number of traffic patterns is 4 when the partitioned grids are , 5 when the grids are , and 6 when the grids are and . It is noted that the number of traffic patterns at the optimal average silhouettes has slightly been raised but not sharply changed with the increasing of the number of traffic patterns. Hence, an appropriate number of traffic patterns clustered can be determined to be 6. The performance analysis is carried out for different number of traffic patterns next.

4.1. Feature Extraction Using Sliding Window with Different Sliding Step Sizes

In this experiment, we count the rate of traffic distribution samples with UE coverage over 98% based on the feature vectors extracted by sliding window with different step sizes and a unit grid. The number of grids partitioned is set to be , and the size of the sliding window is four times the size of a grid (). Thus, the value of can be 1, 2, or 3.

We can observe from Figure 4 that the smaller the sliding step size is, the more the traffic distribution samples achieve coverage over 98%. The percentage of samples with good coverage (at least 98% UE coverage) at step size is always higher than others. That is, sliding window with smaller sliding step size, we can not only extract more features but also reserve the clustering feature more faithfully. This leads to a good coverage. In addition, it shows that, by using the proposed sliding window method, we can always acquire better coverage than that of using the unit grid, shown with the dotted line on the figure.

Figure 4: Feature extraction using sliding window with different step sizes and a unit grid.

4.2. UE Coverage under Different Sliding Window Sizes and Traffic Patterns

In order to discuss the effects of sliding window size and the number of traffic patterns on the coverage, we use grids to partition the region, and grid edge is . The sliding step size is always half of the window size . Three different intervals of UE coverage rate are counted in Figure 5, namely, , , and , respectively.

Figure 5: Coverage for different number of patterns.

It can be seen that the smaller the size of the sliding window is, the higher the percentage of samples achieves good coverage. This is because that more heterogeneous distribution features are preserved by using a smaller sliding window, which contributes to better coverage. However, smaller window size means larger feature vector for a sample, and this unavoidably reduces the operational speed. It is necessary to compromise between the coverage and operational speed when we decide the window size in practice. We can choose different window size according to different requirements for the rates of coverage. At the same time, we can observe that, by increasing the number of traffic patterns, the number of samples with good coverage rises slightly but is not significant. Therefore, we conclude that the number of traffic patterns is less important than other factors such as sliding step size and window size. In practice, we can decide the pattern number by the average silhouette method.

4.3. Number of Active Base Stations for Different Traffic Clusters

After adopting the optimal control strategy of the traffic pattern to its samples, we can observe the number of active base stations in the traffic distribution samples. Here, in the process of feature extraction, grids are used, the size of the sliding window is , and the sliding step size is .

As shown in Figure 6, the difference between the maximal and minimal number of active base stations for all traffic distribution samples within the same traffic pattern is shown. That is, most of the number of active base stations for a traffic pattern is slightly more than that of the maximal number of active base stations for samples in this pattern. This means that applying the control strategy of a traffic pattern to the samples belonging to this pattern will ensure good coverage, and this can achieve significant energy saving as well.

Figure 6: Number of active base stations for different traffic clusters.

4.4. SINR Distribution under a Traffic Pattern

Finally, a SINR distribution example under a traffic pattern is depicted in Figure 7, in order to observe the coverage of active base stations.

(a) Initial state

(b) Final state

Figure 7: SINR distributions.

In this traffic pattern, UE is represented as dots, and base stations are uniformly distributed within the target region. As shown in Figure 7, the triangles represent small base stations, and the squares represent macro base station. The state of base stations is represented by colors, where yellow means sleep and green means active. The values of SINR are in the range of −10 dB to 50 dB, which are represented by different gradient colors. Figure 7(a) shows the initial SINR distribution of UE when all base stations are active. We can observe that the coverage of active base stations is limited due to the ubiquitous interference between base stations. After adopting the optimal control strategy, only ten base stations are activated, and the coverage with higher SINR of UE around the active base stations increases in Figure 7(b). This indicates that the coverage of active base station is enlarged under the condition of over 98% UE coverage.

5. Conclusion

In this paper, we present a feature extraction method using sliding window for traffic distributions in a green mobile cyberphysical system. The method has the advantages of reserving more clustering distribution features over using the grid method. In order to implement rapid base station state control and extend the lifespan of a heterogeneous network, we apply clustering analysis for all traffic distributions to obtain a limited set of traffic patterns. Numerical results demonstrate that the proposed method helps obtain better UE coverage comparing with using the grid method. It is worth noting that both smaller sliding step size and smaller sliding window size can lead to good UE coverage but slow the operational speed of the network.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This research was supported in part by the National Natural Science Foundation of China (Grant no. 61601482) and Guangdong Technology Project (2016B010125003 and 2016B010108010) and sponsored by the Foundation of Science and Technology on Information Transmission and Dissemination in Comm. Networks Lab, National Key Laboratory of Anti-Jamming Communication Technology, and State Joint Engineering Laboratory for Robotics and Intelligent Manufacturing funded by National Development and Reform Commission (no. 2015581).

References

J. F. Monserrat, I. Alepuz, J. Cabrejas et al., “Towards user-centric operation in 5G networks,” Eurasip Journal on Wireless Communications and Networking, vol. 2016, no. 1, article no. 6, pp. 1–7, 2016.

J. F. Monserrat, G. Mange, V. Braun, H. Tullberg, G. Zimmermann, and Ö. Bulakci, “METIS research advances towards the 5G mobile and wireless system definition,” Eurasip Journal on Wireless Communications and Networking, vol. 2015, no. 1, pp. 1–16, 2015.

L. Zhou, Z. Sheng, L. Wei et al., “Green cell planning and deployment for small cell networks in smart cities,” Ad Hoc Networks, vol. 43, pp. 30–42, 2016.

L. Zhou, C. Zhu, R. Ruby et al., “QoS-aware energy-efficient resource allocation in OFDM-based heterogenous cellular networks,” International Journal of Communication Systems, vol. 30, no. 2, p. e2931, 2017.

M. Hoshino, Y. Yuda, T. Takata, and A. Nishio, “Performance evaluation of jt-comp under non full buffer traffic condition on heterogeneous network with dense small cells,” vol. 112, pp. 29–34, 2012.

L. Zhou, X. Hu, E. C.-H. Ngai et al., “A dynamic graph-based scheduling and interference coordination approach in heterogeneous cellular networks,” IEEE Transactions on Vehicular Technology, vol. 65, no. 5, pp. 3735–3748, 2016.

M. Mirahsan, Z. Wang, R. Schoenen, H. Yanikomeroglu, and M. St-Hilaire, “Unified and non-parameterized statistical modeling of temporal and spatial traffic heterogeneity in wireless cellular networks,” in Proceedings of 2014 IEEE International Conference on Communications Workshops, ICC 2014, pp. 55–60, aus, June 2014.

ITU-R, “Guidelines for evaluation of radio interface technologies for imt-advanced,” M.2135-1, 2009.

J. Rataj, I. Saxl, and K. Pelikán, “Convergence of randomly oscillating point patterns to the Poisson point process,” Applications of Mathematics, vol. 38, no. 3, pp. 221–235, 1993.

V. Lucarini, “From symmetry breaking to Poisson point process in 2D Voronoi tessellations: the generic nature of hexagons,” Journal of Statistical Physics, vol. 130, no. 6, pp. 1047–1062, 2008.

B. Błaszczyszyn and D. Yogeshwaran, “Clustering comparison of point processes, with applications to random geometric models,” Lecture Notes in Mathematics, vol. 2120, pp. 31–71, 2015.

M. Mirahsan, R. Schoenen, and H. Yanikomeroglu, “HetHetNets: Heterogeneous Traffic Distribution in Heterogeneous Wireless Cellular Networks,” IEEE Journal on Selected Areas in Communications, vol. 33, no. 10, pp. 2252–2265, 2015.

K. Son, S. Nagaraj, M. Sarkar, and S. Dey, “QoS-aware dynamic cell reconfiguration for energy conservation in cellular networks,” in Proceedings of 2013 IEEE Wireless Communications and Networking Conference, WCNC 2013, pp. 2022–2027, chn, April 2013.

J. Lorincz, A. Capone, and D. Begušić, “Optimized network management for energy savings of wireless access networks,” Computer Networks, vol. 55, no. 3, pp. 514–540, 2011.

H.-S. Jung, H.-T. Roh, and J.-W. Lee, “Energy and traffic aware dynamic topology management for wireless cellular networks,” in Proceedings of 2012 IEEE International Conference on Communication Systems, ICCS 2012, pp. 205–209, sgp, November 2012.

X. Su, E. Sun, M. Li, F. R. Yu, and Y. Zhang, “An Energy-Efficient User Location-Aware Switch-Off Method for LTE-A Cellular Networks,” Wireless Personal Communications, vol. 84, no. 3, pp. 1817–1833, 2015.

L. Al-Kanj, W. El-Beaino, A. M. El-Hajj, and Z. Dawy, “Optimized joint cell planning and BS on/off switching for LTE networks,” Wireless Communications and Mobile Computing, vol. 16, no. 12, pp. 1537–1555, 2015.

X. Hu, T. H. S. Chu, H. C. B. Chan, and V. C. M. Leung, “Vita: a crowdsensing-oriented mobile cyber-physical system,” IEEE Transactions on Emerging Topics in Computing, vol. 1, no. 1, pp. 148–165, 2013.

X. Hu, T. H. S. Chu, V. C. M. Leung, and C. H. Ngai, “A survey on mobile social networks: Applications, platforms, system architectures, and future research directions,” IEEE Communications Surveys & Tutorials, vol. 17, no. 3, pp. 1557–1581, 2014.

C.-L. Fok, M. Hanna, S. Gee et al., “A platform for evaluating autonomous intersection management policies,” in Proceedings of IEEE/ACM Third International Conference on Cyber-Physical Systems, pp. 87–96, Beijing, China, April 2012.

S. A. Haque, S. M. Aziz, and M. Rahman, “Review of cyber-physical system in healthcare,” International Journal of Distributed Sensor Networks, vol. 2014, Article ID 217415, 2014.

J. Sztipanovits, “Composition of cyber-physical systems,” in Proceedings of 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, ECBS 2007, pp. 3-4, usa, March 2007.

E. A. Lee, “Cyber physical systems: design challenges,” in Proceedings of the 11th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing (ISORC '08), pp. 363–369, May 2008.

B. Perumal, P. Rajasekaran, and M. H. M. Ramalingam, “Wsn integrated cloud for automated telemedicine (atm) based e-healthcare applications,” in Proceedings of International Proceedings of Chemical Biological & Environmenta, 2012.

X. Hu, J. Zhao, B.-C. Seet, V. C. M. Leung, T. H. S. Chu, and H. Chan, “S-aframe: agent-based multilayer framework with context-aware semantic service for vehicular social networks,” IEEE Transactions on Emerging Topics in Computing, vol. 3, no. 1, pp. 44–63, 2015.

X. Hu, X. Li, E. C.-H. Ngai, V. C. M. Leung, and P. Kruchten, “Multidimensional context-aware social network architecture for mobile crowdsensing,” IEEE Communications Magazine, vol. 52, no. 6, pp. 78–87, 2014.

L. Zhou, J. Zhang, B. Seet et al., “Software Defined Small Cell Networking under Dynamic Traffic Patterns,” in Proceedings of IEEE Cyber Science and Technology Congress, Auckland, New Zealand, August 2016.

A. K. Jain, M. N. Murty, and P. J. Flynn, “Data clustering: a review,” ACM Computing Surveys, vol. 31, no. 3, pp. 264–323, 1999.

B. S. Everitt, G. Dunn, B. S. Everitt, and G. Dunn, “Cluster analysis,” 1em plus 0.5em minus 0.4em Wiley, 2011.

A. K. Jain and R. C. Dubes, “Algorithms for clustering data,” Technometrics, vol. 32, no. 2, pp. 227–229, 1988.

E. W. Forgy, “Cluster analysis of multivariate data efficiency vs. interpretability of classification,” Biometrics, vol. 21, no. 3, pp. 41–52, 1965.

J. MacQueen, “Some methods for classification and analysis of multivariate observations,” in Proceedings of the Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297, University of California Press, Berkeley, California, 1967.

V. Estivill-Castro and J. Yang, “A fast and robust general purpose clustering algorithm,” in Proceedings of the Pacific Rim International Conference on Artificial Intelligence, pp. 208–218, Springer-Verlag, London, UK, 1999.

B. Schölkopf, A. Smola, and K.-R. Müller, “Nonlinear component analysis as a kernel eigenvalue problem,” Neural Computation, vol. 10, no. 5, pp. 1299–1319, 1998.

U. von Luxburg, “A tutorial on spectral clustering,” Statistics and Computing, vol. 17, no. 4, pp. 395–416, 2007.

A. Y. Ng, M. I. Jordan, and Y. Weiss, “On spectral clustering Analysis and an algorithm,” in Proceedings of the Advances in Neural Information Processing Systems, vol. 14, pp. 849–856, San Francisco, CA, USA, 2002.

P. J. Rousseeuw, “Silhouettes: a graphical aid to the interpretation and validation of cluster analysis,” Journal of Computational and Applied Mathematics, vol. 20, no. 20, pp. 53–65, 1987.

L. Kaufman and P. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Analysis, John Wiley & Sons, New York, NY, USA, 1990.