• Title/Summary/Keyword: Dynamic access time

Search Result 281, Processing Time 0.028 seconds

Stability Evaluation of Terminal Group for Inter-Vehicle Communication Network with an Autonomous Relay Access Scheme

  • Chamchoy, Monchai;Kojima, Fumihide;Harada, Hiroshi;Tangtisanon, Prakit;Fujise, Masayuki
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.564-567
    • /
    • 2002
  • This paper evaluates the stability of the terminal group for he inter-vehicle communication (IVC) network with an autonomous relay access scheme. Some stability criterions such as updating rate, terminal group convergence probability and total path average holding time have been conducted by computer simulation. As the results, dynamic moving of the terminal is the serious problem that can degrade the stability of the terminal group and directly affect to overall performance of the IVC network.

  • PDF

A Study on Intelligent Edge Computing Network Technology for Road Danger Context Aware and Notification

  • Oh, Am-Suk
    • Journal of information and communication convergence engineering
    • /
    • v.18 no.3
    • /
    • pp.183-187
    • /
    • 2020
  • The general Wi-Fi network connection structure is that a number of IoT (Internet of Things) sensor nodes are directly connected to one AP (Access Point) node. In this structure, the range of the network that can be established within the specified specifications such as the range of signal strength (RSSI) to which the AP node can connect and the maximum connection capacity is limited. To overcome these limitations, multiple middleware bridge technologies for dynamic scalability and load balancing were studied. However, these network expansion technologies have difficulties in terms of the rules and conditions of AP nodes installed during the initial network deployment phase In this paper, an intelligent edge computing IoT device is developed for constructing an intelligent autonomous cluster edge computing network and applying it to real-time road danger context aware and notification system through an intelligent risk situation recognition algorithm.

A Dynamic QoS Model for improving the throughput of Wideband Spectrum Sharing in Cognitive Radio Networks

  • Manivannan, K.;Ravichandran, C.G.;Durai, B. Sakthi Karthi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.3731-3750
    • /
    • 2014
  • This paper considers a wideband cognitive radio network (WCRN) which can simultaneously sense multiple narrowband channels and thus aggregate the detected available channels for transmission and studies the ergodic throughput of the WCRN that operated under: the wideband sensing-based spectrum sharing (WSSS) scheme and the wideband opportunistic spectrum access (WOSA) scheme. In our analysis, besides the average interference power constraint at PU, the average transmit power constraint of SU is also considered for the two schemes and a novel cognitive radio sensing frame that allows data transmission and spectrum sensing at the same time is utilized, and then the maximization throughput problem is solved by developing a gradient projection method. Finally, numerical simulations are presented to verify the performance of the two proposed schemes.

Assist Block for Read and Write Operations of SRAM (SRAM의 읽기 및 쓰기 동작을 위한 Assist Block)

  • Tan, Tuy Nguyen;Shon, Minhan;Choo, Hyunseung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.05a
    • /
    • pp.21-23
    • /
    • 2013
  • Static Random Access Memory (SRAM) using CMOS technology has many advantages. It does not need to refresh every certain time, as a result, the speed of SRAM is faster than Dynamic Random Access Memory (DRAM). This is the reason why SRAM is widely used in almost processors and system on chips (SoC) which require high processing speed. Two basic operations of SRAM are read and write. We consider two basic factors, including the accuracy of read and write operations and the speed of these operations. In our paper, we propose the read and write assist circuits for SRAM. By adding a power control circuit in SRAM, the write operation performed successfully with low error ratio. Moreover, the value in memory cells can be read correctly using the proposed pre-charge method.

Proposal of Network Security Solution based on Software Definition Perimeter for Secure Cloud Environment (안전한 클라우드 환경을 위한 소프트웨어 정의 경계 기반의 네트워크 보안 솔루션 제안)

  • Cha, Wuk-Jae;Shin, Jae-In;Lee, Dong-Bum;Kim, Hyeob;Lee, Dae-Hyo
    • Journal of the Korea Convergence Society
    • /
    • v.9 no.12
    • /
    • pp.61-68
    • /
    • 2018
  • As the smartphone and mobile environment develop, the time and space constraints for individual work performance are disappearing. Companies can reduce costs and expand their business quickly through cloud computing. As the use of various cloud expands, the boundaries of users, data, and applications are disappearing. Traditional security approaches based on boundaries (Perimeter) are losing their utility in the cloud environment. This paper describes the limitations of existing network access control (NAC) in a cloud environment and suggests network security technology that complements it. The study explains the SDP and combines SDP(Software Defined Perimeter) to overcome the limitations of NAC, while at the same time explaining its role as a new framework for supporting the cloud environment. The new framework proposed in this paper suggests a software-based network security solution that supports physical and software parts, providing identity-based access control, encrypted segment management, and dynamic policy management, not IP-based.

Study on Dynamic Priority Collision Resolution Algorithm in HFC-CATV Network (HFC-CATV 망에서 동적 우선순위 충돌해결알고리즘에 관한 연구)

  • Lee, Su-Youn;Chung, Jin-Wook
    • The KIPS Transactions:PartC
    • /
    • v.10C no.5
    • /
    • pp.611-616
    • /
    • 2003
  • Recently, the HFC-CATV network stand in a substructure of superhighway information network. Because of sharing up to 500 of subscribes, the Collision Resolution Algorithm needs in the upstream channel of HFC-CATV network. In order to provide Quality of Service (QoS) to users with real-time data such as voice, video and interactive service, the research of Collision Resolution Algorithm must include an effective priority scheme. In IEEE 802.14, the Collision Resolution Algorithm has high request delay because of static PNA(Priority New Access) slots structure and different priority traffics with the same probability. In order to resolve this problem, this paper proposed dynamic priority collision resolution algorithm with ternary tree algorithm. It has low request delay according to an increase of traffic load because high priority traffic first resolve and new traffic content with different probability. In the result of the simulation, it demonstrated that the proposed algorithm needs lower request delay than that of ternary tree algorithm with static PNA slots structure.

A Usage Control Model based on Context-Awareness for Mobile Devices (휴대 단말기를 위한 상황인식 기반 사용제어 모델)

  • Chang, Hye-Young;Noh, Jin-Uk;Cho, Seong-Je
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.1
    • /
    • pp.63-70
    • /
    • 2008
  • As the number of cell phone users become growing, some researchers have presented that the imprudent use of mobile phones exerts harmful influence on electronic devices such as medical appliances, takeoff and landing system of aircraft. In this paper, we propose a usage model based on context-awareness which can be applied to mobile devices. The model controls the usage of both mobile devices themselves and mobile contents according to some context information like location, time, the circumference noise, etc. The proposed usage control model includes a dynamic role-based access control approach. To show the effectiveness of the proposed model, we have implemented a prototype system on an embedded board and PC server, and evaluated the performance of the system.

Design of Security Service Model in Dynamic Cloud Environment (동적 클라우드 환경에 적합한 보안 서비스 모델 설계)

  • Jeong, Yoon-Su
    • Journal of Convergence Society for SMB
    • /
    • v.2 no.2
    • /
    • pp.35-41
    • /
    • 2012
  • The rapid development of cloud computing and mobile internet service changes to an mobile cloud service environment that can serve and pay computing source that users want anywhere and anytime. But when user misses mobile device, the respond to any threat like user's personal information exposal is insufficient. This paper proposes cloud service access control model to provide secure service for mobile cloud users to other level users. The proposed role-based model performs access authority when performs user certification to adapt various access security policy. Also, the proposed model uses user's attribute information and processes before user certification therefore it lowers communication overhead and service delay. As a result, packet certification delay time is increased 3.7% and throughput of certification server is increased 10.5%.

  • PDF

QoS Improvement Method for Real Time Traffic in Wireless Networks (무선망에서 실시간 트래픽을 위한 QoS 향상 기법)

  • Kim, Nam-Hee;Kim, Byun-Gon
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.6
    • /
    • pp.34-42
    • /
    • 2008
  • MAC(Medium Access Control) is demanded to provide end-to-end QoS(Quality of Service) for a variety of traffic in the wireless networks. When all the traffic is integrated in the channel, the main difficulty of the MAC protocol is how to efficiently support multi-class traffic in the limited bandwidth wireless channel. In this paper, we proposed the dynamic bandwidth slot method for improving QoS of the real time traffics. In this paper, we used in-band scheme to send dynamic parameter and considering buffer size and delay variation, we enabled 2 state bits to send to base station in mobile station. The proposed algorithm is to guarantee QoS of real time traffic and maximize transfer efficiency in wireless networks.

A Pseudopolynomial-time Algorithm for Solving a Capacitated Subtree of a Tree Problem in a Telecommunication System

  • Cho, Geon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.22 no.3
    • /
    • pp.485-498
    • /
    • 1996
  • For a tree T rooted at a concentrator location in a telecommunication system, we assume that the capacity H for the concentrator is given and a profit $c_v$, and a demand $d_v$, on each node $\upsilon$ of T are also given. Then, the capacitated subtree of a tree problem (CSTP) is to find a subtree of T rooted at the concentrator location so as to maximize the total profit, the sum of profits over the subtree, under the constraint satisfying that the sum of demands over the subtree does not exceed H. In this paper, we develop a pseudopolynomial-time algorithm for CSTP, the depth-first dynamic programming algorithm. We show that a CSTP can be solved by our algorithm in $\theta$ (nH) time, where n is the number of nodes in T. Our algorithm has its own advantage and outstanding computational performance incomparable with other approaches such as CPLEX, a general integer programming solver, when it is incorporated to solve a Local Access Telecommunication Network design problem. We report the computational results for the depth-first dynamic programming algorithm and also compare them with those for CPLEX. The comparison shows that our algorithm is competitive with CPLEX for most cases.

  • PDF