• Title/Summary/Keyword: Tactical routing

Search Result 42, Processing Time 0.021 seconds

REVIEW ON ENERGY EFFICIENT OPPORTUNISTIC ROUTING PROTOCOL FOR UNDERWATER WIRELESS SENSOR NETWORKS

  • Ismail, Nasarudin;Mohamad, Mohd Murtadha
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.7
    • /
    • pp.3064-3094
    • /
    • 2018
  • Currently, the Underwater Sensor Networks (UWSNs) is mainly an interesting area due to its ability to provide a technology to gather many valuable data from underwater environment such as tsunami monitoring sensor, military tactical application, environmental monitoring and many more. However, UWSNs is suffering from limited energy, high packet loss and the use of acoustic communication. In UWSNs most of the energy consumption is used during the forwarding of packet data from the source to the destination. Therefore, many researchers are eager to design energy efficient routing protocol to minimize energy consumption in UWSNs. As the opportunistic routing (OR) is the most promising method to be used in UWSNs, this paper focuses on the existing proposed energy efficient OR protocol in UWSNs. This paper reviews the existing proposed energy efficient OR protocol, classifying them into 3 categories namely sender-side-based, receiver-side-based and hybrid. Furthermore each of the protocols is reviewed in detail, and its advantages and disadvantages are discussed. Finally, we discuss potential future work research directions in UWSNs, especially for energy efficient OR protocol design.

Multi-layer Network Virtualization for QoS Provisioning in Tactical Networks (전술망의 서비스 품질 보장을 위한 다계층 네트워크 가상화 기법)

  • Kim, Yohan;An, Namwon;Park, Juman;Park, Chan Yi;Lim, Hyuk
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.21 no.4
    • /
    • pp.497-507
    • /
    • 2018
  • Tactical networks are evolving into an All-IP based network for network centric warfare(NCW). Owing to the flexibility of IP based network, various military data applications including real-time and multi-media services are being integrated in tactical networks. Because each application has diverse Quality-of-service(QoS) requirements, it is crucial to develop a QoS provisioning method for guaranteeing QoS requirements efficiently. Conventionally, differentiated services(DiffServ) have been used to provide a different level of QoS for traffic flows. However, DiffServ is not designed to guarantee a specific requirement of QoS such as delay, loss, and bandwidth. Therefore, it is not suitable for military applications with a tight bound of QoS requirements. In this paper, we propose a multi-layer network virtualization scheme that allocates traffic flows having different QoS requirements to multiple virtual networks, which are constructed to support different QoS policies such as virtual network functions(VNFs), routing, queueing/active queue management(AQM), and physical layer policy. The experiment results indicate that the proposed scheme achieves lower delays and losses through multiple virtual networks having differentiated QoS policies in comparison with conventional networks.

Performance Evaluation of Routing Algorithms based on Optimum Transmission Range in Tactical MANETs (전술 MANET의 최적통달거리 기반 라우팅 알고리즘 성능 연구)

  • Choi, Hyungseok;Lee, JaeYong;Kim, ByungChul
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.4
    • /
    • pp.10-17
    • /
    • 2014
  • This paper presents an analytical method for finding the optimum transmission range in mobile ad hoc networks(MANETs). The results are particularly useful for the operation of military networks, as the transmission range affects the traffic throughput of user & routing traffic, delay, and frequency interference. When the conditions of tactical environment are applied in our simulations and the above-mentioned performances are analyzed, we find the OLSR protocol is more excellent. Plus, we compare the results of MANETs performance when applying optimum transmission range and the default transmission range(10km), and analyze the reasonability of the calculation of optimum transmission range proposed by this paper.

Epidemic Reliable Multicast by Peer Collaborations in Wireless Tactical Networks (무선 전술 네트워크에서 단말의 협력을 통한 전염 기반의 신뢰성 있는 멀티캐스트)

  • Hong, Min-Ki;Kang, Kyung-Ran;Cho, Young-Jong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.10B
    • /
    • pp.865-875
    • /
    • 2008
  • In this paper, we propose a reliable multicast scheme for the tactical wireless ad hoc network where the members share the situation and operation data. Our scheme consists of two phases to guarantee the reliability. During the dissemination phase, we utilizes an epidemic approach similar to gossip-based ad hoc routing. Then the group members interchange the message reception state information periodically so that they are able to recover missing packets from the other members. We evaluate the performance of our scheme through extensive simulations using the network simulator in comparison with other existing reliable multicast schemes in mobile ad hoc network. Our scheme shows higher packet delivery ratio regardless of the mobility and imposes much lower control overhead to the non-group members compared with the existing schemes.

A Method for Reducing Path Recovery Overhead of Clustering-based, Cognitive Radio Ad Hoc Routing Protocol (클러스터링 기반 인지 무선 애드혹 라우팅 프로토콜의 경로 복구 오버헤드 감소 기법)

  • Jang, Jin-kyung;Lim, Ji-hun;Kim, Do-Hyung;Ko, Young-Bae;Kim, Joung-Sik;Seo, Myung-hwan
    • Journal of IKEEE
    • /
    • v.23 no.1
    • /
    • pp.280-288
    • /
    • 2019
  • In the CR-enabled MANET, routing paths can be easily destroyed due to node mobility and channel unavailability (due to the emergence of the PU of a channel), resulting in significant overhead to maintain/recover the routing path. In this paper, network caching is actively used for route maintenance, taking into account the properties of the CR. In the proposed scheme, even if a node detects that a path becomes unavailable, it does not generate control messages to establish an alternative path. Instead, the node stores the packets in its local cache and 1) waits for a certain amount of time for the PU to disappear; 2) waits for a little longer while overhearing messages from other flow; 3) after that, the node applies local route recovery process or delay tolerant forwarding strategy. According to the simulation study using the OPNET simulator, it is shown that the proposed scheme successfully reduces the amount of control messages for path recovery and the service latency for the time-sensitive traffic by 13.8% and 45.4%, respectively, compared to the existing scheme. Nevertheless, the delivery ratio of the time-insensitive traffic is improved 14.5% in the proposed scheme.

Topology Aggregation for Hierarchical Wireless Tactical Networks

  • Pak, Woo-Guil;Choi, Young-June
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.2
    • /
    • pp.344-358
    • /
    • 2011
  • Wireless tactical network (WTN) is the most important present-day technology enabling modern network centric warfare. It inherits many features from WMNs, since the WTN is based on existing wireless mesh networks (WMNs). However, it also has distinctive characteristics, such as hierarchical structures and tight QoS (Quality-of-Service) requirements. Little research has been conducted on hierarchical protocols to support various QoS in WMN. We require new protocols specifically optimized for WTNs. Control packets are generally required to find paths and reserve resources for QoS requirements, so data throughput is not degraded due to overhead. The fundamental solution is to adopt topology aggregation, in which a low tier node aggregates and simplifies the topology information and delivers it to a high tier node. The overhead from control packet exchange can be reduced greatly due to decreased information size. Although topology aggregation is effective for low overhead, it also causes the inaccuracy of topology information; thus, incurring low QoS support capability. Therefore, we need a new topology aggregation algorithm to achieve high accuracy. In this paper, we propose a new aggregation algorithm based on star topology. Noting the hierarchical characteristics in military and hierarchical networks, star topology aggregation can be used effectively. Our algorithm uses a limited number of bypasses to increase the exactness of the star topology aggregation. It adjusts topology parameters whenever it adds a bypass. Consequently, the result is highly accurate and has low computational complexity.

Performance Analysis of Routing Protocols for Mobile Ad-hoc Network under Group Mobility Environment (그룹 이동 환경에서의 무선 애드혹 네트워크 라우팅 알고리즘 성능 분석)

  • Yang, Hyo-Sik;Yeo, In-Ho;Rhee, Jong-Myung
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.52-59
    • /
    • 2008
  • Most pier performance analysis results for ad-hoc routing protocols have been based upon the model which each node in the network moves independently without restriction. In most real environments, however, it is very common for a group or multiple groups to move under the direction of group leader or group leaders instead of each node's independent movement. This paper presents the performance analysis of routing protocols for mobile ad-hoc network under group mobility environment. The comparative simulations have been made between a table-driven protocol, DSDV, and two on-demand protocols, AODV and DSR, under a group mobility model, RPGM, which is suitable for the practical applications such as military tactical operation. Multiple group movements are also included. The results show that the protocol performances for single group movement are very similar to node independent movement case. However some differences have been observed by varying pause time and connectivity.

k-hop Flooding-based Multicast Considering the Limited Mobility of Mobile Nodes and Intermittent Disconnection (노드의 제한적 이동성과 간헐적인 연결 단절을 고려한 k-홉 플러딩 기반 멀티캐스트)

  • Im, Kwang-Bin;Kang, Kyung-Ran;Cho, Young-Jong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.6A
    • /
    • pp.600-610
    • /
    • 2010
  • In this paper, a multicast mechanism is proposed for intermittently disconnected networks where the nodes move forward in formation or within a limited area. The proposed scheme extends the well-known tree-based multicast routing mechanism called MAODV by modifying the tree construction and data delivery scheme. Especially, an algorithm is introduced which determines the flooding hop count k estimating the degree of the movement of children in the tree. The performance evaluation was done by the simulation and the proposed scheme was compared with MAODV and two multicast routing schemes for DTN (Disruption Tolerant Network) including the Epidemic routing and ST-multicast. The evaluation results show that our scheme improves the original MAODV from the aspect of tree reconstruction events and message delivery ratio. Compared with the Epidemic routing scheme, our scheme achieves 85% message delivery ratio with less than 50% message delivery overhead.

A Study of Mobile Ad-hoc Network Protocols for Ultra Narrowband Video Streaming over Tactical Combat Radio Networks (초협대역 영상전송 전투무선망을 위한 Mobile Ad-hoc Network 프로토콜 연구)

  • Seo, Myunghwan;Kim, Kihun;Ko, Yun-Soo;Kim, Kyungwoo;Kim, Donghyun;Choi, Jeung Won
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.23 no.4
    • /
    • pp.371-380
    • /
    • 2020
  • Video is principal information that facilitates commander's immediate command decision. Due to fading characteristics of radio link, however, it is difficult to stably transmit video in a multi-hop wireless environment. In this paper, we propose a MANET structure composed of a link adaptive routing protocol and a TDMA MAC protocol to stably transmit video traffic in a ultra-narrowband video streaming network. The routing protocol can adapt to link state change and select a stable route. The TDMA protocol enables collision-free video transmission to a destination using multi-hop dynamic resource allocation. As a result of simulation, the proposed MANET structure shows better video transmission performance than proposed MANET structure without link quality adaption, AODV with CSMA/CA, and OLSR with CSMA/CA structures.

Military Routing Scheme Using Content-Centric Mobile Ad Hoc Networks (콘텐츠 중심 MANET을 이용한 군 통신 라우팅 기법)

  • Park, Heungsoon;Kwon, Taewook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.4
    • /
    • pp.334-342
    • /
    • 2014
  • Military communications for future warfare have limited resources but highly requirements. MANET has a lot of advantages for future military network due to easily deploying without infrastructure and supporting dynamic topology in restricted environments. But, one of the biggest issues for MANET is difficulty of transmitting data due to link failure in dynamic topology. Content Centric Networking is a future Internet paradigm which solves various IP network problem. In this paper, we propose a future military communication routing scheme using CCN in military tactical MANET. Simulation results show our scheme gets lower control message overhead and faster data downloads as number of node increases and mobile speed increases than other two schemes.