• Title/Summary/Keyword: channel access delay

Search Result 275, Processing Time 0.031 seconds

Two Level Bin-Packing Algorithm for Data Allocation on Multiple Broadcast Channels (다중 방송 채널에 데이터 할당을 위한 두 단계 저장소-적재 알고리즘)

  • Kwon, Hyeok-Min
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.9
    • /
    • pp.1165-1174
    • /
    • 2011
  • In data broadcasting systems, servers continuously disseminate data items through broadcast channels, and mobile client only needs to wait for the data of interest to present on a broadcast channel. However, because broadcast channels are shared by a large set of data items, the expected delay of receiving a desired data item may increase. This paper explores the issue of designing proper data allocation on multiple broadcast channels to minimize the average expected delay time of all data items, and proposes a new data allocation scheme named two level bin-packing(TLBP). This paper first introduces the theoretical lower-bound of the average expected delay, and determines the bin capacity based on this value. TLBP partitions all data items into a number of groups using bin-packing algorithm and allocates each group of data items on an individual channel. By employing bin-packing algorithm in two step, TLBP can reflect a variation of access probabilities among data items allocated on the same channel to the broadcast schedule, and thus enhance the performance. Simulation is performed to compare the performance of TLBP with three existing approaches. The simulation results show that TLBP outperforms others in terms of the average expected delay time at a reasonable execution overhead.

Channel and Gate Workfunction-Engineered CNTFETs for Low-Power and High-Speed Logic and Memory Applications

  • Wang, Wei;Xu, Hongsong;Huang, Zhicheng;Zhang, Lu;Wang, Huan;Jiang, Sitao;Xu, Min;Gao, Jian
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.1
    • /
    • pp.91-105
    • /
    • 2016
  • Carbon Nanotube Field-Effect Transistors (CNTFETs) have been studied as candidates for post Si CMOS owing to the better electrostatic control and high mobility. To enhance the immunity against short - channel effects (SCEs), the novel channel and gate engineered architectures have been proposed to improve CNTFETs performance. This work presents a comprehensive study of the influence of channel and gate engineering on the CNTFET switching, high frequency and circuit level performance of carbon nanotube field-effect transistors (CNTFETs). At device level, the effects of channel and gate engineering on the switching and high frequency characteristics for CNTFET have been theoretically investigated by using a quantum kinetic model. This model is based on two-dimensional non-equilibrium Green's functions (NEGF) solved self - consistently with Poisson's equations. It is revealed that hetero - material - gate and lightly doped drain and source CNTFET (HMG - LDDS - CNTFET) structure can significantly reduce leakage current, enhance control ability of the gate on channel, improve the switching speed, and is more suitable for use in low power, high frequency circuits. At circuit level, using the HSPICE with look - up table(LUT) based Verilog - A models, the impact of the channel and gate engineering on basic digital circuits (inverter, static random access memory cell) have been investigated systematically. The performance parameters of circuits have been calculated and the optimum metal gate workfunction combinations of ${\Phi}_{M1}/{\Phi}_{M2}$ have been concluded in terms of power consumption, average delay, stability, energy consumption and power - delay product (PDP). In addition, we discuss and compare the CNTFET-based circuit designs of various logic gates, including ternary and binary logic. Simulation results indicate that LDDS - HMG - CNTFET circuits with ternary logic gate design have significantly better performance in comparison with other structures.

Performance Evaluation and Design of Upstream Scheduling Algorithms To Support Channel Bonding (채널 결합 기반 상향스트림 스케줄링 알고리즘 설계와 성능평가)

  • Roh, Sun-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.5
    • /
    • pp.8-18
    • /
    • 2009
  • CableLAB published DOCSIS 3.0 Specifications to supply broadband access to homes and small businesses. The primary technique of DOCSIS 3.0 Specification is channel bonding which provides cable operators with a flexible way to significantly increase up/downstream speeds. In this paper, we propose the upstream scheduler that serves channel bonding. Proposed scheduler consists of two sub-scheduler: bonding group scheduler and channel scheduler. Also, we propose three scheduling algorithms to allocate request bandwidth of CM to each bonding channel: equivalent scheduling algorithm, current request-based scheduling algorithm, and last grant-based scheduling algorithm. In order to evaluate the performance of these algorithms and DOCSIS 3.0 MAC protocol, we develop the DOCSIS 3.0 simulator with the network simulator, OPNET, to model DOCSIS network, CMTS, and CM. Our results show that equivalent scheduling algorithm is superior to others in the view of transmission delay and throughput and DOCSIS 3.0 protocol provides higher throughput than pre-DOCSIS 3.0 protocol.

Fast and Reliable Dynamic Common Channel Setup and Reconstruction Method for the Point-to-Point Communications in Military CR Networks (군용 인지 무선 네트워크 환경에서 점대점 통신을 위한 신속하고 신뢰성 있는 동적 공통 채널 설정 및 복원 방법)

  • Kim, Min-Gyu;Choi, Jae-Kark;Yoo, Sang-Jo;Jang, Young-Up;Jeong, Kilsoo;Lee, Kwang-Eog
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.11
    • /
    • pp.1112-1128
    • /
    • 2012
  • In cognitive radio networks, secondary users are allowed to utilize the channels currently not occupied by primary users opportunistically. Secondary users can communicate with each other using the commonly available channels (common channels) which may change dynamically based on the activity of the primary users. Even though many studies have dealt with cognitive radio behaviors, the detailed procedures for common channel configuration have not been paid much attention. In this paper, the fast and reliable dynamic common channel setup and reconstruction method for the point-to-point communications in military cognitive radio networks is proposed. The detailed time parameters are considered for common channel setup and reconstruction, such as the packet exchange time, channel request waiting time, and rendezvous time. Through numerical analyses, the delay and throughput performance of the proposed method is derived and evaluated.

Control Frame Design for Improvement Transmit Efficiency in the Wireless Networks (무선 네트워크에서 전송효율증대를 위한 제어프레임 설계)

  • Han, Jae-Kyun;Pyeon, Seok-Beom
    • 전자공학회논문지 IE
    • /
    • v.48 no.2
    • /
    • pp.61-70
    • /
    • 2011
  • IEEE 802.11 wireless network supports control frames like RTS/CTS(Request To Send / Clear To Send). Because they is defend to frame collection problems. It helps to solve the frame collection problem but decreases the throughput rate. Also, control frame makes False Node Problem. This problem is makes to other wireless nodes don't work and don't find channels in the same cell and near cells. We proposed a reformed new control frame for efficiency throughput rate and solution of False Node Problem. New control frame is to have added to 4 bytes of channel detection ability at the RTS frames. Channel detection ability supported to check channel at the wireless node start to transmit data frame, We expect that channel detection ability make prevent False Node Problem for increase to access number to channel. We perform comparative analysis in terms of delay(sec) and load(bits/sec) with reform RTS/CTS method which proves the efficiency of the proposed method.

Multi channel reservation scheme for underwater sensor network (수중 센서 네트워크에서 다중 채널 예약방법)

  • Lee, Dong-Won;Kim, Sun-Myeng
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.05a
    • /
    • pp.336-339
    • /
    • 2011
  • In the RTLS(Real Time Location Based System), in case of existing a number of moving target, extremely complecated data flow is can be occurred. In the network where single gateway exists, various data which was collected from sensor node is transmitted along the simple route as time goes by. In case of multi-gateway configuration, the collected data is transmitted through diverse routes rather than simple route. This kind of data causes jams on nodes and this brings down the performance of the network. Different from existing studies, in this thesis, MAC (Media Access Control) protocol which minimizes data collision between nodes and guarantees QoS(Quality of Service) is suggested, in order to communicate efficiently in multi-gateway underwater sensor network environment. In the suggested protocol, source node which wants to transmit data makes a channel reservation to a number of destination node using a RTS packet. Source node reserves a channel without collision, by scheduling CTS response time using expected delay information from neighbor nodes. Once the reservation is made, source node transmit data packet without collision. This protocol analyzes/estimates the performance compared to a method provided from existing studies via simulation. As a results of the analysis, it was comfirmed that the suggested method has better performance, such as efficiency and delay.

  • PDF

Performance Analysis of the prioritized MAC protocol under the CATV/LAN network (CATV/LAN 전송망에서 우선권 문제를 추가한 MAC프로토콜의 성능해석에 관한 연구)

  • 우상철;윤종호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1A
    • /
    • pp.81-89
    • /
    • 2000
  • In this paper, we analyzed the performance for CATV/LAN added priority problem. Upstrea nm channel which analyzed very deeply for CATV/LAN network have the preferential access property depending upon that positionand unidirectional property. To solve that fairness problem and priority, we propose the CSMA-CD/U/P-P protocolthat transmit as P1 probability if data packets happen. We assumed 2-Class priority(high, low). As the analyticresult and simulation, we obtained P1, value and its average delay time under priority problem assumed twoscenarios. Also, we get its variance value and queue length. Especially, the mean delay time increases nearer thanposition from H/E

  • PDF

A Deterministic Back-off Algorithm for Wireless Networks

  • Jin Jung-woo;Kim Kyung-Jun;Kim Dong-hwan;Lee Ho-seung;Han Ki-jun
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.310-312
    • /
    • 2004
  • Binary Exponential Back-off (BEB) scheme is widely adopted in both wire and wireless networks for collision resolution. The BEB suffers from several performance drawbacks including long packet delay and low utilization since it doubles the back-off size after each collision. In addition, operation of the BEB algorithm may lead to the last-come-first-serve result among competing users and the BEB is further unstable for every arrival rate greater than 0 due to its random access property[1,2]. In this paper, we propose a deterministic back-off algorithm to reduce contention interval as much as possible for accessing the channel without collision in the back-off process. Simulation results show that our scheme offers a higher throughput as well as a lower packet transfer delay than the BEB by taking advantage of its lower collision ratio in saturation state.

  • PDF

Consideration of Performance in Synchronization of Frequency Hopping / Code Division Multiple Access System (FH/CDMA를 위한 동기화 기술의 성능 고찰)

  • 이승대;방성일;진년강
    • The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.5 no.4
    • /
    • pp.18-29
    • /
    • 1994
  • In this paper, the performance of stepped serial search scheme and matched filter scheme for code acqusition in FH / CDMA are evaluated under land mobile radio communication channel environments. And delay lock loop scheme is used as code tracking system. As the results for code acquisition system, it is shown that the performance of stepped searial scheme is superior to matched filter scheme, because system complexity is reduced and system performance is improved by increasing the hopping frequency not to substitute for special hardware. Also, it is shown that its performance is improved under Rayleigh/ Rician fading environments. As the results for code tracking system, it is found that mean hold time is increased due to the increase of the number of lock state and hopping frequency, M.

  • PDF

A MAC Protocol for Underwater Acoustic Sensor Networks (수중 음파 센서 네트워크를 위한 매체접근제어 프로토콜)

  • Jang, Kil-Woong
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.4
    • /
    • pp.337-344
    • /
    • 2008
  • Underwater acoustic sensor networks exhibit characteristics such as high propagation delay and low data rates, which are different from those of terrestrial wireless networks. Therefore, the conventional protocols used in wireless networks can be restrictive and inefficient when applied to underwater acoustic sensor networks. In this paper, we propose a medium access control protocol (MAC) to enhance the energy efficiency and throughput in underwater acoustic sensor networks. The proposed protocol employs a slot-based competition mechanism that reserves a time slot to send a data packet in advance. In the proposed protocol, collision between nodes can occur due to competition to obtain a slot. However, the proposed protocol minimizes the collisions between nodes because the nodes store the reservation information of the neighboring nodes, this reduces unnecessary energy consumption and increases throughput. We perform a simulation to evaluate the performance of the proposed protocol with regard to the energy consumption, the number of collision, channel utilization, throughput and transmission delay. We compare the proposed protocol with the conventional protocol, and the performance results show that the proposed protocol outperforms the conventional protocol.