• 제목/요약/키워드: Ministry of Information and Communication

검색결과 324건 처리시간 0.027초

A Heuristic Algorithm for Optimal Facility Placement in Mobile Edge Networks

  • Jiao, Jiping;Chen, Lingyu;Hong, Xuemin;Shi, Jianghong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권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.

Reduction of the Retransmission Delay for Heterogeneous Devices in Dynamic Opportunistic Device-to-device Network

  • Chen, Sixuan;Zou, Weixia;Liu, Xuefeng;Zhao, Yang;Zhou, Zheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권10호
    • /
    • pp.4662-4677
    • /
    • 2018
  • The dynamic opportunistic device-to-device (DO-D2D) network will frequently emerge in the fifth generation (5G) wireless communication due to high-density and fast-moving mobile devices. In order to improve the Quality of Experience (QoE) of users with different computing capacity devices in the DO-D2D network, in this paper, we focus on the study of how to reduce the packets retransmission delay and satisfy heterogeneous devices. To select as many devices as possible to transmit simultaneously without interference, the concurrent transmitters-selecting algorithm is firstly put forward. It jointly considers the number of packets successfully received by each device and the device's connectivity. Then, to satisfy different devices' demands while primarily ensuring the base-layer packets successfully received by all the devices, the layer-cooperation instantly decodable network coding is presented, which is used to select transmission packets combination for each transmitter. Simulation results illustrate that there is an appreciable retransmission delay gain especially in the poor channel quality network compared to the traditional base-station (BS) retransmission algorithm. In addition, our proposed algorithms perform well to satisfy the different demands of users with heterogeneous devices.

Design and Implementation of Location and Activity Monitoring System Based on LoRa

  • Lin, Shengwei;Ying, Ziqiang;Zheng, Kan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권4호
    • /
    • pp.1812-1824
    • /
    • 2019
  • The location and human activity are usually used as one of the important parameters to monitor the health status in healthcare devices. However, nearly all existing location and monitoring systems have the limitation of short-range communication and high power consumption. In this paper, we propose a new mechanism to collect and transmit monitoring information based on LoRa technology. The monitoring device with sensors can collect the real-time activity and location information and transmit them to the cloud server through LoRa gateway. The user can check all his history and current information through the specific designed mobile applications. Experiment was carried out to verify the communication, power consumption and monitoring performance of the entire system. Experimental results demonstrate that this system can collect monitoring and activity information accurately and provide the long rang coverage with low power consumption.

Social-Aware Resource Allocation Based on Cluster Formation and Matching Theory in D2D Underlaying Cellular Networks

  • Zhuang, Wenqin;Chen, Mingkai;Wei, Xin;Li, Haibo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권5호
    • /
    • pp.1984-2002
    • /
    • 2020
  • With the appearance of wireless spectrum crisis in traditional cellular network, device-to-device (D2D) communication has been regarded as a promising solution to ease heavy traffic burden by enabling precise content delivery among mobile users. However, due to the channel sharing, the interference between D2D and cellular users can affect the transmission rate and narrow the throughput in the network. In this paper, we firstly present a weighted interference minimization cluster formation model involving both social attribute and physical closeness. The weighted-interference, which is evaluated under the susceptible-infected(SI) model, is utilized to gather user in social and physical proximity. Then, we address the cluster formation problem via spectrum clustering with iterative operation. Finally, we propose the stable matching theory algorithm in order to maximize rate oriented to accomplish the one-to-one resource allocation. Numerical results show that our proposed scheme acquires quite well clustering effect and increases the accumulative transmission rate compared with the other two advanced schemes.

A Relay Selection and Power Allocation Scheme for Cooperative Wireless Sensor Networks

  • Qian, Mujun;Liu, Chen;Fu, Youhua;Zhu, Weiping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권4호
    • /
    • pp.1390-1405
    • /
    • 2014
  • This paper investigates optimal relay selection and power allocation under an aggregate power constraint for cooperative wireless sensor networks assisted by amplify-and-forward relay nodes. By considering both transmission power and circuit power consumptions, the received signal-to-noise ratio (SNR) at the destination node is calculated, based on which, a relay selection and power allocation scheme is developed. The core idea is to adaptively adjust the selected relays and their transmission power to maximize the received SNR according to the channel state information. The proposed scheme is derived by recasting the optimization problem into a three-layered problem-determining the number of relays to be activated, selecting the active relays, and performing power allocation among the selected relays. Monte Carlo simulation results demonstrate that the proposed scheme provides a higher received SNR and a lower bit error rate as compared to the average power allocation scheme.

Multiuser chirp modulation for underwater acoustic channel based on VTRM

  • Yuan, Fei;Wei, Qian;Cheng, En
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • 제9권3호
    • /
    • pp.256-265
    • /
    • 2017
  • In this paper, an ascheme is proposed for multiuser underwater acoustic communication by using the multi-chirp rate signals. It differs from the well known TDMA (Time Division Multiple Access), FDMA (Frequency Division Multiple Access) or CDMA (Code Division Multiple Access), by assigning each users with different chirp-rate carriers instead of the time, frequency or PN code. Multi-chirp rate signals can be separated from each other by FrFT (Fractional Fourier Transform), which can be regarded as the chirp-based decomposing, and superior to the match filter in the underwater acoustic channel. VTRM (Virtual Time Reverse Mirror) is applied into the system to alleviate the ISI caused by the multipatch and make the equalization more simple. Results of computer simulations and pool experiments prove that the proposed multiuser underwater acoustic communication based on the multi-chirp rate exhibit well performance. Outfield experments carrie out in Xiamen Port show that using about 10 kHz bandwidth, four users could communicate at the same time with 425 bps with low BER and can match the UAC application.

한국의 신기술 인증제도 비교 (Comparison on the Korea New Technology Certification System)

  • 송학현;최세하;김하식;김윤호
    • 한국정보통신학회논문지
    • /
    • 제7권7호
    • /
    • pp.1363-1368
    • /
    • 2003
  • 정부의 산업육성을 위한 제도 중에는 신기술 인증에 관한 제도가 있다. 우리나라 기업이 개발한 신기술을 조기에 발굴하여 우수성을 인정해 줌으로써 국산신기술의 기업화를 촉진하고, 그 기술을 이용한 제품의 신뢰성제고와 초기시장진출의 기반조성을 목적으로 각종 신기술 인증사업을 시행하고 있다. 신기술 인증사업을 시행하고 있는 정부 부처는 정보통신부, 과학기술부, 산업자원부, 건설교통부, 환경부 등 5개 부처로 동 정부부처들의 인증사업은 인증목적이나 인증신청자격이 유사한데 비해서 지정기준, 권리의 양도 양수 등에서 차이가 있고 기술의 특성에 따라 심의위원회의 운영 둥이 다르게 적용되고 있다. 이러한 정부부처별 신기술 인증사업을 비교 분석하고 바람직한 개선내용을 제안함으로서 국가신기술 인증제도의 체계를 확립할 수 있는 계기를 제시하였다.

Facial Gender Recognition via Low-rank and Collaborative Representation in An Unconstrained Environment

  • Sun, Ning;Guo, Hang;Liu, Jixin;Han, Guang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권9호
    • /
    • pp.4510-4526
    • /
    • 2017
  • Most available methods of facial gender recognition work well under a constrained situation, but the performances of these methods have decreased significantly when they are implemented under unconstrained environments. In this paper, a method via low-rank and collaborative representation is proposed for facial gender recognition in the wild. Firstly, the low-rank decomposition is applied to the face image to minimize the negative effect caused by various corruptions and dynamical illuminations in an unconstrained environment. And, we employ the collaborative representation to be as the classifier, which using the much weaker $l_2-norm$ sparsity constraint to achieve similar classification results but with significantly lower complexity. The proposed method combines the low-rank and collaborative representation to an organic whole to solve the task of facial gender recognition under unconstrained environments. Extensive experiments on three benchmarks including AR, CAS-PERL and YouTube are conducted to show the effectiveness of the proposed method. Compared with several state-of-the-art algorithms, our method has overwhelming superiority in the aspects of accuracy and robustness.

Optimization of Energy Consumption in the Mobile Cloud Systems

  • Su, Pan;Shengping, Wang;Weiwei, Zhou;Shengmei, Liu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권9호
    • /
    • pp.4044-4062
    • /
    • 2016
  • We investigate the optimization of energy consumption in Mobile Cloud environment in this paper. In order to optimize the energy consumed by the CPUs in mobile devices, we put forward using the asymptotic time complexity (ATC) method to distinguish the computational complexities of the applications when they are executed in mobile devices. We propose a multi-scale scheme to quantize the channel gain and provide an improved dynamic transmission scheduling algorithm when offloading the applications to the cloud center, which has been proved to be helpful for reducing the mobile devices energy consumption. We give the energy estimation methods in both mobile execution model and cloud execution model. The numerical results suggest that energy consumed by the mobile devices can be remarkably saved with our proposed multi-scale scheme. Moreover, the results can be used as a guideline for the mobile devices to choose whether executing the application locally or offloading it to the cloud center.

Percolation Theory-Based Exposure-Path Prevention for 3D-Wireless Sensor Networks Coverage

  • Liu, Xiaoshuang;Kang, Guixia;Zhang, Ningbo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권1호
    • /
    • pp.126-148
    • /
    • 2015
  • Different from the existing works on coverage problems in wireless sensor networks (WSNs), this paper considers the exposure-path prevention problem by using the percolation theory in three dimensional (3D) WSNs, which can be implemented in intruder detecting applications. In this paper, to avoid the loose bounds of critical density, a bond percolation-based scheme is proposed to put the exposure-path problem into a 3D uniform lattice. Within this scheme, the tighter bonds of critical density for omnidirectional and directional sensor networks under random sensor deployment-a 3D Poisson process are derived. Extensive simulation results show that our scheme generates tighter bounds of critical density with no exposure path in 3D WSNs.