• Title/Summary/Keyword: Dynamic bit assignment

Search Result 14, Processing Time 0.023 seconds

Efficient Peer Assignment for Low-Latency Transmission of Scalable Coded Images

  • Su, Xiao;Wang, Tao
    • Journal of Communications and Networks
    • /
    • v.10 no.1
    • /
    • pp.79-88
    • /
    • 2008
  • In this paper, we propose efficient peer assignment algorithms for low-latency transmission of scalable coded images in peer-to-peer networks, in which peers may dynamically join and leave the networks. The objective of our algorithm is to minimize the transmission time of a requested image that is scalable coded. When an image is scalable coded in different bit rates, the bit stream encoded in a lower bit rate is a prefix subset of the one encoded in a higher bit rate. Therefore, a peer with the same requested image coded in any bit rate, even when it is different from the requested rate, may work as a supplying peer. As a result, when a scalable coded image is requested, more supplying peers can be found in peer-to-peer networks to help with the transfer. However, the set of supplying peers is not static during transmission, as the peers in this set may leave the network or finish their transmission at different times. The proposed peer assignment algorithms have taken into account the above constraints. In this paper, we first prove the existence of an optimal peer assignment solution for a simple identity permutation function, and then formulate peer assignment with this identity permutation as a mixed-integer programming problem. Next, we discuss how to address the problem of dynamic peer departures during image transmission. Finally, we carry out experiments to evaluate the performance of proposed peer assignment algorithms.

A Sensor Data Compression Algorithm based on Dynamic Bit-assignment Techniques (동적 비트할당 기반 센서데이타 압축 기법)

  • Lee, Seok-Jae;Park, Hyun-Ho;Yeo, Myung-Ho;Song, Seok-Il;Yoo, Jae-Soo
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.4
    • /
    • pp.318-325
    • /
    • 2008
  • Most of the sensor applications collect and analyze sensor data within a given period of time. When sensor send a data to sink, it spend many communication cost. Accordingly, a compression algorithm is one of the most critical issues for the communication cost decrease in sensor fields. In this paper, we propose an algorithm for compressing sensor data using the dynamic bit assignment technique. In our algorithm, sink collect sensor data within a short period of time and make bit assign information. Then sink send the information to sensor. Finally, sensors compresssensing data and send to sink.

Adaptive Dynamic Slot Assignment of VBR Traffics Using In-band Parameters in Wireless ATM (무선 ATM에서 In-Band 파라미터를 이용한 VBR 트래픽의 적응적 슬롯 할당)

  • Paek, Jong-Il;Jun, Chan-Yong;Kim, Young-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.7
    • /
    • pp.30-37
    • /
    • 2002
  • In this paper, we propose a new adaptive slot assignment algorithm called In-VDSA in order to guarantee the QoS(Quality of Service) of VBR(Variable Bit Rate) traffics in wireless ATM and maximize efficiency in use of wireless channels. In the proposed algorithm, the status of terminal buffers is encoded in signed number on the GFC(Generic Flow Control) field of an ATM cell header and piggybacked. And also, the number of slots to be assigned to the next frame is adjusted effectively, which is different to methods in the conventional slot assignment algorithms. As a result, we can guarantee QoS such as CLR(Cell Loss Rate) and cell delay and achieve the higher utilization of channels. The validity of the proposed algorithm has been justified in performance by analysis through simulation results using the BONeS tool and comparison with conventional methods.

Neural Dynamic Slot Assignment Algorithm for QoS Guarantee of VBR Traffic in Wireless ATM Network (무선 ATM 망에서 VBR 트래픽 Qos 보장을 위한 새로운 동적 슬롯 할당 알고리즘에 관한 연구)

  • Kim, Yeong-Cheol;Jeon, Chan-Yong
    • The KIPS Transactions:PartC
    • /
    • v.8C no.4
    • /
    • pp.443-450
    • /
    • 2001
  • 본 논문에서는 무선 ATM 망에서 VBR(Variable Bit Rate) 트래픽의 QoS(Quality of Service)를 보장하고 무선 채널의 효율성을 극대화 할 수 있는 새로운 동적 슬롯 할당 알고리즘인 NDSA(Neural Dynamic Slot Assignment)를 제안한다. 제안된 알고리즘에서는 ATM 셀 헤더 부분의 GFC(Generic Flow Control) 필드 상에 단말기의 버퍼 상태와 셀 발생률 변화를 부호화 하여 piggybacking 하는 in-band 방식을 채택하였으며 다음 프레임에 할당할 슬롯의 갯수를 기존 방식과는 달리 신경회로망을 이용하여 유동적으로 조절하여 할당함으로써 단말기의 셀 손실이나 지연에 대한 QoS를 보장하고 채널 이용 효율을 높일 수 있었다. 제안된 알고리즘은 BONeS tool을 이용한 시뮬레이션을 통하여 기존의 방식과 비교 분석한 결과 그 정당성을 확인하였다.

  • PDF

Performance Comparison of CDMA and TDMA protocols in radio access system for Integrated Voice/Data Services (음성 및 데이터서비스를 위한 무선접속시스템에서 CDMA와 TDMA방식의 성능비교)

  • 고종하;양영님;이정규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.6A
    • /
    • pp.820-831
    • /
    • 1999
  • In this paper, we have compared the performance of a D-TDMA protocol with that of a CDMA protocol, in radio access system for integrated voice/data services.The D-TDMA protocol is based on a generic dynamic channel assignment approach to be followed a combination of “circuit mode” reservation for voice calls, along with dynamic first-come-first served assignment of remaining capacity for data messages. In the CDMA protocol, we have used the voice activity detection to reduce the interface power of other mobiles in internal and external cells, and analyzed the interference power ratio. Also we have computed BER(Bit Error Rate) by using this interference power ratio and evaluated voice blocking probability(voice packet loss probability) and data transmission delay, according to average data length and average data arrival rate.We have found the CDMA protocol achieves comparatively higher performance for short data length, regardless of data arrival rate. Otherwise, the data transmission delay of D-TDMA protocol is shorter than that of the CDMA protocol for long data message.

  • PDF

Adaptable PANID Generation Scheme for Resolving Address Conflict Based on Hash Mechanism in IoT Environment (IoT 환경을 위한 Hash 기반 동적 Zigbee PANID 생성 및 충돌 회피 방안)

  • Lee, Jaeho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.12
    • /
    • pp.2392-2400
    • /
    • 2015
  • Zigbee, which was a representative standard technology for dealing low energy and mesh networks in large deployment area such as smart home, smart building, and massive sensor networks, has been developed and deployed for increasing communication area by using Ad hoc method. It has been originally developed based on IEEE 802.15.4 standard so every node needs 48bit unique address defined by IEEE. However, it is absolutely inefficient to assign an unique address to every communication node where it would be deployed through large-scale network area, e.g., smart lighting and massive sensor networks, because there could be variously multiple companies to deploy network infrastructure and they could have different policy to assign node ID. To prevent the problem, this paper proposes a method of dynamic PANID assignment in overall Personal Coordinators, and also proposes a method for addressing PANID conflict problem which could be derived from dynamic PANID assignment.

MPEG-2 Bit-Rate Control for Video Sequence Editing using Dynamic Macroblock Bit Assignment (압축 비디오시퀀스 편집을 위한 동적 매크로블럭 비트할당 MPEG-2 비트율 제어)

  • Kim, Ju-Do;Lee, Keun-Young
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.9
    • /
    • pp.63-69
    • /
    • 1998
  • In this paper, we propose a new Bit-Rate control algorithm based on bit usage matching to substitute encoded GOP(s) for new GOP(s) in MPEG-2 bitstream. It iteratively encodes current picture according to quantization value of previous picture and records bit-usage of each slice until nearly target bits are used. With target bits falling in two output bits, quantization value of slice should be changed to alleviate output bit error. We use recorded bit-usage information to decide which slices should be encoded with one quantization value and others with another. As every macroblock has different activity, we change macroblock quantization value using slice quantization value and activity value. The simulation results demonstrate that the fluctuation of the output bits can be kept within few-several tens of bits while maintaining the quality of the reconstructed pictures at a relatively stable level.

  • PDF

Label Assignment Schemes for MPLS Traffic Engineering (MPLS 트래픽 엔지니어링을 위한 레이블 할당 방법)

  • 이영석;이영석;옥도민;최양희;전병천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.8A
    • /
    • pp.1169-1176
    • /
    • 2000
  • In this paper, label assignment schemes considering the IP flow model for the efficient MPLS traffic engineering are proposed and evaluated. Based on the IP flow model, the IP flows are classified into transient flows and base flows. Base flows, which last for a long time, transmit data in high bit rate, and be composed of many packets, have good implications for the MPLS traffic engineering, because they usually cause network congestion. To make use of base flows for the MPLS traffic engineering, we propose two base flow classifiers and label assignment schemes where transient flows are allocated to the default LSPs and base flows to explicit LSPs. Proposed schemes are based on the traffic-driven label triggering method combined with a routing tabel. The first base flow classifier uses both flow size in packet counts and routing entries, and the other one, extending the dynamic X/Y flow classifier, is based on a cut-through ratio. Proposed schemes are shown to minimize the number of labels, not degrading the total cut-through ratio.

  • PDF

The Path Recovery Technique for Hierarchical Routing over 6LoWPAN (6LoWPAN 기반의 계층적 라우팅을 위한 경로 복구 방법)

  • Nam, Choon-Sung;Jeong, Hee-Jin;Shin, Dong-Ryeol
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.705-706
    • /
    • 2008
  • The feature of 6LoWPAN is the capability of the dynamic assignment of 16bit short addresses. By using this dynamically assigned short address, a hierarchical routing is employed. In case of node failure, this hierarchical routing don't support a technique for path recovery. So, this paper proposes the path recovery technique for hierarchical routing over 6LoWPAN.

  • PDF

A Study on Adaptable Dynamic Slot Assignment for QoS guarantee of VBR traffic using In-band Parameter in Wireless ATM Networks (무선 ATM에서 VBR 트래픽의 QoS 보장을 위한 In-Band 파라미터를 이용한 적응적 슬롯 할당에 관한 연구)

  • Jun, Chan-Yong;Lim, Myoung-Ju;Kim, Young-Chul
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2001.04b
    • /
    • pp.1161-1164
    • /
    • 2001
  • 본 논문에서는 무선 ATM 망에서 VBR(Variable Bit Rate) 트래픽의 QoS(quality of Service)를 보장하고 무선 채널의 효율성을 극대화 할 수 있는 새로운 적응적 슬롯 할당 알고리즘인 In-VDSA를 제안한다. 제안된 알고리즘에서는 ATM 셀 헤더 부분의 GFC(Generic Flow Field) 필드 상에 단말기의 버퍼 상태를 부호화하여 piggybacking하는 방식을 채택하였으며 다음 프레임에 할당할 슬롯의 개수를 기존의 다른 방식과는 달리 유동적으로 조절하여 할당함으로써 단말기의 셀 손실이나 지연에 대한 QoS를 보장하고 채널 이용 효율을 높일 수 있었다. 제안된 알고리즘은 BONeS tool을 이용한 시뮬레이션을 통하여 기존의 방식과 비교 분석한 결과 그 정당성을 확인하였다.

  • PDF