• Title/Summary/Keyword: Resource share

Search Result 364, Processing Time 0.027 seconds

Resource Allocation scheme for WiMedia UWB MAC (WiMedia UWB MAC의 자원할당 방안)

  • Nam, Jungmin;Baek, Seungho;Huh, Jaedoo;Lee, Sungchang
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.2 no.1
    • /
    • pp.53-59
    • /
    • 2007
  • Wimedia UWB(Ultra-Wideband) platform provides data rates up to 480Mbps in WPAN (Wireless Personal Area Network). Wimedia conformant devices access to the channels through superframe concept for communications. As the channel resource is limited, the optimal channel time required for each device needs to be estimated to share the resource efficiently among the devices. In this paper, we propose a scheme to estimate the required channel time in a super frame to satisfy the QoS of the application on a device. The channel time is estimated from the service rate which is computed from the TSPEC of the application. In the process of the estimation, we take the frame overhead for data transmission as well as the overhead due to the acknowledgement scheme, preamble, and MDSU size into consideration. We also analyze and compare the throughputs for different acknowledgement scheme, preamble, and MDSU size situations. The estimated channel time required for a given service rate is allocated in the unit of MAS(Medium Access Slot).

  • PDF

Co-scheduling Technique of Dataflow Applications with Shared Processor Allocation (프로세서 공유를 이용한 데이터 플로우 어플리케이션의 동시 스케줄링 기법)

  • Kang, Duseok;Kang, Shinhaeng;Yang, Hoeseok;Ha, Soonhoi
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.1
    • /
    • pp.1-7
    • /
    • 2016
  • When multiple applications are running concurrently on a multi-processor system, interferences between applications make it difficult to guarantee real-time constraints. We propose a novel interference analysis technique that allows sharing of share processors among dataflow applications, while satisfying real-time constraints. Based on the interference analysis, we develop a co-scheduling technique that aims to minimize the resource usage. Compared to an existent technique that involves converting application graphs to real-time tasks, the proposed technique shows better results in terms of resource usage, especially when it is applied to applications with tight time constraints.

QoS-Guaranteed Slot Allocation Algorithm for Efficient Medium Access in HR-WPAN

  • Sung, Jung-Sik;Lee, Hyunjeong;Kang, Tae-Gyu;Huh, Jaedoo
    • ETRI Journal
    • /
    • v.37 no.6
    • /
    • pp.1242-1250
    • /
    • 2015
  • It is very important to provide a parameterized quality of service (QoS) using traffic specification (TSPEC), such as mean data rate, maximum burst size, and peak data rate, when packets from the application layer need to be transmitted with guaranteed services in a high-rate wireless personal area network (HR-WPAN). As medium resources are limited, the optimal medium time required for each device needs to be estimated to share the resources efficiently among devices. This paper proposes a variable-service interval-based resource allocation algorithm to efficiently make a reservation of medium resources based on a parameterized QoS. In other words, the proposed algorithm calculates the number of medium access slots (MASs) based on TSPEC, local resources, and local conditions and determines suitable locations for the MASs within a superframe to accommodate more devices. The simulation results show that the proposed algorithm can accommodate more devices and has greater than 10% resource allocation efficiency in an HR-WPAN compared to existing schemes.

Efficient Interference Control Technology for Vehicular Moving Networks

  • Oh, Sung-Min;Lee, Changhee;Lee, Jeong-Hwan;Park, Ae-Soon;Shin, Jae Sheung
    • ETRI Journal
    • /
    • v.37 no.5
    • /
    • pp.867-876
    • /
    • 2015
  • This paper proposes an efficient interference control scheme for vehicular moving networks. The features of the proposed scheme are as follows: radio resources are separated into two resource groups to avoid interference between the cellular and vehicle-to-vehicle (V2V) links; V2V links are able to share the same radio resources for an improvement in the resource efficiency; and vehicles can adaptively adjust their transmission power according to the interference among the V2V links (based on the distributed power control (DPC) scheme derived using the network utility maximization method). The DPC scheme, which is the main feature of the proposed scheme, can improve both the reliability and data rate of a V2V link. Simulation results show that the DPC scheme improves the average signal-to-interference-plus-noise ratio of V2V links by more than 4 dB, and the sum data rate of the V2V links by 15% and 137% compared with conventional schemes.

A Simultaneous Hardware Resource Allocation and Binding Algorithm for VLSI Design (VLSI 설계를 위한 동시수행 하드웨어 자원 할당 및 바인딩 알고리듬)

  • 최지영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.10A
    • /
    • pp.1604-1612
    • /
    • 2000
  • This paper proposes a simultaneous hardware resource allocation and binding algorithm for VLSI design. The proposed algorithm works on scheduled input graph and simultaneously allocates binds functional units, interconnections and registers by considering interdependency between operations and storage elements in each control step, in order to share registers and interconnections connected to functional units, as much as possible. Also, the register allocation is especially executes the allocation optima us-ing graph coloring techniques. Therefore the overall resource is reduced. This paper shows the effectiveness of the proposed algorithm by comparing experiments to determine number of functional unit in advance or to separate executing allocation and binding of existing system.

  • PDF

Content-Aware D2D Caching for Reducing Visiting Latency in Virtualized Cellular Networks

  • Sun, Guolin;Al-Ward, Hisham;Boateng, Gordon Owusu;Jiang, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.514-535
    • /
    • 2019
  • Information-centric networks operate under the assumption that all network components have built-in caching capabilities. Integrating the caching strategies of information centric networking (ICN) with wireless virtualization improves the gain of virtual infrastructure content caching. In this paper, we propose a framework for software-defined information centric virtualized wireless device-to-device (D2D) networks. Enabling D2D communications in virtualized ICN increases the spectral efficiency due to reuse and proximity gains while the software-defined network (SDN) as a platform also simplifies the computational overhead. In this framework, we propose a joint virtual resource and cache allocation solution for latency-sensitive applications in the next-generation cellular networks. As the formulated problem is NP-hard, we design low-complexity heuristic algorithms which are intuitive and efficient. In our proposed framework, different services can share a pool of infrastructure items. We evaluate our proposed framework and algorithm through extensive simulations. The results demonstrate significant improvements in terms of visiting latency, end user QoE, InP resource utilization and MVNO utility gain.

Economic Cooperation Plan in the Natural Resource-Based Manufacturing Industry : Focusing on historical and genetic affinity

  • Shim, Jae-Hyun;Seo, Dae-Sung
    • Asia-Pacific Journal of Business
    • /
    • v.12 no.3
    • /
    • pp.117-136
    • /
    • 2021
  • Purpose - The research is aimed at investigating the dynamics of economic cooperation among countries which share historical and genetic affinity. Research design, data, and methodology - The study analyzed historical and genetic affinity after reviewing related thesis data on countries with historical relations studied by domestic historians. After that, it was applied to the method of designating the counterparts for economic cooperation and suggesting economic cooperation measures within a comprehensive range. Results - Economic cooperation with the counterparts should complement the ongoing economic cooperation with each country among their planned national strategies. Korea proposes such matters in a way that cooperates and develops to obtain mutual economic benefits. Among the associated countries, Mongolia is for the underground resource processing industry, Turkey for the investment of companies advancing into neighboring countries, Kazakhstan for the diversification of business centered on the manufacturing industry, Uzbekistan for the modernization and diversification of industrial production, Turkmenistan for the localization of resource-based industries and Export promotion, Hungary for the increase in investment in line with the East-ward policy, Finland is for the cooperation in the knowledge-based industry. Conclusion - This economic cooperation can raise Korea's international status to the next level and further strengthen our voice right in the international community.

Entropy based Resource Allocation Scheme for Tactical Wireless Sensor Networks (전술 무선 센서 네트워크를 위한 엔트로피 기반 자원할당 기법)

  • Lee, Jongkwan;Lee, Minwoo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.220-222
    • /
    • 2021
  • In this paper, we propose a resource allocation scheme based on entropy for tactical wireless networks. In a tactical situation, the sensing nodes that are located randomly provide transmitted data values depending on environmental conditions. Since they share wireless resources, nodes providing valuable data compared to others need to have more resources. The proposed scheme evaluates the value of received data by a sink node. Based on the results, the sink node reallocates resources to sensing nodes. Through various experiments, we verified the proposed scheme is superior to the fixed allocation scheme.

  • PDF

A Secure Healthcare System Using Holochain in a Distributed Environment

  • Jong-Sub Lee;Seok-Jae Moon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.4
    • /
    • pp.261-269
    • /
    • 2023
  • We propose to design a Holochain-based security and privacy protection system for resource-constrained IoT healthcare systems. Through analysis and performance evaluation, the proposed system confirmed that these characteristics operate effectively in the IoT healthcare environment. The system proposed in this paper consists of four main layers aimed at secure collection, transmission, storage, and processing of important medical data in IoT healthcare environments. The first PERCEPTION layer consists of various IoT devices, such as wearable devices, sensors, and other medical devices. These devices collect patient health data and pass it on to the network layer. The second network connectivity layer assigns an IP address to the collected data and ensures that the data is transmitted reliably over the network. Transmission takes place via standardized protocols, which ensures data reliability and availability. The third distributed cloud layer is a distributed data storage based on Holochain that stores important medical information collected from resource-limited IoT devices. This layer manages data integrity and access control, and allows users to share data securely. Finally, the fourth application layer provides useful information and services to end users, patients and healthcare professionals. The structuring and presentation of data and interaction between applications are managed at this layer. This structure aims to provide security, privacy, and resource efficiency suitable for IoT healthcare systems, in contrast to traditional centralized or blockchain-based systems. We design and propose a Holochain-based security and privacy protection system through a better IoT healthcare system.

An Efficient Deadlock Detection Policy Using the Transitive Matrix of Resource Share Places (자원 공유 플레이스 추이적 행렬을 이용한 효율적인 교착상태 확인 정책)

  • Kim, Jong-Woog;Lee, Jong-Kun
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.3
    • /
    • pp.75-83
    • /
    • 2008
  • A deadlock is a condition in which the excessive demand for the resources being used by others causes activities to stop and it is one of the important problems in process control system to detect and prevent deadlocks. While the reachability analyze methods or divide subnets for analyzing methods are well used, it requires a lot of times and effects to analyze the detection of the deadlock status. Furthermore, it could not be effective if the model is complex or huge. Therefore, it is necessary to develop a new and more efficient deadlock detection algorithm. In this paper, a deadlock detection conditions after analyzed the Petri Net using the transitive matrix has been proposed to solve these problems. For presenting the results, the suggested deadlock detection algorithm was also adapted to an illustrated FMS (Flexible Manufacturing System) model.

  • PDF