• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.259-264
• /
• 2010

In this paper, for supporting more variable services than typical DSRC, brand call service, truck and an official vehicle services, etc. using location information and mobile communication network could be adapted. emergence helping information providing, multimedia service that are wireless internet, movies and games, are increasingly needed for competible wireless car mobile terminal. Those needs would make a development a wireless telemetries system based on WiBro interface in ubiquitous vehicle environment. We analysis the proposed telematics mobile terminal using simulation which is concerned about fixed bandwidth and dynamic bandwidth.

• Electronics and Telecommunications Trends
• /
• v.33 no.6
• /
• pp.118-128
• /
• 2018

With the massive increase in bandwidth for wireless communications, free space optical (FSO) communication has attracted significant interest owing to its outstanding strengths over conventional radio frequency wireless communication such as a wide bandwidth, unlicensed spectrum, low power consumption, small size, electromagnetic interference immunity, long-range propagation, and improved security. In recent years, FSO technology has been studied intensively for use in terrestrial and underwater autonomous and unmanned mobile systems, a rapidly growing application area, including robots, drones, unmanned aerial vehicles, autonomous vehicles, unmanned trains, and unmanned submarines. In this report, we review the recent trends and key technologies for the mobile FSO system, and introduce our drone-based mobile FSO system, which is currently under development.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.3
• /
• pp.465-474
• /
• 2001

In the network with small cell radius, a mobile terminal which has large mobility should perform frequent handover. This requires that handover mechanism must be done fastly. The currently existing method for handover uses an algorithm in which the bandwidth corresponding to the adjacent cells is supposed to be allocated. However, this method leads to the problem of requiring bandwidth allocation for many-unknown cells, due to the lack of information toward moving direction in mobile terminal. In this paper, we propose an efficient dynamic bandwidth allocation algorithm for solving those problem above, based on both path rerouting handover and soft handover mechanism with wireless ATM. As for the QoS, it has been shown that proposed algorithm shows better performance than that with static bandwidth allocation algorithm.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.439-446
• /
• 2003

A crucial limitation in environments where data is broadcast to very large client populations is the low bandwidth available for clients to communicate with servers. Many advanced applications are developed in mobile computing environments, but conventional concurrency controls are not suitable because of the low bandwidth of wireless network. In this paper, we propose a new optimistic concurrency control protocol for mobile transactions. In this protocol, mobile read-only transactions can be completed locally at the clients without additional communication, only mobile update transactions are sent to the server for global validation. Our protocol reduces unnecessary aborts occurred in the previous study using only conflict information. In addition to, our algorithm can detect and resolve non-serializable execution using by data table maintained in a server.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.143-146
• /
• 2004

Differentiated services (DiffServ) has been widely accepted as the service model to adopt for providing quality-of­service (QoS) over the next-generation IP networks. There is a growing need to support QoS in mobile ad hoc networks. Supporting DiffServ in mobile ad hoc networks, however, is very difficult because of the dynamic nature of mobile ad hoc networks, which causes network congestion. The network congestion induces long transfer packet delay and low throughput which make it very difficult to support QoS in mobile ad hoc networks. We propose DiffServ module to support differentiated service in mobile ad hoc networks through congestion control. Our DiffServ module uses the periodical rate control for real time traffic and also uses the best effort bandwidth concession when network congestion occurs. Network congestion is detected by measuring the packet transfer delay or bandwidth threshold of real time traffic. We evaluate our mechanism via a simulation study. Simulation results show our mechanism may offer a low and stable delay and a stable throughput for real time traffic in mobile ad hoc networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3603-3618
• /
• 2022

The offloading method is important when there are multiple mobile nodes and multiple edge servers. In the environment, those mobile nodes connect with edge servers with different bandwidths, thus taking different time and energy for offloading tasks. Considering the system load of edge servers and the attributes (the number of instructions, the size of files, deadlines, and so on) of tasks, the energy-aware offloading problem becomes difficult under our mobile edge environment (MCE). Most of the past work mainly offloads tasks by judging where the job consumes less energy. But sometimes, one task needs more energy because the preferred edge servers have been overloaded. Those methods always do not pay attention to the influence of the scheduling on the future tasks. In this paper, first, we try to execute the job locally when the job costs a lower energy consumption executed on the MD. We suppose that every task is submitted to the mobile server which has the highest bandwidth efficiency. Bandwidth efficiency is defined by the sending ratio, the receiving ratio, and their related power consumption. We sort the task in the descending order of the ratio between the energy consumption executed on the mobile server node and on the MD. Then, we give a "suffrage" definition for the energy consumption executed on different mobile servers for offloading tasks. The task selects the mobile server with the largest suffrage. Simulations show that our method reduces the execution time and the related energy consumption, while keeping a lower value in the number of uncompleted tasks.

• Journal of Korea Multimedia Society
• /
• v.11 no.5
• /
• pp.685-691
• /
• 2008

Recently with the rapid evolution of the mobile computing and communication technologies, mobile VOD service becomes increasingly important for wireless mobile users. The VOD service is being widely used in various areas of application, such as education, entertainment and business, because it provides users convenience in easily having access to video information at any time in any places. However, in reality, the mobile system has many difficulties in providing the smooth VOD service owing to frequent transfers and cutoffs of clients. The importance of a technique to transmit broadcasting is being stressed as a method for providing stabler mobile VOD service to a large number of clients. This paper is aimed at showing how to reduce demands for server bandwidth and delay of earlier service through performance analysis by suggesting an effective VOD broadcasting transmission technique through channel division in the mobile atmosphere. Many researches have been made about regular broadcasting techniques in particular. This study divides the methods used for assigning channels which have been decided by the size of segments into a group of regular channels and assistant channels using wireless gap-fillers to provide effective VOD services to a large number of clients at the mobile environment using small bandwidth resources. The regular channels transfer regular streams, while assistant channels repeatedly transfer the first segment to reduce early service delay time to receive regular streams. In this way, the study suggests a technique to reduce server bandwidth demand and early service delay time. Through the proposed technique, the server bandwidth demand could be reduced by more than 30 percent and the study continuously shows reduced early service delay time through conducting performance analysis.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.505-513
• /
• 2007

Vertical handoff is a new type of handoff in wireless networks. It is issued when a mobile node moves over overlapping wireless networks with each proving a different access bandwidth, transmission latency, and coverage. By issuing the vertical handoff, the mobile node can obtain better network bandwidth. In the sense of TCP throughput, however, the vertical handoff does not always produce positive performance gain, so sometimes it is better for the mobile node to stay at lower bandwidth providing network rather than to select and move to higher bandwidth providing network. In this paper, we analyze TCP throughput for vertical handoff, and propose a new handoff decision scheme which can estimate TCP throughput at the moment of vertical handoff. Based on the estimation, a mobile node can decide to issue vertical handoff to produce better TCP throughput, and we verify the results by simulations.

• The KIPS Transactions:PartC
• /
• v.9C no.3
• /
• pp.385-398
• /
• 2002

To accommodate the increasing number of mobile terminals in the limited radio spectrum, wireless systems have been designed as micro/picocellular architectures for a higher capacity. This reduced coverage area of a cell has caused a higher rate of hand-off events, and the hand-off technology for efficient process becomes a necessity to provide a stable service. Population-based Bandwidth Reservation(PBR) Scheme is proposed to provide prioritized handling for hand-off calls by dynamically adjusting the amount of reserved bandwidth of a cell according to the amount of cellular traffic in its neighboring cells. We analyze the performance of the PBR scheme according to the changes of a fractional parameter, f, which is the ratio of request reservation to the total amount of bandwidth units required for hand-off calls that will occur for the next period. The vague of this parameter, f should be determined based on QoS(Quality of Service) requirement. To meet the requirement the value of Parameter(f) must be able to be adjusted dynamically according to the changing traffic conditions. The best value of f can be determined by a function of the average speed of mobile stations, average call duration, cell size, and so on. This paper considers the average call duration and the cell size according to the speed of mobile stations. Although some difference exists as per speed, in the range of 0.4 $\leq$ f $\leq$ 0.6, Blocking Probability, Dropping Probability and Utilization show the best values.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.1-14
• /
• 2002

The most important issue in providing multimedia traffic on a mobile computing environments is to guarantee the mobile host(client) with consistent QoS(Quality of Service). However, the QoS negotiated between the client and network in one cell may not be honored due to client mobility, causing hand-offs between cells. In this paper, a call admission control mechanism is proposed to provide consistent QoS guarantees for multimedia traffics in a mobile computing environment. Each cell can reserve fractional bandwidths for hand-off calls to its adjacent cells. It is important to determine the right amount of reserved bandwidth for hand-off calls because the blocking probability of new calls may increase if the amount of reserved bandwidth is more than necessary. An adaptive bandwidth reservation based on an MPP(Mobility Pattern Profile) and a 2-tier cell structure has been proposed to determine the amount of bandwidth to be reserved in the cell and to control dynamically its amount based on its network condition. We also propose a call admission control based on this bandwidth reservation and "next-cell prediction" scheme using an MPP. In order to evaluate the performance of our call admission control mechanism, we measure the metrics such as the blocking probability of our call admission control mechanism, we measure the metrics such as the blocking probability of new calls, dropping probability of hand-off calls, and bandwidth utilization. The simulation results show that the performance of our mechanism is superior to that of the existing mechanisms such as NR-CAT1, FR-CAT1, and AR-CAT1.