• Title/Summary/Keyword: System Throughput.

Search Result 1,746, Processing Time 0.027 seconds

Improving RFID Anti-Collision Algorithms with Multi-Packet Reception (다중 패킷 수신을 이용한 RFID 충돌방지 알고리즘의 성능 향상)

  • Lee, Jeong-Keun;Kwon, Taek-Young;Choi, Yang-Hee;Kim, Kyung-Ah
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.11A
    • /
    • pp.1130-1137
    • /
    • 2006
  • One of the important performance issues in large-scale RFID systems is to resolve collisions among responses from RFID tags. Considering two do facto anti-collision solutions, namely the binary-tree splitting algorithm and the Slotted-Aloha algorithm, we propose to use multi-packet reception (MPR) capability to enhance the RFID tag reading rate (i.e., throughput). MPR allows an RFID reader to receive multiple reponses transmitted by tags at the same time. We analyze the effect of MPR capability in the above anti-collision algorithms, which is also validated by simulation. The analysis and simulation results show that RFID reader antenna design and signal separation techniques play an important role in improving RFID system performance with MPR capability.

Frequency-Code Domain Contention in Multi-antenna Multicarrier Wireless Networks

  • Lv, Shaohe;Zhang, Yiwei;Li, Wen;Lu, Yong;Dong, Xuan;Wang, Xiaodong;Zhou, Xingming
    • Journal of Communications and Networks
    • /
    • v.18 no.2
    • /
    • pp.218-226
    • /
    • 2016
  • Coordination among users is an inevitable but time-consuming operation in wireless networks. It severely limit the system performance when the data rate is high. We present FC-MAC, a novel MAC protocol that can complete a contention within one contention slot over a joint frequency-code domain. When a node takes part in the contention, it generates randomly a contention vector (CV), which is a binary sequence of length equal to the number of available orthogonal frequency division multiplexing (OFDM) subcarriers. In FC-MAC, different user is assigned with a distinct signature (i.e., PN sequence). A node sends the signature at specific subcarriers and uses the sequence of the ON/OFF states of all subcarriers to indicate the chosen CV. Meanwhile, every node uses the redundant antennas to detect the CVs of other nodes. The node with the minimum CV becomes the winner. The experimental results show that, the collision probability of FC-MAC is as low as 0.05% when the network has 100 nodes. In comparison with IEEE 802.11, contention time is reduced by 50-80% and the throughput gain is up to 200%.

Symbol Based Rate Adaptation in Coded MIMO-OFDM Systems (심볼 기반의 적응 변조 기법을 이용한 채널 부호화된 MIMO-OFDM 시스템)

  • Sung, Chang-Kyung;Kim, Ji-Hoon;Lee, In-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1A
    • /
    • pp.50-58
    • /
    • 2008
  • The use of space-division multiple access(SDMA) in the downlink of multiuser multi-input/multi-output(MIMO) wireless transmission systems can provide substantial gains in system throughput. When the channel state information(CSI) is available at the transmitter, a considerable performance improvement can be attained by adapting the transmission rates to the reported CSI. In addition, to combat frequency selective fadings in wideband wireless channels, bit-interleaved coded OFDM(BIC-OFDM) modulation schemes are employed to provide reliable packet delivery by utilizing frequency diversity through channel coding. In this paper, we propose an adaptive modulation and coding(AMC) scheme combined with an opportunistic scheduling technique for the MIMO BIC-OFDM with bandwidth-limited feedback channels. The proposed scheme enhances the link performance by exploiting both the frequency diversity and the multiuser diversity. To reduce the feedback information, the proposed AMC scheme employs rate adaptation methods based on an OFDM symbol rather than on the whole subchannels. Simulation results show that the proposed scheme exhibits a substantial performance gain with a reasonable complexity over single antenna systems.

On the Analysis of Transportation Process of Pusan Port (시뮬레이션에 의한 부산항만 운송과정의 분석에 관하여)

  • 박계각
    • Journal of the Korean Institute of Navigation
    • /
    • v.10 no.1
    • /
    • pp.101-127
    • /
    • 1986
  • Transportation provides an infrastructure vital to economic growth, and it is an integral part of production . As a port is the interface between the maritime transport and domestic transport sectors, it certainly plays a key role in any economic development. Therefore, it is doubtless that inadequacy of a nation's port will depress the level of throughput, to the level where it fails to meet the target set by the national economic planning schemes. Korea is surrounded by the seas and the economic structure of Korea consists of processing trades, so that it cannot be overstated that substantial economy in maritime transport coasts can be achieved through the improvement of the port transport system. This paper treats the transportation process in Pusan Port by Queueing Simulation method, and the reasonable size of Pusan Port is suggested from the point of view of efficiency maximization. The results of the analysis are summarized as follows; 1) the utility rate is 47.91 percents in general piers, 85-52 percents in container piers, and waiting time 5.2hrs, in general piers, 0.8 hrs, in container piers, and the probability of maximum queue length 12 ships in general piers, 2 ships in container piers, and the probability of waiting is 44 percents in general piers, 8 percents in container pier. 2) in general piers, the improvement of app. 30 percents in port capacity is desirable for operating effectively concerning the current arrival rate. By introducing the traffic control ion container piers, there is no apparent necessity of port investment, but I is expected to reduce invisible congestion occurred along the waiting line. 3) On Pusan Port, the optimal utility rate and the optimal arrival rate for reducing waiting time are 3.5 to 4.0(hrs./ship) in general piers, 5.1 to 6.0(hrs./ship) in container piers.

  • PDF

A research on the development of Lianyungang port (중국 연운항항 발전방향)

  • Ma, Chang-Ming;Jo, So-Hee;Nam, Ki-Chan
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2009.10a
    • /
    • pp.206-207
    • /
    • 2009
  • It is estimated that the potential of Chinese market is infinite. The success of Chinese economic reformation is generating the high economic growth in China. China is a rising logistics market as its growing throughput and port expansion but China's railway transportation system is not well-linked with ports. China built TCR(Trans-China Railway) which is across the Chinese territory and connected to as far as Europe. With this mode, it is possible to place more overseas freight and meet more customers' needs. Lian yun gang is a city on the East coast of China where the commencing station of TCR is located. This paper reviews the present conditions of Lianyungang and presents the development direction of the city to become a logistics point.

  • PDF

A Vertical Partitioning Algorithm based on Fuzzy Graph (퍼지 그래프 기반의 수직 분할 알고리즘)

  • Son, Jin-Hyun;Choi, Kyung-Hoon;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.28 no.3
    • /
    • pp.315-323
    • /
    • 2001
  • The concept of vertical partitioning has been discussed so far in an objective of improving the performance of query execution and system throughput. It can be applied to the areas where the match between data and queries affects performance, which includes partitioning of individual files in centralized environments, data distribution in distributed databases, dividing data among different levels of memory hierarchies, and so on. In general, a vertical partitioning algorithm should support n-ary partitioning as well as a globally optimal solution for the generation of all meaningful fragments. Most previous methods, however, have some limitations to support both of them efficiently. Because the vertical partitioning problem basically includes the fuzziness property, the proper management is required for the fuzziness problem. In this paper we propose an efficient vertical $\alpha$-partitioning algorithm which is based on the fuzzy theory. The method can not only generate all meaningful fragments but also support n-ary partitioning without any complex mathematical computations.

  • PDF

OXC structure for MPλS merging implementation based on WDM network (WDM망 기반의 MPλS merging 구현을 위한 OXC 구조)

  • Kim, Kyeong-Mok;Cho, Yang-Hyuon;Oh, Young-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3B
    • /
    • pp.183-190
    • /
    • 2003
  • The explosion of the Internet has brought an acute need for efficient operation, which becomes to develop several technologies based on optical networks. By matching merging technology using wavelength multiplexing, an efficient administration with limited wavelength can provide scalability of network. The merging in optical layer has limitation of devices since the merging can not be performed in this layer. Hence the merging must be implemented in electronic layer. When the merging is implemented, the delay time would be increased in OXC (Optical Cross Connection), but the improvement of throughput rate will be expected in the process of explosive traffic due to reduction of optical channel supporting large bandwidth. In this thesis, we proposed an OXC of dual module having a merging function. We considered the optimum merging point with the largest in system performance and confirmed results using the simulation.

Content Delivery Network Based on MST Algorithm (MST 알고리즘 기반 콘텐츠 전송 네트워크에 관한 연구)

  • Lee, Hyung-ok;Kang, Mi-young;Nam, Ji-seung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.2
    • /
    • pp.178-188
    • /
    • 2016
  • The traffic in the wired and wireless networks has increased exponentially because of increase of smart phone and improvement of PC performance. Multimedia services and file transmission such as Facebook, Youtube occupy a large part of the traffic. CDN is a technique that duplicates the contents on a remote web server of content provider to local CDN servers near clients and chooses the optimal CDN server for providing the content to the client in the event of a content request. In this paper, the content request message between CDN servers and the client used the SCRP algorithm utilizing the MST algorithm and the traffic throughput was optimized. The average response time for the content request is reduced by employing HC_LRU cache algorithm that improves the cache hit ratio. The proposed SCRP and HC_LRU algorithm may build a scalable content delivery network system that efficiently utilizes network resources, achieves traffic localization and prevents bottlenecks.

454 Pyrosequencing Analysis of Bacterial Diversity Revealed by a Comparative Study of Soils from Mining Subsidence and Reclamation Areas

  • Li, Yuanyuan;Chen, Longqian;Wen, Hongyu;Zhou, Tianjian;Zhang, Ting;Gao, Xiali
    • Journal of Microbiology and Biotechnology
    • /
    • v.24 no.3
    • /
    • pp.313-323
    • /
    • 2014
  • Significant alteration in the microbial community can occur across reclamation areas suffering subsidence from mining. A reclamation site undergoing fertilization practices and an adjacent coal-excavated subsidence site (sites A and B, respectively) were examined to characterize the bacterial diversity using 454 high-throughput 16S rDNA sequencing. The dominant taxonomic groups in both the sites were Proteobacteria, Acidobacteria, Bacteroidetes, Betaproteobacteria, Actinobacteria, Gammaproteobacteria, Alphaproteobacteria, Deltaproteobacteria, Chloroflexi, and Firmicutes. However, the bacterial communities' abundance, diversity, and composition differed significantly between the sites. Site A presented higher bacterial diversity and more complex community structures than site B. The majority of sequences related to Proteobacteria, Gemmatimonadetes, Chloroflexi, Nitrospirae, Firmicutes, Betaproteobacteria, Deltaproteobacteria, and Anaerolineae were from site A; whereas those related to Actinobacteria, Planctomycetes, Bacteroidetes, Verrucomicrobia, Gammaproteobacteria, Nitriliruptoria, Alphaproteobacteria, and Phycisphaerae originated from site B. The distribution of some bacterial groups and subgroups in the two sites correlated with soil properties and vegetation due to reclamation practice. Site A exhibited enriched bacterial community, soil organic matter (SOM), and total nitrogen (TN), suggesting the presence of relatively diverse microorganisms. SOM and TN were important factors shaping the underlying microbial communities. Furthermore, the specific plant functional group (legumes) was also an important factor influencing soil microbial community composition. Thus, the effectiveness of 454 pyrosequencing in analyzing soil bacterial diversity was validated and an association between land ecological system restoration, mostly mediated by microbial communities, and an improvement in soil properties in coal-mining reclamation areas was suggested.

A Study on Adaptive Parallel Computability in Many-Task Computing on Hadoop Framework (하둡 기반 대규모 작업처리 프레임워크에서의 Adaptive Parallel Computability 기술 연구)

  • Jik-Soo, Kim
    • Journal of Broadcast Engineering
    • /
    • v.24 no.6
    • /
    • pp.1122-1133
    • /
    • 2019
  • We have designed and implemented a new data processing framework called MOHA(Mtc On HAdoop) which can effectively support Many-Task Computing(MTC) applications in a YARN-based Hadoop platform. MTC applications can be composed of a very large number of computational tasks ranging from hundreds of thousands to millions of tasks, and each MTC application may have different resource usage patterns. Therefore, we have implemented MOHA-TaskExecutor(a pilot-job that executes real MTC application tasks)'s Adaptive Parallel Computability which can adaptively execute multiple tasks simultaneously, in order to improve the parallel computability of a YARN container and the overall system throughput. We have implemented multi-threaded version of TaskExecutor which can "independently and dynamically" adjust the number of concurrently running tasks, and in order to find the optimal number of concurrent tasks, we have employed Hill-Climbing algorithm.