• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2533-2540
• /
• 2013

In multihop cellular network environments, the mobility of nodes is a major obstacle to find a reliable routing path between a mobile node (MN) and the access node (AN). Therefore, in this paper, we propose a fast and reliable neighbor discovery protocol that enables the fast and reliable neighbor discovery by considering the node mobility in the multihop cellular network. The proposed neighbor discovery protocol inhibits the transmission of unnecessary control messages to quickly find a suitable neighbor node (NN) and performs a priority-based access control to transmit control messages without collision in the order of NN desirable to be selected. Simulation results show that the proposed neighbor discovery protocol can discover the NNs faster than the conventional scheme and select a more reliable relay node although the number of neighbor nodes increases and the node mobility increases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.393-402
• /
• 2017

Just like terrestrial cellular networks, underwater cellular communication networks, which can manage the overall network resource by adaptively allocating backhaul resource for each base station according to its ingress traffic, are necessary. In this paper, a new resource allocation protocol is proposed for the underwater cellular communication network, allocating backhaul resource of a base station proportional to its ingress traffic to the base station. This protocol is classified into two types dependent upon allocation period: the resource allocation protocol with adaptive period and that with fixed period. In order to determine a proper resource allocation protocol, the performance of the two protocols, in terms of reception rate, message overhead, and latency is compared and investigated via simulation. As a result, the resource protocol with adaptive period outperforms that with fixed period; the resource allocation protocol with fixed period results in a maximum of $10^2$ order longer queueing delay as well as $10^2$ order greater message overhead than that with adaptive period.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5209-5228
• /
• 2016

Device-to-device (D2D) communication underlaying cellular networks can bring significate benefits for improving the performance of mobile services. However, it hinges on elaborate resource sharing scheme to coordinate interference between cellular users and D2D pairs. We formulate a joint mode selection, link allocation and power control optimization problem for D2D communication sharing uplink resources in a multi-user cellular network and consider the efficiency and the fairness simultaneously. Due to the non-convex difficulty, we propose a three-step scheme: firstly, we conduct mode selection for D2D pairs based on a minimum distance metric after an admission control and obtain some cellular candidates for them. And then, a cellular candidate will be paired to each D2D pair based on fairness. Finally, we use Lagrangian Algorithm to formulate a joint power control strategy for D2D pairs and their reused cellular users and a closed-form of solution is derived. Simulation results demonstrate that our proposed algorithms converge in a short time. Moreover, both the sum rate of D2D pairs and the energy efficiency of cellular users are improved.

• Information and Communications Magazine
• /
• v.13 no.8
• /
• pp.143-151
• /
• 1996

• Proceedings of the Korea Water Resources Association Conference
• /
• 2005.09b
• /
• pp.1458-1459
• /
• 2005

• Molecules and Cells
• /
• v.45 no.2
• /
• pp.51-52
• /
• 2022

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.261-264
• /
• 2004

We propose a location management with adaptive binding idle lifetime scheme for IP-based wireless network. In our proposed scheme, the binding idle lifetime value is adaptively varied according to user characteristics. The main idea is that the mobile node (MN) does location update (LU) even in idle state. Furthermore a sequential paging scheme is used to reduce the paging cost. The proposed scheme can be used in both cellular network and IP-based network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.5
• /
• pp.912-919
• /
• 2005

The Growth in wireless Internet has made Networking possible at anytime and anywhere. So mobile devices like cellular phone and PDA are now used in various fields. In particular, the mobility of mobile devices has a great advantage in remote control. This paper designed and implemented a Mobile VNC system that transmitted the screen image of a remote computer, control the remote computer GU and monitor all by cellular phone. The proposed system consists of a Mobile Viewer un on the cellular phone, VNC Server m on a number of remote computers and a VNC Monitor. For communication between the VNC Server and the Mobile Viewer the MRFB protocol is used. The screen image transmitted to the Mobile Viewer is encoded in the PNG format supported by SK-VM, the Java execution environment of the Cellular phone. According to implementation results, the image is about $2KB\~8KB$. According to the 65 times transmission test, the average frame per second is 4.93fps in the emulator and a real cellular phone takes 0.8fps. Therefore, the proposed system is more efficient than existing systems.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.3
• /
• pp.119-135
• /
• 2005

Design of location erea(LA) in a cellular network is to partition the network into clusters of cells so as to minimize the cost of location updating and paging. Most research works dealing with the LA design problem assume that the call. arrival rate and mobile flow rate are fixed parameters which can be estimated independently. In this aspect, most Problems addressed so far are deterministic LA design problems(DLADP), known to be NP hard. The mobile flow and call arrival rate are, however, varying with time and should be treated simultaneously because the call arrival rate in a cell during a day is influenced by the change of a population size of the cell. This Paper Presents a new model on IA design problems considering the time-dependent call arrival and mobile flow rate. The new model becomes a stochastic LA design problem(SLADP) because It takes into account the possibility of paging waiting and blocking caused by the changing call arrival rate and finite paging capacity. Un order to obtain the optimal solution of the LA design problem, the SIADP is transformed Into the DLADP by introducing the utilization factor of paging channels and the problem is solved iteratively until the required paging quality is satisfied. Finally, an illustrative example reflecting the metropolitan area, Seoul, is provided and the optimal partitions of a cell structure are presented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5301-5323
• /
• 2017

Small cell deployment offers a low-cost solution for the boosted traffic demand in heterogeneous cellular networks (HCNs). Besides improved spatial spectrum efficiency and energy efficiency, future HCNs are also featured with the trend of network architecture convergence and feasibility for flexible mobile applications. To achieve these goals, dual connectivity (DC) is playing a more and more important role to support control/user-plane splitting, which enables maintaining fixed control channel connections for reliability. In this paper, we develop a tractable framework for the downlink SINR analysis of DC assisted HCN. Based on stochastic geometry model, the data-control joint coverage probabilities under multi-frequency and single-frequency tiering are derived, which involve quick integrals and admit simple closed-forms in special cases. Monte Carlo simulations confirm the accuracy of the expressions. It is observed that the increase in mobility robustness of DC is at the price of control channel SINR degradation. This degradation severely worsens the joint coverage performance under single-frequency tiering, proving multi-frequency tiering a more feasible networking scheme to utilize the advantage of DC effectively. Moreover, the joint coverage probability can be maximized by adjusting the density ratio of small cell and macro cell eNBs under multi-frequency tiering, though changing cell association bias has little impact on the level of the maximal coverage performance.