• Journal of Communications and Networks
• /
• 제16권2호
• /
• pp.202-208
• /
• 2014

Wireless network information services allow end systems to discover heterogeneous networks and spectrum available for secondary use at or near their current location, helping them to cope with increasing traffic and finite spectrum resources. We propose a unified architecture that allows end systems to find nearby base stations that are using either licensed, shared or unlicensed spectrum across multiple network operators. Our study evaluates the performance and scalability of spatial databases storing base station coverage area geometries. The measurement results indicate that the current spatial databases perform well even when the number of coverage areas is very large. A single logical spatial database would likely be able to satisfy the query load for a large national cellular network. We also observe that coarse geographic divisions can significantly improve query performance.

• Journal of Computing Science and Engineering
• /
• 제9권4호
• /
• pp.163-176
• /
• 2015

Self-organization of distributed wireless sensor nodes is a critical issue in wireless sensor networks (WSNs), since each sensor node has limited energy, bandwidth, and scalability. These issues prevent sensor nodes from actively collaborating with the other types of sensor nodes deployed in a typical heterogeneous and somewhat hostile environment. The automated self-organization of a WSN becomes more challenging as the number of sensor nodes increases in the network. In this paper, we propose a dynamic self-organized architecture that combines tree topology with a drawn-grid algorithm to automate the self-organization process for WSNs. In order to make our proposed architecture scalable, we assume that all participating active sensor nodes are unaware of their primary locations. In particular, this paper presents two algorithms called active-tree and drawn-grid. The proposed active-tree algorithm uses a tree topology to assign node IDs and define different roles to each participating sensor node. On the other hand, the drawn-grid algorithm divides the sensor nodes into cells with respect to the radio coverage area and the specific roles assigned by the active-tree algorithm. Thus, both proposed algorithms collaborate with each other to automate the self-organizing process for WSNs. The numerical and simulation results demonstrate that the proposed dynamic architecture performs much better than a static architecture in terms of the self-organization of wireless sensor nodes and energy consumption.

• Journal of Communications and Networks
• /
• 제18권5호
• /
• pp.784-795
• /
• 2016

In this paper, we investigate the resource allocation problem in time-varying heterogeneous wireless networks (HetNet) with multi-homing user equipments (UE). The stochastic optimization model is employed to maximize the network utility, which is defined as the difference between the HetNet's throughput and the total energy consumption cost. In harmony with the hierarchical architecture of HetNet, the problem of stochastic optimization of resource allocation is decomposed into two subproblems by the Lyapunov optimization theory, associated with the flow control in transport layer and the power allocation in physical (PHY) layer, respectively. For avoiding the signaling overhead, outdated dynamic information, and scalability issues, the distributed resource allocation method is developed for solving the two subproblems based on the primal-dual decomposition theory. After that, the adaptive resource allocation algorithm is developed to accommodate the timevarying wireless network only according to the current network state information, i.e. the queue state information (QSI) at radio access networks (RAN) and the channel state information (CSI) of RANs-UE links. The tradeoff between network utility and delay is derived, where the increase of delay is approximately linear in V and the increase of network utility is at the speed of 1/V with a control parameter V. Extensive simulations are presented to show the effectiveness of our proposed scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1336-1356
• /
• 2017

The spectrum scarcity crisis has resulted in a shortage of resources for many emerging wireless services, and research on dynamic spectrum management has been used to solve this problem. Game theory can allocate resources to users in an economic way through market competition. In this paper, we propose a bidding game-based spectrum allocation mechanism in cognitive radio network. In our framework, primary networks provide heterogeneous wireless service and different numbers of channels, while secondary users have diverse bandwidth demands for transmission. Considering the features of traffic and QoS demands, we design a weighted interference graph-based grouping algorithm to divide users into several groups and construct the non-interference user-set in the first step. In the second step, we propose the dynamic bidding game-based spectrum allocation strategy; we analyze both buyer's and seller's revenue and determine the best allocation strategy. We also prove that our mechanism can achieve balanced pricing schema in competition. Theoretical and simulation results show that our strategy provides a feasible solution to improve spectrum utilization, can maximize overall utility and guarantee users' individual rationality.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권6호
• /
• pp.1979-1995
• /
• 2015

Network convergence is regarded as the development tendency of the future wireless networks, for which self-organization paradigms provide a promising solution to alleviate the upgrading capital expenditures (CAPEX) and operating expenditures (OPEX). Self-optimization, as a critical functionality of self-organization, employs a decentralized paradigm to dynamically adapt the varying environmental circumstances while without relying on centralized control or human intervention. In this paper, we present comprehensive surveys of heterogeneous networks (HetNets) and investigate the enhanced self-optimization models. Self-optimization approaches such as dynamic mobile access network selection, spectrum resource allocation and power control for HetNets, etc., are surveyed and compared, with possible methodologies to achieve self-optimization summarized. We hope this survey paper can provide the insight and the roadmap for future research efforts in the self-optimization of convergence networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.1912-1931
• /
• 2018

In future wireless network, user experience and energy efficiency will play more and more important roles in the communication systems compared to their roles at present. Quality of experience (QoE) and Energy Efficiency (EE) become the widely used metrics. In this paper, we study a combinatorial problem of QoE and EE and investigate a fair power allocation in heterogeneous networks. We first design a new metric, QoE-aware EE (QEE) to reflect the relationship of QoE and energy. Then, the concept of Utopia QEE is introduced, which is defined as the achievable maximum QEE in ideal conditions, for each user. Finally, we transform the power allocation process to an optimization of ratio of QEE and Utopia QEE and use invasive weed optimization (IWO) algorithm to solve the optimization problem. Numerical simulation results indicate that the proposed algorithm can get converged and efficiently improve the system energy efficiency and the QoE for each user.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.2029-2043
• /
• 2018

In this paper, we propose a novel inter-cell handover approach from a new perspective in dense Heterogeneous and Small Cell Networks (HetSNets). We first devise a cell selection mechanism to choose a proper candidate small cell for the UEs that tend to implement inter-small cell handover (ICH). By exploiting the property of a typical non-concentric circle, i.e., circle of Apollonius, we then propose a novel analytical method for modeling inter-cell handover regions and present mathematical derivation to prove that the inter-small cell handover issues fit the property of the circle of Apollonius. We design an inter-cell handover algorithm (ICHA) by means of our proposed handover model to dynamically configure hysteresis margin and properly implement handover decision in terms of UE's mobility. Simulation results demonstrate that the proposed ICHA yields lower call drop rate and radio link failure rate than the conventional methods and hence achieve high Handover Performance Indicator (HPI).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2701-2722
• /
• 2017

Key generation is essential for protecting wireless networks. Based on wireless channel reciprocity, transceivers can generate shared secret keys by measuring their communicating channels. However, due to non-simultaneous measurements, asymmetric noises and other interferences, channel measurements collected by different transceivers are highly correlated but not identical and thus might have some discrepancies. Further, these discrepancies might lead to mismatches of bit sequences after quantization. The referred mismatches significantly affect the efficiency of key generation. In this paper, an efficient key generation scheme leveraging wireless channel reciprocity is proposed. To reduce the bit mismatch rate and enhance the efficiency of key generation, the involved transceivers separately apply discrete cosine transform (DCT) and inverse discrete cosine transform (IDCT) to pre-process their measurements. Then, the outputs of IDCT are quantified and encoded to establish the bit sequence. With the implementations of information reconciliation and privacy amplification, the shared secret key can be generated. Several experiments in real environments are conducted to evaluate the proposed scheme. During each experiment, the shared key is established from the received signal strength (RSS) of heterogeneous devices. The results of experiments demonstrate that the proposed scheme can efficiently generate shared secret keys between transceivers.

• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.28-37
• /
• 2006

State-dependent call admission control (SDCAC) is proposed to make efficient use of scarce wireless resource in a hierarchical wireless network with heterogeneous traffic. With SDCAC, new calls are accepted according to an acceptance probability taking account of not only cell dwell time but also call holding time and system state (i.e., occupied bandwidth). An analytical method is developed to calculate performance measures of interest, e.g., new call blocking probability, forced termination probability, over. all weighted blocking probability. Numerical results with not only stationary but nonstationary traffic loads are presented to show the robustness of SDCAC. It is shown that SDCAC performs much better than the other considered schemes under nonstationary traffic load.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 2006년도 하계종합학술발표회 논문 초록집
• /
• pp.541-541
• /
• 2006