• Title/Summary/Keyword: 패킷전송

Search Result 2,386, Processing Time 0.03 seconds

Optimal Design of Network-on-Chip Communication Sturcture (Network-on-Chip에서의 최적 통신구조 설계)

  • Yoon, Joo-Hyeong;Hwang, Young-Si;Chung, Ki-Seok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.8
    • /
    • pp.80-88
    • /
    • 2007
  • High adaptability and scalability are two critical issues in implementing a very complex system in a single chip. To obtain high adaptability and scalability, novel system design methodology known as communication-based system design has gained large attention from SoC designers. NoC (Network-on-Chip) is such an on-chip communication-based design approach for the next generation SoC design. To provide high adaptability and scalability, NoCs employ network interfaces and routers as their main communication structures and transmit and receive packetized data over such structures. However, data packetization, and routing overhead in terms of run time and area may cost too much compared with conventional SoC communication structure. Therefore, in this research, we propose a novel methodology which automatically generates a hybrid communication structure. In this work, we map traditional pin-to-pin wiring structure for frequent and timing critical communication, and map flexible and scalable structure for infrequent, or highly variable communication patterns. Even though, we simplify the communication structure significantly through our algorithm the connectivity or the scalability of the communication modules are almost maintained as the original NoC design. Using this method, we could improve the timing performance by 49.19%, and the area taken by the communication structure has been reduced by 24.03%.

A Study on the Development Plan to Increase Supplement of Voice over Internet Protocol (인터넷전화의 보급 확산을 위한 발전방안에 관한 연구)

  • Park, Jae-Yong
    • Management & Information Systems Review
    • /
    • v.28 no.3
    • /
    • pp.191-210
    • /
    • 2009
  • Internet was first designed only for sending data, but as the time passed, internet started to evolve into a broadband multi-media web that is capable of transmitting sound, video, high-capacity data and more due to the demands of internet users and the rapid changing internet-communication technology. Domestically, in January, 2000 Saerom C&T, launched a free VoIP, but due to limited ways of conversation(PC to PC) and absence of a revenue model, and bad speech quality, it had hit it's growth limit. This research studied VoIP based on technological enhancement in super-speed internet. According to IDC, domestic internet market's size was 80,800 million in 2008, and it formed a percentage of 12.5% out of the whole sound-communication market. in case of VoIP, it is able to maximize it's profit by connecting cable and wireless network, also it has a chance of becoming firm-concentrated monopoly market by fusing with IPTV. Considering the fact that our country is insignificant in MVNO revitalization, regulating organizations will play a significant roll on regulating profit between large and small businesses. Further research should be done to give VoIP a secure footing to prosper and become popularized.

  • PDF

Adaptive Collision Resolution Algorithm for Improving Delay of Services in B-WLL System (B-WLL 시스템에서 서비스 지연 향상을 위한 충돌 해소 알고리즘)

  • Ahn, Kye-Hyun;Park, Byoung-Joo;Baek, Seung-Kwon;Kim, Eung-Bae;Kim, Young-Chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.1B
    • /
    • pp.42-48
    • /
    • 2002
  • In broadband wireless networks, the effective meeting of the QoS guarantees may strongly depend on the Contention Resolution Algorithm used in the uplink contention period. The time it takes a station to transmit a successful request to the base station, or request delay, must be kept low even during periods of high contention. If a request suffers many collisions, it cannot rely on the preemptive scheduler to receive low access delays. However, the conventional collision resolution algorithm has a problem that all collided stations are treated equally regardless of their delay from previous contention periods. Some requests may have very long request delay caused by continuous collisions. In this paper, we propose an adaptive collision resolution algorithm for fast random access in broadband wireless networks. The design goal is to provide quick access to the request with a high number of collisions. To do this, the proposed algorithm separates the whole contention region into multiple sub regions and permits access through each sub region only to the requests with equal number of collisions. The sub region is adaptively created according to the feedback information of previous random access. By simulation, the proposed algorithm can improve the performance in terms of throughput, random delay and complementary distribution of random delay by its ability to isolate higher priorities from lower ones. We can notice the algorithm provides efficiency and random access delay in random access environment.

An adaptive keystream resynchronization algorithm by using address field of LAPB (LAPB의 주소 영역을 이용한 적응 난수열 재동기 알고리즘)

  • 윤장홍;이주형;황찬식;양상운
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.10
    • /
    • pp.2181-2190
    • /
    • 1997
  • The synchronous stream cipher has the problem of synchronization loss by cycle slip. Synchronization loss make the state which sender and receiver can't communicate and it may make the receiving system disordered. To lessen the risk, we usually use a continuous resynchronization which achieve resynchronization at fixed timesteps by inserting synchronization pattern and session key. While we can get effectively resynchronizationby continuous resynchronization, there are some problems. In this paper, we proposed an adaptive resynchronization algorithm for cipher system using LAPB protocol. It is able to solve the problem of the continunous resynchronization.The proposed adaptive algorithm make resynchronization only in the case that the resynchronization is occurred by analyzing the address field of LAPB. It measure the receiving rate of the address field in the decesion duration. If the receiving rate is smaller than threshold value, it make resynchronization or not. By using adaptively resynchronization, it solves the problems of continunous resynchronization. When the proposed adaptive algorithm is applied to the synchronous stream cipher system which is used in X.25 packet network, it reduced the time for resynchronization by ten times. It means that 11.3% of total data for transmit is compressed.

  • PDF

BER performance analysis of successive interference cancellation(SIC) algorithm for W-CDMA HSDPA receiver (W-CDMA HSDPA수신기의 직렬간섭제거 알고리즘의 오류율 성능해석)

  • Koo Je-Gil
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.1
    • /
    • pp.13-22
    • /
    • 2004
  • This paper drives the exact expression of bit error rate(BER) performance for successive interference cancellation(SIC) algorithm against multipath interference components in a high-speed downlink packet access(HSDPA) system of W-CDMA downlink and the BER performance is evaluated by numerical analysis. Numerical results showed that the average BER performance is rapidly saturated in terms of increasing the number of multipath and is revealed significant improvement for improvement Processing gain(PG). For example, the average BER Performance of the SIC algorithm is superior to the performance of conventional scheme by more than 7dB and 1.4dB for processing gain PG=54 and 128 under the two-path channel and average BER=$1.0{\times}10^{-3}$, respectively. This results also indicated that the average BER saturation is occurred at nearly one weight factor which is assigned to pilot and data channels. Likewise, the average BER performance is greatly degraded due to increasing the interference power in proportional to the number of multipath with increasing multicode K. And the smaller multipath fading channel gain is arrived later, the more the average BER performance is improved. The results of performance analysis in this paper indicated that the multipath interference cancellation is required to improve the BER performance in a HSDPA system under multicode for high-speed packet transmission, low spreading factor, and multipath fading channel.

A Simultaneous Compensation for the CPE and ICI in the OFDM System (OFDM 시스템에서 CPE와 ICI의 동시보상 방법)

  • Li Ying-Shan;Ryu Heung-Gyoon;Jeong Young-Ho;Hahm Young-Kown
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.15 no.12 s.91
    • /
    • pp.1152-1160
    • /
    • 2004
  • OFDM technique was adopted as the standard of IEEE 802.1 la and it has been widely used for wireless LAN, European DVB/DAB system, Korean DMB system. In the standard of IEEE 802.11a the data packet is composed of two parts, preamble and data. Preamble is composed of short pilots and long pilots, which are used for synchronization and estimation of frequency offset and channel. We can also compensate phase noise effect in the transceiver by using above pilots. The phase noise is more complicate than frequency offset and seriously affects system performance. In this paper, we newly propose CPE and ICI simultaneous compensation method to compensate phase noise generated by transceiver oscillator and compare with previous studies. As results, phase noise effect can be significantly compensated by CPE cancellation method, PNS algorithm and our proposed CPE and ICI compensation method. Especially, the proposed CPE and ICI compensation method can achieve the best BER performance compared with original OFDM, CPE cancellation method and PNS algorithm.

Implementation of Wireless Communication Module with Point-to-multipoint Media Access Control (점대다중점 매체다중접속을 지원하는 무선통신모듈의 구현)

  • Kim, June-Hwan;Jung, Jin-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.5
    • /
    • pp.267-273
    • /
    • 2012
  • The short-range communication module was developed in this paper which is suitable for the point-to-multipoint circumstances of 40 terminals communicating frequently in about 50 meters. The media access control layer of this communication module using asynchronous time-division multiplexing provides a fast and robust performance even in the worst case of simultaneous transmission events, and low packet error rate was measured a in LOS (Line-of-sight) circumstance by adding the function of acknowledge response to media access control layer. The difference test was carried out in order to measure the performance of point-to-multipoint communication. Two communication modules are respectively measured and graphed in 10 branches to 40 branches. The communication module developed in this paper showed a faster performance than the commercial Zigbee module in the specific case presented in this paper. Especially, in over 20 branches showed wide differences of the transmission speed. This results is caused by more network overhead of Zigbee whose wider applications needs the network layer and applicaiton layer besides media access control layer. Also, the asynchronous time-division multiplexing proposed in this paper are more suitable than CSMA-CA of Zigbee module when a lot of module ought to be frequently communicated in small area.

Development of Textile Fabrics Flexible Platform based Multiple Bio-Signal Central Monitoring System for Emergency Situational Awareness in High-Risk Working Environments (고위험 작업환경에서 응급상황 인지를 위한 직물형 플렉시블 플랫폼 기반의 다중 생체신호 중앙 모니터링 시스템 개발)

  • Jeon, Ki-Man;Ko, Kwang-Cheol;Lee, Hyun-Min;Kim, Young-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.12
    • /
    • pp.227-237
    • /
    • 2014
  • The purpose of this paper is to implement a multiple bio-signal central monitoring system based on textile fabrics flexible platform which can obtain and monitor bio signals(heart rate, body temperature, electrocardiography, electromyogram) of workers in special working environments and additional situational information (3-axis acceleration, temperature, humidity, illumination, surrounding image). This system can prevent various accidents that may occur in the remote work environment and provide fast and efficient response by detecting workers' situations in real-time. For it, the textile fabrics flexible platform was made as innerwear or outerwear so that it does not interfere with workers' performance while collecting bio-signal and situational information, and obtained information is sent to the central monitoring system through wireless communication. The central monitoring system is based on wireless medical telemetry service of WMTS (Wireless Medical Telemetry Service); can monitor from 2 to 32 people simultaneously; and was designed so that it can be expanded. Also, in this study, to verify performance of the WMTS communication model, packet transmission rates were compared according to the distance.

A Virtual Grouping Scheme for Improving the Performance of IEEE 802.11 Distributed Coordination Function (IEEE 802.11 DCF의 성능 향상을 위한 가상 그룹 방법)

  • 김선명;조영종
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.8
    • /
    • pp.9-18
    • /
    • 2004
  • The IEEE 802.11 Distributed Coordination Function(DCF) protocol provides a contention-based distribution channel access mechanism for stations to share the wireless medium. However, the performance of the DCF drops dramatically in terms of throughput, delay and delay jitter as the number of active stations becomes large. In this paper, we propose a simple and effective scheme, called DCF/VG(Distributed Coordination Function with Virtual Group), for improving the performance of the IEEE 802.11 DCF mechanism. In this scheme, each station independently decides the virtual group cycle using the information provided by the carrier sensing mechanism. The virtual group cycle consists of one or more virtual groups and a virtual group includes an idle period and a busy period. Each station operates in only one out of several virtual groups of the virtual group cycle and does not operate in the others. In other words, each station decreases its backoff counter and tries to transmit a packet only in its virtual group like the IEEE 802.11 DCF. Performance of the proposed scheme is investigated by numerical analysis and simulation. Numerical and simulation results show that the proposed scheme is very effective and has high throughput and low delay and jitter under a wide range of contention level.

Reducing False Alarm and Shortening Worm Detection Time in Virus Throttling (Virus Throttling의 웜 탐지오판 감소 및 탐지시간 단축)

  • Shim Jae-Hong;Kim Jang-bok;Choi Hyung-Hee;Jung Gi-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.12C no.6 s.102
    • /
    • pp.847-854
    • /
    • 2005
  • Since the propagation speed of the Internet worms is quite fast, worm detection in early propagation stage is very important for reducing the damage. Virus throttling technique, one of many early worm detection techniques, detects the Internet worm propagation by limiting the connection requests within a certain ratio.[6, 7] The typical throttling technique increases the possibility of false detection by treating destination IP addresses independently in their delay queue managements. In addition, it uses a simple decision strategy that determines a worn intrusion if the delay queue is overflown. This paper proposes a two dimensional delay queue management technique in which the sessions with the same destination IP are linked and thus a IP is not stored more than once. The virus throttling technique with the proposed delay queue management can reduce the possibility of false worm detection, compared with the typical throttling since the proposed technique never counts the number of a IP more than once when it chicks the length of delay queue. Moreover, this paper proposes a worm detection algorithm based on weighted average queue length for reducing worm detection time and the number of worm packets, without increasing the length of delay queue. Through deep experiments, it is verified that the proposed technique taking account of the length of past delay queue as well as current delay queue forecasts the worn propagation earlier than the typical iuぉ throttling techniques do.