Tactical Mobile Ad Hoc Networks Research Articles

Improvisation of Node Mobility Using Cluster Routing-based Group Adaptive in MANET

In today's Internet routing infrastructure, designers have addressed scaling concerns in routing constrained multiobjective optimization problems examining latency and mobility concerns as a secondary constrain. In tactical Mobile Ad-hoc Network (MANET), hubs can function based on the work plan in various social affairs and the internally connected hubs are almost having the related moving standards where the topology between one and the other are tightly coupled in steady support by considering the touchstone of hubs such as a self-sorted out, self-mending and self-administration. Clustering in the routing process is one of the key aspects to increase MANET performance by coordinating the pathways using multiple criteria and analytics. We present a Group Adaptive Hybrid Routing Algorithm (GAHRA) for gathering portability, which pursues table-driven directing methodology in stable accumulations and on-request steering strategy for versatile situations. Based on this aspect, the research demonstrates an adjustable framework for commuting between the table-driven approach and the on-request approach, with the objectives of enhancing the output of MANET routing computation in each hub. Simulation analysis and replication results reveal that the proposed method is promising than a single well-known existing routing approach and is well-suited for sensitive MANET applications.

Propagation Attenuation Maps Based on Parabolic Equation Method.

Modern wireless communication systems use various technological solutions to increase the efficiency of created radio networks. This efficiency also applies to radio resources. Currently, the utilization of a radio environment map (REM) is one of the directions allowing to improve radio resource management. The REM is increasingly used in emerging mobile ad-hoc networks (MANETs), in particular military tactical networks. In this case, the use of new technologies such as software-defined radio and network, cognitive radio, radio sensing, and building electromagnetic situational awareness made it possible to implement REM in tactical MANETs. Propagation attenuation maps (PAMs) are crucial REM elements that allow for determining the ranges of radio network nodes. In this paper, we present a novel algorithm for PAM based on a parabolic equation method (PEM). The PEM allows determining the signal attenuation along the assumed propagation direction. In this case, we consider terrain topography to obtain a more realistic analysis. Then, we average the adjacent attenuation profiles defined for the selected directions in places where attenuation has not been calculated. To this aim, linear regression is applied. Finally, we define several metrics that allow for the accuracy assessment of determining the PAM as a function of its dimensions.

Investigation of a GNN approach to mitigate congestion in a realistic MANET scenario

Mobile Ad-hoc Networks (MANETs) can be modelled as time-varying graphs as their topology and traffic demands change. Optimizing routing in MANETs by proactively adapting the routes is a challenge, even with a fixed topology and user demand Omniscient Dijkstra Routing (ODRb) is one of the best known approaches, which computes alternative paths but has limitations to mitigate congestions. In this paper, we investigate Graph Neural Networks (GNNs) for routing optimization in MANETs. Our contribution is inspired by the centralized GNN-based Data Driven Routing (GDDR) framework developed by Hope [1]. GDDR was developed for optical fibre networks to support time varying user demands. After failing to obtain good results using the GDDR approach on the tactical Anglova MANET scenario, we adapted GDDR to minimize the maximum number of traversals. Our GNN-t proposal is able to find alternative longer paths mitigating congestion on central nodes. Considering a challenging static topology, the first second of the 24-node Anglova scenario: GNN-t achieves a Completion Ratio of CR=99% for a traffic of acked-messages averaging 1msg/s/node and CR=77% when the traffic is doubled (2msg/s/node). For the challenging first 300s of Anglova CP1, similar performance is reported for ODRb and GNN-t: CR=81% without fading and CR=54% with fading.

Cooperative maximum-ratio transmission with multi-antenna relay nodes for tactical mobile ad-hoc networks

Abstract In this paper, we propose a cooperative maximum-ratio transmission (C-MRT) technique with multi-antenna relay nodes for tactical mobile ad-hoc networks (MANETs) where both the location and the number of antennas of relay nodes are arbitrary. Each relay node is assumed to know both the wireless channel coefficient from the source node to itself and the wireless channel from itself to the destination node, which is known as local channel state information (CSI) assumption. Maximum-ratio combining (MRC) and MRT techniques are used for beamforming the transmit and receive signals of the relay node, respectively. In addition, we mathematically analyze the overall outage probability of the proposed technique with moment generating function (MGF). It is shown that the mathematical analysis on the overall outage probability of the proposed C-MRT technique is matched well with the simulation results especially in high transmit power regimes. It is also observed that the proposed technique outperforms other schemes such as phase steering (PS) and optimal relay selection (ORS) in terms of outage probability.

Influential Nodes Analysis Method of Tactical Mobile Ad Hoc Networks Based on Impact Factors Evaluation*

How to identify and analyze influential nodes of Tactical Mobile Ad Hoc Networks is an urgent problem. Existing researches fail to make full use of features of Tactical Mobile Ad Hoc Networks. In this paper, we propose an influential nodes analysis method of Tactical Mobile Ad Hoc Networks based on impact factors evaluation (TINE). The method evaluates node importance through two mechanisms: connectivity analysis and node importance evaluation. In connectivity analysis, the current network topology is reconstructed by placing nodes to monitor network data packets and resolve protocol. In node importance evaluation, node importance degree is calculated by adjacency matrix. The experimental results show that TINE we proposed has advantages over the existing methods in Tactical Mobile Ad Hoc Networks.

Group Connectivity-Based UAV Positioning and Data Slot Allocation for Tactical MANET

On a future tactical-battle field network, combat radio nodes will be deployed for various operations, forming a mobile ad-hoc network (MANET). However, because of the nodes’ mobility, a single group might be divided into several small groups with fewer nodes. Conversely, several small groups might be merged into one group. In such an environment, an unmanned aerial vehicle (UAV) will provide an effective way to improve network coverage and connectivity among the small groups. However, some issues should be considered for the optimal deployment of the UAV. One issue is to find the proper position of the UAV, which enhances the connectivity among the groups, because a tactical network places a high priority on network survivability rather than throughput maximization. We also need to exploit real topographic information to obtain more accurate connectivity information among nodes. Second, an efficient resource allocation scheme for reliable communications through the UAV should be taken into account. Since most of the links between the UAV and the ground nodes are line-of-sight (LoS), due to the good quality of these links, the traffic via the UAV will be heavy in spite of the limited data slot resources. Moreover, the traffic flows of the network require diverse quality-of-service (QoS), and different priorities should be imposed upon the nodes depending on the involved tactical operations. In this paper, we formulate a UAV positioning problem maximizing group connectivity (GC) and a data slot-allocation problem maximizing GC utility. Subsequently, we propose an optimal positioning and slot allocation algorithm, which satisfies QoS requirement and supports the predetermined priorities of the nodes and the groups. Numerical analysis verifies that the proposed scheme is effective in UAV positioning and slot allocation, outperforming conventional methods.

Energy-Efficient TDMA Scheduling for UVS Tactical MANET

In a tactical mobile ad-hoc network (MANET), unmanned vehicles are deployed for surveillance and reconnaissance. They send multimedia data to a center node in real time. In this letter, we propose a centralized TDMA slot and power scheduling schemes which maximize energy efficiency (EE) considering Quality-of-Service (QoS) for the tactical MANET. We formulate this problem as a non-concave ratio optimization, and propose the optimal slot allocation and power control algorithms based on the Dinkelbach method and the concave-convex procedure. The performance of the proposed algorithm is verified by numerical results, which show a fairly good energy efficiency.

Implementasi Routing Terdistribusi pada Mobile AD HOC Networks (MANETS) untuk Sistem Komunikasi Taktis

Military communication, known tactical communications. Tactical communications support military operations is the region that does not have a fixed network infrastructure. Appropriate technology to support performance of tactical communication is Mobile Ad Hoc Networks (MANETs). Node in MANET has dynamic characteristics that will significantly influence the composition of the network topology. In tactical Mobile Ad Hoc Networks, problems that occur is the vulnerability to changes in the network topology due to node mobility. The solution face this problems is the routing protocol is suitable for use in MANET. In this study, used an approach in terms of distributed routing mechanism. In distributed routing mechanism, each node informed about the status of other nodes in the same network, and storage the information is within their local database respectively. TORA and AODV can support this mechanism, so in this study two of routing protocols will be compared in terms of dynamic adaptability, routing overhead, end-to-end delay and throughput. From this research, AODV produce better performance than TORA. For the speed of 10 m/s, the measurement of end-to-end delay is the smallest 1245.376 ms, increase in throughput of 74.363 % and the adaptability of 30.179. But the routing overhead generated greater, amounting 1359.

Enhancing Reliability of Tactical MANETs by Improving Routing Decisions

Mobile ad-hoc networks (MANETs) have been primarily designed to enhance tactical communications in a battlefield. They provide dynamic connectivity without requiring any pre-existing infrastructure. Their multi-hop capabilities can improve radio coverage significantly. The nature of tactical MANET operations requires more specialized routing protocols compared to the ones which are used in commercial MANET. Routing decisions in MANETs are usually conditioned on signal-to-interference-plus-noise ratio (SINR) measurements. In order to improve routing decisions for use in highly dynamic tactical MANETs, this paper proposes to combine two different metrics to achieve reliable multicast in multi-hop ad hoc networks. The resulting protocol combining received signal strength (RSS) with SINR to make routing decisions is referred to as Link Quality Aware Ad-hoc On-Demand Distance Vector (LQA-AODV) routing. The proposed routing protocol can quickly adapt to dynamic changes in network topology and link quality variations often encountered in tactical field operations. Using computer simulations, the performance of proposed protocol is shown to outperform other widely used reactive routing protocols assuming several performance metrics.

Enabling connectivity for tactical networks in mountainous areas by aerial relays

A general modeling framework for realistic performance evaluations of tactical mobile ad-hoc networks deployed in mountainous areas is presented. The framework is easily extensible, and can be eventually automated. It can be also used to generate data for other network simulators. The framework utilizes the freely downloadable high resolution 3D terrain data to define time dependent trajectories of network nodes. The node speeds and directions are linked to the terrain profile which extends the previously proposed mobility models. The path-loss analysis along the node trajectories revealed the need for aerial relays to enable full network connectivity at all times. The network consisting of 5 cluster heads and a single stationary relay is considered as a case study. The relay location and its antenna height are optimized to achieve the line-of-sight connectivity over the whole mission duration. The antenna radiation pattern at the relay is incorporated in the analysis. The resulting star network topology is used by the cluster heads to broadcast their packets to all other cluster heads. Several relaying schemes including the amplify-and-forward and the decode-and-forward relaying are studied together with the go-back-N retransmissions to achieve the reliable data transfer.

Comparative Analysis of Various Attacks on MANET

Mobile Ad hoc Networks (MANET) is a part of wireless networks. No wires and fixed routers are used in this type of network. It is not everlasting network; it is the short term network. Nodes has the capability to self organize themselves and it follows infrastructure less architecture. Network is formed by number of nodes moving in an inconsistent manner. They do not form any topology. Few examples of Ad hoc wireless network devices are Laptops, palmtops, smart phones etc [6]. And every nodes further acts as routers which transfers packet from one node to another node. Security is one of the main issues in Mobile Ad hoc Network. From last few years security problems in MANETs are gaining much attention. As there are many security vulnerabilities in MANET and which is the reason that it is not safe from attacks. There are many types of MANET like VANET (Vehicular Ad hoc Network), SPANs (Smart Phone Ad hoc Networks), iMANET (Internet based Mobile Ad hoc Network), Tactical MANET. The aim of this paper is to discuss about different types of attacks in Ad hoc network and some of the techniques by which these attacks can be protected.

전술 MANET에서 그룹 단위 분산된 동적 주소 할당 기법

전술 MANET에서 그룹 단위 분산된 동적 주소 할당 기법

On effective sampling techniques in host-based intrusion detection in tactical MANET

A tactical Mobile Ad Hoc Network MANET demands a robust, diverse and resilient communication and computing infrastructure which enables network-centric operation with minimal downtime. Nevertheless, tactical MANET poses great security risks because mobile nodes are deployed in open hostile environments and wireless communication makes the information accessible to an adversary attacking the tactical MANET. Cyber attack monitoring and detection in the tactical MANET is challenging because of limited resources and its infrastructure-less network environment. To address these issues, we first introduce the host-based detection architecture to monitor and detect cyber attacks against the tactical MANET. We then develop two sampling techniques and discuss other techniques to balance trade-offs between detection accuracy and consumption of network resources. We also analyse the impact of detection accuracy versus sampling techniques and associated parameters. We conduct extensive real-world experiments and simulation studies. Our data validates our theoretical findings well.

전술 모바일 애드 혹 네트워크를 위한 위치 기반의 신뢰성 제공을 위한 라우팅 방법

최근 정보통신 산업 및 네트워크 분야의 기술발달로 국방 무기체계에 새로운 패러다임 변화가 형성되었고, 군에서도 이러한 전쟁양상에 변화에 맞추어 TICN(Tactical Information Communication Network)이라는 통신체계를 도입하여 구축 중에 있다. TICN체계가 그 기능을 갖추기 위해서는 전장의 소규모 전투로부터 신뢰성 있는 정보를 실시간으로 전송 받아야 하는데, 이러한 기능을 지원해 주는 기술의 핵심적인 요소가 바로 MANET(Mobile Ad-Hoc Network) 라우팅 프로토콜이다. 본 논문에서는 일반 MANET 라우팅 프로토콜에서 주로 사용되는 최단경로 설정 기법의 전술네트워크 적용에 따른 문제점을 식별하고, 소규모 전투부대의 전술환경을 바탕으로, 중계 노드들의 위치와 속도, 데이터 크기 등을 고려하여 경로의 신뢰성과 데이터 지연 시간을 계산함으로써, 신뢰성 있는 정보를 실시간으로 전송 받을 수 있는 효율적인 전술 MANET 라우팅 프로토콜을 제안해 보고자 한다. Recently, developments in the field of communication and network technologies induced new paradigm in the defense weapon system. As a consequence, military authorities develop the Tactical Information Communication Network(TICN) system to adapt to the changing paradigm. One of the most important functions of TICN is real-time communication. As a result, TICN system needs to receive real-time information from the battlefield, and the key technology to support these features is MANET(Mobile Ad-Hoc Network) routing protocol. In this paper, we analyze problems of the shortest path scheme in tactical Ad-Hoc networks, which is widely used in common Ad-Hoc networks. We propose efficient routing protocol for tactical MANET by considering the environment of small combat units, such as node position, speed and data size. The proposed algorithm shows reliable data transfer and low latency in battlefield.

RMR: Reliability Map Routing for Tactical Mobile Ad Hoc Networks

We present a novel framework for spatial routing through difficult terrains with possibly untrustworthy regions in tactical mobile ad hoc networks. We describe a protocol, named Reliability Map Routing (RMR), which uses end-to-end Quality of Service metrics that include spatial reliability and trust. The RMR protocol reactively discovers routes over spatial cells whose local reliabilities are distributed throughout the network via a fast dissemination algorithm. By using a spatial approach where reliability and trust are attributed to space rather than to nodes, RMR is able to find reliable routes that persist for longer durations than those discovered by node-centric protocols. Furthermore, RMR is capable of reliable geocasting with low overhead. Via QualNet simulation studies, we compare the performance of the RMR protocol in terms of packet delivery ratio, delay, and overhead, and quantify the effects of node density, velocity, and traffic load on protocol performance. Our results indicate that the RMR protocol performs well in high mobility, high density scenarios because of its controlled routing overhead and spatial approach to routing.

A Hierarchical Identity Based Key Management Scheme in Tactical Mobile Ad Hoc Networks

Hierarchical key management schemes would serve well for military applications where the organization of the network is already hierarchical in nature. Most of the existing key management schemes concentrate only on network structures and key allocation algorithms, ignoring attributes of the nodes themselves. Due to the distributed and dynamic nature of MANETs, it is possible to show that there is a security benefit to be attained when the node states are considered in the process of constructing a private key generator (PKG). In this paper, we propose a distributed hierarchical key management scheme in which nodes can get their keys updated either from their parent nodes or a threshold of sibling nodes. The dynamic node selection process is formulated as a stochastic problem and the proposed scheme can select the best nodes to be used as PKGs from all available ones considering their security conditions and energy states. Simulation results show that the proposed scheme can decrease network compromising probability and increase network lifetime in tactical MANETs.

Link reliability based hybrid routing for tactical mobile ad hoc network

Tactical mobile ad hoc network (MANET) is a collection of mobile nodes forming a temporary network, without the aid of pre-established network infrastructure. The routing protocol has a crucial impact on the network performance in battlefields. Link reliability based hybrid routing (LRHR) is proposed, which is a novel hybrid routing protocol, for tactical MANET. Contrary to the traditional single path routing strategy, multiple paths are established between a pair of source-destination nodes. In the hybrid routing strategy, the rate of topological change provides a natural mechanism for switching dynamically between table-driven and on-demand routing. The simulation results indicate that the performances of the protocol in packet delivery ratio, routing overhead, and average end-to-end delay are better than the conventional routing protocol.