• Title/Summary/Keyword: Message Delay

Search Result 375, Processing Time 0.022 seconds

Optimum Design of a Communication Protocol for Meteor Burst Communication (유성 버스트 통신을 위한 통신 프로토콜의 최적설계)

  • 권혁숭
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.5
    • /
    • pp.892-901
    • /
    • 2001
  • Despite of many advantages over conventional radio paths, application of the Meteor Burst Path in commercial communication system is so far limited to a few extent because of its low duty rate, which is, less than several percent at best. In order to get through maximum number of data bits during the short interval of each burst, which normally lives a fractions of a second, a sophisticated communication protocol is called for. In this paper, author introduces a communication protocol which can effectively locate and fetch burst signal by sending out periodic detection signal from master station and, with minimal delay, switch over to transmission states so as to put as many data bits through the detected burst as the burst length permits. By analyzing time period required for each transaction steps, the author derives optimal packet length for various bursts which assures to get a message string through in minimum delay. According to the analysis, the author proposes a protocol including a routine which automatically accesses average length of bursts at each environment and automatically adapt length of data packet so as to maximize data throughput under Riven burst conditions.

  • PDF

Reliable Dynamic TDMA Scheme with new Packing method for Image Transmission over Link-16 (Link-16에서 이미지 전송을 위한 신뢰성 기반의 동적 TDMA 기법과 새로운 패킹 방법)

  • Baek, Hoki;Lim, Jaesung;Koo, Jayeul;Jin, Jeonghwan;Chun, Philseong;Oh, Ilhyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.11
    • /
    • pp.1045-1053
    • /
    • 2012
  • Link-16 is a widely used TDL (Tactical Data Link) which uses TDMA (Time Division Multiple Access). Link-16 is a very low rate system, so it supports small size of data like tactical message and voice. However, there are related works to transmit situation awareness information like image due to the increasing interest about EBO(Effect-Based Operation), recently. Special TDMA scheduling is needed not static TDMA of Link-16 for image transmission because image data has much larger size than the existing tactical data. In this paper, we proposed Link-16K which enhances the Link-16 MAC. The proposed Link-16K is compatible with Link-16, and includes dynamic TDMA, new packing method, and an efficient retransmission scheme for image transmission effectively. We can see that image transmission delay is reduced and channel utilization is increased through simulation results of proposed idea.

Performance Improvement of ARQ Protocol using HARQ Feedback Information in IEEE 802.16m Systems (IEEE 802.16m 시스템에서 HARQ 피드백 정보를 이용한 ARQ 프로토콜 성능 개선)

  • Lee, Jong-Min;Hong, Dae-Hyoung;So, Jae-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12A
    • /
    • pp.1136-1144
    • /
    • 2010
  • In this paper, the effects of HARQ feedback error are evaluated in IEEE 802.16m system when the HARQ and ARQ interactions that utilize the HARQ feedback information is used. Also, the HARQ and ARQ interaction scheme considering HARQ feedback errors are proposed. The HARQ and ARQ interaction scheme improve the system throughput by using the HARQ feedback information instead of the ARQ feedback message, which reduce retransmission time. However, errors in the HARQ feedback information generate severe performance degradation. Especially, the local NAK errors between HARQ feedback error critically degrade the performance, because the local NAK errors lead the loss of ARQ blocks. We propose a channel state-based schemes for HARQ and ARQ interactions to mitigate the throughput degradation due to HARQ feedback errors. Simulation results show that the proposed scheme improves the throughput and the delay performance.

Performance analysis of information propagation in DTN-like scale-free mobile social network

  • Wang, Zhifei;Deng, Su;Huang, Hongbin;Wu, Yahui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.3984-3996
    • /
    • 2014
  • Mobile social network can be seen as a specific application of the DTN (Delay Tolerant Network), in which the information propagation can be impacted by many social behaviors of the nodes. For a specific node, its social behaviors are various. For example, the node may not be interested in the information before receiving it and may also discard the information after getting it. On the other hand, people are more willing to forward the message to his friends. These interactive behaviors between nodes can be seen as social behaviors. It is easy to see that the impact of the social behaviors is related to the social ties, which can be manifested by the structure of the social network. State of the art works often simply assumes that the social networks can be divided into some communities. At present, some works find that the structure of some social networks is scale-free. To overcome this problem, this paper proposes a theoretical model to evaluate the impact of above social behaviors in the DTN-like scale-free network. Simulation shows the accuracy of the model. Numerical results show that both social behaviors and scale-free character have significant impact on information propagation. Moreover, the impact of social behaviors is related to the scale-free character of the networks.

Fast Handoff Technique using Improved Cashing Agent and CoA Pool in Mobile IP (모바일 아이피에서 개선된 캐싱 에이전트와 CoA 풀을 사용한 빠른 핸드오프 기법)

  • Lee, Jang-Su;Kim, Sung-Chun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.2
    • /
    • pp.75-82
    • /
    • 2008
  • Mobile IP was proposed to overcome identity problem of original IP address system caused by mobility of wireless mobile host. To complete its network handoff procedure, it must receive a mobile advertisement broadcasted by mobile agent. Generally, in a mobile IP system, mean time delay, 500ms, in a network handoff procedure is a critical problem of wireless service such as Voip, multimedia streaming. A caching agent caches a latest mobile advertisement, and replays it by receiving solicitation message from a mobile node finishing link layer detection. But, during the procedure of mobile registration, many packets from service provider to the mobile host would be lost and handoff time delay would be increased. In this thesis, we propose an unproved caching agent technique which can forward data packets while handoff procedure, and CoA pool for fast mobile IP registration.

Improved AODV Routing Protocol Considering the Link Quality of Wireless Transmission Environments (무선 전송환경의 링크품질을 고려한 개선된 AODV 라우팅프로토콜)

  • Lee, Tae-Hoon;Jeun, Sung-Woo;Kim, Young-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.10
    • /
    • pp.1903-1911
    • /
    • 2016
  • As interest in MANET is increasing nowadays, research upon an efficient MANET routing protocol is actively under way. A LQA(Link Qualty Aware)-AODV routing protocol to deal with frequent changes of topology and wireless link variations under tactical operating conditions is proposed in this paper. The suggested LQA-AODV takes into account the channel capacity of each hop during the route request process of the traditional AODV protocol. In detail, LQA-AODV adds a channel capacity cost value to the RREQ message format that occurs during the routing process of the existing AODV Routing Protocol causing the accumulated channel capacity cost values of each sections to be compared before establishing a route. To verify the performance of LQA-AODV, NS2.35 was utilized and the Link-Quality Model was applied in order to reflect the tactical wireless environment. The simulation compares and analyzes LQA-AODV and the existing AODV, showing a large improvement over the traditional AODV in regards to the Packet Delivery Ratio, and End-to-End Delay.

A Study on Performance Analysis of a Messaging System in IoT Environments (IoT 환경에서의 메시징 시스템의 성능 분석에 관한 연구)

  • Young-Dong Lee
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.24 no.2
    • /
    • pp.112-118
    • /
    • 2023
  • Internet of Things(IoT) technology is developing to a stage where the Internet and objects are connected and objects themselves analyze and judge data to interconnect the real world and the virtual world in real time. This technology consists of sensors, actuators, devices, and networks, and it is being applied in various fields. As the number of IoT devices and applications increases, data traffic also increases. In this paper, a messaging system is designed and implemented in order to analyze the performance between an IoT device and MQTT broker. The experimental was performed to measure MQTT-based round-trip time and message transmission time between the IoT device and the broker. The result shows that there is no packet loss, and propagation delay affects round-trip time.

An efficient Broadcast Authentication Scheme for Wireless Sensor Networks (무선 센서 네트워크에서의 효율적 Broadcast Authentication 방안)

  • Moon Hyung-Seok;Lee Sung-Chang
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.6 s.348
    • /
    • pp.23-29
    • /
    • 2006
  • It is difficult to apply conventional security algorithms to the wireless sensor networks composed of nodes that have resource constraints such as memory, computing, power resources limitation. Generally, shared key based algorithms with low resource consumption and short key length are used for broadcast packets in authentication of base station. But it is not suitable that all the nodes hold the same shared key only for packet authentication. Recently, broadcast authentication algorithm for sensor network is proposed, which uses key chain generation by one-way hash function, Message Authentication Code generation by each keys of the key chains and delayed key disclosure. It provides suitable authentication method for wireless sensor networks but may leads to inefficient consequence with respect to network conditions such as broadcast ratio, key chain level, and so on. In this paper, we propose an improved broadcast authentication algorithm that uses key chain link and periodical key disclosure. We evaluated the performance of proposed algorithm using TOSSIM(TinyOS Simulator) in TinyOS. The results show that the proposed algorithm ensures low authentication delay, uses memory and computing resource of receiving nodes efficiently and reduces the amount of packet transmitting/receiving.

An Implementation of Bandwidth Broker Based on COPS for Resource Management in Diffserv Network (차별화 서비스 망에서 COPS 기반 대역 브로커 설계 및 구현)

  • 한태만;김동원;정유현;이준화;김상하
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.4
    • /
    • pp.518-531
    • /
    • 2004
  • This paper discusses a testbed architecture for implementing scalable service differentiation in the Internet. The differentiated services (DiffServ) testbed architecture is based on a model in which a bandwidth broker (BB) can control network resources, and the ALTQ can reserve resources in a router to guarantee a Quality of Service (QoS) for incoming traffic to the testbed. The reservation and releasemessage for the ALTQ is contingent upon a decision message in the BE. The BB has all the information in advance, which is required for a decision message, in the form of PIB. A signaling protocol between the BB and the routers is the COPS protocol proposed at the IETF. In terms of service differentiation, a user should make an SLA in advance, and reserve required bandwidth through an RAR procedure. The SLA and RAR message between a user and the BB has implemented with the COPS extension which was used between a router and the BB. We evaluates the service differentiation for the video streaming in that the EF class traffic shows superb performance than the BE class traffic where is a network congestion. We also present the differentiated service showing a better packet receiving rate, low packet loss, and low delay for the EF class video service.

  • PDF

Update Frequency Cache Consistency for Reducing Wait Time in Mobile Computing (이동 컴퓨팅 환경에서 대기 시간을 감소시키는 갱신 빈도 캐쉬 일관성 기법)

  • Lee, Chan-Seob;Kim, Dong-Hyuk;Baek, Joo-Hyun;Choi, Eui-In
    • The KIPS Transactions:PartD
    • /
    • v.9D no.6
    • /
    • pp.1017-1024
    • /
    • 2002
  • According as mobile computing environment is generalized by development of wireless networking technology and communication device, mobile host uses local cache for extensibility and early response time. and reduction of limited bandwidth. This time, between mobile host and mobile support station cache need consistency interested person of done data accordingly much techniqueses propose. Existent consistency techniques because detection based techniqueses are used mainly and broadcast periodic invalid message considering frequent disconnection. However, these techniqueses increase abort step through increase or delay of transmission message number by accuracy examination of data. Therefore, because mobile host deletes cached data, and extensity are decreased. Techniques that is proposed in this paper did to perform refering update frequency about object that page request or when complete update operation happens to solve these problem. Therefore, have advantage that response is fast because could run write intention declaration or update by update frequency electively asynchronously when update operation consists and abort step decreases. Also, improved extensity running delete or propagation electively according to update frequency about periodic invalid message gone since disconnection.