Properties of Mobile Tactical Radio Networks on VHF Bands

Similar documents
Optimal p-persistent MAC algorithm for event-driven Wireless Sensor Networks

High resolution radar signal detection based on feature analysis

The Impact of Random Waypoint Mobility on Infrastructure Wireless Networks

Prediction Efficiency in Predictive p-csma/cd

An Overview of Substrate Noise Reduction Techniques

PERFORMANCE IMPROVEMENT OF MANETS

Analysis of Mean Access Delay in Variable-Window CSMA

and assigned priority levels in accordance with the QoS requirements of their applications.

Random Access Compressed Sensing in Underwater Sensor Networks

Ultra Wideband System Performance Studies in AWGN Channel with Intentional Interference

FOUNTAIN codes [1], [2] have been introduced to achieve

Decorrelation distance characterization of long term fading of CW MIMO channels in urban multicell environment

EXPERIMENT 6 CLOSED-LOOP TEMPERATURE CONTROL OF AN ELECTRICAL HEATER

Performance Analysis of Battery Power Management Schemes in Wireless Mobile. Devices

Efficient Importance Sampling for Monte Carlo Simulation of Multicast Networks

Investigation on Channel Estimation techniques for MIMO- OFDM System for QAM/QPSK Modulation

Performance Analysis of MIMO System using Space Division Multiplexing Algorithms

Practical Evaluation of Cooperative Communication for Ultra-Reliability and Low-Latency

Delivery Delay Analysis of Network Coded Wireless Broadcast Schemes

A Novel Image Component Transmission Approach to Improve Image Quality and Energy Efficiency in Wireless Sensor Networks

An Adaptive Narrowband Interference Excision Filter with Low Signal Loss for GPS Receivers

IMPROVED POLYNOMIAL TRANSITION REGIONS ALGORITHM FOR ALIAS-SUPPRESSED SIGNAL SYNTHESIS

Application of Notch Filtering under Low Sampling Rate for Broken Rotor Bar Detection with DTFT and AR based Spectrum Methods

Entropy Coding. Outline. Entropy. Definitions. log. A = {a, b, c, d, e}

Initial Ranging for WiMAX (802.16e) OFDMA

Evolutionary Circuit Design: Information Theory Perspective on Signal Propagation

Underwater acoustic channel model and variations due to changes in node and buoy positions

Control of Grid Integrated Voltage Source Converters under Unbalanced Conditions

Detecting Content Adaptive Scaling of Images for Forensic Applications

Mathematical and Computer Modelling. On the characterization of Aloha in underwater wireless networks

SPACE-FREQUENCY CODED OFDM FOR UNDERWATER ACOUSTIC COMMUNICATIONS

JOINT COMPENSATION OF OFDM TRANSMITTER AND RECEIVER IQ IMBALANCE IN THE PRESENCE OF CARRIER FREQUENCY OFFSET

Uplink Scheduling in Wireless Networks with Successive Interference Cancellation

A new approach to bit error rate reduction and its impact on telecom performance

Transmitter Antenna Diversity and Adaptive Signaling Using Long Range Prediction for Fast Fading DS/CDMA Mobile Radio Channels 1

University of Twente

LAB IX. LOW FREQUENCY CHARACTERISTICS OF JFETS

Impact of Inaccurate User and Base Station Positioning on Autonomous Coverage Estimation

Lab 4: The transformer

THE USE OF INSULATED WIRES MILLIKEN CONDUCTORS IN HIGH VOLTAGE POWER TRANSMISSION UNDERGROUND AC LINES. x y s ABSTRACT

Adaptive Switching between Spatial Diversity and Multiplexing: a Cross-layer Approach

Analysis of Pseudorange-Based DGPS after Multipath Mitigation

Approximated fast estimator for the shape parameter of generalized Gaussian distribution for a small sample size

Primary User Enters the Game: Performance of Dynamic Spectrum Leasing in Cognitive Radio Networks

Statistical Evaluation of the Azimuth and Elevation Angles Seen at the Output of the Receiving Antenna

Accurate wireless channel modeling for efficient adaptive Forward Error Correction in JPEG 2000 video streaming systems

Multi-TOA Based Position Estimation for IR-UWB

Technical and Economic Feasibility of Passive Shielding Used to Mitigate Power Lines Magnetic Fields

The online muon identification with the ATLAS experiment at the LHC

2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media,

ANALYSIS OF ROBUST MILTIUSER DETECTION TECHNIQUE FOR COMMUNICATION SYSTEM

Optimization of an Evaluation Function of the 4-sided Dominoes Game Using a Genetic Algorithm

Performance of Chaos-Based Communication Systems Under the Influence of Coexisting Conventional Spread-Spectrum Systems

A toy-model for the regulation of cognitive radios

Origins of Stator Current Spectra in DFIGs with Winding Faults and Excitation Asymmetries

Chapter 7 Local Navigation: Obstacle Avoidance

Design and Evaluation of Localization Protocols and Algorithms in Wireless Sensor Networks Using UWB

The pulse compression waveform that we have already considered is the LFM t is a quadratic phase function.

Performance Analysis of LTE Downlink under Symbol Timing Offset

Simulation and Characterization of UWB system coexistence with traditional communication Systems

Reduced Complexity MUD-MLSE Receiver for Partially-Overlapping WLAN-Like Interference

The Multi-Focus Plenoptic Camera

An Efficient VLSI Architecture Parallel Prefix Counting With Domino Logic Λ

Analysis of Source Location Accuracy Using a Network of Acoustic Sensors with Application to Network System Design

Usable speech detection using a context dependent Gaussian mixture model classifier

Cost-Efficient Topology Design Problem in Time-Evolving Delay-Tolerant Networks

A Pricing-Based Cooperative Spectrum Sharing Stackelberg Game

State-of-the-Art Verification of the Hard Driven GTO Inverter Development for a 100 MVA Intertie

Matching Book-Spine Images for Library Shelf-Reading Process Automation

Random Access Compressed Sensing for Energy-Efficient Underwater Sensor Networks

RICIAN FADING DISTRIBUTION FOR 40GHZ CHANNELS

Capacity Gain From Two-Transmitter and Two-Receiver Cooperation

Analysis of Electronic Circuits with the Signal Flow Graph Method

Antenna Selection Scheme for Wireless Channels Utilizing Differential Space-Time Modulation

CHAPTER 5 INTERNAL MODEL CONTROL STRATEGY. The Internal Model Control (IMC) based approach for PID controller

Kaleidoscope modes in large aperture Porro prism resonators

FROM ANTENNA SPACINGS TO THEORETICAL CAPACITIES - GUIDELINES FOR SIMULATING MIMO SYSTEMS

Self-Driven Phase Shifted Full Bridge Converter for Telecom Applications

Topology Construction in RPL Networks over Beacon-Enabled

Multi-period Channel Assignment

Probabilistic Broadcast for Flooding in Wireless Mobile Ad hoc Networks

Improving Satellite Surveillance through Optimal Assignment of Assets

TWO-STAGE SPEECH/MUSIC CLASSIFIER WITH DECISION SMOOTHING AND SHARPENING IN THE EVS CODEC

Computer Networks 56 (2012) Contents lists available at SciVerse ScienceDirect. Computer Networks

Indirect Channel Sensing for Cognitive Amplify-and-Forward Relay Networks

TO IMPROVE BIT ERROR RATE OF TURBO CODED OFDM TRANSMISSION OVER NOISY CHANNEL

There are two basic types of FET s: The junction field effect transistor or JFET the metal oxide FET or MOSFET.

Data-precoded algorithm for multiple-relayassisted

Operating Characteristics of Underlay Cognitive Relay Networks

Characteristics of optical bandpass filters employing series-cascaded double-ring resonators q

COMPARISON OF DIFFERENT CDGPS SOLUTIONS FOR ON-THE-FLY INTEGER AMBIGUITY RESOLUTION IN LONG BASELINE LEO FORMATIONS

Ground Clutter Canceling with a Regression Filter

Dynamic Range Enhancement Algorithms for CMOS Sensors With Non-Destructive Readout

Energy-Efficient MANET Routing: Ideal vs. Realistic Performance

An Overview of PAPR Reduction Optimization Algorithm for MC-CDMA System

Joint Frame Design, Resource Allocation and User Association for Massive MIMO Heterogeneous Networks with Wireless Backhaul

A Novel, Robust DSP-Based Indirect Rotor Position Estimation for Permanent Magnet AC Motors Without Rotor Saliency

PROVIDING ANCILLARY SERVICES IN DISTRIBUTION NETWORKS WITH VANADIUM REDOX FLOW BATTERIES: ALPSTORE PROJECT

Laboratory Essay with Online Back-calculation Anti-windup Scheme for a MTG System

arxiv: v1 [eess.sp] 10 Apr 2018

Transcription:

Proerties of Mobile Tactical Radio Networks on VHF Bands Li Li, Phil Vigneron Communications Research Centre Canada Ottawa, Canada li.li@crc.gc.ca / hil.vigneron@crc.gc.ca ABSTRACT This work extends a network model that was develoed for the study of mobile tactical scenarios emloying VHF combat radios. The model uses VHF radio signal measurement data, integrating ractical network deloyment scenarios and node mobility models to evaluate network link robabilities, and to derive fundamental network roerties including the average network node degree, network connectivity strength, network ath ho count distribution and dynamics of network link udates. The results illustrate imortant network characteristics and rovide insights for assessing alicability and otimization of network rotocols for tactical radios oerating in the VHF band. 1.0 INTRODUCTION Mobile Tactical Networks (MTN) that use tactical radios oerating in the VHF military bands [4-5] offer the otential for imroved coverage and scalability through self-forming multi-ho caabilities. The MTN aims to deliver realtime integrated voice and data across command osts, vehicles and dismounted soldiers to rovide enhanced C2 and situational awareness in the military oerational theatre. To suort the multi-ho networking functions required by the MTN, many recent rotocols roosed for mobile ad hoc networks (MANET) [6-9] may be considered candidate solutions. However, most of these roosals assume WiFi (e.g., IEEE 802.11) radios when conducting rotocol analysis and simulations. The communication roerties exhibited by VHF tactical radios are very different from those of generic WiFi radios, e.g., limited bandwidth and different signal ath loss roerties. To establish effective network rotocol design guidelines and to evaluate networking solution otions ragmatically, it is imortant to understand the fundamental roerties of MTN in tyical oerational scenarios. The urose of this work is thus to investigate the network characteristics of MTNs in a ractical deloyment scenario. The aroach taken combines an analytical network model [1], tactical VHF radio signal measurement data [2-3] and realistic mobility scenarios, taking into account different terrain tyes. In the model, numerical comutations are alied to calculate the changing distance matrix of the network nodes through the duration of network simulation to cature the toology udates. The model comutes the network link and ath robability matrices, the network node degree, the link udate ratio, the ath length and cost distribution, etc. The results obtained illustrate the fundamental network roerties of the MTN, which rovide significant insights for assessing alicability and otimization of the mobile ad hoc network rotocols and schemes in the MTN environment. The rest of the aer is organized as follows: section 2 briefly describes the network model; the network deloyment scenario is resented in section 3; section 4 illustrates the network roerties obtained and section 5 concludes the aer. RTO-MP-IST-092 15-1

Proerties of Mobile Tactical Radio Networks on VHF Bands 2.0 NETWORK MODEL FOR MOBILE VHF NETS The network model emloyed in this study is established for a mobile tactical network alying comrehensive radio signal measurement data [1-3]. As described in [1], the network model is based on an undirected geometric random grah where a tactical link is described using ( r, t), which is the robability of having a link between node i and j at distance metric r at time t [1, 10]. The mobility scenario generator BonnMotion [12] is emloyed to roduce MTN deloyment scenarios for the model. The outut file of BonnMotion traces the trajectory of each node by logging ositions of the node through time. Then given a time interval samled at instants nt, i.e., t = {T, 2T,, nt, }, the 2-dimensional osition coordinates of all nodes in the network at each samling instant t are collected in the N 2 osition matrix X t) {( x ( t), x ( )) i = 1,2,... N, where N is the total number of radio nodes. A distance matrix is N 2 ( = i1 i2 t } then formed for all nodes at each samling instant as d ( t) = { d ( t) i, = 1,2, d ( t) = ( xik ( t) x jk ( t)) k = 1,2 2 N N j }..., N, where. Matrix d ( t) N N is then alied to calculate ( r, t), using the radio signal measurement data taken in the terrain tye of the deloyment field [2, 3], as described in [1]. With T sufficiently small, the resulting ( r, t) characterizes the network link status through the entire modelling duration. Given ( r, t), the average node degree, the robability that a link changes its state at any given time t, and the exected number of links that change states at any given node i at time t can all be derived as resented in [1]. To gather the network connectivity information, ath robability matrices of the network for both voice and data ackets are comuted at each samling time t. Realtime voice traffic requires aths of high availability and low latency, without erforming retransmissions even if errors occur in the recetion. The ath matrix for voice VP [t], with (i,j)th element [t], is comuted assuming that the transmission from source to v destination refers all the intermediate hos to be available simultaneously, and that the link robabilities are indeendent of each other. A modified Floyd shortest ath algorithm is used selecting the maximum ath robability [1] as: VP[ t] = [ ( r, t)]; for k = 1 to N do for all i, j, do If v [ t] < ), v [ t] = max( v [ t], v [ t] v [ t]) ; where r is the error threshold. ( r ik kj Other auxiliary data structures are included in the ath comutation algorithm to cature the list of hos contained along each ath; these are not shown here to kee the descritions succinct. Denote the required delivery ratio of voice ackets as The error threshold is dr. L is the length of the acket and b is the BER. dr r = for a ath of m hos, assuming indeendent bit errors. Taking the ml ( 1 b ) NATO standard MELPe voice format of 7 bytes er frame and 4 frames acked into one voice acket to 15-2 RTO-MP-IST-092

Proerties of Mobile Tactical Radio Networks on VHF Bands enhance the transmission efficiency as in many common imlementations, an examle voice acket size is assumed containing 50 bytes, i.e., L =400, including headers in comressed format. The voice aths are comuted at each samling time t using dr =95% and b = 6 10. The ath for data communications differs from that for voice. Data communications tolerate end to end latency but not errors. Retransmissions will be used, such as in the er-ho ARQ scheme to ensure reliable delivery. In this case, the ho cost is formulated as the exected number of transmissions taken for the acket to traverse a ho. This ho cost reresents the sectral cost in terms of number of sends, aroximating the occuancy of timeslots in a TDMA network. As earlier, the link robability between nodes i and j at time t is ( r, t), hence the robability that a acket is successfully received is b L = ( r, t)(1 ). The robability that node i receives the acknowledgement (ACK) from j after 2 sending a acket is ( 1 (1 )) =, assuming only one ACK is sent for each received acket. Then the 1 exected number of times that node i sends the acket is. At each time, the robability that a sent acket 2 is received successfully at j is. If received correctly, a single ACK is generated. The total exected number 1 1 of ACKs sent by node j for this acket is then 1 =. The total exected number of acket 2 transmission attemts and acknowledgements sent across the ho between nodes i and j, which is the sectral cost of the ho, is thus: 1 1 1+ w ( t) = + =. 2 2 The ath matrix for data, DP [t] with its (i,j)th element [t], is thus comuted as: DP[ t] = [ w ( t)]; for k = 1 to N do for all i, j, do d [ t] = min( d [ t], d [ t] d [ t]) ; ik + kj The above two algorithms generate the ath matrices for voice and data at each samling instant during the modelling time of the network. The results will be illustrated in Section 4. d 3.0 NETWORK SCENARIO The network mobility traces are generated using the mobility scenario generator BonnMotion [12]. The semi-rural area is selected for network deloyment, using the measurement data taken from this tye of terrain [2-3]. The semi-rural environment measured has a significant amount of rural and forested areas, RTO-MP-IST-092 15-3

Proerties of Mobile Tactical Radio Networks on VHF Bands some overgrown farm fields and a few two or three story brick buildings [3]. The scenario has 38 deloyed radio nodes in a field of 400 km 2 (20 km by 20 km), which is divided into four 10 km by 10 km non-overlaing quarters. Among all the nodes, 3 of them form a commander grou ositioned in the area of 5 km by 5 km at the center of the field. A grou of 8 nodes is deloyed in each of the four quarters. The commanders and the 4 grous are all running the reference oint grou mobility (RPGM) model [11]. The remaining three are individual nodes with assigned tasks such as reconnaissance or secial oerations. These three nodes move in the entire field of 20 km by 20 km according to a random wayoint model. Excet the commander grou, all the nodes travel in the seed range of 8.3 22.2 m/s with an average ause time of zero to 10 minutes. The commander grou has an average ause time of 30 minutes and moves between the seed levels of 0-8 m/s. Within each grou, the maximum distance from any node to the grou center varies between 3 km and 5 km. A total of 10 networks are generated to average the comutation results. The modelling time for each network is 9000 sec and the samling interval is chosen to be 3 sec for semi-rural scenarios, which is sufficient to cature the udates caused by the defined mobility. Figure 1 below illustrates some sna shots of one of such networks generated in the model, at different samling times. km 20. 15. 10. 5. Network at Time=30 minutes ç ç à à à à à àà ô ç ôô ì ì ì æ æ æ æ æ æ km 20. 15. Network at Time=75 minutes ì ì ç ìì ìì 0 0 5. 10. 15. 20. km 10. æ grou 1 à grou 2 ì grou 3 grou 4 ô Commanders ç Secial Oerations 5. à à àà àà à ô ô ç ô æ æ æ æ æ æ æ 0 ç 0 5. 10. 15. 20. km Figure 1 Tactical network deloyment scenario examle 4.0 NETWORK PROPERTIES The radio signal frequency is at 57.0 MHz with channel bandwidth of 25 khz. The data rates range from 20kbs to 96 kbs. The transmission ower is 46 dbm for vehicle mounted unit. The recetion noise floor in the field is -126 to -95 dbm. The required SNR for achieving the data rate, deending on the radio design, may range from 6 dbm to 23 dbm. From these arameters, the ath loss margin is estimated to be around 140 db. Given the reference distance d 0 = 100 m, the ath loss arameters comuted from the measurement 15-4 RTO-MP-IST-092

data have the exonent η =3.18, the intercet α d ) = 68.8 dbm, and the standard deviation of the ( 0 shadowing δ = 4.11 dbm, for the selected terrain of semi-rural. Then alying the algorithms resented in the revious section and the formulas in [1], the link robability ( r, t) at each samling instant t is obtained, which leads to the node degree distribution, as shown in Figure 2. Proerties of Mobile Tactical Radio Networks on VHF Bands cdf 1.0 0.8 0.6 ath loss margin=130db 133 db 135 db 0.4 0.2 138 db ath loss margin =140dB 15 20 25 30 35 node degree Figure 2 Distribution of network node degree The average node degree varies from about 17 nodes to 33 nodes when the ath loss margin changes from 130 db to 140 db, which is fairly high. To find out how the network connectivity is imacted under the different network conditions, the average network connectivity level (t) is defined as: C l C ( t) = l 2 N N i= 1 j= i+ 1 γ ( i, j, t) N ( N 1), where γ ( i, j, t) is the largest ath robability between node i and j comuted over all ossible routes at time t. Note that C l (t) is the ratio of the exected number of aths over the total number of routes (node airs) in the network. The matrix Γ( t) = [ γ ( i, j, t)] is obtained by alying the voice ath comuting algorithm with r =1. The network C l (t) s for ath loss margin of 130 db and 140 db are lotted in Figure 3 (a), showing the variation through the entire 9000 seconds of network modelling time. A network connectivity level of 1 indicates a fully connected network between all node airs. It can be seen that when the average node degree decreases from 33 to 17, the network connectivity level moves from close to 1 all the time, to ranging between 85% and 99%. Taking any of the three commander nodes in the network, its average ath robability to all the other nodes in the network, referred as the average overall ath robability, can be comuted at each samling time t. It is found that the average overall ath robability of any of the commander nodes is closely related to the network connectivity level (t). In Figure 3 (b), the average overall ath robability of one of the C l commander nodes is lotted together with the network connectivity level C l (t), for ath loss of 140 db, to RTO-MP-IST-092 15-5

Proerties of Mobile Tactical Radio Networks on VHF Bands illustrate this observation. The imlication of this relationshi is elaborated on later in the section. Connectivity Level 1.00 0.98 0.96 0.94 0.92 0.90 0.88 ath loss margin 130dB ass loss margin 140dB Time HsL 1500 3000 4500 6000 7500 9000 Figure 3 (a) Average network connectivity levels 1.00000 0.99995 0.99990 0.99985 time HsL 1500 3000 4500 6000 7500 9000 commander node network Conn. Level Figure 3 (b) Average overall ath robabilities of commander nodes vs. network connectivity level The voice ath matrix VP[t] is comuted with dr =95%, yielding the distribution of the voice ath length in the network, which is deicted in Figure 4, for networks with average node degree ranging from 17 to 32 nodes, i.e., the ath loss margin of 130 to 140 db. When the ath ho count is larger than three, the end-toend throughut delivered on the very low seed tactical links may be ractically too small and the latency too high. When the average node degree is below 25, i.e., the ath loss margin <135dB, certain voice ath will extend to more than 3 hos, causing QoS concerns. A ractical MTN is often connected with many nodes within 1 ho and others reachable through a single relay. A few nodes at certain times may temorarily require two relay nodes to connect when they are searated due to ath obstacles. Such strong connectivity maintains the high reliability and low latency required by tactical communications. At a ath loss margin of 140 db, the network is connected with nodes mostly 1 and 2 hos aart, and only a few aths 15-6 RTO-MP-IST-092

Proerties of Mobile Tactical Radio Networks on VHF Bands traversing 3 hos. The average smallest best ossible ath robability found in matrices (t) was then 0.985, reresenting a strongly connected tactical network. 1.0 cdf 0.8 0.6 0.4 ath loss margin 130dB ath loss margin 135dB ath loss margin 138dB aths loss margin 140dB 2 4 6 8 10 Ho Count Figure 4 Distributions of voice ath ho counts The data ath matrix DP[t] is comuted by alying the algorithm resented in the revious section. The distribution of data ath ho counts is illustrated in Figure 5(a) for different ath loss margins (denoted as lm in the figure). It can be seen that data aths have relatively shorter ho counts than voice aths. However, because of the required reliability and the ARQ transmission scheme, the real sending cost on a data ath is different from its ho count. On a single ho, two sends or even more will be needed to deliver a single data acket successfully. Each send consumes bandwidth and ower. Thus the real cost of data aths is calculated as the number of transmissions required for a successful acket delivery, as the ath sectral cost, described in the algorithm resented in the revious section. The distribution of the data ath sectral cost is illustrated in Figure 5 (b). The cost of data aths in the network is relatively higher than the voice ath, because the send cost of voice traffic is the same as the ho count of its ath. cdf 1.0 0.9 0.8 0.7 0.6 0.5 HaL data ath ho count lm=130db lm=135db lm=140db 1 2 3 4 cdf 1.0 0.8 0.6 0.4 0.2 HbL data ath sectral cost lm=130db lm=135db lm=140db 2 3 4 5 6 7 8 9 10 Figure 5 Distributions of data ath ho counts and costs The robability that a link changes its state from samling instant t-1 to t can be calculated as [1]: _ linkchange( i, j, t) = ( 1 ( r, t 1)) ( r, t) + ( r, t 1)(1 ( r, t)) RTO-MP-IST-092 15-7

Proerties of Mobile Tactical Radio Networks on VHF Bands The link between node i and j incurs a state change from time instant t-1 to t, if there is a link between node i and j at time t while none existed at time t-1; or there is no link between node i and j at time t while there was one at time t-1. The distribution of the ercentage of links that change their states across each samling interval is deicted in Figure 6. In comarison, when the node degree is around 17, i.e., ath loss margin is 130 db, on average more than 23% of the links in the network exerience state changes in the 3 sec samling interval. This amounts to about 150 links changing their state at a given time in the network. 1.0 0.8 cdf Percentage of Changing Links in the Network ath loss margin 130dB ass loss margin 140dB 0.6 0.4 0.2 5 10 15 20 25 H%L Figure 6 Percentage of changing links er samling interval The above results illustrate the basic structural and dynamic network roerties of the selected tyical VHF tactical deloyment scenario. It can be seen that the network has a relatively dense neighbourhood with nodes having high average node degrees. When average network node degrees decrease, the ath ho counts will increase. To maintain the useful voice aths in the network without too many traversing hos, the node degree may need to stay quite high, e.g., about 17 to 20 nodes on average. However, the increase in data ath sectral cost is even faster than the increase of the ho counts. Hence to maintain a low cost for data communication aths, the average node degree may need to be even higher. For low node degrees, there may be an average of 6 sends for a data acket along the ath. With a high node degree and very limited link bandwidth, e.g., 20 kbs to 96 kbs of shared link rates for the next generation NATO narrowband waveforms oerating in the tyical 25 khz VHF channel, a rotocol udating the two ho neighbourhood information, e.g., the oular HELLO rotocol [6-10] may result in a fairly heavy traffic overhead in the shared neighbourhood, when node degrees are so high [13]. In general, the comrehensive exchange of link status information can be quite costly in such densely formed networks. Even when the node degree decreases, e.g., if the ath loss margin is reduced to 130 or 135 db, the number of links that need to reort an udate would increase, which roduces more data in the udate messages [1, 13]. It should also be noted that this network configuration concentrates the highest node degrees on the commander nodes. As shown in Figure 7, which deicts the average node degrees of each of the 38 nodes in the network, the commander nodes, numbered as node 33, 34 and 35, have much higher average node degree comared to the other nodes. In fact, the commander nodes become the major relay nodes for network aths. On one hand, this fortifies the connections between the commander nodes and the rest of the network, which is desirable; but on the other hand, it leads to increased congestion and contention in the neighborhood of the commander nodes, and increases their vulnerability. This also exlains the result illustrated in the Figure 3(b). As major relay nodes, the average overall ath robabilities observed by the commander nodes reflect the overall connectivity strength among all nodes at that time. This roerty may lead to a network route and toology control strategy for this tye of network deloyment scenario that exhibits a central area. The nodes 15-8 RTO-MP-IST-092

Proerties of Mobile Tactical Radio Networks on VHF Bands laced in the central area will not only become the hub/relay oints, but also have visibilities on network connectivity situations. Such nodes can even be dedicated hub/central nodes if it is desirable to shield the commander nodes from the vulnerability and heavy traffic load entailed in being in the role of network hubs. Then the commander nodes may maintain a one ho strong connectivity to these central relay nodes to achieve their strong network reachability as well as network situational awareness. 5.0 CONCLUDING REMARKS Figure 7 Average node degrees for all nodes in the network In this aer, real VHF radio signal measurement data are alied to study the network roerties of mobile VHF radio networks in a tyical deloyment scenario. This is accomlished using a geometric random grah integrating tactical mobility scenarios with radio measurement data to establish a network model. The model is further extended to cature the imortant roerties of the network such as the link robability, the ath robability, the ath ho counts and the network connectivity strength. These models have identified the fundamental structural and dynamic characteristics of the network formed. The results indicate the ossible heavy overhead cost of oular networking rotocols when udating two-ho neighbour information in the dense network neighbourhood. It has also demonstrated the critical role of the central/hub nodes in such deloyment scenarios when network ho counts are small. The different ath ho count distributions for voice and data traffic call for a suitable ath selection mechanism to suort their different QoS requirements. It is evident from this study that the network roerties of mobile tactical radio networks need to be considered when designing and otimizing networking solutions. 6.0 ACKNOWLEDGEMENT This research is suorted by Defence Research and Develoment Canada. 7.0 REFERENCES [1] L. Li and T. Kunz, Efficient Mobile Networking for Tactical Radios, Proceedings of IEEE MILCOM 2009, Boston, MA, USA, Oct 2009 [2] J. Pugh, R. Bultitude, and P. Vigneron, Path Loss Measurements With Low Antennas for Segmented RTO-MP-IST-092 15-9

Proerties of Mobile Tactical Radio Networks on VHF Bands Wideband Communications at VHF, Proceedings of IEEE MILCOM 06, Washington DC, Oct 2006 [3] J. Pugh, R. Bultitude, and P. Vigneron, Proagation Measurements and Modelling for Multiband Communications on Tactical VHF Channels, Proceedings of IEEE MILCOM 07, Orlando, Florida, Oct. 2007 [4] H. Wang, et al., "Imlementing Mobile Ad hoc Networking (MANET) over Legacy Tactical Radio Links", Proceedings of IEEE MILCOM 2007, Orlando, Florida, Oct 2007 [5] A. Blair et al., "Tactical Mobile Mesh Network System Design", IEEE MILCOM 2007, Orlando, Florida, Oct 2007 [6] L. Villasenor-Gonzalez et al., H-OLSR: A Hierarchical Proactive Routing Mechanism for Mobile Ad hoc Networks, IEEE Communications Magazine, Vol. 43, No.7, Jul 2005 [7] J. Luo et al., A Survey of Multicast Routing Protocols for Mobile Ad-hoc Networks, IEEE Communications Surveys & Tutorials, Vol 11, Issue 1, 2009 [8] G. Pei, M. Gerela and X. Hong, "LANMAR: Landmark Routing for Large Scale Wireless Ad Hoc Networks with Grou Mobility", in Proceedings of IEEE/ACM MObiHoc 2000, Boston, MA, Aug. 2000 [9] R. Rajaraman, Toology control and routing in ad hoc networks: a survey, ACM SIGACT News. Issue 33, 2002 [10] Ramin Hekmat, Ad-hoc Networks: Fundamental Proerties and Network Toologies, Sringer, 2006, ISBN-10 1-4020-5165-4 [11] X. Hong, M. Gerla, G. Pei and C.-C. Chiang, "A Grou Mobility Model for Ad Hoc Wireless Networks", in Proceedings of ACM / IEEE MSWiM'99, Sealttle, WA, Aug. 1999 [12] BonnMotion - a mobility scenario generation and analysis tool, htt://iv.cs.unibonn.de/wg/cs/alications/bonnmotion/, Univ. of Bonn, 2002 [13] L. Li and T. Kunz, Efficiency of Multiarty Networking Protocols over Mobile Tactical Radios on VHF Bands, too aear in Proceedings of IEEE MILCOM 2010, Nov. 2010, San Jose, CA. 15-10 RTO-MP-IST-092