scholarly journals QoS based Enhanced System Determination Plan for 4G Frameworks

In this paper we regulate 4G structures where choice of applications in light of Rank of the separation work has been enlisted for different open associations/get to types of progress, dynamic clients to the degree handoff we moreover figure the data transmission, delay and no of gatherings lost. This client driven structure deals with the motivation to give best associations of the system to the clients. The proposed estimation shows better outcomes separated from single parameter based structure, under a heterogeneous structure framework. In like way in the last half we do consider the data move limit usage utilizing (SFF) and dynamic recently fit (DFF) by which we limit as far as possible which is an oblige for some client by prudence of adaptable controlling. At long last we look at the execution estimations by strategies for PC reenactment and multifaceted nature Rank in light of parcel work and Always Best Connected approach for gathering transport degree, throughput, no of packs lost and deferral

2020 ◽  
Vol 23 (2) ◽  
pp. 82
Author(s):  
M. A. Lamri ◽  
I. A. Kaisina ◽  
D. S. Vasiliev ◽  
A. V. Chunaev ◽  
A. V. Abilov

В мобильных самоорганизующихся сетях часто наблюдаются задержки при передаче потоковых данных и снижение QoS. В статье представлен разработанный модуль для измерения задержки и джиттера. Модуль встроен в программу автоматического запроса повторной передачи прикладного уровня (AL-ARQ). Для оценки эффективности работы модуля была собрана сеть, состоящая из узла-источника (микрокомпьютер RaspberryPi) и узла-получателя (ноутбук HP). С узла-источника отправлялось потоковое видео к узлу-получа­телю с использованием беспроводного стандарта 802.11g. Для синхронизации времени между устройствами применялся NTP-сервер.Результаты эксперимента показали эффективность предложенного модуля для измерения задержки и джиттера при передаче потоковых данных. При исследовании работы модуля было выявлено, что механизмы повторной передачи AL-ARQ влияют как на максимальное значение задержек при передаче, так и на среднее значение за время всей передачи. Был сделан вывод, что снижению уровня задержек и общему улучшению QoS может способствовать адаптивный буфер.


2014 ◽  
Vol 571-572 ◽  
pp. 867-872
Author(s):  
Xiao Yun Liu ◽  
Li Ting Xiong ◽  
Jian Shen

To solve the problem of image information transmission delay in the network multimedia teaching system, the compression and multicast solutions are put forward on the basis of usual screen blocking skill of data. According to the characteristics of the multimedia teaching system, the screen changes typically little at smaller intervals. It means that only a few screen blocks, which are changing, are needed to be transferred by screen blocking skill. At the same time, the network video data transmission volume is further curtailed through compression and multicast so that the multimedia information network transmission delay is decreased. The minimal buffer size for allocation is determined to ensure the smooth transmission of video data in the multimedia teaching system.


2019 ◽  
Vol 2019 ◽  
pp. 1-11
Author(s):  
Kehua Zhao ◽  
Yourong Chen ◽  
Siyi Lu ◽  
Banteng Liu ◽  
Tiaojuan Ren ◽  
...  

To solve the problem of sensing coverage of sparse wireless sensor networks, the movement of sensor nodes is considered and a sensing coverage algorithm of sparse mobile sensor node with trade-off between packet loss rate and transmission delay (SCA_SM) is proposed. Firstly, SCA_SM divides the monitoring area into several grids of same size and establishes a path planning model of multisensor nodes’ movement. Secondly, the social foraging behavior of Escherichia coli in bacterial foraging is used. A fitness function formula of sensor nodes’ moving paths is proposed. The optimal moving paths of all mobile sensor nodes which can cover the entire monitoring area are obtained through the operations of chemotaxis, replication, and migration. The simulation results show that SCA_SM can fully cover the monitoring area and reduce the packet loss rate and data transmission delay in the process of data transmission. Under certain conditions, SCA_SM is better than RAND_D, HILBERT, and TCM.


2021 ◽  
Vol 2 (4) ◽  
pp. 160-164
Author(s):  
Abul Bashar ◽  
Dinesh Kumar

When transmitting data in a large number, the number of conflicts that arise is high. This is especially the case when there is dense distribution of marginal wireless sensor network (WSN). Some of the major conflicts that affect the overall operation of a system include heavy transmission delay and large data loss. In this proposed work, a multipath reliable transmission is used for wireless sensor network. In order to determine the reliability of the system, the WSN implements redundancy methodology. As the first step, data is sub-divided into packets of information along with data redundancy. These packets are then transmitted via multi-paths to their corresponding destination nodes. Experimental observation shows that the proposed work indicates a significant increase in network lifetime, reduction in transmission delay and data packet loss rate.


2021 ◽  
pp. 1-14
Author(s):  
Wei Shu ◽  
Dajiang He ◽  
Jun Shu

In order to overcome the problems of low channel utilization, low transmission success rate and high data transmission delay in current gateway node reconfiguration methods of IOT, this paper proposes a novel gateway node reconfiguration method of IOT based on hierarchical coding particle swarm optimization. Based on the IOT network model, this paper analyzes the delay characteristics of the IOT, and constructs the object function of the gateway node reconfiguration of IOT. By monotone decreasing inertia weight strategy, the coding particle swarm optimization is optimized, and the reconfiguration objective function of the gateway node of IOT by using the optimized particle swarm optimization algorithm is solved. Experimental results show that the channel utilization ratio of the proposed method is higher than 90%, the success rate of information transmission is more than 80%, and the data transmission delay is less than 0.5 s, which indicates that the proposed method has high channel utilization, high transmission success rate and low data transmission delay.


Algorithms ◽  
2018 ◽  
Vol 11 (8) ◽  
pp. 125 ◽  
Author(s):  
Yeqing Yan ◽  
Zhigang Chen ◽  
Jia Wu ◽  
Leilei Wang

With the popularization of mobile communication equipment, human activities have an increasing impact on the structure of networks, and so the social characteristics of opportunistic networks become increasingly obvious. Opportunistic networks are increasingly used in social situations. However, existing routing algorithms are not suitable for opportunistic social networks, because traditional opportunistic network routing does not consider participation in human activities, which usually causes a high ratio of transmission delay and routing overhead. Therefore, this research proposes an effective data transmission algorithm based on social relationships (ESR), which considers the community characteristics of opportunistic mobile social networks. This work uses the idea of the faction to divide the nodes in the network into communities, reduces the number of inefficient nodes in the community, and performs another contraction of the structure. Simulation results show that the ESR algorithm, through community transmission, is not only faster and safer, but also has lower transmission delay and routing overhead compared with the spray and wait algorithm, SCR algorithm and the EMIST algorithm.


2018 ◽  
Vol 14 (4) ◽  
pp. 155014771877253 ◽  
Author(s):  
Anfeng Liu ◽  
Wei Chen ◽  
Xiao Liu

In order to solve the problem of spectrum scarcity in wireless sensor networks, cognitive radio technology can be introduced into wireless sensor networks, giving rising to cognitive radio sensor networks. Delay-sensitive data applications in cognitive radio sensor networks require efficient real-time communication. Opportunistic pipeline routing is a potential technology to reduce the delay, which can use nodes outside the main forwarding path forward data opportunistically when the transmission fails. However, the energy efficiency of cognitive radio sensor networks with opportunistic pipeline routing is low, and the data transmission delay can be further optimized. In view of this situation, we propose the delay optimal opportunistic pipeline routing scheme named Variable Duty Cycle for Opportunistic Pipeline Routing (VDCOPR). In the Variable Duty Cycle for Opportunistic Pipeline Routing scheme, the nodes employ high duty cycle in the area far from the sink, and low duty cycle in the area near to the sink, which can achieve the balance of energy consumption and reduce the data transmission delay while not affecting network lifetime. The theoretical analysis and experimental results show that, compared with previous opportunistic pipeline routing, energy consumption of network is relatively balanced and the data transmission delay can be reduced by 36.6% in the Variable Duty Cycle for Opportunistic Pipeline Routing scheme.


Sign in / Sign up

Export Citation Format

Share Document