• Title/Summary/Keyword: transmission priority

Search Result 309, Processing Time 0.04 seconds

An Energy-Efficient Transmission Strategy for Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율적인 전송 방안에 관한 연구)

  • Phan, Van Ca;Kim, Jeong-Geun
    • Journal of Internet Computing and Services
    • /
    • v.10 no.3
    • /
    • pp.85-94
    • /
    • 2009
  • In this work we propose an energy-efficient transmission strategy for wireless sensor networks that operate in a strict energy-constrained environment. Our transmission algorithm consists of two components: a binary-decision based transmission and a channel-aware backoff adjustment. In the binary-decision based transmission, we obtain the optimum threshold for successful transmission via Markov decision process (MDP) formulation. A channel-aware backoff adjustment, the second component of our proposal, is introduced to favor sensor nodes seeing better channel in terms of transmission priority. Extensive simulations are performed to verify the performance of our proposal over fading wireless channels.

  • PDF

Progressive Image Coding based on SPIHT Using Object Region Transmission Method by Priority (객체 영역 우선 전송 기법을 이용한 SPIHT기반 점진적 영상 부호화)

  • 최은정;안주원;강경원;권기룡;문광석
    • Proceedings of the IEEK Conference
    • /
    • 2000.11d
    • /
    • pp.53-56
    • /
    • 2000
  • In progressive image coding, if object region that have main contents in image are transmitted prior to the remained region, this method will be very useful. In this paper, the progressive image coding based on SPIHT using object region transmission method by priority is proposed. First, an original image is transformed by wavelet. Median filtering is used about wavelet transformed coefficient region for extracting object region. This extracted object region encoded by SPIHT. Then encoded object region are transmitted in advance of the remained region. This method is good to a conventional progressive image coding about entire original image. Experimental results show that the proposed method can be very effectively used for image coding applications such as internet retrieval and database searching system.

  • PDF

An Improved DWRR Cell Scheduling Algorithm based on the QoS of Delay (지연 특성을 고려한 개선된 DWRR 셀 스케쥴링 알고리즘)

  • 곽지영;김체훤;김두현;남지승
    • Proceedings of the IEEK Conference
    • /
    • 2000.06c
    • /
    • pp.81-84
    • /
    • 2000
  • Scheduling algorithm proposed in this paper is based on both DWRR(Dynamic Weighed Round Robin) method and QLT(Queue Length Threshold) method. The proposed scheduling algorithm guarantees delay property of realtime traffic, not considered in previous DWRR method, with serving realtime traffic preferentially by using RR(Round Robin) method which service each channel equally and QLT algorithm that is dynamic time priority method. Proposed cell scheduling algorithm may increase some complexity over conventional DWRR scheme because of delay priority based cell transmission method. However, due to reliable ABR service and congesition avoidance capacity, proposed scheduling algorithm has good performance over conventional DWRR scheme. Also, delay property based cell transmission method in proposed algorithm minimizes cell delay and requires less temporary buffer size

  • PDF

Design of Real-Time CAN Framework Based on Plug and Play Functionality

  • Kim, Sungheo;Hwang, Kwang-il
    • Journal of Information Processing Systems
    • /
    • v.13 no.2
    • /
    • pp.348-359
    • /
    • 2017
  • Nowadays most vehicles are equipped with a variety of electronic devices to improve user convenience as well as its performance itself. In order to efficiently interconnect these devices with each other, Controller Area Network (CAN) is commonly used. However, the CAN requires reconfiguration of the entire network when a new device, which is capable of supporting both of transmission and reception of data, is added to the existing network. In addition, since CAN is based on the collision avoidance using address priority, it is difficult that a new node is assigned high priority and eventually it results in transmission delay of the entire network. Therefore, in this paper we propose a new system component, called CAN coordinator, and design a new CAN framework capable of supporting plug and play functionality. Through experiments, we also prove that the proposed framework can improve real-time ability based on plug and play functionality.

Active and Reactive Power Control Model of Superconducting Magnetic Energy Storage (SMES) for the Improvement of Power System Stability

  • Ham, Wan-Kyun;Hwang, Sung-Wook;Kim, Jung-Hoon
    • Journal of Electrical Engineering and Technology
    • /
    • v.3 no.1
    • /
    • pp.1-7
    • /
    • 2008
  • Superconducting Magnetic Energy Storage (SMES) can inject or absorb real and reactive power to or from a power system at a very fast rate on a repetitive basis. These characteristics make the application of SMES ideal for transmission grid control and stability enhancement. The purpose of this paper is to introduce the SMES model and scheme to control the active and reactive power through the power electronic device. Furthermore, an optimal priority scheme is proposed for the combination of active and reactive power control to be able to stabilize power transient swings.

An Efficient Rate Control Protocol for Wireless Sensor Network Handling Diverse Traffic

  • Monowar, Muhammad Mostafa;Rahman, Md. Obaidur;Hong, Choong-Seon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.10a
    • /
    • pp.130-131
    • /
    • 2007
  • Wireless Sensor Network typically incorporates diverse applications within the same network. A sensor node may have multiple sensors i.e. light, temperature, seismic etc with different transmission characteristics. Each application has different characteristics and requirements in terms of transmission rates, bandwidth, packet loss and delay demands may be initiated towards the sink. In this paper we propose Heterogeneous Traffic Oriented Rate Control Protocol (HTRCP) which ensures efficient rate control for diverse applications according to the priority specified by the sink. Moreover. HTRCP ensures the node priority based hop by hop dynamic rate adjustment for high link utilization.

  • PDF

Software structure design for processing various tactical data

  • Kim, Jin Woo;Lee, Woo Sin;Lee, Seung Chan;Kim, Young Don;Jin, So Yeon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.11
    • /
    • pp.39-47
    • /
    • 2017
  • In this paper, we propose a message transmission processing structure for efficient use of radio resources. Existing tactical data links have more data and accumulate more data than the amount of tactical data planned according to the situation. This may result in delays in operations and additional problems. To prevent this, priority is assigned to the message and transmission is performed according to the priority on a single basis. And we design a processing structure that can update duplicate messages and delete old messages in order to prevent waste of radio resources. Experiments are conducted to verify that these structures can be implemented and applied to data links.

Prioritized Resource Allocation in Wireless Spectrum Pooling

  • Biglieri, Ezio;Lozano, Angel;Alrajeh, Nabil
    • Journal of Communications and Networks
    • /
    • v.14 no.5
    • /
    • pp.495-500
    • /
    • 2012
  • A standard paradigm for the allocation of wireless resources in communication demands symmetry, whereby all users are assumed to be on equal footing and hence get equal shares of communication capabilities. However, there are situations in which "prime users" should be given higher priority, as for example in the transmission of emergency messages. In this paper, we examine a prioritization policy that can be implemented at the physical layer. In particular, we evaluate the performance of a prioritized transmission scheme based on spectrum pooling and on the assignment of higher signal-to-noise ratio channels to higher-priority users. This performance is compared to that of unprioritized (or "symmetric") schemes, and the impact of prioritization on the unprioritized users is discussed.

Performance analysis of EY-NPMA protocol in the infinite population model of HIPERLAN (HIPERLAN의 무한 가입자 모델에서 EY-NPMA 프로토콜의 성능분석)

  • 조광오;이정규;조병학;김호섭
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.9A
    • /
    • pp.1425-1433
    • /
    • 1999
  • In this Paper, we analyzed the HIPERLAN(Hlgh PErformance Radio LAN) MAC(Medium Access Control) protocol, which was a standard for Wireless LANs defined by ETSI. We analyzed mathematically the elimination phase and the yield phase of the channel contention phase of CAC(Channel Access Control) layer in the infinite population model of the HIPERLAN using EY-NPMA(Elimination Yield-Nonpreemptive Priority Multiple Access)protocol. Also we analyzed the probability of successful transmission in the transmission phase. And, we proved results of a mathematical analysis by the simulation of HIPERLAN MAC protocol.

  • PDF

An Enhanced Transmission Mechanism for Supporting Quality of Service in Wireless Multimedia Sensor Networks

  • Cho, DongOk;Koh, JinGwang;Lee, SungKeun
    • Journal of Internet Computing and Services
    • /
    • v.18 no.6
    • /
    • pp.65-73
    • /
    • 2017
  • Congestion occurring at wireless sensor networks(WSNs) causes packet delay and packet drop, which directly affects overall QoS(Quality of Service) parameters of network. Network congestion is critical when important data is to be transmitted through network. Thus, it is significantly important to effectively control the congestion. In this paper, new mechanism to guarantee reliable transmission for the important data is proposed by considering the importance of packet, configuring packet priority and utilizing the settings in routing process. Using this mechanism, network condition can be maintained without congestion in a way of making packet routed through various routes. Additionally, congestion control using packet service time, packet inter-arrival time and buffer utilization enables to reduce packet delay and prevent packet drop. Performance for the proposed mechanism was evaluated by simulation. The simulation results indicate that the proposed mechanism results to reduction of packet delay and produces positive influence in terms of packet loss rate and network lifetime. It implies that the proposed mechanism contributes to maintaining the network condition to be efficient.