• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.1
• /
• pp.9-14
• /
• 2014

The path loss data was re-calculated according to the distance between the base station and a mobile station in the mobile telecommunications network. In this paper, the averaged path loss data was plotted with the conventional path loss models(free space, plane earth, Hata model ${\ldots}$). The standard deviations for the 2 Km, 1 Km, 0.5 Km-interval averaged path loss were 2.29 dB, 3.39 dB, 4.75 dB, respectively. Additionally, the derivative values for the 2 Km, 1 Km, 0.5 Km-interval averaged path loss were evaluated to find the positions with more than 1 times or 2times of the standard deviation. The situations with the sharply fluctuated path loss were calculated to 5 positions in the 2 Km interval, to 7 positions in the 1 Km interval, to 19 positions in the 0.5 Km interval, respectively. And, the exact distances between the base station and a mobile station were found with the sharply fluctuated path loss.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.3
• /
• pp.477-493
• /
• 2011

The IEEE 802.16 mobile multi-hop relay (MMR) task group 'j' (TGj) has introduced the multi-hop relaying concept in the IEEE 802.16 Wireless MAN, wherein a relay station (RS) is employed to improve network coverage and capacity. Several RSs can be deployed between a base station and mobile stations, and configured to form a tree-like multi-hop topology. In such architecture, we consider the problem of a path selection through which the mobile station in and outside the coverage can communicate with the base station. In this paper, we propose a new path selection algorithm that ensures more efficient distribution of resources such as bandwidth among the relaying nodes for improving the overall performance of the network. Performance of our proposed scheme is compared with the path selection algorithms based on loss rate and the shortest path algorithm. Based on the simulation results using ns-2, we show our proposal significantly improves the performance on throughput, latency and bandwidth consumption.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.2
• /
• pp.140-146
• /
• 2007

This paper demonstrates the development of a mobile robot for patrol. We fuse differential GPS, angle sensor and odometry data using the framework of extended Kalman filter to localize a mobile robot in outdoor environments. An important feature of road environment is the existence of curbs. So, we also propose an algorithm to find out the position of curbs from laser range finder data using Hough transform. The mobile robot builds the map of the curbs of roads and the map is used fur tracking and localization. The patrol robot system consists of a mobile robot and a control station. The mobile robot sends the image data from a camera to the control station. The remote control station receives and displays the image data. Also, the patrol robot system can be used in two modes, teleoperated or autonomous. In teleoperated mode, the teleoperator commands the mobile robot based on the image data. On the other hand, in autonomous mode, the mobile robot has to autonomously track the predefined waypoints. So, we have designed a path tracking controller to track the path. We have been able to confirm that the proposed algorithms show proper performances in outdoor environment through experiments in the road.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1807-1816
• /
• 1998

The interference probability between non-geostationary-statellite orbit mobile station is calculated when the two systems are sharing the frquency band below 1 GHz. The probability density function of a mobile earth station(MES) is calculated based on the established propagation model and then, a probability of exceeding the threshold level is derived. By changing the average transimission per unit time of total MSS(Moblie satellite service) area and the ratio of transmitters for specific area, we obtain the average transmission per unit time for the area under consideration. From this, the exceedance probability for the given pfd threshold level is evaluated. The exceedance probability is increased as the average transmissio per unit time and ratio become larger. Also the effect of filter isolation between channels is accounted for.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.475-478
• /
• 2004

In this paper, a CSSMA/AI MAC protocol for data services in packet CDMA network is presented. The proposed protocol is based on the code status sensing and reservation scheme. In the proposed protocol, the base station broadcast the rode status on a frame-by-frame basis just before the beginning of each preamble transmission, and the mobile station transmits a preamble for reserving a randomly selected code based on the received code status. After having transmitted the preamble, the mobile station listens to the downlink of the selected rode and waits for the base station reply. If this reply indicates that the code has been correctly acquired, it continues the packet transmission lot the rest of the frame. If there are other packets waiting for transmission, the base station broadcasts the status of the code as reserved, and the mobile station transmits a packet through the reserved code for the successive frames.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.528-531
• /
• 2004

This paper presents the design and implementation of a QoS based IrDA in mobile phones. The IrDA standards have arised from the need to connect various mobile devices together. But currently, we have a difficult to connecting various mobile devices together. The difficult thing is to adjust the minimum turn around time. The minimum turn around time in IrDA deals with the time needed for a receiver circuit to recover following saturation by transmissions from the same device (turn around latency). This parameter corresponds to the required time delay between the last byte of the last frames sent by a station and the point at which it is ready the first byte of a frame from another station. This parameter comes into play when the link is turned around and is negotiated independency for each station. We solve this matter by using the Dynamic Adjustment Algorithm (DAA). The dynamic adjustment algorithm adjusts the minimum turn around time according to the numbers of devices. We apply our direct adjustment algorithm to our QoS based IrDA in mobile phones and show the improved performance of connection with various mobile phones together.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.288-300
• /
• 2006

In this paper, we consider a channel ordering problem that seeks to minimize the total interference in mobile radio networks. If a base station receives connection request from a mobile user, one of the empty channels that are fixed to the base station is assigned to the mobile user. Among several channels available, we can choose one that seems to make least interference with other channels assigned to adjacent base stations. However, a pair of channels that are not separated enough do not generate interference if both of them are not simultaneously used by 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 costs are properly generated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12A
• /
• pp.959-965
• /
• 2011

As the usage of mobile stations increases thanks to various services, power saving mechanisms of mobile station operated by battery power have been gained much attention. This paper presents a power saving mechanism(PSM) of IEEE 802.16m, called Mobile WiMAX, for 4G mobile technology. This paper first presents different points of the PSM of IEEE 802.16m from IEEE 802.16e, which is a basis of IEEE 802.16m. This paper proposes a dynamic sleep cycle adjustment algorithm for improving the performance of IEEE 802.16m PSM by considering the arrival pattern of incoming packets from base station. Performance of the algorithm is analyzed in terms of energy consumption as well as waiting time of packets.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.1
• /
• pp.87-93
• /
• 2004

In the design of mobile wireless communication network, BSC(Base Station Location), BSC(Base Station Controller) and MSC(Mobile Switching Center) are the most important parameters. Designing base station location, the cost must be minimized by combining various, complex parameters. We can solve this Problem by combining optimization algorithm, such as Simulated Annealing, Tabu Search, Genetic Algorithm, Random Walk Algorithm that have been used extensively for global optimization. This paper shows the 4 kinds of algorithm to be applied to the optimization of base station location for communication system and then compares, analyzes the results and shows optimization process of algorithm.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.5
• /
• pp.451-458
• /
• 2016

Urban railway can be divided into ground and underground sections. In particular, the center of the metropolitan has been built mostly underground stations and tunnels. Underground section is difficult to measure the position because GPS signal is unavailable, so it is necessary to apply the indoor positioning technology. For this purpose, we analyzed the positioning technologies which are based on Wi-Fi and mobile base stations. The positing technology for smart phone which uses mobile base station' information is developed in the underground area of urban railway where the core technique is to implement base station ID into the positing technology by considering hand-off point.