• Title/Summary/Keyword: efficient throughput

Search Result 709, Processing Time 0.031 seconds

WDMA protocol with collision avidance for high speed optical networks (고속 광통신망에서 충돌 회피를 위한 파장 분할 다중 액세스 프로토콜)

  • 이호숙;최형원;박성우;김영천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.3
    • /
    • pp.664-674
    • /
    • 1996
  • In high speed multi-wavelength networks, retransmission overhead due to desination conflict or control packet collision is one factor of performance degration because signal prpagation delay is much larger than the transmission time of data packet. In this paper, an efficient WDMA protocol with a collision avoidance mechanism is proposed for high speed WDM single-hop network with a passive star topology. In proposed protocol, each node has cource queues and routing table to store souting informatio. This architecture makes is possible to avoid any kind of collision when a node reserves the channel to transmit a data packet. High system thoughput and channel utilization can be achieved by proposed protocol since there are no discarded packets caused by any collision at transmission time. The performance of proposed protocol is evaluated in term of throughput and delay with variations in offered load. Simulation results show that the proposed protocol has superior performance to convertional protocols under nonuniform traffic as well as uniform traffic.

  • PDF

Smart Grid Cooperative Communication with Smart Relay

  • Ahmed, Mohammad Helal Uddin;Alam, Md. Golam Rabiul;Kamal, Rossi;Hong, Choong Seon;Lee, Sungwon
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.640-652
    • /
    • 2012
  • Many studies have investigated the smart grid architecture and communication models in the past few years. However, the communication model and architecture for a smart grid still remain unclear. Today's electric power distribution is very complex and maladapted because of the lack of efficient and cost-effective energy generation, distribution, and consumption management systems. A wireless smart grid communication system can play an important role in achieving these goals. In this paper, we describe a smart grid communication architecture in which we merge customers and distributors into a single domain. In the proposed architecture, all the home area networks, neighborhood area networks, and local electrical equipment form a local wireless mesh network (LWMN). Each device or meter can act as a source, router, or relay. The data generated in any node (device/meter) reaches the data collector via other nodes. The data collector transmits this data via the access point of a wide area network (WAN). Finally, data is transferred to the service provider or to the control center of the smart grid. We propose a wireless cooperative communication model for the LWMN.We deploy a limited number of smart relays to improve the performance of the network. A novel relay selection mechanism is also proposed to reduce the relay selection overhead. Simulation results show that our cooperative smart grid (coopSG) communication model improves the end-to-end packet delivery latency, throughput, and energy efficiency over both the Wang et al. and Niyato et al. models.

A Performance Enhancement Scheme for Heterogeneous Network Systems Utilizing Remote Radio Heads (원격송신국을 활용하는 이종 네트워크 시스템의 성능 개선 방안)

  • Yoo, Hyung-Gil;Sung, Won-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.1B
    • /
    • pp.31-38
    • /
    • 2012
  • In this paper, we propose a method to improve cell edge users' performance in HetNet (heterogeneous network) systems by cooperatively transmitting signals using remote radio heads (RRHs) located near coverage boundaries, referred to as edge RRHs. The proposed method locates the edge RRHs in specific locations of the cell boundary and provides an efficient operational strategy by adjusting the duty cycle of the edge RRHs and base stations. The effectiveness of the method is demonstrated by experimental performance based on the system model parameters of the CoMP (coordinated multi-point transmission and reception) scenario, which is discussed in LTE-Advanced (Long Term Evolution - Advanced) standard contributions. When compared with conventional methods, utilization of edge RRHs is especially advantageous for the performance improvement of lower percentile users in terms of average throughput and effectively improves the fairness among users.

Grid Resource Selection System Using Decision Tree Method (의사결정 트리 기법을 이용한 그리드 자원선택 시스템)

  • Noh, Chang-Hyeon;Cho, Kyu-Cheol;Ma, Yong-Beom;Lee, Jong-Sik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.1
    • /
    • pp.1-10
    • /
    • 2008
  • In order to high-performance data Processing, effective resource selection is needed since grid resources are composed of heterogeneous networks and OS systems in the grid environment. In this paper. we classify grid resources with data properties and user requirements for resource selection using a decision tree method. Our resource selection method can provide suitable resource selection methodology using classification with a decision tree to grid users. This paper evaluates our grid system performance with throughput. utilization, job loss, and average of turn-around time and shows experiment results of our resource selection model in comparison with those of existing resource selection models such as Condor-G and Nimrod-G. These experiment results showed that our resource selection model provides a vision of efficient grid resource selection methodology.

  • PDF

A Cache Consistency Control for B-Tree Indices in a Database Sharing System (데이타베이스 공유 시스템에서 B-트리 인덱스를 위한 캐쉬 일관성 제어)

  • On, Gyeong-O;Jo, Haeng-Rae
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.593-604
    • /
    • 2001
  • A database sharing system (DSS) refers to a system for high performance transaction processing. In the DSS, the processing nodes are coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches data pages and index pages in its memory buffer. In general, B-tree index pages are accessed more often and thus cached at more processing nodes, than their corresponding data pages. There are also complicated operations in the B-tree such as Fetch, Fetch Next, Insertion and Deletion. Therefore, an efficient cache consistency scheme supporting high level concurrency is required. In this paper, we propose cache consistency schemes using identifiers of index pages and page_LSN of leaf page. The propose schemes can improve the system throughput by reducing the required message traffic between nodes and index re-traversal.

  • PDF

Performances of wireless ATM cell transmission with partial concatenated coding (무선 ATM셀 전송을 위한 부분 연쇄 부호화 기법의 성능분석)

  • 이진호;김태중;이동도;안재영;황금찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.9
    • /
    • pp.2014-2026
    • /
    • 1997
  • In this paper, the performances of wireless asynchronous transfer mode (ATM) cell transmission in mobile work are analyzed. We adopt 16Star QAM as amodulation technique in wireless channel and considered Reed-Solomon, convolutional, and concatenated coding to improve the error rate performances, and also proposed the Partial Concatenated Coding (PCC) technique as UEP(unequal error protection) code for efficient transmission of ATM cell in the air interface. We consider Doppler's effect, Rician fading, and diversity technique of maximal-ratio combining (MRC) for mobile channel model. For performance measure, we analyze bit error rate, ATM cell loss probability, ATM cell error probability, and network performances of ATM cell transmission delay and throughput. The numerical results show that the adoption of PCC is a prospective way for the evolution of future wireless ATM network on mobile environment.

  • PDF

An Analysis for the Efficient Dissemination of Beacon Messages in Vehicle-to-Vehicle (V2V) Communications (자동차 간 통신에서 비컨 메시지의 효율적인 방송을 위한 성능 분석)

  • Nguyen, Hoa-Hung;Bhawiyuga, Adhitya;Jeong, Han-You
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6C
    • /
    • pp.483-491
    • /
    • 2012
  • In vehicle-to-vehicle (V2V) communications, each vehicle should periodically disseminate a beacon message including the kinematics information, such as position, speed, steering, etc., so that a neighbor vehicle can better perceive and predict the movement of the vehicle. However, a simple broadcasting of such messages may lead to a low reception probability as well as an excessive delay. In this paper, we attempt to analyze the impact of the following key parameters of the beacon dissemination on the performance of vehicular networks: beacon period, carrier-sensing range, and contention window (CW) size. We first derive a beacon period which is inversely proportional to the vehicle speed. Next, we mathematically formulate the maximum beacon load to demonstrate the necessity of the transmit power control. We finally present an approximate closed-form solution of the optimal CW size that leads to the maximum throughput of beacon messages in vehicular networks.

Efficient Relay Selection Algorithm Using S-MPR for Ad-Hoc Networks Based on CSMA/CA (CSMA/CA 기반 애드혹 네트워크에서 S-MPR을 이용한 효율적인 중계 노드 선택 알고리즘)

  • Park, Jong-Ho;Oh, Chang-Yeong;Ahn, Ji-Hyoung;Seo, Myung-Hwan;Cho, Hyung-Weon;Lee, Tae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.8B
    • /
    • pp.657-667
    • /
    • 2012
  • In the MPR selection algorithm of Optimized Link State Routing (OLSR), each node selects own MPRs independently, so most of nodes are selected to MPR at least once. To cope with this problem, the MPR candidate selection algorithm was proposed. The MPR candidate selection algorithm can reduce the number of MPRs, but the efficiencies of route and connectivity decline due to decreased number of MPRs. So, in this paper, we propose the Significant Multi-Point Relay (S-MPR) selection algorithm which can enhance the performance of ad hoc network by improving the MPR selection algorithm of OLSR. In proposed S-MPR selection algorithm, each node selects the most important node to S-MPR to guarantee the connectivity then selects remaining MPRs in MPR candidates. So proposed S-MPR selection algorithm can reduce the overhead of many MPRs without decline of routing performance. To show the performance gain of proposed S-MPR selection algorithm, we simulate the proposed S-MPR selection algorithm by using OPNET.

A Cache Hit Ratio based Power Consumption Model for Wireless Mesh Networks (무선 메쉬 네트워크를 위한 캐시 적중률 기반 파워 소모 모델)

  • Jeon, Seung Hyun;Seo, Yong-jun
    • Journal of Industrial Convergence
    • /
    • v.18 no.2
    • /
    • pp.69-75
    • /
    • 2020
  • Industrial IoT has much interested in wireless mesh networks (WMNs) due to cost effectiveness and coverage. According to the advance in caching technology, WMNs have been researched to overcome the throughput degradation of multihop environment. However, there is few researches of cache power consumption models for WMNs. In particular, a wired line based cache power consumption model in content-centric networks is not still proper to WMNs. In this paper, we split the amount of cache power from the idle power consumption of CPU, and then the cache hit ratio proportional power consumption model (CHR-model) is proposed. The proposed CHR-model provides more accurate power consumption in WMNs, compared with the conventional cache power efficiency based consumption model (CPE-model). The proposed CHR-model can provide a reference model to improve energy-efficient cache operation for Industrial IoT.

Fuzzy Logic-driven Virtual Machine Resource Evaluation Method for Cloud Provisioning Service (클라우드 프로비저닝 서비스를 위한 퍼지 로직 기반의 자원 평가 방법)

  • Kim, Jae-Kwon;Lee, Jong-Sik
    • Journal of the Korea Society for Simulation
    • /
    • v.22 no.1
    • /
    • pp.77-86
    • /
    • 2013
  • Cloud computing is one of the distributed computing environments and utilizes several computing resources. Cloud environment uses a virtual machine to process a requested job. To balance a workload and process a job rapidly, cloud environment uses a provisioning technique and assigns a task with a status of virtual machine. However, a scheduling method for cloud computing requires a definition of virtual machine availabilities, which have an obscure meaning. In this paper, we propose Fuzzy logic driven Virtual machine Provisioning scheduling using Resource Evaluation(FVPRE). FVPRE analyzes a state of every virtual machine and actualizes a value of resource availability. Thus FVPRE provides an efficient provisioning scheduling with a precise evaluation of resource availability. FVPRE shows a high throughput and utilization for job processing on cloud environments.