• Title/Summary/Keyword: 데이터 링크 간 전달확인

Search Result 13, Processing Time 0.025 seconds

1-hop Data Traffic Reduction Method in Tactical Wireless Mobile Ad-Hoc Network based on MIL-STD-188-220C (MIL-STD-188-220C 기반 전술 무선 이동 Ad-Hoc 망에서 1-hop내 데이터 트래픽 감소 방법)

  • You, Ji-Sang
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.11 no.1
    • /
    • pp.15-24
    • /
    • 2008
  • The data delivery confirmation method of MIL-STD-188-220C, which is a tactical wireless mobile Ad-Hoc communication protocol, is that a source node requires the end-to-end ack from all destination nodes and the data-link ack from 1-hop neighboring destination nodes and relaying nodes, regardless of the hop distance from a source node to destination nodes. This method has the problem to degrade the whole communication network performance because of excessive data traffic due to the duplicate use of end-to-end ack and data-link ack, and the collision among end-to-end acks on the wireless network in the case of confirming a data delivery within an 1-hop distance. In order to solve this problem, this paper has proposed the method to perform the data delivery confirmation with the improvement of communication network performance through the data traffic reduction by achieving the reliable data delivery confirmation requiring the only data-link ack within an 1-hop distance. The effects of the proposed method are analyzed in the two aspects of the data delivery confirmation delay time and the data delivery confirmation success ratio.

A Real-Time Data Transfer Mechanism Considering Link Error Rates in Wireless Sensor Networks (무선 센서 네트워크에서 링크 에러율을 고려한 실시간 데이터 전달 기법)

  • Choi, Jae-Won;Lee, Kwang-Hui
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.1
    • /
    • pp.146-154
    • /
    • 2007
  • In this paper, we have presented a real-time transfer mechanism for the delay-sensitive data in WSNs (Wireless Sensor Networks). The existing methods for real-time data transfer select a path whose latency is shortest or the number of hops is least. Although the approaches of these methods are acceptable, they do not always work as efficiently as they can because they had no consideration for the link error rates. In the case of transmission failures on links, they can not guarantee the end-to-end real-time transfer due to retransmissions. Therefore, we have proposed an algorithm to select a real-time transfer path in consideration of the link error rates. Our mechanism estimates the 1-hop delay based on the link error rate between two neighboring nodes, which in turn enables the calculation of the expected end-to-end delay. A source node comes to choose a path with the shortest end-to-end delay as a real-time route, and sends data along the path chosen. We performed various experiments changing the link error rates and discovered that this proposed mechanism improves the speed of event-to-sink data transfer and reduces delay jitter. We also found that this mechanism prevents additional energy consumption and prolongs network lifetime, resulting from the elative reduction of transmission failures and retransmissions.

A Reliable Data Transfer Mechanism Using Directed Diffusion in Wireless Sensor Networks (무선 센서 네트워크에서 Directed Diffusion을 이용한 신뢰성 있는 데이터 전달 기법)

  • Choi Jae-Won;Lee Kwang-Hui
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.8 s.350
    • /
    • pp.77-83
    • /
    • 2006
  • In this paper, we have pesented a reliable data transfer mechanism using Directed Diffusion in WSNs (fireless Sensor Networks). This mechanism involves selecting a route with higher reachability and transferring data along the route chosen, which is based on the end-to-end reliability calculated by the dissemination procedure of Interest packets, while each node of a sensor network maintains the only information on its neighborhood. We performed various experiments changing the link error rates and the number of nodes and discovered that this proposed mechanism improves event-to-sink data transfer reliability in WSNs. We also found that this mechanism spreads traffic load over and reduces energy consumption, which in turn prolongs network lifetime.

A Design of DisplayPort AUX Channel (디스플레이포트 인터페이스의 AUX 채널 설계)

  • Cha, Seong-Bok;Yoon, Kwang-Hee;Kim, Tae-Ho;Kang, Jin-Ku
    • Journal of IKEEE
    • /
    • v.14 no.1
    • /
    • pp.1-7
    • /
    • 2010
  • This paper presents an implementation of the DisplayPort AUX(Auxiliary) Channel. DisplayPort uses Main link, AUX Channel and Hot Plug Detect line to transfer the video & audio data. For isochronous transport service, source device converts to image and audio data which are to be transported through the Main Link and transports the restructured image and audio data to sink device. The AUX Channel provides link service and device service for discovering, initializing and maintaining the Main link. Hot Plug Detect line is used to confirm the connection between source device and sink device. The AUX Channel is implemented with 3315 LUTs(Look Up Table), 1466 Flip Flops and 168.782MHz max speed synthesized using Xilinx ISE 9.2i at SoC Master3.

A Fast Route Selection Mechanism Considering Channel Statuses in Wireless Sensor Networks (무선 센서 네트워크에서 채널 상태를 고려하여 빠른 경로를 선택하는 기법)

  • Choi, Jae-Won
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.7
    • /
    • pp.45-51
    • /
    • 2009
  • We have presented a routing mechanism that selects a route by considering channel statuses in order to fast transfer delay-sensitive data in WSNs (Wireless Sensor Networks). The existing methods for real-time data transfer select a path whose latency is the shortest or the number of hops is the smallest. An algorithm to select a real-time transfer path based on link error rates according to the characteristic of wireless medium was also suggested. However, the propagation delay and retransmission timeout affected by link error rates are shorter than channel assessment time and backoff time. Therefore, the mechanism proposed in this paper estimated the time spent in using a clear channel and sending out a packet, which is based on channel backoff rates. A source node comes to select a route with the shortest end-to-end delay as a fast transfer path for real-time traffic, and sends data along the path chosen. We found that this proposed mechanism improves the speed of event-to-sink data transfer by performing experiments under different link error and channel backoff rates.

An Opportunistic Subchannel Allocation Scheme in Relay-based Marine Communication Networks (릴레이 기반의 해양 통신 시스템에서 기회주의적 서브채널 할당 기법)

  • Lee, Deokhui;Lee, Seong Ro;So, Jaewoo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.7
    • /
    • pp.546-551
    • /
    • 2014
  • This paper proposes an opportunistic subchannel allocation (OSA) scheme for relay-based marine communication networks to improve a sum-rate capacity. In most previous works for relay-based networks, each RS delivers the data received from the BS immediately to the corresponding ships in each frame. The achievable data-rate of the two-hop transmission (BS-RS and RS-ship links) is thus limited by the channel quality between BS-RS and RS-ship links. Hence, the radio resources can be wasted according to the difference in the channel quality between the BS-RS link and the RS-ship link. The proposed OSA scheme reduces the waste of radio resources by efficiently and independently allocating the radio resources at the BS-RS link and at the RS-ship link according to the channel quality of each link. The proposed OSA scheme, however, increases the computational complexity, because the BS finds the optimal OFDMA resource by checking the channel quality of all BS-RS links and RS-ship links. The simulation results show that the sum-rate capacity of the proposed OSA scheme improves maximum 14.0% compared with the conventional scheme.

Multipath Routing Protocol based on Multi-Rate Transmission in Mobile Ad Hoc Networks (이동 에드혹 네트워크에서 다중전송률전송에 기반한 다중경로 라우팅 기법)

  • Lee, Kang-Gun;Park, Hyung-Kun
    • Journal of Advanced Navigation Technology
    • /
    • v.18 no.3
    • /
    • pp.236-241
    • /
    • 2014
  • In a mobile ad hoc networks, multi-hop transmission is used to transfer data from source node to destination node and the routing protocol is the one of the important technical issues. The links between nodes can be unstable due to the changes of node location and channel conditions, and it can induce link error. To solve this problem, multipath routing was proposed. Multipath routing can reduce the data congestion and increase data throughput. In the multipath routing, however, each path can be interfered by the other path, and it can aggravate network performance. In this paper, we propose the multipath routing technique in the multi-rate MANET. The proposed multipath routing can avoid interference without the knowledge of node location. Simulation results show that the proposed multipath routing can reduce transmission delay and error.

Heterogeneous Network Gateway Architecture and Simulation for Tactical MANET (전술 에드혹 환경에서 이종망 게이트웨이 구조 및 시뮬레이션 연구)

  • Roh, Bong Soo;Han, Myoung Hun;Kwon, Dae Hoon;Ham, Jae Hyun;Yun, Seon Hui;Ha, Jae Kyoung;Kim, Ki Il
    • Journal of the Korea Society for Simulation
    • /
    • v.28 no.2
    • /
    • pp.97-105
    • /
    • 2019
  • The tactical mobile ad-hoc network(MANET) consists of distributed autonomous networks between individual ground nodes, which is effective in terms of network survivability and flexibility. However, due to constraints such as limited power, terrain, and mobility, frequent link disconnection and shadow area may occur in communication. On the other hand, the satellite network has the advantage of providing a wide-area wireless link overcoming terrain and mobility, but has limited bandwidth and high-latency characteristic. In the future battlefield, an integrated network architecture for interworking multi-layer networks through a heterogeneous network gateway (HNG) is required to overcome the limitations of the existing individual networks and increase reliability and efficiency of communication. In this paper, we propose a new HNG architecture and detailed algorithm that integrates satellite network and the tactical MANET and enables reliable data transfer based on flow characteristics of traffic. The simulations validated the proposed architecture using Riverbed Modeler, a network-level simulator.

Channel Assignment and Routing using Traffic Profiles in Wireless Mesh Networks (무선 메쉬 네트워크에서 트래픽 프로파일을 고려하는 채널 할당 및 라우팅)

  • Park, Sook-Young;Lee, Sang-Kyu
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.5
    • /
    • pp.374-385
    • /
    • 2010
  • Wireless mesh networks can be deployed for various networks from home networking to last-mile broadband Internet access. Wireless mesh networks are composed of mesh routers and mesh clients. In these networks, static nodes form a multi-hop backbone of a large wireless access network that provides connectivity to end-users' mobile terminals. The network nodes cooperate with each other to relay data traffic to its destinations. In order to increase connectivity and better performance, researchers are getting interested in multi-channel and multi-interface wireless mesh networks. In these networks, non-overlapping multiple frequency channels are used simultaneously to increase the aggregate bandwidth available to end-users. Recently, researches have focused on finding suitable channel assignments for wireless network interfaces, equiped in a mesh node, together with efficient routing to improve overall system throughput in wireless mesh networks. This goal can be achieved by minimize channel interference. Less interference among using channels in a network guarantees more aggregated channel capacity and better connectivity of the networks. In this thesis, we propose interference aware channel assignment and routing algorithms for multi-channel multi-hop wireless mesh networks. We propose Channel Assignment and Routing algorithms using Traffic Profiles(CARTP) and Routing algorithms allowing detour routing(CARTP+2). Finally, we evaluate the performance of proposed algorithms in comparison to results from previous methods using ns-2 simulations. The simulation results show that our proposed algorithms can enhance the overall network performance in wireless mesh networks.

DT-GPSR: Delay Tolerant-Greedy Perimeter Stateless Routing Protocol (DT-GPSR: 지연감내형 GPSR 라우팅 프로토콜)

  • Nam, Jae-Choong;Cho, You-Ze
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.2
    • /
    • pp.189-197
    • /
    • 2016
  • Mobile ad-hoc networks (MANETs) experience frequent link disconnections due to non-uniform node distribution and mobility. Thus, end-to-end path establishment-based routing protocols cause frequent transmission failures in MANETs, resulting in heavy control messages for path reestablishment. While location-based MANET routing protocols, such as Greedy Perimeter Stateless Routing (GPSR), use location information to forward messages in a hop-by-hop routing fashion without an end-to-end path establishment procedure, such protocols encounter communication void problems when message forwarding to the next hop fails due to the absence of a relay node. Therefore, to solve this problem, this paper proposes a Delay Tolerant-GPSR (DT-GPSR) protocol, which combines Delay Tolerant Networking (DTN) technology with the GPSR protocol. The performance of DT-GPSR is compared with the performances of the original GPSR and PRoPHET routing protocols through simulation using NS-2. The simulation results confirm that DT-GPSR outperforms GPSR and PRoPHET in terms of the message delivery ratio and message delivery delay.