scholarly journals Simulations for Resource-Allocation Protocol Optimization for MIL-STD-188-186 over a UHF SATCOM Network

Author(s):  
Edward William Chandler

A simple simulation tool was previously developed to simulate the operation and performance of demand-assigned communication networks having time-varying data traffic patterns.  Such networks use protocols to increase or decrease the resources allocated to a network node as the resource needs at that node change.  These resource-allocation protocols have parameters such as numerical thresholds for requesting or releasing resources.  The additional simulator development and execution described herein allows a comparison of performance metrics that result when using the existing MIL-STD-188-186 protocol versus using a proposed alternative protocol.  The network behavior revealed by the simulation results also allows examining network performance trade-offs as values for the protocol parameters are adjusted.  Although commercially available simulation tools could be used for these simulations, such tools are often expensive and sometimes complicated to adapt to new and not yet standardized protocols.  The simple simulation tool that was previously developed is described in an earlier paper and is programmed as an Excel spreadsheet.   It has now been adapted to allow comparing an existing resource-allocation protocol versus a proposed protocol for MIL-STD-188-186.  The simulator allows examination of performance metrics such as the average number of assigned time slots per frame assigned to a transmitting node that has a specified message generation rate, the percentage of generated messages that are discarded prior to transmission due to being queued for an excessive time, and a histogram showing the percentage of messages transmitted with each possible message delivery time.

2018 ◽  
Vol 14 (11) ◽  
pp. 155014771881505 ◽  
Author(s):  
Ishtiaq Wahid ◽  
Ata Ul Aziz Ikram ◽  
Masood Ahmad ◽  
Fasee Ullah

With resource constraint’s distributed architecture and dynamic topology, network issues such as congestion, latency, power awareness, mobility, and other quality of service issues need to be addressed by optimizing the routing protocols. As a result, a number of routing protocols have been proposed. Routing protocols have trade-offs in performance parameters and their performance varies with the underlying mobility model. For designing an improved vehicular ad hoc network, three components of the network are to be focused: routing protocols, mobility models, and performance metrics. This article describes the relationship of these components, trade-offs in performance, and proposes a supervisory protocol, which monitors the scenario and detects the realistic mobility model through analysis of the microscopic features of the mobility model. An analytical model is used to determine the best protocol for a particular mobility model. The supervisory protocol then selects the best routing protocol for the mobility model of the current operational environment. For this, EstiNet 8.1 Simulator is used to validate the proposed scheme and compare its performance with existing schemes. Simulation results of the proposed scheme show the consistency in the performance of network throughout its operation.


2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Muhammad Muzamil Aslam ◽  
Liping Du ◽  
Xiaoyan Zhang ◽  
Yueyun Chen ◽  
Zahoor Ahmed ◽  
...  

Recently, 5G installation has been started globally. Different capabilities are in the consistent procedure, like ultrareliability, mass connectivity, and specific low latency. Though, 5G is insufficient to meet all the necessities of the future technology in 2030 and so on. Next generation information and communication technology is playing an important role in attraction of researchers, industries, and technical people. With respect to 5G networks, sixth-generation (6G) CR networks are anticipated to familiarize innovative use cases and performance metrics, such as to offer worldwide coverage, cost efficiency, enhanced spectral, energy improved intelligence, and safety. To reach such requirements, upcoming 6G CRNs will trust novel empowering technologies. Innovative network architecture and transmission technologies and air interface are of excessive position, like multiple accesses, waveform design, multiantenna technologies, and channel coding schemes. (1) To content, the condition should be of worldwide coverage, there will be no limit on 6G to global CR communication networks that may require to be completed with broadcast networks, like satellite communication networks, therefore, attaining a sea integrated communication network. (2) The spectrums overall will be entirely travelled to the supplementary rise connection density data rates in optical frequency bands, millimeter wave (mmWave), sub-6 GHz, and terahertz (THz). (3) To see big datasets created because of tremendously varied CR communication networks, antenna rush, diverse communication scenarios, new provision necessities, wide bandwidth, and 6G CRNs will allow an innovative variety of intelligent applications with the assistance of big data and AI technologies. (4) Need to improve network security when deploying 6G technology in CR networks. 6G is decentralized, intended, intelligent innovative, and distributed network. In this article, we studied a survey of current developments and upcoming trends. We studied the predicted applications, possible technologies, and security issues for 6G CR network communication. We also discussed predicted future key challenges in 6G.


2019 ◽  
Vol 8 (4) ◽  
pp. 12773-12778

In the communication networks, one of the major problems in the quality of service is congestion. Indeed, the phenomenon of congestion is due to the fact that many packets emitted follow the same paths. As a result, the increase the bandwidth offered can solve the problem only in the short term. In order to solve this problem, several solutions have been proposed, such as multipath routing algorithms, which distribute traffic between a source and a destination on several different paths, while taking into account the level of saturation of the intermediaries nodes, composing the different paths with a objective to avoid cluttered paths. Its purpose is to shed the excessive burden save a knot on its neighbors to improve performance and to exploit efficiently. In this paper we have analysis the load balancing in Multipath routing to achieve better network performance. We have study and reviewed the different load balancing algorithm in multipath network and based on review we have proposed a new load balancing algorithm in the multipath network. We have modified the packet of RREP and RREQ packet to transmit and receive the route information to compute the load of every path and we added a new field in RREP packet Buffer size to store the current node and their neighbor information to find the alternate route if network load in increase we have compare the performance of proposed protocol with the LB-AOMDV, SMR & AOMDV multipath routing protocols. NS2 is used for simulation


2015 ◽  
Vol 7 (3) ◽  
pp. 52
Author(s):  
Farzana Yasmeen ◽  
Uyen Trang Nguyen ◽  
Nurul Huda ◽  
Shigeki Yamada ◽  
Cristian Borcea

Delay-tolerant networks (DTNs) can tolerate disruption on end-to-end paths by taking advantage of temporal links emerging between nodes as nodes move in the network. Intermediate nodes store messages before forwarding opportunities become available. A series of encounters (i.e., coming within mutual transmission range) among different nodes will eventually deliver the message to the desired destination. The message delivery performance in a DTN (such as delivery ratio and end-to-end delay) highly depends on the time elapsed between encounters and the time two nodes remain in each others communication range once a contact is established. As messages are forwarded opportunistically among nodes, it is important to have sufficient contact opportunities in the network for faster, more reliable delivery of messages. We propose a simple yet efficient method for improving the performance of a DTN by increasing the contact duration of encountered nodes (i.e., mobile devices). Our proposed sticky transfer framework and protocol enable nodes in DTNs to collect neighbors’ information, evaluate their movement patterns and amounts of data to transfer in order to make decisions of whether to “stick” with a neighbor to complete the necessary data transfers. The sticky transfer framework can be combined with any DTN routing protocol to improve its performance. We evaluate ourframework through simulations and measure several network performance metrics. Simulation results show that the proposed framework can improve the message delivery ratio, end-to-end delay, overhead ratio, buffer occupancy, number of disrupted message transmissions and so on. It can be well adopted for challenged scenarios where larger messages sizes need to be delivered with application deadline constraints. Furthermore, performance of the DTN improved (upto 43%) at higher node densities and (up to 49%) under increased mobility conditions.


2015 ◽  
Vol 24 (4) ◽  
pp. 467-477
Author(s):  
Idris Skloul Ibrahim ◽  
Peter J.B. King ◽  
Hans-Wolfgang Loidl

AbstractNs2 is an open-source communications network simulator primarily used in research and teaching. Ns2 provides substantial support for simulation of TCP, routing, and multicast protocols over wired and wireless networks. Although Ns2 is a widely used powerful simulator, it lacks a way to measure networks that are used to assess reliability and performance metrics (e.g., the number of packets transferred from source to destination, delay in packets, packet loss, etc.) and it does not analyse the trace files it produces. The data obtained from the simulations are not straightforward to analyse. Ns2 is still unable to provide any data analysis statistics or graphics as requested. Moreover, the analysis of the Ns2 trace file using any software scripts requires further steps by a developer to do data processing and then produce graphical outputs. Lack of standardisation of tools means that results from different users may not be strictly comparable. There are alternative tools; however, most of them are not standalone applications, requiring some additional libraries. Also, they lack a user-friendly interface. This article presents the architecture and development considerations for the NsGTFA (Ns2 GUI Trace File Analyser) tool, which intends to simplify the management and enable the statistical analysis of trace files generated during network simulations. NsGTFA runs under Windows and has a friendly graphical user interface. This tool is a very fast standalone application implemented in VC++, taking as input an Ns2 trace file. It can output two-dimensional (2D) and 3D graphs (points, lines, and bar charts) or data sets, whatever the trace file format (Tagged, Old, or New). It is also possible to specify the output of standard network performance metrics. NsGTFA satisfies most user needs. There is no complex installation process, and no external libraries are needed.


2019 ◽  
Vol 8 (3) ◽  
pp. 5930-5938

With the recent advancements and due to the rapid growth of LTE networks, Machine Type Communication (MTC) plays a vital role in the characterization of Internet of Things (IOT).Human-to-Human (H2H) communication and MTC are the two different types of communication handled by LTE-A networks. Due to the co-existence of H2H communication and MTC in LTE-A networks, a serious challenge may arise for scheduling critical MTC with H2H communication networks. To maintain the Quality of Service (QoS) requirements for H2H communication and to provide data traffic for MTC networks LTE networks faces a serious challenge for allocating the resources blocks to the users. In this paper we propose a resource allocation algorithm for optimizing the problems faced by critical MTC and H2H communication networks by maintaining the QoS requirements from a cross-layer design perspective. A novel cross layer memtic based resource allocation algorithm is presented in this paper by investigating the resource allocation problem for different combinations of Channel Quality Indicator (CQI) modes for critical MTCDs and H2H UEs. The Performance and computational complexity of the proposed algorithm in different cases of CQI is measured in terms of cell throughput and probability of delay bound violation (PBDV) is analyzed and the simulations results shows that the proposed system is more efficient compared to other resource allocation algorithms.


2017 ◽  
Author(s):  
Mohammad Noormohammadpour ◽  
Cauligi S. Raghavendra

Datacenters provide cost-effective and flexible access to scalable compute and storage resources necessary for today’s cloud computing needs. A typical datacenter is made up of thousands of servers connected with a large network and usually managed by one operator. To provide quality access to the variety of applications and services hosted on datacenters and maximize performance, it deems necessary to use datacenter networks effectively and efficiently. Datacenter traffic is often a mix of several classes with different priorities and requirements. This includes user-generated interactive traffic, traffic with deadlines, and long-running traffic. To this end, custom transport protocols and traffic management techniques have been developed to improve datacenter network performance. In this tutorial paper, we review the general architecture of datacenter networks, various topologies proposed for them, their traffic properties, general traffic control challenges in datacenters and general traffic control objectives. The purpose of this paper is to bring out the important characteristics of traffic control in datacenters and not to survey all existing solutions (as it is virtually impossible due to massive body of existing research). We hope to provide readers with a wide range of options and factors while considering a variety of traffic control mechanisms. We discuss various characteristics of datacenter traffic control, including management schemes, transmission control, traffic shaping, prioritization, load balancing, multipathing, and traffic scheduling. Next, we point to several open challenges as well as new and interesting networking paradigms. At the end of this paper, we briefly review inter-datacenter networks that connect geographically dispersed datacenters, which have been receiving increasing attention recently and pose interesting and novel research problems. To measure the performance of datacenter networks, different performance metrics have been used, such as flow completion times, deadline miss rate, throughput, and fairness. Depending on the application and user requirements, some metrics may need more attention. While investigating different traffic control techniques, we point out the tradeoffs involved in terms of costs, complexity, and performance. We find that a combination of different traffic control techniques may be necessary at particular entities and layers in the network to improve the variety of performance metrics. We also find that despite significant research efforts, there are still open problems that demand further attention from the research community.


Sign in / Sign up

Export Citation Format

Share Document