• Title/Summary/Keyword: retransmission count

Search Result 10, Processing Time 0.028 seconds

Drop Policy Considering Performance of TCP in Optical Burst Switching Networks (Optical Burst Switching Network에서 TCP 성능을 고려한 Drop Policy)

  • 송주석;김래영;김현숙;김효진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.2B
    • /
    • pp.203-209
    • /
    • 2004
  • In OBS networks, the burst dropping due to contention significantly affects the performance of TCP, but existing drop policies have not considered this problem and researches related to TCP have been mainly studied on burst assembling. We propose the drop policy considering retransmission of TCP to improve the performance of TCP in OBS networks. The proposed drop policy is the Retransmission Count-based DP that regards retransmission count of bursts as priority when it selects dropping burst. This paper evaluates the performance of RC-based DP model and general DP model using ns-2. The metrics of performance evaluation are TCP throughput, maximum sequence number of received TCP packets and drop rate of packet as simulation time increases.

The energy efficient traffic control mechanism in Wireless Sensor Network (무선 센서 네트워크에서 에너지 효율적인 트래픽 제어 메커니즘)

  • Jang, Yong-Jae;Park, Kyung-Yuk;Lee, Sung-Keun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.10
    • /
    • pp.2257-2264
    • /
    • 2011
  • Sensor nodes in Wireless sensor network have limited resources and consume almost all energy to the communication. For its traffic feature as a burst traffic type toward a sink node, it has high probability to network congestion. Network congestion causes packet drops and retransmission of dropped packets draws energy consumption. In particular, the loss of packet that is from the sensor node far away from a sink node requires additional energy consumption by frequent retransmission. This paper presents a traffic control mechanism that determines packet transfer by considering priority of packet and congestion level as well as hop count. Analysis of proposed mechanism by simulation demonstrated that it improved energy efficiency.

Dynamic Retransmission Scheme Using Retry Count in Constrained Application Protocol (CoAP) (CoAP 프로토콜에서 재전송 카운트를 이용한 능동적 전송 기법)

  • Lee, Jung June;Kim, Kyung Tae;Youn, Hee Yong
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2015.01a
    • /
    • pp.243-246
    • /
    • 2015
  • 최근 사물 인터넷(Internet of things) 의 발달에 따라, 스마트 디바이스 간의 네트워크 및 이를 구축할 수 있는 기술에 대한 수요가 급증하고 있다. 이러한 스마트 디바이스 간의 저 전력 저 손실 네트워크(Low power and Lossy network) 환경에서 쓰이는 대표적인 프로토콜로 CoAP(Constrained Application Protocol)가 있으며, 해당 프로토콜은 다양한 네트워크 환경에 유연하게 적용할 수 있도록 패킷 재전송 주기 설정 옵션을 가진다. 하지만 하나의 디바이스에서 네트워크 환경이 패킷 손실 및 지연여부를 구분 할 수 없기 때문에, 네트워크 상태 파악을 위해서는 수신과 응답 양측 디바이스의 패킷 흐름을 확인해야 하는 문제점이 있다. 본 논문에서는 프로토콜의 정보를 기반으로 네트워크 상태를 파악 할 수 있는 새로운 필드 값을 적용하여 CoAP 패킷 재전송 주기를 네트워크 환경의 상태에 따라 동적으로 설정해주는 알고리즘을 제안한다. 제안된 기법은 동적으로 재전송 주기를 설정함으로써, 패킷 손실에 의한 서비스 장애 극복 및 패킷 지연 상황에서의 불필요한 패킷 재전송을 방지하여 에너지 효율성을 향상시키고 서비스 안정성을 보장한다.

  • PDF

Routing Algorithm to Select a Stable Path Using the Standard Deviation (표준편차를 이용하여 안정적인 경로를 선택하는 라우팅 알고리즘)

  • Shin, Hyun-Jun;Jeon, Min-Ho;Kang, Chul-Gyu;Oh, Chang-Heon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.758-760
    • /
    • 2012
  • The wireless sensor network is used to get information that location tracing or data of surrounding areas. Unnecessary retransmission request or many energy consumption because the transmission over the wireless links. In order to select the link of reliable and energy efficient to estimate the quality of radio link technique is required using RSSI, LQI, and so on. In this paper, each path between the sensor nodes, a small in the path within standard deviation of shall be determined the priority. Each path a high priority of the node values, respectively LQI is accumulated. Node can be selected the high LQI value path. Among them the less hop count to select the path is proposed. The proposed algorithm is removed the paths of shorten life using high the LQI value of the entire and high hop count even less variation. So its advantage that the sensor nodes can be selected more reliable path.

  • PDF

Channel Aware Reliable Routing Protocol in Wireless Multimedia Sensor Networks (무선 멀티미디어 센서네트워크에서 신뢰성향상을 위한 채널상태기반 경로설정 프로토콜)

  • Cho, Byeong Seok;Lee, Juhyeon;Park, Hyung-Kun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.2
    • /
    • pp.459-465
    • /
    • 2014
  • Recently, multimedia data transmission becomes important issues in the wireless sensor network. For the multimedia data transmission in wireless sensor network, QoS (Quality of service) is an important factor to determine the system performance. AODV algorithm is one of the widely used algorithm for wireless ad-hoc environment. In AODV, the destination node selects the route with the smallest hop count. Since AODV only considers the hop count, the selected route could have low channel condition, and degrade QoS. In this paper, we propose a modified AODV algorithm that considers the successful transmission rate of each link. The proposed algorithm regards the number of retransmission which can be obtained from the successful transmission rate as the hop count, and applies the modified hop count to AODV. The advantage of the proposed algorithm is that the modified AODV can support QoS without significant change of the conventional algorithm.

A Generalized Markov Chain Model for IEEE 802.11 Distributed Coordination Function

  • Zhong, Ping;Shi, Jianghong;Zhuang, Yuxiang;Chen, Huihuang;Hong, Xuemin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.2
    • /
    • pp.664-682
    • /
    • 2012
  • To improve the accuracy and enhance the applicability of existing models, this paper proposes a generalized Markov chain model for IEEE 802.11 Distributed Coordination Function (DCF) under the widely adopted assumption of ideal transmission channel. The IEEE 802.11 DCF is modeled by a two dimensional Markov chain, which takes into account unsaturated traffic, backoff freezing, retry limits, the difference between maximum retransmission count and maximum backoff exponent, and limited buffer size based on the M/G/1/K queuing model. We show that existing models can be treated as special cases of the proposed generalized model. Furthermore, simulation results validate the accuracy of the proposed model.

Performance of an Efficient Backoff Retransmission Algorithm with a Proactive Jamming Scheme for Realtime transmission in Wireless LAN (재밍 기반의 재전송 방식을 사용한 무선 LAN에서의 효율적인 실시간 트래픽 전송 방안의 성능 분석)

  • Koo Do-Jung;Yoon Chong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.2B
    • /
    • pp.98-106
    • /
    • 2006
  • In order to provide a realtime transmission over a wireless LAM, we here present a new jamming based retransmission mechanism. In a legacy wireless LAN system, all stations use the binary exponential backoff algorithm to avoid collisions among frames. It is well known that the backoff algorithm causes more collisions as the numbers of active stations increases. This makes transmission of real time traffic hard. In the proposed scheme, when each station senses collisions, it promptly allows to send a jamming signal during a unique jamming window period which is determined by its own channel access count database(CACDB). This jamming windows is chosen not to be overlapped each other by using of CACDB, and thus channel access of another station is prevented. Hereafter the station gets the ownership of the medium when the wireless medium becomes idle after sending the jamming signal and sensing carrier, and then sends frame in medium. In our proposal, repeating collisions is never happened. We here assume that real time traffic use a frame of fixed length in order to make the time for receiving its ACK frame same. Comparing the proposed jamming-based retransmission scheme with the the 802.11 and 802.11e MAC by simulation. one can find that the proposed scheme have advantages in terms of delay, average backoff time, and average number of collisions per frame. One can find that the proposed scheme might be practically applicable to several applications of realtime traffic transmission in wireless LAN systems.

LQI Standard Deviation Routing Algorithm for Energy Loss Reduction in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 손실 감소를 위한 LQI 표준편차 라우팅 알고리즘)

  • Shin, Hyun-Jun;Oh, Chang-Heon
    • Journal of Advanced Navigation Technology
    • /
    • v.16 no.6
    • /
    • pp.960-967
    • /
    • 2012
  • Wireless sensor network is used at the environment to obtain nearby information and since such information is transferred through wireless link, it causes unnecessary re-sending and disadvantage of big energy consumption at node. Because of this to select reliable, energy effective link, method of estimating quality on wireless link using RSSI(received signal strength indication), LQI(link quality indication), etc is needed on wireless link. To set up path extending survival time by reducing energy consumption of nodes at the wireless sensor network, the thesis selects with small standard deviation of LQI after obtaining LQI within each path. Additionally, LQI standard deviation routing algorithm is compared based on LQI algorithm such as minimum-LQI, hop-LQI weight and RF output -7dBm. According to the outcome, the algorithm suggested has superior characters such as the number of node, retransmission rate and network life span respectively compared to existing algorithm. Therefore, energy consumption can be efficiently reduced in case that LQI standard deviation routing scheme suggested by this paper is adapted to wireless sensor network.

Vulnerability Case Analysis of Wireless Moving Vehicle (무선이동체의 취약점 사례 분석)

  • Oh, Sangyun;Hong, Jinkeun
    • Journal of the Korea Convergence Society
    • /
    • v.9 no.8
    • /
    • pp.41-46
    • /
    • 2018
  • As the industry related to drones has been activated, the public interest in drones has increased explosively, and many cases of drone-using are increasing. In the case of military drones, the security problem is the level of defense of the aircraft or cruise missiles, but commercial small and low cost drones are often released and utilized without security count-measure. This makes it possible for an attacker to easily gain access to the root of the drones, access internal files, or send fake packets. However, this droning problem can lead to another dangerous attack. In this regard, this paper has identified the vulnerabilities inherent in the commercial drones by analyzing the attack cases in the communication process of the specific drones. In this paper, we analyze and test the vulnerability in terms of scanning attack, meson attack, authentication revocation attack, packet stop command attack, packet retransmission attack, signal manipulation and de-compile attack. This study is useful for the analysis of drones attack and vulnerability.

Performance Evaluation of WSP with Capability Extension using Compression Techniques (압축 기법을 이용한 WSP의 기능 확장과 성능 평가)

  • Kim, Ki-Jo;Lee, Dong-Gun;Lim, Kyung-Shik
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.5
    • /
    • pp.543-552
    • /
    • 2002
  • Wireless Session Protocol(WSP) which was updated and supplemented based on HyperText Transfer Protocol(HTTP) was designed by Wireless Application Protocol(WAP) forum regarding the characteristics of wireless environment. WSP improved the performance in wireless network, and introduced various facilities considering wireless environment. In this paper, we more improve the performance of WSP adding protocol message compression capability; we cail improved WSP protocol as WSP+. And, we analysis the performance of each protocol with WSP and WSP+ implementation. As a result of experiment, the capability which proposed in this paper reduced a response traffic about 45%. In $10^{-4}$ bit error rate, we also found the packet loss rate and time delay per transaction of WSP+ was improved over 40%. Finally, we found that the protocol message compression capability reduces message retransmission count in transaction layer and shorten the delay time per transaction by reducing a message size.