Effects of sampling frequency on node mobility prediction in dynamic networks: A spectral view

The field of mobility prediction has been widely investigated in the recent past,especially the reduction of the coverage radius of cellular networks,which led to an increase in hand-over events.Changing the cell coverage very frequently,for example,may lead to service disruptions if a predictive approach is not deployed in the system.Although several works examined mobility prediction in the new-generation mobile networks,all of these studies focused on studying the time features of mobility traces,and the spectral content of historical mobility patterns was not considered for prediction purposes as yet.In the present study,we propose a new approach to mobility prediction by analyzing the effects of a proper mobility sampling frequency.The proposed approach lies in the mobility analysis in the frequency domain,to extract hidden features of the mobility process.Thus,we proposed a new methodology to determine the spectral content of mobility traces(considered as signals)and,thus,the appropriate sampling frequency,which can provide numerous advantages.We considered several types of mobility models(e.g.pedestrian,urban,and vehicular),containing important details in the time and frequency domains.Several simulation campaigns were performed to observe and analyze the characteristics of mobility from real traces and to evaluate the effects of sampling frequency on the spectral content.

TCP-LTE/5G Cross-layer performance analysis tool for high mobility data networking and a case study on high-speed railway

Nowadays,high mobility scenarios have become increasingly common.The widespread adoption of High-speed Rail(HSR)in China exemplifies this trend,while more promising use cases,such as vehicle-to-everything,continue to emerge.However,the Internet access provided in high mobility environments stllstruggles to achieve seamless connectivity.The next generation of wireless cellular technology 5 G further poses more requirements on the endto-end evolution to fully utilize its ultra-high band-width,while existing network diagnostic tools focus on above-IP layers or below-IP layers only.We then propose HiMoDiag,which enables flexible online analysis of the network performance in a cross-layer manner,i.e.,from the top(application layer)to the bottom(physical layer).We believe HiMoDiag could greatly simplify the process of pinpointing the deficiencies of the Internet access delivery on HSR,lead to more timely optimization and ultimately help to improve the network performance.

A Fault-Tolerant Mobility-Aware Caching Method in Edge Computing

Mobile Edge Computing(MEC)is a technology designed for the on-demand provisioning of computing and storage services,strategically positioned close to users.In the MEC environment,frequently accessed content can be deployed and cached on edge servers to optimize the efficiency of content delivery,ultimately enhancing the quality of the user experience.However,due to the typical placement of edge devices and nodes at the network’s periphery,these components may face various potential fault tolerance challenges,including network instability,device failures,and resource constraints.Considering the dynamic nature ofMEC,making high-quality content caching decisions for real-time mobile applications,especially those sensitive to latency,by effectively utilizing mobility information,continues to be a significant challenge.In response to this challenge,this paper introduces FT-MAACC,a mobility-aware caching solution grounded in multi-agent deep reinforcement learning and equipped with fault tolerance mechanisms.This approach comprehensively integrates content adaptivity algorithms to evaluate the priority of highly user-adaptive cached content.Furthermore,it relies on collaborative caching strategies based onmulti-agent deep reinforcement learningmodels and establishes a fault-tolerancemodel to ensure the system’s reliability,availability,and persistence.Empirical results unequivocally demonstrate that FTMAACC outperforms its peer methods in cache hit rates and transmission latency.

A Self-Attention Based Dynamic Resource Management for Satellite-Terrestrial Networks

The satellite-terrestrial networks possess the ability to transcend geographical constraints inherent in traditional communication networks,enabling global coverage and offering users ubiquitous computing power support,which is an important development direction of future communications.In this paper,we take into account a multi-scenario network model under the coverage of low earth orbit(LEO)satellite,which can provide computing resources to users in faraway areas to improve task processing efficiency.However,LEO satellites experience limitations in computing and communication resources and the channels are time-varying and complex,which makes the extraction of state information a daunting task.Therefore,we explore the dynamic resource management issue pertaining to joint computing,communication resource allocation and power control for multi-access edge computing(MEC).In order to tackle this formidable issue,we undertake the task of transforming the issue into a Markov decision process(MDP)problem and propose the self-attention based dynamic resource management(SABDRM)algorithm,which effectively extracts state information features to enhance the training process.Simulation results show that the proposed algorithm is capable of effectively reducing the long-term average delay and energy consumption of the tasks.

Mechanism analysis of regulating Turing instability and Hopf bifurcation of malware propagation in mobile wireless sensor networks

A dynamical model is constructed to depict the spatial-temporal evolution of malware in mobile wireless sensor networks(MWSNs). Based on such a model, we design a hybrid control scheme combining parameter perturbation and state feedback to effectively manipulate the spatiotemporal dynamics of malware propagation. The hybrid control can not only suppress the Turing instability caused by diffusion factor but can also adjust the occurrence of Hopf bifurcation induced by time delay. Numerical simulation results show that the hybrid control strategy can efficiently manipulate the transmission dynamics to achieve our expected desired properties, thus reducing the harm of malware propagation to MWSNs.

Multiscale Characteristics and Connection Mechanisms of Attraction Networks:A Trajectory Data Mining Approach Leveraging Geotagged Data

Urban tourism is considered a complex system,and multiscale exploration of the organizational patterns of attraction networks has become a topical issue in urban tourism,so exploring the multiscale characteristics and connection mechanisms of attraction networks is important for understanding the linkages between attractions and even the future destination planning.This paper uses geotagging data to compare the links between attractions in Beijing,China during four different periods:the pre-Olympic period(2004–2007),the Olympic Games and subsequent‘heat period’(2008–2013),the post-Olympic period(2014–2019),and the COVID-19(Corona Virus Disease 2019)pandemic period(2020–2021).The aim is to better understand the evolution and patterns of attraction networks at different scales in Beijing and to provide insights for tourism planning in the destination.The results show that the macro,meso-,and microscales network characteristics of attraction networks have inherent logical relationships that can explain the commonalities and differences in the development process of tourism networks.The macroscale attraction network degree Matthew effect is significant in the four different periods and exhibits a morphological monocentric structure,suggesting that new entrants are more likely to be associated with attractions that already have high value.The mesoscale links attractions according to the common purpose of tourists,and the results of the community segmentation of the attraction networks in the four different periods suggest that the functional polycentric structure describes their clustering effect,and the weak links between clusters result from attractions bound by incomplete information and distance,and the functional polycentric structure with a generally more efficient network of clusters.The pattern structure at the microscale reveals the topological transformation relationship of the regional collaboration pattern,and the attraction network structure in the four different periods has a very similar importance profile structure suggesting that the attraction network has the same construction rules and evolution mechanism,which aids in understanding the attraction network pattern at both macro and micro scales.Important approaches and practical implications for planners and managers are presented.

Robot-Oriented 6G Satellite-UAV Networks: Requirements, Paradigm Shifts, and Case Studies

Networked robots can perceive their surroundings, interact with each other or humans,and make decisions to accomplish specified tasks in remote/hazardous/complex environments. Satelliteunmanned aerial vehicle(UAV) networks can support such robots by providing on-demand communication services. However, under traditional open-loop communication paradigm, the network resources are usually divided into user-wise mostly-independent links,via ignoring the task-level dependency of robot collaboration. Thus, it is imperative to develop a new communication paradigm, taking into account the highlevel content and values behind, to facilitate multirobot operation. Inspired by Wiener’s Cybernetics theory, this article explores a closed-loop communication paradigm for the robot-oriented satellite-UAV network. This paradigm turns to handle group-wise structured links, so as to allocate resources in a taskoriented manner. It could also exploit the mobility of robots to liberate the network from full coverage,enabling new orchestration between network serving and positive mobility control of robots. Moreover,the integration of sensing, communications, computing and control would enlarge the benefit of this new paradigm. We present a case study for joint mobile edge computing(MEC) offloading and mobility control of robots, and finally outline potential challenges and open issues.

Collaborative Charging Scheduling in Wireless Charging Sensor Networks

Wireless sensor networks (WSNs) have the trouble of limited battery power, and wireless charging provides apromising solution to this problem, which is not easily affected by the external environment. In this paper, we studythe recharging of sensors in wireless rechargeable sensor networks (WRSNs) by scheduling two mobile chargers(MCs) to collaboratively charge sensors. We first formulate a novel sensor charging scheduling problem with theobjective of maximizing the number of surviving sensors, and further propose a collaborative charging schedulingalgorithm(CCSA) for WRSNs. In the scheme, the sensors are divided into important sensors and ordinary sensors.TwoMCs can adaptively collaboratively charge the sensors based on the energy limit ofMCs and the energy demandof sensors. Finally, we conducted comparative simulations. The simulation results show that the proposed algorithmcan effectively reduce the death rate of the sensor. The proposed algorithm provides a solution to the uncertaintyof node charging tasks and the collaborative challenges posed by multiple MCs in practical scenarios.

Online Learning-Based Offloading Decision and Resource Allocation in Mobile Edge Computing-Enabled Satellite-Terrestrial Networks

Mobile edge computing(MEC)-enabled satellite-terrestrial networks(STNs)can provide Internet of Things(IoT)devices with global computing services.Sometimes,the network state information is uncertain or unknown.To deal with this situation,we investigate online learning-based offloading decision and resource allocation in MEC-enabled STNs in this paper.The problem of minimizing the average sum task completion delay of all IoT devices over all time periods is formulated.We decompose this optimization problem into a task offloading decision problem and a computing resource allocation problem.A joint optimization scheme of offloading decision and resource allocation is then proposed,which consists of a task offloading decision algorithm based on the devices cooperation aided upper confidence bound(UCB)algorithm and a computing resource allocation algorithm based on the Lagrange multiplier method.Simulation results validate that the proposed scheme performs better than other baseline schemes.

A Novel Approach to Energy Optimization:Efficient Path Selection in Wireless Sensor Networks with Hybrid ANN

In pursuit of enhancing the Wireless Sensor Networks(WSNs)energy efficiency and operational lifespan,this paper delves into the domain of energy-efficient routing protocols.InWSNs,the limited energy resources of Sensor Nodes(SNs)are a big challenge for ensuring their efficient and reliable operation.WSN data gathering involves the utilization of a mobile sink(MS)to mitigate the energy consumption problem through periodic network traversal.The mobile sink(MS)strategy minimizes energy consumption and latency by visiting the fewest nodes or predetermined locations called rendezvous points(RPs)instead of all cluster heads(CHs).CHs subsequently transmit packets to neighboring RPs.The unique determination of this study is the shortest path to reach RPs.As the mobile sink(MS)concept has emerged as a promising solution to the energy consumption problem in WSNs,caused by multi-hop data collection with static sinks.In this study,we proposed two novel hybrid algorithms,namely“ Reduced k-means based on Artificial Neural Network”(RkM-ANN)and“Delay Bound Reduced kmeans with ANN”(DBRkM-ANN)for designing a fast,efficient,and most proficient MS path depending upon rendezvous points(RPs).The first algorithm optimizes the MS’s latency,while the second considers the designing of delay-bound paths,also defined as the number of paths with delay over bound for the MS.Both methods use a weight function and k-means clustering to choose RPs in a way that maximizes efficiency and guarantees network-wide coverage.In addition,a method of using MS scheduling for efficient data collection is provided.Extensive simulations and comparisons to several existing algorithms have shown the effectiveness of the suggested methodologies over a wide range of performance indicators.

Real-Time Prediction of Urban Traffic Problems Based on Artificial Intelligence-Enhanced Mobile Ad Hoc Networks(MANETS)

Traffic in today’s cities is a serious problem that increases travel times,negatively affects the environment,and drains financial resources.This study presents an Artificial Intelligence(AI)augmentedMobile Ad Hoc Networks(MANETs)based real-time prediction paradigm for urban traffic challenges.MANETs are wireless networks that are based on mobile devices and may self-organize.The distributed nature of MANETs and the power of AI approaches are leveraged in this framework to provide reliable and timely traffic congestion forecasts.This study suggests a unique Chaotic Spatial Fuzzy Polynomial Neural Network(CSFPNN)technique to assess real-time data acquired from various sources within theMANETs.The framework uses the proposed approach to learn from the data and create predictionmodels to detect possible traffic problems and their severity in real time.Real-time traffic prediction allows for proactive actions like resource allocation,dynamic route advice,and traffic signal optimization to reduce congestion.The framework supports effective decision-making,decreases travel time,lowers fuel use,and enhances overall urban mobility by giving timely information to pedestrians,drivers,and urban planners.Extensive simulations and real-world datasets are used to test the proposed framework’s prediction accuracy,responsiveness,and scalability.Experimental results show that the suggested framework successfully anticipates urban traffic issues in real-time,enables proactive traffic management,and aids in creating smarter,more sustainable cities.

Analysis of Mobile and Internet Network Coverage: Propagation of Electromagnetic Waves and Concept of Digital Divide in Burundi

Mobile and Internet network coverage plays an important role in digital transformation and the exploitation of new services. The evolution of mobile networks from the first generation (1G) to the 5th generation is still a long process. 2G networks have developed the messaging service, which complements the already operational voice service. 2G technology has rapidly progressed to the third generation (3G), incorporating multimedia data transmission techniques. It then progressed to fourth generation (4G) and LTE (Long Term Evolution), increasing the transmission speed to improve 3G. Currently, developed countries have already moved to 5G. In developing countries, including Burundi, a member of the East African Community (ECA) where more than 80% are connected to 2G technologies, 40% are connected to the 3G network and 25% to the 4G network and are not yet connected to the 5G network and then still a process. The objective of this article is to analyze the coverage of 2G, 3G and 4G networks in Burundi. This analysis will make it possible to identify possible deficits in order to reduce the digital divide between connected urban areas and remote rural areas. Furthermore, this analysis will draw the attention of decision-makers to the need to deploy networks and coverage to allow the population to access mobile and Internet services and thus enable the digitalization of the population. Finally, this article shows the level of coverage, the digital divide and an overview of the deployment of base stations (BTS) throughout the country to promote the transformation and digital inclusion of services.

A quality of service routing protocol based on mobility prediction in mobile ad hoc networks

A QoS routing protocol based on mobility prediction is proposed. The protocol selects the steadiest path based on mobility prediction and QoS requirements on bandwidth, delay, and so forth. The main properties of the protocol as follows. (1) Each node just broadcasts its own information, so the packet is very small and can get to the destination in a very short time. (2) When another path is built for the same QoS requirements, the original path has higher priority. (3) The update messages are reduced by using mobility prediction. (4) Data packets carry the information of link change using piggyback, which is helpful for forecasting the link status more accurately. (5) When source node gets Resource Reserve and reconnect packets at the same time, it selects reconnect packet over Resource Reserve packet. The results of simulation show that the protocol has good network performance with low control overload, and efficiently supports transmitting multimedia with QoS requirements in mobile ad hoc networks.

Dynamical behaviour of an epidemic on complex networks with population mobility

In this paper, we study the dynamical behaviour of an epidemic on complex networks with population mobility. In our model, the number of people on each node is unrestricted as the nodes of the network are considered as cities, communities, and so on. Because people can travel between different cities, we study the effect of a population＇s mobility on the epidemic spreading. In view of the population＇s mobility, we suppose that the susceptible individual can be infected by an infected individual in the same city or other connected cities. Simulations are presented to verify our analysis.

Novel model of a AlGaN/GaN high electron mobility transistor based on an artificial neural network

In this paper we present a novel approach to modeling AlGaN/GaN high electron mobility transistor （HEMT） with an artificial neural network （ANN）. The AlGaN/GaN HEMT device structure and its fabrication process are described. The circuit-based Neuro-space mapping （neuro-SM） technique is studied in detail. The EEHEMT model is implemented according to the measurement results of the designed device, which serves as a coarse model. An ANN is proposed to model AIGaN/CaN HEMT based on the coarse model. Its optimization is performed. The simulation results from the model are compared with the measurement results. It is shown that the simulation results obtained from the ANN model of A1GaN/GaN HEMT are more accurate than those obtained from the EEHEMT model.

Virtual reality mobility model for wireless ad hoc networks

For wireless ad hoc networks simulation, node＇s mobility pattern and traffic pattern are two key elements. A new simulation model is presented based on the virtual reality collision detection algorithm in obstacle environment, and the model uses the path planning method to avoid obstacles and to compute the node＇s moving path. Obstacles also affect node＇s signal propagation. Considering these factors, this study implements the mobility model for wireless ad hoc networks. Simulation results show that the model has a significant impact on the performance of protocols.

Reinforcement Learning-Based Optimization for Drone Mobility in 5G and Beyond Ultra-Dense Networks

Drone applications in 5th generation(5G)networks mainly focus on services and use cases such as providing connectivity during crowded events,human-instigated disasters,unmanned aerial vehicle traffic management,internet of things in the sky,and situation awareness.4G and 5G cellular networks face various challenges to ensure dynamic control and safe mobility of the drone when it is tasked with delivering these services.The drone can fly in three-dimensional space.The drone connectivity can suffer from increased handover cost due to several reasons,including variations in the received signal strength indicator,co-channel interference offered to the drone by neighboring cells,and abrupt drop in lobe edge signals due to antenna nulls.The baseline greedy handover algorithm only ensures the strongest connection between the drone and small cells so that the drone may experience several handovers.Intended for fast environment learning,machine learning techniques such as Q-learning help the drone fly with minimum handover cost along with robust connectivity.In this study,we propose a Q-learning-based approach evaluated in three different scenarios.The handover decision is optimized gradually using Q-learning to provide efficient mobility support with high data rate in time-sensitive applications,tactile internet,and haptics communication.Simulation results demonstrate that the proposed algorithm can effectively minimize the handover cost in a learning environment.This work presents a notable contribution to determine the optimal route of drones for researchers who are exploring UAV use cases in cellular networks where a large testing site comprised of several cells with multiple UAVs is under consideration.

Mobility Management in Small Cell Cluster of Cellular Network

The installation of small cells in a 5G network extends the maximum coverage and provides high availability.However,this approach increases the handover overhead in the Core Network(CN)due to frequent handoffs.The variation of user density and movement inside a region of small cells also increases the handover overhead in CN.However,the present 5G system cannot reduce the handover overhead in CN under such circumstances because it relies on a traditionally rigid and complex hierarchical sequence for a handover procedure.Recently,Not Only Stack(NO Stack)architecture has been introduced for Radio Access Network(RAN)to reduce the signaling during handover.This paper proposes a system based on NO Stack architecture and solves the aforementioned problem by adding a dedicated local mobility controller to the edge cloud for each cluster.The dedicated cluster controller manages the user mobility locally inside a cluster and also maintains the forwarding data of a mobile user locally.To reduce the latency for X2-based handover requests,an edge cloud infrastructure has been also developed to provide high-computing for dedicated controllers at the edge of a cellular network.The proposed system is also compared with the traditional 3GPP architecture and other works in the context of overhead and delay caused by X2-based handover requests during user mobility.Simulated results show that the inclusion of a dedicated local controller for small clusters together with the implementation of NO Stack framework reduces the significant amount of overhead of X2-based handover requests at CN.

Mobility-driven user-centric AP clustering in mobile edge computing-based ultra-dense networks

ultra-Dense Network(UDN)has been envisioned as a promising technology to provide high-quality wireless connectivity in dense urban areas,in which the density of Access Points(APs)is increased up to the point where it is comparable with or surpasses the density of active mobile users.In order to mitigate inter-AP interference and improve spectrum efficiency,APs in UDNs are usually clustered into multiple groups to serve different mobile users,respectively.However,as the number of APs increases,the computational capability within an AP group has become the bottleneck of AP clustering.In this paper,we first propose a novel UDN architecture based on Mobile Edge Computing(MEC),in which each MEC server is associated with a user-centric AP cluster to act as a mobile agent.In addition,in the context of MEC-based UDN,we leverage mobility prediction techniques to achieve a dynamic AP clustering scheme,in which the cluster structure can automatically adapt to the dynamic distribution of user traffic in a specific area.Simulation results show that the proposed scheme can highly increase the average user throughput compared with the baseline algorithm using max-SINR user association and equal bandwidth allocation,while it guarantees at the same time low transmission delay.

Mobility Issue on Octagonal Structured ZigBee Network Using Riverbed

Wireless Sensor Network (WSN) is a special type of communication medium through distributed sensor nodes. Popular wireless sensor nodes like ZigBee have splendid interoperability after IEEE 802.15.4 standardization in the domain of wireless personal area network (WPAN). ZigBee has another great feature mobility that makes the ZigBee network more versatile. The mobility feature of ZigBee mobile nodes has a greater impact on network performance than fixed nodes. This impact sometimes turns into more severe because of network structure and mobility model. This study mainly focuses on the performance analysis of the ZigBee mobile node under Random and Octagonal mobility management model with the Tree routing method. The Riverbed academic modeler is used to design, implement and simulate the ZigBee network under certain conditions. This study also presents a competitive performance analysis based on ZigBee mobile nodes transmitter and receiver characteristics under the observation of the mobility model. This indicates that Octagonal mobility model exhibits better performance than the Random mobility model. This study will constitute a new way for further designing and planning a reliable and efficient ZigBee network.