Decentralized content sharing in mobile ad-hoc networks:A survey

The evolution of smart mobile devices has significantly impacted the way we generate and share contents and introduced a huge volume of Internet traffic.To address this issue and take advantage of the short-range communication capabilities of smart mobile devices,the decentralized content sharing approach has emerged as a suitable and promising alternative.Decentralized content sharing uses a peer-to-peer network among colocated smart mobile device users to fulfil content requests.Several articles have been published to date to address its different aspects including group management,interest extraction,message forwarding,participation incentive,and content replication.This survey paper summarizes and critically analyzes recent advancements in decentralized content sharing and highlights potential research issues that need further consideration.

A Collaborative Approach for Secured Routing in Mobile Ad-Hoc Network

Mobile computing is the most powerful application for network com-munication and connectivity,given recent breakthroughs in thefield of wireless networks or Mobile Ad-hoc networks(MANETs).There are several obstacles that effective networks confront and the networks must be able to transport data from one system to another with adequate precision.For most applications,a frame-work must ensure that the retrieved data reflects the transmitted data.Before driv-ing to other nodes,if the frame between the two nodes is deformed in the data-link layer,it must be repaired.Most link-layer protocols immediately disregard the frame and enable the high-layer protocols to transmit it down.In other words,because of asset information must be secured from threats,information is a valu-able resource.In MANETs,some applications necessitate the use of a network method for detecting and blocking these assaults.Building a secure intrusion detection system in the network,which provides security to the nodes and route paths in the network,is a major difficulty in MANET.Attacks on the network can jeopardize security issues discovered by the intrusion detection system engine,which are then blocked by the network’s intrusion prevention engine.By bringing the Secure Intrusion Detection System(S-IDS)into the network,a new technique for implementing security goals and preventing attacks will be developed.The Secure Energy Routing(SER)protocol for MANETs is introduced in this study.The protocol addresses the issue of network security by detecting and preventing attacks in the network.The data transmission in the MANET is forwarded using Elliptical Curve Cryptography(ECC)with an objective to improve the level of security.Network Simulator–2 is used to simulate the network and experiments are compared with existing methods.

Multi-Agent Deep Reinforcement Learning for Cross-Layer Scheduling in Mobile Ad-Hoc Networks

Due to the fading characteristics of wireless channels and the burstiness of data traffic,how to deal with congestion in Ad-hoc networks with effective algorithms is still open and challenging.In this paper,we focus on enabling congestion control to minimize network transmission delays through flexible power control.To effectively solve the congestion problem,we propose a distributed cross-layer scheduling algorithm,which is empowered by graph-based multi-agent deep reinforcement learning.The transmit power is adaptively adjusted in real-time by our algorithm based only on local information(i.e.,channel state information and queue length)and local communication(i.e.,information exchanged with neighbors).Moreover,the training complexity of the algorithm is low due to the regional cooperation based on the graph attention network.In the evaluation,we show that our algorithm can reduce the transmission delay of data flow under severe signal interference and drastically changing channel states,and demonstrate the adaptability and stability in different topologies.The method is general and can be extended to various types of topologies.

Survivability modeling and analysis on 3D mobile ad-hoc networks

Most existing work on survivability in mobile ad-hoc networks(MANETs) focuses on two dimensional(2D) networks.However,many real applications run in three dimensional(3D) networks,e.g.,climate and ocean monitoring,and air defense systems.The impact on network survivability due to node behaviors was presented,and a quantitative analysis method on survivability was developed in 3D MANETs by modeling node behaviors and analyzing 3D network connectivity.Node behaviors were modeled by using a semi-Markov process.The node minimum degree of 3D MANETs was discussed.An effective approach to derive the survivability of k-connected networks was proposed through analyzing the connectivity of 3D MANETs caused by node misbehaviors,based on the model of node isolation.The quantitative analysis of node misbehaviors on the survivability in 3D MANETs is obtained through mathematical description,and the effectiveness and rationality of the proposed approach are verified through numerical analysis.The analytical results show that the effect from black and gray attack on network survivability is much severer than other misbehaviors.

Optimization of Route Repair in Mobile Ad-hoc Network

A main shortcoming of mobile Ad-hoc network's reactive routing protocols is the large volume of far-reaching control traffic required to support the route discovery (RD) and route repair (RR) mechanism. Using a random mobility model, this paper derives the probability equation of the relative distance (RDIS) between any two mobile hosts in an ad-hoc network. Consequently, combining with average equivalent hop distance (AEHD), a host can estimate the routing hops between itself and any destination host each time the RD/RR procedure is triggered, and reduce the flooding area of RD/RR messages. Simulation results show that this optimized route repair (ORR) algorithm can significantly decrease the communication overhead of RR process by about 35%.

Performance Analysis under MAC Layer Misbehavior Attack in Mobile Ad-Hoc Networks

This work presents a multi-criteria analysis of the MAC （media access control） layer misbehavior of the IEEE （Institute of Electrical and Electronics Engineers） 802.11 standard, whose principle is to cheat at the protocol to increase the transmission rate by greedy nodes at the expense of the other honest nodes. In fact, IEEE 802.11 forces nodes for access to the channel to wait for a back off interval, randomly selected from a specified range, before initiating a transmission. Greedy nodes may wait for smaller back-off intervals than honest nodes, and then obtaining an unfair assignment. In the first of our works a state of art on the research on IEEE 802.11 MAC layer misbehavior are presented. Then the impact of this misbehavior at the reception is given, and we will generalize this impact on a large scale. An analysis of the correlation between the throughput and the inter-packets time is given. Afterwards, we will define a new metric for measuring the performance and capability of the network.

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.

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.

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.

Quality of Service and Security on Cisco Network Devices, Coupled with the Development of a Mobile Application Prototype Software for Server Room Temperature Monitoring

In an era where digital technology is paramount, higher education institutions like the University of Zambia (UNZA) are employing advanced computer networks to enhance their operational capacity and offer cutting-edge services to their academic fraternity. Spanning across the Great East Road campus, UNZA has established one of the most extensive computer networks in Zambia, serving a burgeoning community of over 20,000 active users through a Metropolitan Area Network (MAN). However, as the digital landscape continues to evolve, it is besieged with burgeoning challenges that threaten the very fabric of network integrity—cyber security threats and the imperatives of maintaining high Quality of Service (QoS). In an effort to mitigate these threats and ensure network efficiency, the development of a mobile application to monitor temperatures in the server room was imperative. According to L. Wei, X. Zeng, and T. Shen, the use of wireless sensory networks to monitor the temperature of train switchgear contact points represents a cost-effective solution. The system is based on wireless communication technology and is detailed in their paper, “A wireless solution for train switchgear contact temperature monitoring and alarming system based on wireless communication technology”, published in the International Journal of Communications, Network and System Sciences, vol. 8, no. 4, pp. 79-87, 2015 [1]. Therefore, in this study, a mobile application technology was explored for monitoring of temperatures in the server room in order to aid Cisco device performance. Additionally, this paper also explores the hardening of Cisco device security and QoS which are the cornerstones of this study.

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.

Location aided probabilistic broadcast algorithm for mobile Ad-hoc network routing

On-demand routing protocols are widely used in mobile Ad-hoc network （MANET）. Flooding is an important dissemination scheme in routing discovering of on-demand routing protocol. However, in high-density MANET redundancy flooding packets lead to dramatic deterioration of the performance which calls broadcast storm problem （BSP）. A location-aided probabilistic broadcast （LAPB） algorithm for routing in MANET is proposed to reduce the number of routing packets produced by flooding in this paper. In order to reduce the redundancy packets, only nodes in a specific area have the probability, computed by location information and neighbor knowledge, to propagate the routing packets. Simulation results demonstrate that the LAPB algorithm can reduce the packets and discovery delay （DD） in the routing discovery phase.

Toward path reliability by using adaptive multi-path routing mechanism for multimedia service in mobile Ad-hoc network

Traditional multi-path routing mechanisms aim to establish complete node or link disjoint paths. However, under some circumstances if multiple paths cannot be established based on the current network topology, the traditional multi-path routing mechanism will degenerate into single path routing mechanism, thus the advantages of multi-path routing cannot be exhibited. To enhance the end-to-end path reliability, an adaptive multi-path routing mechanism with path segment is proposed, in which multi-path can be established at part of the end-to-end path. In this way the reliability of the path can be enhanced. This path segment mechanism can divide the end-to-end path into several short segments, and a parallel forwarding mechanism is proposed for guaranteeing the quality of service of multimedia services over the wireless network. Simulations show that the network performance metrics such as the packet delivery ratio, the end-to-end delay and the number of route discoveries are all improved by using the adaptive multi-path routing mechanism.

Survivability Evaluation in Large-Scale Mobile Ad-Hoc Networks

Survivability refers to the ability of a network system to fulfill critical services in a timely manner to end users in the presence of failures and/or attacks. In order to establish a highly survivable system, it is necessary to measure its survivability to evaluate the performance of the system＇s services under adverse conditions. According to survivability requirements of large-scale mobile ad-hoc networks （MANETs）, we propose a novel model for quantitative evaluation on survivability. The proposed model considers various types of faults and connection states of mobile hosts, and uses the continuous time Markov chain （CTMC） to describe the survivability of MANETs in a precise manner. We introduce the reliability theory to perform quantitative analysis and survivability evaluation of segment-by-segment routing （SSR）, multipath-based segment-by-segment routing （MP-SSR）, and segment-by-segment-based multipath routing （SS-MPR） in large-scale MANETs. The proposed model can be used to analyze the network performance much more easily than a simulation-based approach. Numerical validation shows that the proposed model can be used to obtain a better evaluation result on the survivability of large-scale MANETs.

Collision Avoidance in Mobile Wireless Ad-Hoc Networks with Enhanced MACAW Protocol Suite

Jamming attack is quite serious threat for Mobile networks that collapses all necessary communication infrastructure. Since mobile nodes in Mobile Ad Hoc Networks (MANET) communicate in a multi-hop mode, there is always a possibility for an intruder to launch a jamming attack in order to intercept communication among communication nodes. In this study, a network simulation has been carried out in order to explore and evaluate the possible impacts of jamming attack on MACAW protocol. Ad-hoc network modelling is used to provide communication infrastructure among mobile nodes in order to modelling the simulation scenarios. In simulation model, these nodes have used AODV routing protocol which is designed for MANET while second scenario contains simulated MACAW node models for comparison. On the other hand, this paper is the first study that addresses performance evaluation of MACAW protocol under a constant Jamming Attack. The performance of MACAW protocol is simulated through OPNET Modeler 14.5 software.

Power Adjusting Algorithm： A New Cross-Layer Power Saving Mechanism for Mobile Ad-Hoc Networks

Power saving is one of the key issues in Mobile Ad-Hoc Networks （MANETs）. It can be realized in Medium Access Control （MAC） layer and network layer. However, previous attentions were mainly paid to MAC layer or network layer with the aim of improving the channel utilization by adopting variable-range transmission power control. In this paper we focus on the power saving in both MAC layer and network layer, and propose a Power Adjusting Algorithm （PAA）. In the presence of host＇s mobility, PAA is designed to conserve energy by adjusting the transmission power to maintain the route＇s connectivity and restarting the route discovery periodically to find a new route with better energy efficiency dynamically. After analyzing the operations of PAA, we find that the length of route discovery restarting period is a critical argument which will affect power saving, and an energy consumption model is abstracted to find the optimal value of the restarting period by analyzing the energy consumption of this algorithm. PAA can handle the mobility of MANET by adjusting the transmission power and in the meantime save energy by restarting route discovery periodically to balance the energy consumption on route discovery and packet delivering. Simulation results show that, PAA saves nearly 40% energy compared with Dynamic Source Routing protocol when the maximum speed of mobile hosts is larger than 8 m/s.

Artificial Potential Field Incorporated Deep-Q-Network Algorithm for Mobile Robot Path Prediction

Autonomous navigation of mobile robots is a challenging task that requires them to travel from their initial position to their destination without collision in an environment.Reinforcement Learning methods enable a state action function in mobile robots suited to their environment.During trial-and-error interaction with its surroundings,it helps a robot tofind an ideal behavior on its own.The Deep Q Network(DQN)algorithm is used in TurtleBot 3(TB3)to achieve the goal by successfully avoiding the obstacles.But it requires a large number of training iterations.This research mainly focuses on a mobility robot’s best path prediction utilizing DQN and the Artificial Potential Field(APF)algorithms.First,a TB3 Waffle Pi DQN is built and trained to reach the goal.Then the APF shortest path algorithm is incorporated into the DQN algorithm.The proposed planning approach is compared with the standard DQN method in a virtual environment based on the Robot Operation System(ROS).The results from the simulation show that the combination is effective for DQN and APF gives a better optimal path and takes less time when compared to the conventional DQN algo-rithm.The performance improvement rate of the proposed DQN+APF in comparison with DQN in terms of the number of successful targets is attained by 88%.The performance of the proposed DQN+APF in comparison with DQN in terms of average time is achieved by 0.331 s.The performance of the proposed DQN+APF in comparison with DQN average rewards in which the positive goal is attained by 85%and the negative goal is attained by-90%.

Neural Dynamics for Cooperative Motion Control of Omnidirectional Mobile Manipulators in the Presence of Noises: A Distributed Approach

This paper presents a distributed scheme with limited communications, aiming to achieve cooperative motion control for multiple omnidirectional mobile manipulators(MOMMs).The proposed scheme extends the existing single-agent motion control to cater to scenarios involving the cooperative operation of MOMMs. Specifically, squeeze-free cooperative load transportation is achieved for the end-effectors of MOMMs by incorporating cooperative repetitive motion planning(CRMP), while guiding each individual to desired poses. Then, the distributed scheme is formulated as a time-varying quadratic programming(QP) and solved online utilizing a noise-tolerant zeroing neural network(NTZNN). Theoretical analysis shows that the NTZNN model converges globally to the optimal solution of QP in the presence of noise. Finally, the effectiveness of the control design is demonstrated by numerical simulations and physical platform experiments.

MobileNetV3识别甲状腺良恶性结节的超声图像

目的:研究MobileNetV3在甲状腺良恶性结节超声图像分类问题中的可行性并评估效果。方法:回顾性分析1996例甲状腺结节患者的临床与超声资料。共获得良性结节1353个,恶性结节1197个。将良性结节和恶性结节超声图像按照8∶1∶1比例划分为训练集、测试集和验证集。构建基于Pytorch框架的MobileNetV3深度学习网络。采用不同优化器和学习率组合在数据集中对MobileNetV3的2个亚模型(small和large)进行训练、测试和验证。结果:large模型中以LAdamax_0.001在训练集和测试集的准确率最高,分别为0.98和0.92;其次为LAdam_0.0001,分别为0.96和0.87。small模型中以SAdam_0.001在训练集和测试集的准确率最高,分别为0.97和0.85;其次为SAdam_0.0001,分别为0.88和0.85。在验证集中的精确度、召回率、F1评分和受试者工作特征曲线下面积分别为LAdamax_0.001(0.95,0.95,0.95,0.94)、LAdam_0.0001(0.88,0.88,0.88,0.88)、SAdam_0.001(0.90,0.89,0.89,0.88)和SAdam_0.0001(0.89,0.89,0.89,0.89)。结论:MobileNetV3是甲状腺良恶性结节超声图像分类的有效方法,以LAdamax_0.001性能最佳,具有潜在的临床应用价值。

Mobile Coded Caching in Small Cell Networks:Algorithm Design and Performance Analysis

In coded caching,users cache pieces of files under a specific arrangement so that the server can satisfy their requests simultaneously in the broadcast scenario via e Xclusive OR(XOR)operation and therefore reduce the amount of transmission data.However,when users’locations are changing,the uploading of caching information is frequent and extensive that the traffic increase outweighed the traffic reduction that the traditional coded caching achieved.In this paper,we propose mobile coded caching schemes to reduce network traffic in mobility scenarios,which achieve a lower cost on caching information uploading.In the cache placement phase,the proposed scheme first constructs caching patterns,and then assigns the caching patterns to users according to the graph coloring method and four color theorem in our centralized cache placement algorithm or randomly in our decentralized cache placement algorithm.Then users are divided into groups based on their caching patterns.As a benefit,when user movements occur,the types of caching pattern,rather than the whole caching information of which file pieces are cached,are uploaded.In the content delivery phase,XOR coded caching messages are reconstructed.Transmission data volume is derived to measure the performance of the proposed schemes.Numerical results show that the proposed schemes achieve great improvement in traffic offloading.