• Title/Summary/Keyword: mobility metrics

Search Result 45, Processing Time 0.023 seconds

Evaluation of Geo-based Image Fusion on Mobile Cloud Environment using Histogram Similarity Analysis

  • Lee, Kiwon;Kang, Sanggoo
    • Korean Journal of Remote Sensing
    • /
    • v.31 no.1
    • /
    • pp.1-9
    • /
    • 2015
  • Mobility and cloud platform have become the dominant paradigm to develop web services dealing with huge and diverse digital contents for scientific solution or engineering application. These two trends are technically combined into mobile cloud computing environment taking beneficial points from each. The intention of this study is to design and implement a mobile cloud application for remotely sensed image fusion for the further practical geo-based mobile services. In this implementation, the system architecture consists of two parts: mobile web client and cloud application server. Mobile web client is for user interface regarding image fusion application processing and image visualization and for mobile web service of data listing and browsing. Cloud application server works on OpenStack, open source cloud platform. In this part, three server instances are generated as web server instance, tiling server instance, and fusion server instance. With metadata browsing of the processing data, image fusion by Bayesian approach is performed using functions within Orfeo Toolbox (OTB), open source remote sensing library. In addition, similarity of fused images with respect to input image set is estimated by histogram distance metrics. This result can be used as the reference criterion for user parameter choice on Bayesian image fusion. It is thought that the implementation strategy for mobile cloud application based on full open sources provides good points for a mobile service supporting specific remote sensing functions, besides image fusion schemes, by user demands to expand remote sensing application fields.

Mobile Resource Reliability-based Job Scheduling for Mobile Grid

  • Jang, Sung-Ho;Lee, Jong-Sik
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.1
    • /
    • pp.83-104
    • /
    • 2011
  • Mobile grid is a combination of grid computing and mobile computing to build grid systems in a wireless mobile environment. The development of network technology is assisting in realizing mobile grid. Mobile grid based on established grid infrastructures needs effective resource management and reliable job scheduling because mobile grid utilizes not only static grid resources but also dynamic grid resources with mobility. However, mobile devices are considered as unavailable resources in traditional grids. Mobile resources should be integrated into existing grid sites. Therefore, this paper presents a mobile grid middleware interconnecting existing grid infrastructures with mobile resources and a mobile service agent installed on the mobile resources. This paper also proposes a mobile resource reliability-based job scheduling model in order to overcome the unreliability of wireless mobile devices and guarantee stable and reliable job processing. In the proposed job scheduling model, the mobile service agent calculates the mobile resource reliability of each resource by using diverse reliability metrics and predicts it. The mobile grid middleware allocated jobs to mobile resources by predicted mobile resource reliability. We implemented a simulation model that simplifies various functions of the proposed job scheduling model by using the DEVS (Discrete Event System Specification) which is the formalism for modeling and analyzing a general system. We also conducted diverse experiments for performance evaluation. Experimental results demonstrate that the proposed model can assist in improving the performance of mobile grid in comparison with existing job scheduling models.

An Efficient Service Function Chains Orchestration Algorithm for Mobile Edge Computing

  • Wang, Xiulei;Xu, Bo;Jin, Fenglin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.12
    • /
    • pp.4364-4384
    • /
    • 2021
  • The dynamic network state and the mobility of the terminals make the service function chain (SFC) orchestration mechanisms based on static and deterministic assumptions hard to be applied in SDN/NFV mobile edge computing networks. Designing dynamic and online SFC orchestration mechanism can greatly improve the execution efficiency of compute-intensive and resource-hungry applications in mobile edge computing networks. In order to increase the overall profit of service provider and reduce the resource cost, the system running time is divided into a sequence of time slots and a dynamic orchestration scheme based on an improved column generation algorithm is proposed in each slot. Firstly, the SFC dynamic orchestration problem is formulated as an integer linear programming (ILP) model based on layered graph. Then, in order to reduce the computation costs, a column generation model is used to simplify the ILP model. Finally, a two-stage heuristic algorithm based on greedy strategy is proposed. Four metrics are defined and the performance of the proposed algorithm is evaluated based on simulation. The results show that our proposal significantly provides more than 30% reduction of run time and about 12% improvement in service deployment success ratio compared to the Viterbi algorithm based mechanism.

Targetless displacement measurement of RSW based on monocular vision and feature matching

  • Yong-Soo Ha;Minh-Vuong Pham;Jeongki Lee;Dae-Ho Yun;Yun-Tae Kim
    • Smart Structures and Systems
    • /
    • v.32 no.4
    • /
    • pp.207-218
    • /
    • 2023
  • Real-time monitoring of the behavior of reinforced soil retaining wall (RSW) is required for safety checks. In this study, a targetless displacement measurement technology (TDMT) consisting of an image registration module and a displacement calculation module was proposed to monitor the behavior of RSW, in which facing displacement and settlement typically occur. Laboratory and field experiments were conducted to compare the measuring performance of natural target (NT) with the performance of artificial target (AT). Feature count- and location-based performance metrics and displacement calculation performance were analyzed to determine their correlations. The results of laboratory and field experiments showed that the feature location-based performance metric was more relevant to the displacement calculation performance than the feature count-based performance metric. The mean relative errors of the TDMT were less than 1.69 % and 5.50 % for the laboratory and field experiments, respectively. The proposed TDMT can accurately monitor the behavior of RSW for real-time safety checks.

A Wireless Traffic Load-Balancing Algorithm based on Adaptive Bandwidth Reservation Scheme in Mobile Cellular Networks (셀룰러 망에서 적응적 대역폭 예약 기법을 이용한 무선 트래픽 부하 균형 알고리즘)

  • 정영석;우매리;김종근
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2001.06a
    • /
    • pp.21-24
    • /
    • 2001
  • For very large multimedia traffic to be supported successfully in wireless network environment, it is necessary to provide Quality-of-Service(QoS) guarantees between mobile hosts(clients). In order to guarantee the Qos, we have to keep the call blocking probability below target value during handoff session. However, the QoS negotiated between the client and the network may not be guaranteed due to lack of available channels for traffic in the new cell, since mobile clients should be able to continue their on-going sessions. In this paper we propose a efficient load-balancing algorithm based on the adaptive bandwidth reservation scheme for enlarging available channels in a cell. We design a new method to predict the mobility of clients using MPT(mobility profile table). This method is then used to reserve a part of bandwidths for handoff calls to its adjacent cells and this reserved bandwidth can be used for handoff call prior to new connection requests. If the number of free channels is also under a low threshold value, our scheme use a load-balancing algorithm with a adaptive bandwidth reservation. In order to evaluate the performance of our algorithm, we measure the metrics such as the blocking probability of new calls and dropping probability of handoff calls, and compare with other existing schemes.

  • PDF

State-Aware Re-configuration Model for Multi-Radio Wireless Mesh Networks

  • Zakaria, Omar M.;Hashim, Aisha-Hassan Abdalla;Hassan, Wan Haslina;Khalifa, Othman Omran;Azram, Mohammad;Goudarzi, Shidrokh;Jivanadham, Lalitha Bhavani;Zareei, Mahdi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.146-170
    • /
    • 2017
  • Joint channel assignment and routing is a well-known problem in multi-radio wireless mesh networks for which optimal configurations is required to optimize the overall throughput and fairness. However, other objectives need to be considered in order to provide a high quality service to network users when it deployed with high traffic dynamic. In this paper, we propose a re-configuration optimization model that optimizes the network throughput in addition to reducing the disruption to the mesh clients' traffic due to the re-configuration process. In this multi-objective optimization model, four objective functions are proposed to be minimized namely maximum link-channel utilization, network average contention, channel re-assignment cost, and re-routing cost. The latter two objectives focus on reducing the re-configuration overhead. This is to reduce the amount of disrupted traffic due to the channel switching and path re-routing resulted from applying the new configuration. In order to adapt to traffic dynamics in the network which might be caused by many factors i.e. users' mobility, a centralized heuristic re-configuration algorithm called State-Aware Joint Routing and Channel Assignment (SA-JRCA) is proposed in this research based on our re-configuration model. The proposed algorithm re-assigns channels to radios and re-configures flows' routes with aim of achieving a tradeoff between maximizing the network throughput and minimizing the re-configuration overhead. The ns-2 simulator is used as simulation tool and various metrics are evaluated. These metrics include channel-link utilization, channel re-assignment cost, re-routing cost, throughput, and delay. Simulation results show the good performance of SA-JRCA in term of packet delivery ratio, aggregated throughput and re-configuration overhead. It also shows higher stability to the traffic variation in comparison with other compared algorithms which suffer from performance degradation when high traffic dynamics is applied.

Quality Assessment Model for Practical Wearable Computers (실용적 웨어러블 컴퓨터 품질평가모델)

  • Oh, Cheon-Seok;Choi, Jae-Hyun;Kim, Jong-Bae;Park, Jea-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.12
    • /
    • pp.842-855
    • /
    • 2014
  • Recently, the progress of smart phone market has retarded by oversupply therefore wearable computer has been the focus of new growth engine. Wearable computing system is a complex fusion of a variety of technologies such as wireless network, embedded, sensor and new material. Because these technologies involves utilization and mobility in addition to quality characteristic in existing software, application of ISO/IEC 9126 is not perfect when assessing quality of wearable computer. In this study, author suggested new quality assessment model for wearable computer by sorting quality attribute in ISO/IEC 9126 and adding new quality attribute. For this, author investigated features and functional requirements related to wearable computer. and then author suggested quality standard and metrics by identifying quality characteristic. Author confirmed practicality of quality assessment model by using suggested model in scenario and comparing quality assessment of three goods such as company S, L, G. This quality assessment model is expected to use guidelines for assessing quality of wearable computer.

Load-balanced Topology Maintenance with Partial Topology Reconstruction (부분 토폴로지 재구성 기법을 적용한 부하 균형 토폴로지 유지)

  • Hong, Youn-Sik;Lim, Hwa-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12A
    • /
    • pp.1188-1197
    • /
    • 2010
  • A most important thing in a connected dominating set(CDS)-based routing in a wireless ad-hoc network is to select a minimum number of dominating nodes and then build a backbone network which is made of them. Node failure in a CDS is an event of non-negligible probability. For applications where fault tolerance is critical, a traditional dominating-set based routing may not be a desirable form of clustering. It is necessary to minimize the frequency of reconstruction of a CDS to reduce message overhead due to message flooding. The idea is that by finding alternative nodes within a restricted range and locally reconstructing a CDS to include them, instead of totally reconstructing a new CDS. With the proposed algorithm, the resulting number of dominating nodes after partial reconstruction of CDS is not changed and also its execution time is faster than well-known algorithm of construction of CDS by 20~40%. In the case of high mobility situation, the proposed algorithm gives better results for the performance metrics, packet receive ratio and energy consumption.

A Branch and Bound Algorithm to Find a Routing Tree Having Minimum Wiener Index in Sensor Networks with High Mobile Base Node (베이스 노드의 이동성이 큰 센서 네트워크 환경에서 최소 Wiener 수를 갖는 라우팅 트리를 위한 분기한정 알고리즘)

  • Kang, Seung-Ho;Kim, Ki-Young;Lee, Woo-Young;Song, Iick-Ho;Jung, Min-A;Lee, Seong-Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5A
    • /
    • pp.466-473
    • /
    • 2010
  • Several protocols which are based on tree topology to guarantee the important metrics such as energy efficiency in sensor networks have been proposed. However, studies on the effect of topologies in sensor networks, where base node has a high mobility, are very few. In this paper, we propose a minimum Wiener index tree as a suitable topology to the wireless sensor networks with high mobile base node. The minimum Wiener index spanning tree problem which aims to find a tree with minimum Wiener index from a given weighted graph was proved to be NP-hard. We designed a branch and bound algorithm for this problem. To evaluate the performance of proposed tree, the comparisons with minimum spanning tree in terms of transmission distance, energy consumption during one round, and network lifetime was performed by simulations. Our proposed tree outperformed in transmission distance and energy efficiency but underperformed in lifetime.

Design of Operation-Level Simulator for Wireless Sensor Network (무선센서네트워크용 동작레벨 시뮬레이터 설계)

  • Lee, Doo-Wan;Kim, Min-Je;Lee, Kang-Whan;Jang, Kyung-Sik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.3
    • /
    • pp.733-739
    • /
    • 2011
  • Recently, a lots of research proposals and results on mobile sensor network are actively announced. The most of such works are based on general-purposed network simulators such as ns-2, mathlab, etc. But, It is not easy to model and simulate the detail activities of each sensor node, data deliveries between them, and its cost such as power consumption and resource utilization, so that the simulation results of those simulators show the limited aspects of overall networks features or performance metrics. In this paper proposed, power consumption of each node, performance, mobility, and location information in operation-level of the network that can simulate a wireless sensor network simulator platform. Because the network routing algorithm analysis of being developed in an existing becomes available, the proposed simulator can usability in the new network routing algorithm development.