Wireless Computer Networks Research Articles

DEVELOPMENT OF A HYBRID NETWORK CONGESTION MONITORING SYSTEM

Constantly growing requirements for the information systems service quality require monitoring of network congestion. The experimental results proved that when using hybrid networks, it is difficult to estimate the network load based on the average time of information delivery due to the presence of a significant scatter of time data. A mathematical model of information transmission in wireless computer networks in the form of a queuing system has been developed. The system identifies the main elements: a data transmission channel, a data frame and a device that transmits data. Analysis of transmission standards allows us to identify the following main transmission modes for modeling: one frame successful transmission; transmitting a frame with an error and repeating the transmission (possibly several times); frame transmission using performance-enhancing technology (Bursting technology is used as an example). Events associated with the transmission of information over the wireless network of one device are considered as monitoring system states under consideration. Packet exchange process was considered to be a homogeneous Markov process with discrete states, continuous time and constant intensities. A mathematical model has been developed based on the state graph of the device-frame-transmission channel system, which allows one to determine the timing characteristics for the previously identified modes. The methods for assessing network congestion based on statistical information during data transmission is proposed. Delivery times are broken down into ranges derived from the simulation. The proportion of packets whose delivery time lies within the selected test range is estimated. To evaluate the results, experimental studies were carried out on a fragment of the hybrid network. Delivery time results for each experiment were divided into four ranges: corresponding to accelerated delivery of fragments, successful delivery on the first, second and third attempts, respectively. Results analysis showed that it is preferable to use the fourth range to assess network congestion. Approximation reliability in this case is 0.85, the correlation coefficient is 0.92. The proposed methodology allows us to estimate network congestion based on testing data with a fairly high degree of reliability.

Analysis of the efficiency of block frame transmission in IEEE 802.11 computer networks

In infrastructure schemes of WLANs wireless computer networks, which are based on the use of the DSF (distributed coordination function) function and the CSMA/CA mechanism, the station STA (STAtion) sends a frame if the transmission channel is released after waiting for the end of the DIFS (distributed interframe space) interval and operation of the slot selec-tion mechanism for transmission (backoff mechanism). In case of collisions or damage to the frame by interference, the AP cannot decode the frame and does not send it back to the ACS station. The sending station STA waits for the re-ceipt of a potential ASK before the expiration of the corresponding timeout, and in case of receipt, starts the backoff procedure before transmission. The duration of the slot used in the backoff process depends on the speed of the physical layer technology. To reduce overhead, a transmission mechanism using frame blocks was proposed. This mechanism assumes that a block of frames intended for one recipient can be sent without con-firming the fact of correct reception by the AP access point of each frame separately. In this case, the sender (STA) competes for access to the channel for the first frame of the block. If it wins the access competition, the transmission of the first frame begins, and after receiving the ACK acknowledgment for it and a short SIFS separation interval, the STA transmits a whole block of frames, which is accompanied by a BAR service frame. The mechanism of frames block transmission in wireless computer networks IEEE 802.11 DCF with infrastructure topology has been analyzed. In protected mode, the depend-encies of network throughput on data transmission rate and the number of frames in a block are determined. It is shown that the mechanism of block transmission significantly increases the network throughput, especially in the range of higher transmission rates. With a marked increase in the intensity of interference the transmission of blocks becomes more complicated. Already with BER=10^-6 and the frames number of the order of 10 and more, in some cases there is a need to retransmit distorted in a block frames, and at BER=10^-5 there are many re-transmissions, so the resulting network throughput becomes small.

Modeling of ergodic processes in dynamic graphs of computer networks

Summary: For a mathematical model of mobile wireless computer networks, the random process of alternating network connectivity and disconnection was studied using several mobility models: isotropic random walk with reflection from the boundaries of the network location area, partially directed random walk, random walk with elements of vortex motion. The probability distribution functions of the durations of periods of network connectivity and disconnection are found, the ergodicity of the process and the uncorrelated nature of the period durations are shown. A large positive asymmetry of the distributions was noted, indicating the presence of a relatively small number of periods of long duration in the process. The analysis was carried out using simulation methods. The results of the analysis are presented as dependency plots.

EMPLOYEE PRESENCE DESIGN BASED ON NEAR FIELD COMMUNICATION (NFC)

There are many indications that show the performance of an employee, one of which is presence or attendance at work. In the institution of Universitas PGRI Wiranegara or UNIWARA, the employee attendance system still uses a manual system or is not modern. In the era of the COVID-19 pandemic, an attendance system based on no physical contact is the best choice. This study aims to develop an automatic attendance system without physical contact using Near Field Communication (NFC). NFC is a wireless computer network technology that uses radio frequency that allows you to connect without physical contact combined with applications developed using the SDLC (Software Development Life Cycle) method that can process data automatically. The final results of the study show that, from the tests carried out by this application, it makes it easy to make attendance without physical contact, where previously physical contact was still used. And in testing using Blackbox there were no errors, whereas when testing an objective system to respondents it was found that this system is easy to use, useful for users, has an attractive appearance, and is easy to understand.

Design of Optimized Koch Based Fractal Patch Antenna for Multiband Wireless Applications

An optimized Koch based fractal patch antenna with twin lower leafs has been designed for appropriate wireless communication applications and capable of exhibiting penta-band behavior. The proposed structure has been created by introducing modified Koch curve on a rhombus shaped fractal patch having compact dimensions of 60 mm×50 mm×1.6 mm with defected ground structure. The reflection coefficient (S11) values of the proposed antenna are -11.97 dB, -20.29 dB, - 25.38 dB, -13.91 dB and -23.48 dB at resonating frequencies of 2.8649 GHz, 6.3514 GHz, 7.1622 GHz, 8.2973 GHz, and 8.9459 GHz, respectively. It has values of VSWR at all resonating frequencies within acceptable range of 1 to 2. The prototype of the proposed structure has been designed on easily available and low cost FR4 epoxy substrate material. The bandwidths of 1.39 GHz, 3.30 GHz, 10.19 GHz, 1.93 GHz and 2.23 GHz has been obtained at all resonating frequencies. The measured results has been analyzed and compared with simulated results and bears a close approximation. The developed prototype can be utilized for applications in S, C, and X frequency band which can further be used for various communication applications like radar, satellite communication and wireless computer networks.

SOFTWARE AND HARDWARE STAND AS A MODERN TOOL FOR TEACHING STUDENTS TO CONFIGURE WIRELESS NETWORKS

Goal. Theoretical justification and development of a software and hardware stand in order to train future information security specialists in setting up modern wireless networks.
 Work methodology or method. The study is based on scientific regulations of the practice-oriented learning organization. The competence-based approach was used as its methodological base, theoretical (comparison, analysis, generalization, concretization, modeling) methods were used. The development and implementation of a software and hardware stand in the educational process was carried out at Tyumen State University in 2021-2022 with the involvement of students from the “Computer Security” direction of training.
 Results. The authors have developed and applied in the educational process a software and hardware laboratory stand that combines virtualization tools for software and hardware components of a computer network.
 The stand is used to study the modern infrastructure of a computer network which is used in enterprises and companies by students of the “Computer Security” specialization. It can also be used while teaching modern wireless networks configuration for students of the directions: “Mathematical support and administration of information systems”, “Computer science and computer technology”, “Software engineering”.
 On the basis of the stand a cycle of laboratory works was developed for senior students of the “Computer security” specialization as part of the study of the “Wireless computer networks security” discipline.
 Scope of results. The results of the study can be applied in the field of training future IT-specialists in the higher education system.

MANAJEMEN BANDWIDTH MENGGUNAKAN METODE HIERARCHICAL TOKEN BUCKET (HTB) DENGAN PENAMBAHAN BUCKET SIZE USAHA AJ COMP

The internet is currently very much needed because of the increasing use of many people depending on the internet because this information technology is very fast.In this case, it has a very big impact, the need for a very efficient internet service provider is needed. One of the technologies that is becoming a trend in computer networks is wireless computer networks (wireless local area network/WLAN) This technology is the development of local computer network technology (local area network) which allows efficiency in the implementation and development of computer networks that can increase user mobility with computer network technology using cable media. Bandwidth management is a way to manage the internet network for even distribution of bandwidth usage even though many network users use it. Hierarchical token bucket (HTB) one method to do a bandwidth management in this HTB

The WIRELESS COMPUTER NETWORK MANAGEMENT SECURITY ANALYSIS

The use of a wireless computer network in some institutions has become a very flexible option to connect all users of the existing computer network in the institution. This flexibility also has the disadvantage that anyone with a network password can take advantage of the wireless network. The possibility of threats to information security is very large, such as the presence of intruders on the network. Therefore, it is necessary to manage wireless networks that pay attention to information security issues on the network. The Directorate General of New, Renewable Energy and Energy Conservation at the Ministry of Energy and the Human Resources Republic of Indonesia was chosen as the research location given that computer network users in this institution are diverse and have also used The Dude MikroTik application to manage wireless computer networks, which are instruments to analyze information security. in this institution. The analysis was conducted to identify the activities and effectiveness of information security management in this institution. This study concludes that the use of The Dude MikroTik application is quite helpful in analyzing information security on wireless computer networks in this institution.

Models and Methods for Improving Performance of Wireless Computer Networks Based on the Decomposition of Lower Layers of the OSI Reference Model

The paper discusses models and methods for improving the performance of wireless computer networks built based on the decomposition of the lower levels of the OSI reference model. A method to improve the performance of networks is suggested, which functionally combines the physical and network layers, which improves its efficiency in marginal reception areas almost twice. A model of the block diagram of a device for improving data transmission quality in marginal reception areas or those with insufficient noise immunity is developed based on the so-called communication quality status monitoring, as well as a model of the block diagram of a wireless adaptive capacity reallocation router based on dynamic channels capacity reallocation, which allows adequately reallocating IS resources depending on traffic and user priority. Keywords— Bluetooth, FIFO discipline, IEEE 802.11, OSI/ISO reference model, wireless computer networks.

РАЗРАБОТКА ПРОГРАММНО-АППАРАТНОГО СТЕНДА С ПРИМЕНЕНИЕМ СОВРЕМЕННЫХ СРЕДСТВ ВИРТУАЛИЗАЦИИ ДЛЯ ИЗУЧЕНИЯ КОМПЬЮТЕРНЫХ СЕТЕЙ СТАНДАРТА IEEE 802.11

The article analyzes the specifics of organizing the work of a software and hardware stand with wireless computer networks, the need for which arises when training future IT specialists in the system administration of wireless networks or when modeling an enterprise corporate network in order to apply and test modern technologies for protecting network infrastructure from information security threats, aimed at users of wireless computer networks. A feature of this stand is the use of advanced virtualization tools while maintaining the physical wireless environment, which allows you to effectively train modern competitive IT specialists and test the resistance of customized technologies to various computer attacks aimed at the wireless segment of corporate computer networks.

Wireless Intrusion Detection Based on Optimized LSTM with Stacked Auto Encoder Network

In recent years, due to the rapid progress of various technologies, wireless computer networks have developed. However, the activities of the security threats and attackers affect the data communication of these technologies. So, to protect the network against these security threats, an efficient IDS (Intrusion Detection System) is presented in this paper. Namely, optimized long short-term memory (OLSTM) network with a stacked auto-encoder (SAE) network is proposed as an IDS system. Using SAE, significant features are extracted from the databases such as input NSL-KDD database and the UNSW-NB15 database. Then extracted features are given as input to the optimized LSTM which is used as an intrusion identification system. To enhance the effectiveness of the LSTM, we present the pigeon optimization algorithm (POA). Using this algorithm, weight parameters of the LSTM are chosen optimally. Finally, the proposed IDS model decides whether the input packets are intruded or not. The results confirm that the proposed IDS model surpasses the previous machine learning-based IDS models in terms of correctness, F1-score and G mean.

Limited visibility graphs and modeling obstacles to network interaction

The problems of constructing mathematical and simulation models of wireless computer and sensor networks deployed in areas of terrain containing numerous obstacles that prevent the propagation of a high-frequency radio signal are considered. Graphs of limited visibility are proposed as a mathematical model of the network structure. An algorithm for generating simulation models of terrain areas is presented. The characteristics of the terrain are introduced: the coefficient of the obstacle shape, the effective area, the length of the free path, methods for their calculation are proposed. The influence of the shape factor on the connectivity of a limited visibility graph is shown. The dependences of the effective area and length of the free path from the rank and number of obstacles in the region are obtained.

One-directional parsing function for information security in computer networks of unmanned aerial vehicles

The tools of the formal languages and grammars theory are proposed to be used in developing the ways to increase the information security of wireless data transmission systems in computer networks of unmanned aerial vehicles (UAV). Multiple use of production rules for generating sentences of a (regular) language in the processes of inter-level transformations and transmission of PDUs from a true primary information generator through UAV wireless computer network nodes allows to create the pseudo-sources of primary information, which hinders unauthorized access.

Synthesis of novel 8 × 8 beam‐forming network for broadband multibeam antenna array

Synthesis of a novel 8 × 8 beam-forming network (BFN) for broadband multi-beam antenna arrays in the X-band has been proposed. The synthesized BFN has 6 less path crossings than a classic Butler matrix. The BFN design is realized using basic elements such as slot-line transition and magic-Ts. A numerical simulation for the analysis of the frequency characteristics of the proposed BFN is carried out. In addition, we offer a design of an eight-channel multibeam antenna array consisting of the synthesized BFN and Vivaldi antennas. Eight spatial beams cover approximately 120° in the azimuth plane with a peak gain of 12 dB in the range of 8.3–11.7 GHz. The proposed broadband multibeam antenna array has good performance, compactness, and ease of fabrication that would be an attractive candidate for radar, satellite communication, and wireless computer networks.

WI-MAX NETWORK SIMULATION FOR SALAHADDIN UNIVERSITY NEW CAMPUS

Wireless Networks became very important in this latest decade and especially Wi-Max system because of high bit rate, handover flexibility and longer distance of mobility. Signal strength and coverage is one of the challenges for this systems which leads to affect directly on Quality of Service (QoS), this paper is an attempt to design and study of Wi-Max network for a certain coverage area, testing the coverage of the signal for the area that can hold the sufficient amount of data with less latency has been studied depending upon the Wi-Max advanced specification and data stream behavior benefit’s, some Wi-Max parameters like coverage, quality of service, data rate are optimized, the study and design has been done using OPNET modeler used in the a simulation of the certain coverage area, in this paper the new campus of university of Salahaddin has been used on supposed area of about 4 X4 km. The results show a perfect bit rate as a bit stream for the global characteristics in which is sufficient to the students and teachers of the university in addition of providing the mobility by high performance. It is needed to design a wireless computer network to Salahaddin University to improve mobility and to let the teachers and students to stay connected at any time in any university location Especially with the nowadays learning techniques and requirements which needs both teacher and students to be online with each other especially like E-learning and online remount learning especially with the COVID-19 university campus blocking. Therefore, it is needed to cover overall area of the university campus and with additional coverage that exceed the university boundaries to improve the reliability of the hall network and to insure the required coverage area. To do that is very efficient to design an advanced computer network like Wi-Max with the most powerful and advanced hardware capabilities to full-fit the teachers and students requirement of fast net browsing and download in addition in e-learning bases it is very regular to use video conferencing or video streaming which normally needs a very fast network data transfer

Dynamic hypergraphs of renewal processes in mobile networks.

The characteristics of random geometric hypergraphs are studied as mathematical models of scalable wireless computer networks. An efficient algorithm for finding cliques in geometric graphs, constructing hypergraphs from geometric configurations has been developed. The types of hyper-edges in hypergraphs generated by a scalable configuration have been identified. The influence of random failures of nodes of computer networks and their restorations on the dynamics of hypergraphs of networks is considered. The analysis of the dynamics of the number of active nodes depending on the type of probability distributions of uptime and recovery time is carried out. The dependences of the mathematical expectation of the number of hyper-edges of certain types in the geometric hypergraph of a wireless computer network on the network operation time, on the radii of zones of reliable reception / transmission of a signal, on the ratio of the parameters of local recovery processes are obtained. The presentation of the results is accompanied by charts.

StegoFrameOrder-MAC Layer Covert Network Channel for Wireless IEEE 802.11 Networks.

The proposed StegoFrameOrder (SFO) method enables the transmission of covert data in wireless computer networks exploiting non-deterministic algorithms of medium access (such as the distributed coordination function), especially in IEEE 802.11 networks. Such a covert channel enables the possibility of leaking crucial information outside secured network in a manner that is difficult to detect. The SFO method embeds hidden bits of information in the relative order of frames transmitted by wireless terminals operating on the same radio channel. The paper presents an idea of this covert channel, its implementation, and possible variants. The paper also discusses implementing the SFO method in a real environment and the experiments performed in the real-world scenario.

Computer wireless network integration technology in equipment state data collection

The paper introduces a handheld integrated power data acquisition and analysis equipment based on a computer wireless network mobile platform, an intelligent transportation inspection box. The intelligent transportation inspection box acts as a bridge between the transportation inspection work site side and the power grid company center to realize data and resource sharing between the site and center sides. The application of intelligent operation and inspection boxes based on computer wireless network integration technology is essential for improving the professional and intelligent level of on-site operation and maintenance, improving the efficiency of operation and inspection work and the ability to control equipment status, strengthening state maintenance and auxiliary decision-making, and promoting the construction of smart grids significance.

Connectivity and routes in large geometric network hypergraphs

Random geometric hypergraphs are considered as mathematical models of large wireless computer networks. The dependences of the mathematical expectation of the number of hyper-edges in random geometric hypergraphs on the radii of reliable reception / transmission of radio signals by network nodes, as well as on the number of vertices in the hyper- graph are studied. The concepts of the shortest route in a geometric hypergraph are discussed. Calculations of the probabil- ity of connectivity of large random geometric hypergraphs, the mathematical expectation of the diameter of hypergraphs and its change with a change in the radii of the nodes are carried out. The presentation of the results is accompanied by graphs.

Circular Distance-Two Labelling of Book Graphs Related to Code Assignment in Computer Wireless Networks

Let d be a positive real number. An L(1,d)-labeling of a graph G is an assignment of nonnegative real numbers to the vertices of G such that the adjacent vertices are assigned two different numbers (labels) whose difference is at least one, and the difference between numbers (labels) for any two distance-two vertices is at least d. The minimum range of labels over all L(1,d)-labelings of a graph G is called the L(1,d)-labeling number of G, denoted by λ_(1,d)(G). The L(1,d)-labeling with d≥1 of graph arose from the code assignment problem of computer wireless network and the L(1,d)-labeling with 0<d≤1 of graph is motivated by channel assignment problem. Let σ and d be two positive real numbers, a circular σ-L(1,d)-labeling of a graph G is a function f: V(G)→[0,σ) satisfying |f(u)-f(v)|σ≥1 if u v∈E(G), and |f(u)-f(v)|σ≥d if u and v are distance two apart, where |f(u)-f(v)|σ=min{|f(u)-f(v)|, σ-|f(u)-f(v)|}. The circular L(1,d)-labeling number of a graph G, denoted by σ_(1,d) (G), is the minimum σ such that there exists a circular σ-L(1,d)-labeling of G. In this paper, the code assignment of 3-D computer wireless network is abstracted as the circular L(1,d)-labeling of book graph, and the authors determined the circular L(1,d)-labeling numbers of book graph for any positive real number d≥2 basing on the properties and constructions of book graphs.