• Journal of the Korean Data and Information Science Society
• /
• v.20 no.6
• /
• pp.1177-1190
• /
• 2009

In this paper, we propose a fuzzy proxy cache scheme for caching web documents in mobile base stations. In this scheme, a mobile cache model is used to facilitate data caching and data replication. Using the proposed cache scheme, the individual proxy in the base station makes cache decisions based solely on its local knowledge of the global cache state so that the entire wireless proxy cache system can be effectively managed without centralized control. To improve the performance of proxy caching, the proposed cache scheme predicts the direction of movement of mobile hosts, and uses various cache methods for neighboring proxy servers according to the fuzzy-logic-based control rules based on the membership degree of the mobile host. The performance of our cache scheme is evaluated analytically in terms of average response delay and average energy cost, and is compared with that of other mobile cache schemes.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.6
• /
• pp.1191-1197
• /
• 2013

In large-scale distributed sensor networks, it is often recommended to employ mobile sinks, instead of fixed base stations, for data collection to prolong network lifetime and enhance security. Mobile sinks may also be used, e.g., for network repair, identification and isolation of compromised sensor nodes and localized reprogramming, etc. In such circumstances, mobile sinks should be able to securely interact with neighbor sensor nodes while traversing the network. This paper presents a secure and efficient mobile query protocol that can be used for such purposes.

• Journal of Information Technology Services
• /
• v.9 no.2
• /
• pp.163-177
• /
• 2010

In this paper, we consider a channel ordering problem that seeks to maximize the service quality in mobile radio communication systems. If a base station receives a connection request from a mobile user, one of the empty channels belonging to the base station is assigned to the mobile user. In case multiple empty channels are available, we can choose one that incurs least interference with other channels assigned to adjacent base stations. However, note that a pair of channels that are not separated enough generates interference only if both channels are assigned to mobile users. That is, interference between channels may vary depending on the channel assignment sequence for each base station and on the distribution of mobile users. To find a channel assignment sequence that seems to generate minimum interference, we develop an optimization model considering various scenarios of mobile user distribution. Simulation results show that channel assignment sequence determined by the scenario based optimization model significantly reduces the interference provided that scenarios and interference cost are properly generated.

• Journal of Communications and Networks
• /
• v.17 no.6
• /
• pp.549-557
• /
• 2015

Mobile cellular networks are becoming increasingly complex to manage while classical deployment/optimization techniques and current solutions (i.e., cell densification, acquiring more spectrum, etc.) are cost-ineffective and thus seen as stopgaps. This calls for development of novel approaches that leverage recent advances in storage/memory, context-awareness, edge/cloud computing, and falls into framework of big data. However, the big data by itself is yet another complex phenomena to handle and comes with its notorious 4V: Velocity, voracity, volume, and variety. In this work, we address these issues in optimization of 5G wireless networks via the notion of proactive caching at the base stations. In particular, we investigate the gains of proactive caching in terms of backhaul offloadings and request satisfactions, while tackling the large-amount of available data for content popularity estimation. In order to estimate the content popularity, we first collect users' mobile traffic data from a Turkish telecom operator from several base stations in hours of time interval. Then, an analysis is carried out locally on a big data platformand the gains of proactive caching at the base stations are investigated via numerical simulations. It turns out that several gains are possible depending on the level of available information and storage size. For instance, with 10% of content ratings and 15.4Gbyte of storage size (87%of total catalog size), proactive caching achieves 100% of request satisfaction and offloads 98% of the backhaul when considering 16 base stations.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.11
• /
• pp.118-131
• /
• 2012

The existing electronic tagging system traces the location of a sex offender through communicating with GPS satellites and mobile phone base stations in order to prevent repeated crimes. However, the GPS satellite communication method does not work well in the interiors of downtown buildings or on the subways where it is difficult to receive satellite signals. In such cases, the location can be traced through communication with mobile phone base stations. But the distance between mobile phone base stations is several hundred meters, and as a result the margin of error for location tracing can be maximum of 2km in accuracy reduction. Take for example, if a kindergarten is located on the 2nd floor and a coffee shop and the sex offender are located on the 3rd floor in a 5-story building that is downtown, the existing electronic tagging system cannot trace the location of the sex offender as the GPS satellite communication does not work in the interior of the building and the exact floor that the sex offender is located on cannot be recognized through communication with mobile phone base stations. This occurrence is a big problem for the existing electronic tagging system, which is based on position recognition. Therefore, this study suggests a smart electronic tagging system that can monitor sex offenders by using a Ubiquitous Sensor Network in such extreme situations where position recognition is not possible.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.247-256
• /
• 2002

In a wireless multicasting when a mobile host moves to the new bate station being in the same multicast group it needs to exchange information about data delivery between base stations to receive data from the new base station at once. However it is inefficient to use the existence schemes because it takes too much time to exchange information and many overheads. The next, a mobile host moving to the base station not being in the same multicast group, the old base station will pre-forward data to neighboring base stations to avoid transmission delay. However, if other mobile hosts move at short interval, the old base station may retransmit the same data to the same neighboring base stations. In this paper we proposed called Information Exchange Scheme (IES). In IES in the same multicast grope the base stations exchange information locally so it takes the minimum time and overheads to use IES. Also in IES the neighboring base stations delay to delete data for continuous moving of other MHs. We also present how our scheme is efficient by producing cost ad simulating.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.595-598
• /
• 2014

In order to provide the Mobile Stations operating in IEEE 802.11 Wireless LAN network with seamless handover, a comprehensive study on the functions of handover considering various networking environments and characteristics of Mobile Stations is required. Note that the channel scan process finding a new AP takes the major portion of handover time, and this is the most significant issue with seamless handover for real-time multimedia service in WLAN environment. In this paper the functions required to provide seamless handover in IEEE 802.11 WLAN network are identified, and a new scanning technique is proposed with which the Mobile Stations can selectively scan the channels to reduce the channel scan time in various network environments. Here each Mobile Station awares of the channels the neighbor APs are using by scanning them in advance according to the proposed technique. Afterwards, when handover is actually required, the optimal AP is decided quickly by scanning only the predetemined group of channels and order of scan without unnecessary scan of all the channels. In addition, proposes to enter the Scan Trigger Value and Handover Threshold Value in mobile phones in order to prevent the phenomenon can not handover.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.4
• /
• pp.375-383
• /
• 2012

Together with the GPS-based approach, geolocation through mobile communication networks is a key technology for location-based service. Since the Mobile WiMAX system is considered as a candidate for fourth-generation mobile systems, it is important to investigate its location capability. The geolocation of Mobile WiMAX can be realized when the preamble symbols in the down-link channel are appropriately used for a TDOA (Time-Difference-of-Arrival) approach. However, the cellular structure of Mobile WiMAX inevitably generates co-channel interference, and it is difficult for the mobile terminal to acquire distance measurements from multiple base stations. Therefore, for geolocation via multilateration using the Mobile WiMAX network, it is very important to increase hearability. This paper proposes a geolocation method for Mobile WiMAX which employs interference cancellation and preamble signal overlapping for the enhancement of hearability. A novel interference cancellation strategy for complex-valued Mobile WiMAX signals is presented which has an iterative structure. Simulation results show that the proposed geolocation method provides the user's position with an accuracy of less than 20 m through the Mobile WiMAX cellular network if there is no multi-path or NLOS (None-Line-of-Sight).

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.3
• /
• pp.321-329
• /
• 1999

An efficient location management for mobile stations plays an important role in mobile communication network. This paper studies a movement-based registration(MBR) method with a selective paging scheme. In the movement-based registration method, a mobile station performs a location registration when the number of cell boundary crossings since the last registration equals to the given movement threshold. In the selective paging scheme, the network first partitions the location area of the called mobile station into a number of subareas and then pages each subarea one after another until the MS is found. To reduce the paging and registration load, we propose a modified MBR(MMBR) method in the aspect of minimization of signaling traffic on radio channels. First, we propose a new establishment of the paging area to reduce the paging load on radio channels and then analyze its effects. Next, we propose the MMBR to reduce the registration load. Numerical results show that our proposed movement-based registration provides the better performance compared with the conventional method.

• ETRI Journal
• /
• v.19 no.3
• /
• pp.116-140
• /
• 1997

The base station transceiver subsystem (BTS) of the CDMA Mobile System is interfaced to mobile stations over the air and to the wired network through a packet switched interconnection network. The potential benefits of CDMA technology are achieved when the transmitter and the receiver are properly designed and implemented. The physical layer of the interface at the base station is implemented with the CDMA ASICs and control circuits in channel card of the BTS. We present the design perspectives and structural illustration of the BTS. Base station modem ASICs and their control to implement the CDMA receiver, Baseband and RF signal processing blocks, and BTS controller are described. Elaborate power control is essential to ensure the high capacity which is one of advantages of the CDMA technology. The closed loop reverse link power control and the forward link power control operated in the BTS are described.