• Title/Summary/Keyword: End-to-End Throughput

Search Result 262, Processing Time 0.022 seconds

The Beacon Frame-Based Node Grouping Algorithm for Improving the Performance between MCT devices in the Home Wireless Network (가정 무선 네트워크 내 MCT 디바이스 간 성능 향상을 위한 Beacon frame 기반 노드 그룹화 알고리즘)

  • Kim, Gyu-Do;Kown, Young-Ho;Rhee, Byung-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.10a
    • /
    • pp.787-790
    • /
    • 2015
  • Recently, M2M (Machine to Machine) communication is possible the development of MTC (Machine Type Communication) devices becomes active. MCT devices in the form of home appliances have a low power consumption, low cost, short-range wireless communication in wireless home network. For purpose, MTC devices based on IEEE 802.15.4/Zigbee are composed in the form of cluster-tree topology, which consists of one PAN (Personal Area Network), one or other router and end of nodes. It happens that transmission delay, packet drop, and lacking data resulted from collision originated by a competition for allocating channels among MTC devices that greatly increased. At last performance of entire network can be degradated. This paper proposes that the beacon frame-based grouping algorithm using multiple channels in a MTC devices in the presence of wireless home network interference. The proposed algorithm decreases the transmission delay, dropped packet and throughput is more increase, so the proposal algorithm is more efficient than the IEEE 802.15.4/ Zigbee standard.

  • PDF

Load Balancing of Unidirectional Dual-link CC-NUMA System Using Dynamic Routing Method (단방향 이중연결 CC-NUMA 시스템의 동적 부하 대응 경로 설정 기법)

  • Suh Hyo-Joon
    • The KIPS Transactions:PartA
    • /
    • v.12A no.6 s.96
    • /
    • pp.557-562
    • /
    • 2005
  • Throughput and latency of interconnection network are important factors of the performance of multiprocessor systems. The dual-link CC-NUMA architecture using point-to-point unidirectional link is one of the popular structures in high-end commercial systems. In terms of optimal path between nodes, several paths exist with the optimal hop count by its native multi-path structure. Furthermore, transaction latency between nodes is affected by congestion of links on the transaction path. Hence the transaction latency may get worse if the transactions make a hot spot on some links. In this paper, I propose a dynamic transaction routing algorithm that maintains the balanced link utilization with the optimal path length, and I compare the performance with the fixed path method on the dual-link CC-NUMA systems. By the proposed method, the link competition is alleviated by the real-time path selection, and consequently, dynamic transaction algorithm shows a better performance. The program-driven simulation results show $1{\~}10\%$ improved fluctuation of link utilization, $1{\~}3\%$ enhanced acquirement of link, and $1{\~}6\%$ improved system performance.