• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3329-3350
• /
• 2017

Installing caching and computing facilities in mobile edge networks is a promising solution to cope with the challenging capacity and delay requirements imposed on future mobile communication systems. The problem of optimal facility placement in mobile edge networks has not been fully studied in the literature. This is a non-trivial problem because the mobile edge network has a unidirectional topology, making existing solutions inapplicable. This paper considers the problem of optimal placement of a fixed number of facilities in a mobile edge network with an arbitrary tree topology and an arbitrary demand distribution. A low-complexity sequential algorithm is proposed and proved to be convergent and optimal in some cases. The complexity of the algorithm is shown to be $O(H^2{\gamma})$, where H is the height of the tree and ${\gamma}$ is the number of facilities. Simulation results confirm that the proposed algorithm is effective in producing near-optimal solutions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1146-1165
• /
• 2013

Collaborative awareness between persons with various smart multimedia devices is a new trend in the Internet of Things (IoT). Because of the mobility, randomness, and complexity of persons, it is difficult to achieve complete data awareness and data transmission in IoT. Therefore, research must be conducted on mobile-aware service models. In this work, we first discuss and quantify the social relationships of mobile nodes from multiple perspectives based on a summary of social characteristics. We then define various decision factors (DFs). Next, we construct a directed and weighted community by analyzing the activity patterns of mobile nodes. Finally, a mobile-aware service routing algorithm (MSRA) is proposed to determine appropriate service nodes through a trusted chain and optimal path tree. The simulation results indicate that the model has superior dynamic adaptability and service discovery efficiency compared to the existing models. The mobile-aware service model could be used to improve date acquisition techniques and the quality of mobile-aware service in the IoT.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2B
• /
• pp.334-344
• /
• 2010

Recently, due to the prevalence of various mobile devices and broadband wireless networks, a significant interests and demands for multimedia streaming services over the Internet have been increasing. However, it is difficult to transmit continuous multimedia stream when mobile terminals are moving. Therefore, in order to deploy mobile IPTV service in the broadband wireless network, efficient wireless resource utilization and seamless QoE (Quality of Experience) offers to the users are an important issue. In this paper, we propose a network based adaptive streaming scheme, called MARC (Mobile Adaptive Rate Control), which controls the quality of the video and rate of the video based on the status of the wireless channel. The proposed scheme uses awareness information of the wireless channel status and controls transmitting streaming video which is suitable for the wireless channel status and mobile station location, in order to provide a seamless video playback for mobile environment in addition to improving the quality of a streaming service. The proposed MARC scheme alleviates the discontinuity of video playback and allocates suitable client buffer in broadband wireless network. Simulation results demonstrate the effectiveness of our proposed scheme.

• Journal of Digital Contents Society
• /
• v.14 no.3
• /
• pp.357-365
• /
• 2013

The popularization of smart phones changes the usage patterns of mobile communication from voice-centric to data-centric communication. The demand for wireless data communications is rapidly increasing, and thus the need for expanding infrastructure for mobile communication is also rapidly increasing. In this paper, we propose a scheme for reducing the cost for the mobile communication infrastructure by exploiting opportunistic networks in dissemination of multimedia contents. By using this scheme, the large portion of the cost for mobile communication infrastructure could be saved, and the need of users for multimedia contents could be also fulfilled. Our scheme is evaluated using agent-based simulations. The simulation results show that about 70% of mobile communication can be replaced with the data communication through opportunistic networks.

• Journal of the Korea Society for Simulation
• /
• v.21 no.1
• /
• pp.45-54
• /
• 2012

Advances in mobile communication and digital video technology enable to commercialize converged multimedia services such as VoD in the mobile networks. Media convergence is evolving into U-Cloud and mobile IP-TV services constituted by high-speed mobile multimedia networks and integrated personal devices. This paper proposes a resource allocation scheme to guarantee QoS of converged mobile multimedia services, and simultaneously maximize legacy services in heterogeneous wireless networks. Performances are analyzed by the simulation.

• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.422-429
• /
• 2008

Mobile peer-to-peer (P2P) systems have recently got in the limelight of the research community that is striving to build efficient and effective mobile content addressable networks. Along this line of research, we propose a new peer-to-peer file sharing protocol suited to mobile ad hoc networks (MANET). The main ingredients of our protocol are network coding and mobility assisted data propagation, i.e., single-hop communication. We argue that network coding in combination with single-hop communication allows P2P file sharing systems in MANET to operate in a more efficient manner and helps the systems to deal with typical MANET issues such as dynamic topology and intermittent connectivity as well as various other issues that have been disregarded in previous MANET P2P researches such as addressing, node/user density, non-cooperativeness, and unreliable channel. Via simulation, we show that our P2P protocol based on network coding and single-hop communication allows shorter file downloading delays compared to an existing MANET P2P protocol.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.3
• /
• pp.90-101
• /
• 2000

In this paper, we propose a controller for differentially steered wheeled mobile robots. The controller uses input-output linearization algorithm and artificial neural network to stabilize the dynamic model and compensate uncertainties. The proposed neural network part has 6 inputs, 1 hidden layer, 2 torque outputs and features fast online learning and good performance on structure error learning basis. Simulation results show that the proposed controller perform precisely tracking of reference path and is robust to uncertainties.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.583-588
• /
• 2007

It is easy to implement a temporary network with a mobile ad-hoc network in which mobile nodes have without using a infrastructure network. They depend on their limited power. Recently, it is a hot issue to save the energy in a mobile ad-hoc network because a mobile nodes have a limited energy. Research of IEEE 802.11 PSM was proposed in a single hop ad-hoc assumption. If IEEE 802.11 PSM is applied to multi hop ad-hoc network, non-optimal paths will be generated by the mobile nodes which didn't receive a message of routing request. Non-optimal paths increase not only a network latency but also energy consumption of mobile nodes. Reconfiguring algorithm of non-optimal paths caused by the mobile nodes which didn't receive a message of routing request is proposed in this paper. A mobile node can overhear the data in his range. A wireless medium is shared by all mobile nodes using the same bandwidth. All mobile nodes lookout the non-optimal paths with these properties of a medium, if non-optimal path is generated, optimal reconfiguring will be accomplished by modifying routing table of itself or sending a request message of routing update to nearby nodes. By reconfiguring the non-optimal paths to optimized ones, network latency and energy consumption was decreased. It is confirmed to ignore the overhead caused by a algorithm presented in this paper through the result of the simulation.

• Journal of Korea Multimedia Society
• /
• v.15 no.12
• /
• pp.1485-1491
• /
• 2012

In this paper, we address the problem of fast handover support for future internet networks. The current mobility support protocols, for example Proxy Mobile IPv6, follow a centralized architecture in which a mobility controller is used to manage intra-network handovers that gives rise to high handover latency. To handle this problem, we propose a novel distributed mobility control architecture in which gateways in the network can exchange user information with neighbour gateways to support intra-network handovers, the mobility controller is only needed in case of inter-network handovers. Simulation results show that our architecture reduce approximately 20% intra-network handover latency than Proxy Mobile IPv6.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.7 no.4
• /
• pp.15-22
• /
• 2011

U-Healthcare service is a real-time service using the vital signs which are continuously transferred from monitoring sensors attached to mobile patients under the wireless network environments. It should monitor the health condition of mobile patients everywhere at any time. In this paper, we have improved two features of the three layered mobile patient monitoring system with load balancing ability. First, the simulation process has been improved by allowing the number of related nodes to be changed. Secondly, we have modified S node to which queue is added to reduce the loss rate of collecting data from patients during the delay of S node process. And the data from the patient with high priority can be transferred to the server immediately through the filtering function. Furthermore, we have solved the problem of redundancy in sharing information among S nodes by differentiating process time to each S node. By performing a DEVS Java-based system simulation, we have verified the efficiency of this improved system.