• 한국멀티미디어학회논문지
• /
• 제9권7호
• /
• pp.844-853
• /
• 2006

미래 근거리망, 도시망 및 광역망을 위해 최근에 표준화된 IEEE 802.17 레질런트 패킷링의 공정성 제어 방식은 비대칭 과부하에서 지연지터 특성을 악화시키고 대역폭 손실까지 초래하는 문제점을 갖고 이다. 본 논문은 이러한 문제를 해결하기 위해 기존 방식과 호환성을 유지하는 대역폭 재분배 기반 공정성 제어 방식을 제안한다. 제안된 방식에서 체증노드는 상단노드들의 병목링크 사용을 통제한 결과 얻어지는 병목링크의 가용 대역폭을 측정하고 대역폭이 더 필요한 상단노드의 수를 추정하여 최적 공정속도를 계산하며, 계산된 공정속도를 상단노드로 통보하여 가용 대역폭을 재분배 한다. 성능평가 결과 단 2회의 재분배 시도로 가용 대역폭의 95%를 공평하게 분배하였다.

• Journal of electromagnetic engineering and science
• /
• 제3권1호
• /
• pp.50-56
• /
• 2003

This paper proposes a coding scheme of control channel for mobile packet communication to maximize the minimum Hamming distance, which is based on shifting of basis vectors of Reed Muller code with optimized dynamic puncturing and/or(partial) sequence repetition. Since the maximum likelihood decoding can be performed using the extremely simple FHT(Fast Hadamard Transformation), it is suitable for real time optimum decoding of control channel information with very little complexity. We show applications of the proposed coding method to TFCI(Transport Format Combination Indicator) code in split and normal modes of 3GPP W-CDMA system. We also discuss how this method can reduce rate indication error over AWGN(Additive White Gaussian Noise) as well as fading channels when the proposed coding scheme is applied to 1xEV-DV system of $3^{rd}$TEX> generation partnership project 2(3GPP2) to indicate the data rate transmitted on the reverse traffic channel by a Mobile Station(MS).

• 한국컴퓨터정보학회논문지
• /
• 제7권1호
• /
• pp.112-119
• /
• 2002

본 논문에서는 계수분할을 이용한 개선된 웨이블릿 패킷 영상 부호화 알고리듬을 제안한다. 제안된 알고리듬은 전체 압축시간을 단축을 위해 엔트로피를 이용하여 영상을 웨이블릿 패킷 분할하고, 부대역간 상관성을 이용하여 계수들을 제로트리 방식으로 부호화하여 비트율 및 왜곡 성능을 개선한다. 영상 복원시 오차 감소를 위해 각 주파수 부대역간의 상관성을 이용하여 새로운 부모-자식노드 관계를 추출하고, 이를 이용하여 계수들에 대한 부호화 순서를 결정한다. 컴퓨터 모의실험을 통해 제안된 웨이블릿 패킷영상 부호화 알고리듬에 대한 성능 평가를 위해 텍스처 이미지에 대해 기존의 알고리듬과 비트율과 제곱오차에 대한 비교 평가하였으며, 비트율 및 왜곡 성능이 개선되었음을 확인하였다.

• 정보와 통신
• /
• 제19권9호
• /
• pp.77-85
• /
• 2002

In this paper, we introduce an ADSRC(hdvanced DSRC) OFDM packet communication system which has been developed by ETRI. The ADSRC system is targeted to provide high terminal mobility, high data rate and seamless service in roadside environment for mobile office services. We discuss the requirements of the ADSRC communication system for mobile office services, and the system design specification to meet them with regard to air interface. The ADSRC packet communication systems consist of the MAC processor block, the OFDM packet modem block and the RF block. The MAC processor block handles medium access control and the test. The OFDM packet modem transmits data packets at up to 24Mbps adaptively and recovers the data from RF block. We describe the ADSRC packet communication system architecture and the ADSRC system protocol.

• Journal of Communications and Networks
• /
• 제8권3호
• /
• pp.297-305
• /
• 2006

High-rate wireless personal area network (HR-WPAN) has been standardized by the IEEE 802.15.3 task group (TG). To support multimedia services, the IEEE 802.15.3 TG adopts a time-slotted medium access control (MAC) protocol controlled by a central device. In the time division multiple access (TDMA)-based wireless packet networks, the packet scheduling algorithm plays a key role in quality of service (QoS) provisioning for multimedia services. In this paper, we propose an adaptive cross-layer packet scheduling method for the TDMA-based HR-WPAN. Physical channel conditions, MAC protocol, link layer status, random traffic arrival, and QoS requirement are taken into consideration by the proposed packet scheduling method. Performance evaluations are carried out through extensive simulations and significant performance enhancements are observed. Furthermore, the performance of the proposed scheme remains stable regardless of the variable system parameters such as the number of devices (DEVs) and delay bound.

• Journal of Communications and Networks
• /
• 제4권2호
• /
• pp.108-117
• /
• 2002

TCP, which was developed on the basis of wired links, supposes that packet losses are caused by network congestion. In a wireless network, however, packet losses due to data corruption occur frequently. Since TCP does not distinguish loss types, it applies its congestion control mechanism to non-congestion losses as well as congestion losses. As a result, the throughput of TCP is degraded. To solve this problem of TCP over wireless links, previous researches, such as split-connection and end-to-end schemes, tried to distinguish the loss types and applied the congestion control to only congestion losses; yet they do nothing for non-congestion losses. We propose a novel transport protocol for wireless networks. The protocol called VS-TCP (Variable Segment size Transmission Control Protocol) has a reaction mechanism for a non-congestion loss. VS-TCP varies a segment size according to a non-congestion loss rate, and therefore enhances the performance. If packet losses due to data corruption occur frequently, VS-TCP decreases a segment size in order to reduce both the retransmission overhead and packet corruption probability. If packets are rarely lost, it increases the size so as to lower the header overhead. Via simulations, we compared VS-TCP and other schemes. Our results show that the segment-size variation mechanism of VS-TCP achieves a substantial performance enhancement.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.215-217
• /
• 2004

In wireless sensor networks, fair allocation of bandwidth among different nodes is one of the critical problems that effects the serviceability of the entire system. Fair bandwidth allocation mechanisms, like fair queuing, usually need to maintain state, manage buffers, and perform packet scheduling on a per flow basis, and this complexity may prevent them from being cost-effectively implemented and widely deployed. It is a very important and difficult technical issue to provide packet scheduling architecture for fairness in wireless sensor networks. In this paper, we propose an packet scheduling architecture for sensor node, called FISN (Fairness Improvement Sensor Network), that significantly reduces this implementation complexity yet still achieves approximately fair bandwidth allocations. Sensor node for sensing estimate the incoming rate of each sensor device and insert a label into each transmission packet header based on this estimate. Sensor node for forwarding maintain no per flow state; they use FIFO packet scheduling augmented by a probabilistic dropping algorithm that uses the packet labels and an estimate of the aggregate traffic at the gathering node. We present the detailed design, implementation, and evaluation of FISN using simulation. We discuss the fairness improvement and practical engineering challenges of implementing FISN in an experimental sensor network test bed based on ns-2.

• 대한전기학회논문지:전기물성ㆍ응용부문C
• /
• 제50권4호
• /
• pp.176-181
• /
• 2001

As the data rate between chip-to-chip gets high, the skin effect and load of pins deteriorate noise margin. With these, noise disturbances on the bus channel make it difficult for receiver circuits to read the data signal. This paper has proposed a new pre-emphasis driver circuit which achieves wide noise margin by enlarging the signal voltage range during data transition. When data is transferred from a memory chip to a controller, the output boltage of the driver circuit reaches the final values through the intermediate voltage level. The proposed driver supplies more currents applicable to a packet-based memory system, because it needs no additional control signal and realizes very small area. The circuit has been designed in a 0.18 ${\mu}m$ CMOS process, and HSPICE simulation results have shown that the data rate of 1.32 Gbps be achieved. Due to its result, the proposed driver can achieved higher speed than conventional driver by 10%.

• 인터넷정보학회논문지
• /
• 제3권6호
• /
• pp.43-51
• /
• 2002

본 논문은 능동적인 큐 관리를 이용한 새로운 패킷 탈락 알고리즘에 대해 연구이다. 능동적인 큐 관리 기법은 기존의 Drop Tail과 다른데, Drop Toil은 버퍼 오버플로우가 발생하면 패킷 탈락되는 반면, 능동적인 큐 관리 기법인 RED는 폭주가 발생하기 전에 패킷이 탈락된다는 것이다. 그러나 능동적인 큐 관리 기법은 버퍼 크기가 충분히 크지 않을 때 높은 패킷 손실률을 초래한다. 폭주를 탐지하고 무작위로 선택된 연결에 이를 통보함에 의한 글로벌 동기화와 공정성 문제를 야기하며, 최적의 평균 큐 길이를 찾기 위해서는 네트워크 트래픽 특성이 미리 알려져야 한다는 커다란 문제가 있다. 본 논문에서는 폭주제어를 위한 새로운 큐 관리 기법 기반의 효율적인 패킷 탈락 기법을 제안한다. 제안된 기법은 플로우별 도착률과 추정된 공정한 대역을 사용한다. 이를 이용하여 플로우 도착률과 링크 대역을 계산하기 위한 추정 알고리즘을 제안한다. 제안된 기법은 패킷 손실을 가져오는 패킷에 의한 큐 길이의 급속한 진동을 초래하지 않기 때문에 네트워크 성능을 향상시킬 수 있음을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권8호
• /
• pp.2875-2893
• /
• 2015

Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn't consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.