• Title/Summary/Keyword: packet transmission problem

Search Result 204, Processing Time 0.022 seconds

Asynchronous and Adaptive Massage Passing Scheme for Wireless Sensor Networks (무선 센서 네트워크를 위한 비동기 적응형 메시지 전달 기법)

  • Jeong, Jong-Kyun;Ra, In-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.3
    • /
    • pp.196-201
    • /
    • 2013
  • In this paper, we propose an asynchronous and adaptive message passing scheme based on S-MAC for handling with the problem on energy efficiency in wireless sensor networks. The proposed scheme consists of a policy that differentiate transmission errors caused by packet collision or radio interference from congestion errors caused by buffer overflow and a method that adaptively controls the size of a fragment according to the variance of traffic loads. Especially, it presents a method that highly reduce the energy consumption by keeping the size of fragment not being excessively smaller than the one that may result in rapid increment of the total transfer time. Finally, with the simulation results we show that network throughput and delay are improved by using the proposed message passing scheme.

Convolutional auto-encoder based multiple description coding network

  • Meng, Lili;Li, Hongfei;Zhang, Jia;Tan, Yanyan;Ren, Yuwei;Zhang, Huaxiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1689-1703
    • /
    • 2020
  • When data is transmitted over an unreliable channel, the error of the data packet may result in serious degradation. The multiple description coding (MDC) can solve this problem and save transmission costs. In this paper, we propose a deep multiple description coding network (MDCN) to realize efficient image compression. Firstly, our network framework is based on convolutional auto-encoder (CAE), which include multiple description encoder network (MDEN) and multiple description decoder network (MDDN). Secondly, in order to obtain high-quality reconstructed images at low bit rates, the encoding network and decoding network are integrated into an end-to-end compression framework. Thirdly, the multiple description decoder network includes side decoder network and central decoder network. When the decoder receives only one of the two multiple description code streams, side decoder network is used to obtain side reconstructed image of acceptable quality. When two descriptions are received, the high quality reconstructed image is obtained. In addition, instead of quantization with additive uniform noise, and SSIM loss and distance loss combine to train multiple description encoder networks to ensure that they can share structural information. Experimental results show that the proposed framework performs better than traditional multiple description coding methods.

Performance Evaluation of Distributed Cooperative MAC Protocol Algorithm for Enhancing Multimedia QoS of WiMedia Communication Network (와이미디어 통신네트워크의 멀티미디어 QoS 개선을 위한 분산협력방식 MAC 프로토콜 성능분석)

  • Kim, Jin-Woo;Lee, Yeon-Woo;Lee, Seong-Ro
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.4
    • /
    • pp.516-525
    • /
    • 2012
  • In this paper, an efficient technique for enhancing the QoS of multimedia service for an WiMedia network applying distributed cooperative medium access (D-MAC) protocol is proposed. D-MAC protocol has been proposed to support high-rate Wireless Personal Area Networks (HR-WPANs) by the WiMedia Alliance. Unlike the centralized IEEE 802.15.3 MAC, the D-MAC UWB specified by WiMedia supports all devices to be self-organized and removes the SOP (Simultaneous Operating Piconet) problem, i.e., packet collisions between overlapped piconets in the centralized IEEE 802.15.3 MAC. However the WiMedia D-MAC can't prevent reduce the throughput degradation occurred by mobile nodes with low data rate. Therefore, a distributed cooperative MAC protocol for multi-hop UWB network is proposed in this paper. The proposed technique can intelligently select the transmission path with higher data rate to provide real-time multimedia services with minimum delay, thus enhances QoS of multimedia service.

Delay Guaranteed Bandwidth-Efficient Multicast Routing in Wireless Multi-hop Networks (다중 홉 무선 네트�p에서 지연을 고려한 멀티케스트 루팅)

  • Sohn, Hee-Seok;Lee, Chae Y.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.41 no.2
    • /
    • pp.53-65
    • /
    • 2016
  • Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol : end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.

Improved Fast Link-Setup Protocol for high-capacity Wireless Sensor Networks (대용량 무선 센서 네트워크를 위한 개선된 고속링크설정 알고리즘)

  • Kim, Byun-gon;Chung, Kyung-taek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.12
    • /
    • pp.2387-2394
    • /
    • 2016
  • It is important to select the most appropriate channel for efficient transmission of massive data in wireless sensor network. In the fixed channel method for wireless sensor node, shortage of frequency may be a major constraint to support a variety of environments. In this paper, the method that seeks common channels between two nodes without common control channels in the existing wireless cognitive radio network is introduced in order to use efficiently the channel of wireless sensor network. The problem of existing method shows the severe degradation of performance that is caused by interference of linkage between selected channels, so that the sequential algorithm is suggested to improve the performance. From the results of computer simulation, the suggested method shows that the link can be set 50% faster than the other methods as the number of links increases because the beacon packet waiting time caused by the interference decreases remarkably.

A Same-Priority Collision-Avoidance Algorithm Using RTS/CTS Frame in IEEE 802.11e EDCA under Network Congested Condition (IEEE 802.11e EDCA 네트워크 혼잡 환경에서 RTS/CTS 프레임을 이용한 동일 우선순위 충돌 회피 알고리즘)

  • Kwon, YongHo;Rhee, Byung Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.5
    • /
    • pp.425-432
    • /
    • 2014
  • The Enhanced Distributed Channel Access (EDCA) function of IEEE 802.11e standard defines contention window (CW) for different Access Category (AC) limits to support Quality-of-Service (QoS). However, it have been remained the problem that the collision probability of transmission is increasing in congested network. Several different solutions have been proposed but the collision occurs among same priority queue within the same station to compete the channel access. This paper presents an APCA (Advanced Priority Collision Avoidance) algorithm for EDCA that increases the throughput in saturated situation. The proposed algorithm use reserved field's bits of FC(Frame Control) using IEEE 802.11e standard's RTS/CTS (Request to Send / Clear to Send) mechanism to avoid data collision. The simulation results show that the proposed algorithm improves the performance of EDCA in packet loss. Using Jain's fairness index formula, we also prove that the proposed APCA algorithm achieves the better fairness than EDCA method under network congested condition.

A New Congestion Control Algorithm for Vehicle to Vehicle Safety Communications (차량 안전 통신을 위한 새로운 혼잡 제어 알고리즘 제안)

  • Yi, Wonjae
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.5
    • /
    • pp.125-132
    • /
    • 2017
  • Vehicular safety service reduces traffic accidents and traffic congestion by informing drivers in advance of threats that may occur while driving using vehicle-to-vehicle (V2V) communications in a wireless environment. For vehicle safety services, every vehicle must broadcasts a Basic Safety Message(BSM) periodically. In congested traffic areas, however, network congestion can easily happen, reduce the message delivery ratio, increase end-to-end delay and destabilize vehicular safety service system. In this paper, to solve the network congestion problem in vehicle safety communications, we approximate the relationship between channel busy ratio and the number of vehicles and use it to estimate the total network congestion. We propose a new context-aware transmit power control algorithm which controls the transmission power based on total network congestion. The performance of the proposed algorithm is evaluated using Qualnet, a network simulator. As a result, the estimation of total network congestion is accurately approximated except in specific scenarios, and the packet error rate in vehicle safety communication is reduced through transmit power control.

Design and Implementation of MAC Protocol for Underwater Mobile Ad-hoc Networks (수중 모바일 애드 혹 네트워크를 위한 MAC 프로토콜 설계 및 구현)

  • Lee, Jin-Young;Yun, Nam-Yeol;Park, Soo-Hyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.4
    • /
    • pp.76-89
    • /
    • 2014
  • In this paper, we propose a MAC(Media Access Control) protocol based on flexible RWT(RTS Waiting Time) for underwater mobile ad-hoc networks with a three-way handshaking mechanism. This protocol can solve a problem of collision between RTS(Request-To-Send) and CTS(Clear-To-Send) packets in existing MACA(Multiple Access with Collision Avoidance) protocol. This proposed MAC protocol is also an effective protocol which can apply to underwater mobile ad-hoc networks in a real field by using implementable technologies. We set flexible RTS Waiting Time called RWT, considering various characteristics of underwater environment. It is possible to support variable network size according to node mobility. Finally, we conduct a performance evaluation between proposed MAC protocol and existing MACA based MAC protocol through practical implementation and experiment. As a result, we verify the superiority of our proposed MAC protocol in terms of throughput, packet drop rate, average transmission time, energy consumption and channel utilization.

IEEE 802.15.4 Ad-Hoc Wireless Sensor Network Routing Method Applying EtherCAT Communication Method (EtherCAT 통신방식을 응용한 IEEE 802.15.4 Ad-Hoc 무선 센서 네트워크 라우팅 방식)

  • Park, Jeong-Hyeon;Seo, Chang-Jun
    • Journal of IKEEE
    • /
    • v.22 no.2
    • /
    • pp.289-301
    • /
    • 2018
  • IIoT, the IoT technology applied to the industrial field, is being used as a monitoring technology for increasing in production rate and safety of workers. However, monitoring through the construction of IIoT network using Ethernet and RS485 in production lines where dozens to hundreds of machine tools are manufacturing components, have difficulties of infrastructure cost and network flexibility and fluidity. Therefore, in this paper, using IEEE 802.15.4 standard WSN device to construct a Ad-Hoc WSN in the production line. In addition, the transmission period and order of the sensor nodes are set by applying the EtherCAT communication method in which the payload frames are shared by all the sensor nodes. From this, we have overcome the problem of reliability decline and real-time issue due to the packet collision of wireless network and confirmed that it is a wireless network routing method that can be used in the actual industrial field.

An Efficient Scheme to Create Data Delivery Tree for Community Group Communication (커뮤니티 그룹 통신을 위한 효율적인 데이터 전달 트리 구성 방안)

  • Oh, Je-Jun;Kang, Nam-Hi;Kim, Yong-Hyuk;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.55-63
    • /
    • 2007
  • Multicast is an efficient transport mechanism for community communications and MANET is recently regarded as a promising solution for support ubiquitous computing as an underlying network technology. However, it is hard to deploy multicast mechanism into MANET owing to scarce resources in wireless networks and unpredictable changes in network topology. Several multicast mechanisms have been proposed in the literature to overcome the limitations. Especially, overlay multicasting schemes present several advantages over network based multicasting schemes. Yet, the overlay multicasting schemes still introduce redundant data transmissions that waste network bandwidth and battery of relay nodes. As a result the performance of the network is degraded. To reduce the redundancy, we propose an efficient way to construct an overlay structure as a multicast data delivery tree that utilizes a branch node which belongs to the tree. By using network simulation, we show that the proposed scheme presents higher packet delivery ratio and lower transmission cost than previously proposed schemes.