Dynamic content-cached satellite selection and routing for power minimization in LEO satellite networks by Jeongmin Seo, Dongho Ham, Jeongho Kwak

Get full text

Two Novel DV-Hop Localization Algorithms for Randomly Deployed Wireless Sensor Networks by Guozhi Song, Dayuan Tam

“…Aiming at solving the problem of low accuracy in traditional distance vector-hop (DV-hop) algorithm used for wireless sensor networks node location, two refined localization algorithms, that is, hyperbolic-DV-hop localization algorithm and improved weighted centroid DV-hop localization algorithm (IWC-DV-hop), are proposed in this paper. …”
Get full text

Inventory control strategy based on neural network and fuzzy algorithm in intelligent warehousing system by Chunmei Xie, Cong Xie

“…Abstract To cope with the inventory control problem of an intelligent warehousing system, this paper proposes a neuro-fuzzy dynamic inventory regulation model (NFDIRM), which integrates radial basis function neural network (RBFNN) and fuzzy logic algorithm, aiming to solve the problems of poor prediction accuracy and poor decision flexibility of traditional models. …”
Get full text

Enhanced residual-attention deep neural network for disease classification in maize leaf images by Nidhi Parashar, Prashant Johri, Ahmed Elbeltagi, Ali Salem, Prakash Choudhary, Vijay Kumar, Tarun Agrawal

“…The macro-average of all evaluation metrics is considered to address the dataset’s class imbalance problem. …”
Get full text

Adaptive random early detection algorithm based on network traffic level grade prediction by Debin WEI, Chengsheng PAN, Li YANG, Zuoren YAN

“…In view of the problem that the calculation of average queue length and maximum packet drop probability in random early detection algorithm and its variants reflect the changes of network traffic slowly, an adaptive random early detection algorithm based on network traffic level grade prediction was proposed.Based on the statistical characteristics of self-similar network traffic, the transition probability table of network traffic level grade was established, and a grade prediction method of self-similar network traffic level with low complexity and high accuracy was proposed.Furthermore, the prediction results were applied to calculate the average queue length in equal interval and adjust the maximum packet drop probability.Under the condition of fixed and variable bottleneck link capacity, it is found that regardless of the degree of self-similarity of network traffic, the proposed algorithm can improve the throughput and packet loss rate, especially when the Hurst parameter is large and the traffic is light.…”
Get full text

Auction based bandwidth allocation mechanism for P2P content distribution networks by Yun-he ZHANG, Yan-qin ZHU, Qi-jin JI

“…Unreasonable allocation of originally scarce bandwidth was a severe problem in the P2P content distribution networks.To solve the problem and suppress the node's selfishness,an auction-based bandwidth allocation mechanism for P2P networks was proposed.Through the effective bandwidth payment scheme,the selfish nodes had no incentives to lie and provided the real bandwidth requirements.Also the “tragedy of the commons” could be avoided by the nodes' healthy bandwidth competition.To adapt to the distributed nature of the P2P networks,the algorithm was implemented in parallel at resource providing nodes and request nodes.Simulation results show that the scheme not only suppresses riding nodes efficiently in the system,but also shortens the average completion time for content distribution and decreases the ratio of data uploaded by the source server.…”
Get full text

Energy-Efficient User Association Strategy for Hyperdense Heterogeneous Networking in the Fifth Generation Systems by Lei Li, Hao Jin, Zhipeng Yan, Changqing Yang, Yong Wu

“…Redesigning user association strategies to improve energy efficiency (EE) has been viewed as one of the promising shifting paradigms for the fifth generation (5G) cellular networks. In this paper, we investigate how to optimize users’ association to enhance EE for hyper dense heterogeneous networking in the 5G cellular networks, where the low-power node (LPN) much outnumbers the high-power node (HPN). …”
Get full text

Adaptive random early detection algorithm based on network traffic level grade prediction by Debin WEI, Chengsheng PAN, Li YANG, Zuoren YAN

“…In view of the problem that the calculation of average queue length and maximum packet drop probability in random early detection algorithm and its variants reflect the changes of network traffic slowly, an adaptive random early detection algorithm based on network traffic level grade prediction was proposed.Based on the statistical characteristics of self-similar network traffic, the transition probability table of network traffic level grade was established, and a grade prediction method of self-similar network traffic level with low complexity and high accuracy was proposed.Furthermore, the prediction results were applied to calculate the average queue length in equal interval and adjust the maximum packet drop probability.Under the condition of fixed and variable bottleneck link capacity, it is found that regardless of the degree of self-similarity of network traffic, the proposed algorithm can improve the throughput and packet loss rate, especially when the Hurst parameter is large and the traffic is light.…”
Get full text

Warehouse Network Design With Fortification Considerations: A Mixed-Integer Nonlinear Modeling Approach by Tareq Oshan

“…This study presents a mathematical model for optimizing warehouse-location decisions in supply-chain network design. Previous studies have focused on the facility-location problem and provided fortification plans and solutions. …”
Get full text

Cost-efficient dynamic quota-controlled routing in multi-community delay-tolerant networks by Jiagao Wu, Yue Ma, Linfeng Liu

“…How to improve the routing efficiency in multi-community scenarios has become one of the research hot spots in delay-tolerant networks. In this article, we present a network model of the multi-community delay-tolerant networks and formulate a dynamic quota-controlled routing problem of minimizing the average number of copies of a message that satisfies the required delivery probability under the given time-to-live of the message as a nonlinear optimization problem. …”
Get full text

Route Planning for Military Ground Vehicles in Road Networks under Uncertain Battlefield Environment by Tan Zhao, Jincai Huang, Jianmai Shi, Chao Chen

“…A binary integer programming is presented to formulate the problem. As the combination of the uncertainties results in a huge number of scenarios, we employed the sample average approximation method to obtain a robust solution for the problem. …”
Get full text

Asymptotic Delay Analysis for Cross-Layer Delay-Based Routing in Ad Hoc Networks by Philippe Jacquet, Amina Meraihi Naimi, Georgios Rodolakis

“…This paper addresses the problem of the evaluation of the delay distribution via analytical means in IEEE 802.11 wireless ad hoc networks. …”
Get full text

Resource Allocation in Multicore Elastic Optical Networks: A Deep Reinforcement Learning Approach by Juan Pinto-Ríos, Felipe Calderón, Ariel Leiva, Gabriel Hermosilla, Alejandra Beghelli, Danilo Bórquez-Paredes, Astrid Lozada, Nicolás Jara, Ricardo Olivares, Gabriel Saavedra

“…A deep reinforcement learning (DRL) approach is applied, for the first time, to solve the routing, modulation, spectrum, and core allocation (RMSCA) problem in dynamic multicore fiber elastic optical networks (MCF-EONs). …”
Get full text

Energy Efficiency Maximization for Device-to-Device Communication Underlaying Cellular Networks on Multiple Bands by Yuan Zhang, Yang Yang, Linglong Dai

“…In this paper, we first consider the whole cellular network underlaid with D2D communication on multiple bands and derive the exact expressions of the successful transmission probabilities, the average sum rate and the EE based on stochastic geometry theory. …”
Get full text

METHODOLOGY FOR INVESTIGATING THE PROBABILITY-TIME CHARACTERISTICS OF NETWORK ATTACKS IN THE SIMULATION MODELLING SOFTWARE ENVIRONMENT by Irina G. Drovnikova, Anatoly A. Zmeev, Anton D. Popov, Evgenii A. Rogozin

“…To such parameters one can attribute the average time of a network attack in one of its states, realising destructive impacts, in order to develop an effective model for countering threats implemented in systems and information security products. …”
Get full text

CycRank: a universal optimization framework for vital nodes identification in complex networks by Wenfeng Shi, Tianlong Fan, Shuqi Xu, Rongmei Yang, Linyuan Lü

“…Identifying influential nodes to maximize the spread of information within networks is a vital combinatorial optimization problem with extensive practical applications. …”
Get full text

Research on end-to-end network link delay inference based on link reconstruction-destruction by Yong-sheng LIANG, Bo GAO, Yue ZOU, Ji-hong ZHANG, Nai-tong ZHANG

“…Based on two assumptions,inference model and end-to-end delay data acquisition,an approach to end-to-end network internal link delay inference based on link reconstruction-deconstruction (LRD) was proposed.Pseudo likelihood estimation (PLE) was adopted and the inference problem was divided into independent sub-problems.Inference units with definite solution are determined by LRD.By means of controlling average sampling precision and decreasing inference unit links,the computation complexity of link delay inference was significantly lowered.Experimental study was performed based on model computation and NS2 simulation platform.Theoretical analysis and experimental results show that the approach is accurate and effective.…”
Get full text

SSRC:source rate control algorithm for delay-sensitive flow in data center network by Yang YANG, Min CAO, Jiahai YANG, Rong CHE, Wei LIU

“…Previous work had studied how to ensure the transmission time of delay-sensitive flows,but falled short in its effectiveness for a given period.Motivated by that and based on SDN/OpenFlow framework,a SDN-based source rate control (SSRC) algorithm was proposed.With a global view of network,SSRC can quickly locate the potential congestion node,adjust the transmission rate of source and reduce the response time of SSRC.The experiment results show that compared with DCTCP and other algorithms,SSRC can shorten the completion time of flows by 75% in average,which can ensure the transmission time of delay-sensitive and solve the problem of Incast well.…”
Get full text

Research on end-to-end network link delay inference based on link reconstruction-destruction by Yong-sheng LIANG, Bo GAO, Yue ZOU, Ji-hong ZHANG, Nai-tong ZHANG

“…Based on two assumptions,inference model and end-to-end delay data acquisition,an approach to end-to-end network internal link delay inference based on link reconstruction-deconstruction (LRD) was proposed.Pseudo likelihood estimation (PLE) was adopted and the inference problem was divided into independent sub-problems.Inference units with definite solution are determined by LRD.By means of controlling average sampling precision and decreasing inference unit links,the computation complexity of link delay inference was significantly lowered.Experimental study was performed based on model computation and NS2 simulation platform.Theoretical analysis and experimental results show that the approach is accurate and effective.…”
Get full text

Dynamic interference coordination scheme based on the iterative joint transmission in ultra dense network by Xiaona LI, Zhongfang WANG, Qian CHENG, Jingwen FU, Shunliang ZHANG

“…In consideration of the rapidly increasing number of cells and users in the ultra-dense network,how to realize dynamic interference coordination by selecting the appropriate joint transmission users was studied,so as to improve the spectral efficiency of the edge users.All users were classified by dynamic coordination cluster division and dynamic joint-muting transmission.The iterative optimization algorithm was used to further improve the system performance and solve the problem of selecting the number of joint transmission users.The simulation results prove that compared with the conventional CoMP JT scheme,the proposed scheme has significant performance gains in the cell edge spectral efficiency without reducing the cell average spectral efficiency.…”
Get full text