• Title/Summary/Keyword: efficient throughput

Search Result 709, Processing Time 0.038 seconds

An Optimal Design of Double Carousel System Under Two Class Based Assignment Policy (등급별 저장방식하에서의 이중 캐로절시스템의 최적구성)

  • Kim, Chae-Soo;Hwang, Hark
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.4
    • /
    • pp.384-393
    • /
    • 2001
  • The performance of a double carousel system depends on its design and operation strategy. The two-class based assignment policy is expected to be an appropriate storage policy for its efficient operation, since it has two independently-moved carousels, lower and upper sub-carousels. This paper conducts a comparative analysis of the effects of the two-class based assignment policy and those of randomized assignment policy on the throughput of a double carousel system. We also show that, by allowing the sub-carousels not to be equal in size, a further improvement in the throughput can be obtained.

  • PDF

Throughput Based Study of UWB Receiver Modem Parameters

  • Choi, Byoung-Jo
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.2
    • /
    • pp.158-163
    • /
    • 2008
  • The MB-OFDM based UWB communication system is a personal area network specification aiming to provide 480Mbps peak data rate over 528 MHz spectrum. As the corresponding baseband modem operates at high clock rate, its complexity should be optimized for low power consumption. A set of modem design parameters is suggested including the AD bit width, the clipping level and the quantization level at the Viterbi decoder input as well as the trace-back depth of the Viterbi decoder. The data throughput is used to evaluate the performance of the receiver and a recommended set of design parameter values is presented to aid efficient modem implementation.

An Implementation of Acoustic-based MAC Protocol Multichannel Underwater Communication Network

  • Lim, Yong-Kon;Park, Jong-Won;Kim, Chun-Suk;Lee, Young-Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.1 no.1
    • /
    • pp.105-111
    • /
    • 1997
  • This Paper Proposes a new efficient system design strategies for the acoustic-based underwater multiple modem and media access control protocol. The system aims to establish the acoustic-based communication network of an underwater vehicles for deep sea mining, which ensures a certain level of maximum throughput regardless of the propagation delay of acoustic and allows fast data transmission through the acoustic-based multiple channel. A media access control protocol for integrated communication network and it's acoustic-based communication modems that allows 'peer-to-peer' communication between a surface mining plant multiple underwater system is designed, and the proposed media access control protocol is implemented for its verification. Furthermore, a proposed design strategies which make it possible to control the multiple vehicle for an underwater mining is presented in this paper.

  • PDF

A Multi-Dimensional Radio Resource Scheduling Scheme for MIMO-OFDM Wireless Systems

  • Li, Lei;Niu, Zhisheng
    • Journal of Communications and Networks
    • /
    • v.8 no.4
    • /
    • pp.401-409
    • /
    • 2006
  • Orthogonal frequency division multiplexing (OFDM) and multiple input multiple output (MIMO) technologies provide additional dimensions of freedom with spectral and spatial resources for radio resource management. Multi-dimensional radio resource management has recently been identified to exploit the full dimensions of freedom for more flexible and efficient utilization of scarce radio spectrum while provide diverse quality of service (QoS) guarantees. In this work, a multi-dimensional radio resource scheduling scheme is proposed to achieve above goals in hybrid orthogonal frequency division multiple access (OFDMA) and space division multiple access (SDMA) systems. Cochannel interference (CCI) introduced by frequency reuse under SDMA is eliminated by frequency division and time division between highly interfered users. This scheme maximizes system throughput subjected to the minimum data rate guarantee. for heterogeneous users and transmit power constraint. By numerical examples, system throughput and fairness superiority of the our scheduling scheme are verified.

Analysis on MIMO Transmit Diversity Techniques for Ship Ad-hoc Network under a Maritime Channel Model in Coastline Areas

  • Ahmad, Ishtiaq;Chang, KyungHi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.2
    • /
    • pp.383-385
    • /
    • 2017
  • For the purpose of providing high data rate real-time services, radio transmission technologies for ship ad-hoc network based on the Recommendation ITU-R 1842-1 are designed. In order to increase the link throughput of real-time services, in this paper, we investigate the performance of the SANET with the spatial transmit diversity techniques are employed. Based on the analysis of the packet error rate and throughput, we select the efficient multiple antenna schemes for SANET to improve the link reliability.

Soft Fault Detection Using an Improved Mechanism in Wireless Sensor Networks

  • Montazeri, Mojtaba;Kiani, Rasoul
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4774-4796
    • /
    • 2018
  • Wireless sensor networks are composed of a large number of inexpensive and tiny sensors used in different areas including military, industry, agriculture, space, and environment. Fault tolerance, which is considered a challenging task in these networks, is defined as the ability of the system to offer an appropriate level of functionality in the event of failures. The present study proposed an intelligent throughput descent and distributed energy-efficient mechanism in order to improve fault tolerance of the system against soft and permanent faults. This mechanism includes determining the intelligent neighborhood radius threshold, the intelligent neighborhood nodes number threshold, customizing the base paper algorithm for distributed systems, redefining the base paper scenarios for failure detection procedure to predict network behavior when running into soft and permanent faults, and some cases have been described for handling failure exception procedures. The experimental results from simulation indicate that the proposed mechanism was able to improve network throughput, fault detection accuracy, reliability, and network lifetime with respect to the base paper.

An Efficient Scheduling for Input Queued Switch (입력큐 교환기를 위한 스케줄링기법)

  • Lee, Sang-Ho;Shin, Dong-Ryeol
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.12
    • /
    • pp.58-66
    • /
    • 2001
  • Input queueing is useful for high bandwidth switches and routers because of lower complexity and fewer circuits than output queueing. The input queueing switch, however, suffers HOL-Blocking, which limits the throughput to 58%. To get around this low throughput, many input queueing switches have centralized scheduler, which centralized scheduler restrict the design of the switch architecture. To overcome this problem, we propose a simple scheduler called PRR(Pipelined Round Robin), which is intrinsically distributed and presents to show the effectiveness of the proposed scheduling.

  • PDF

P2P Streaming Media Node Selection Strategy Based on Greedy Algorithm

  • Gui, Yiqi;Ju, Shuangshuang;Choi, Hwangkyu
    • Journal of IKEEE
    • /
    • v.22 no.3
    • /
    • pp.570-577
    • /
    • 2018
  • With the increasing number of network nodes, traditional client/server node selection mechanisms are under tremendous pressure. In order to select efficient cooperative nodes in a highly dynamic P2P network topology, this article uses greedy algorithm to translate the overall optimization into multiple local optimal problems, and to quickly select service nodes. Therefore, the service node with the largest comprehensive capacity is selected to reduce the transmission delay and improve the throughput of the service node. The final simulation results show that the node selection strategy based on greedy algorithm can effectively improve the overall performance of P2P streaming media system.

Efficient Multicast Tree Construction in Wireless Mesh Networks

  • Nargesi, Amir-Abbas;Bag-Mohammadi, Mozafar
    • Journal of Communications and Networks
    • /
    • v.16 no.6
    • /
    • pp.613-619
    • /
    • 2014
  • Multicast routing algorithms designed for wireline networks are not suitable for wireless environments since they cannot efficiently exploit the inherent characteristics of wireless networks such as the broadcast advantage. There are many routing protocols trying to use these advantages to decrease the number of required transmissions or increase the reception probability of data (e.g., opportunistic routing).Reducing the number of transmissions in a multicast tree directly decreases the bandwidth consumption and interference and increases the overall throughput of the network. In this paper, we introduce a distributed multicast routing protocol for wireless mesh networks called NCast which take into account the data delivery delay and path length when constructing the tree. Furthermore, it effectively uses wireless broadcast advantage to decrease the number of forwarding nodes dynamically when a new receiver joins the tree.Our simulation results show that NCast improves network throughput, data delivery ratio and data delivery delay in comparison with on demand multicast routing protocol. It is also comparable with multichannel multicast even though it does not use channeling technique which eliminates the interference inherently.

Efficient Channel Assignment Scheme Based on Finite Projective Plane Theory

  • Chen, Chi-Chung;Su, Ing-Jiunn;Liao, Chien-Hsing;Woo, Tai-Kuo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.628-646
    • /
    • 2016
  • This paper proposes a novel channel assignment scheme that is based on finite projective plane (FPP) theory. The proposed scheme involves using a Markov chain model to allocate N channels to N users through intermixed channel group arrangements, particularly when channel resources are idle because of inefficient use. The intermixed FPP-based channel group arrangements successfully related Markov chain modeling to punch through ratio formulations proposed in this study, ensuring fair resource use among users. The simulation results for the proposed FPP scheme clearly revealed that the defined throughput increased, particularly under light traffic load conditions. Nevertheless, if the proposed scheme is combined with successive interference cancellation techniques, considerably higher throughput is predicted, even under heavy traffic load conditions.