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.

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.

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.

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.

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.

Anonymous multipath routing protocol based on secret sharing in mobile ad hoc networks

Because the intrinsic characteristics of mobile ad hoc networks（MANETs） cause several vulnerabilities,anonymous routing protocols attract much more attention in secure mobile ad hoc networks for the purposes of security and privacy concerns.Until recently,lots of anonymous routing protocols have been proposed.However,most of them are single path or use one path at a time,and the multipath schemes can not thwart both the passive attacks and active attacks simultaneously.Thus an anonymous multipath routing protocol based on secret sharing is proposed.The protocol provides identity anonymity,location anonymity,data and traffic anonymity by employing cryptograph technology and secret sharing in MANET communication process.Meanwhile,a hash function is introduced to detect active attacks in the data transmission process.The protocol can effectively thwart various passive attacks and reduce the successful probability of active attacks（such as interception and physical destroy attacks）.Simulation results show that the proposed scheme provides a reasonably good level of network security and performance.

Analytical Comparison of Resource Search Algorithms in Non-DHT Mobile Peer-to-Peer Networks

One of the key challenges in ad-hoc networks is the resource discovery problem.How efciently&quickly the queried resource/object can be resolved in such a highly dynamic self-evolving network is the underlying question?Broadcasting is a basic technique in the Mobile Ad-hoc Networks(MANETs),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive ooding technique oods the network with query messages,while the random walk scheme operates by contacting subsets of each node’s neighbors at every step,thereby restricting the search space.Many earlier works have mainly focused on the simulation-based analysis of ooding technique,and its variants,in a wired network scenario.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of mobile P2P networks.In this article,we mathematically model different widely used existing search techniques,and compare with the proposed improved random walk method,a simple lightweight approach suitable for the non-DHT architecture.We provide analytical expressions to measure the performance of the different ooding-based search techniques,and our proposed technique.We analytically derive 3 relevant key performance measures,i.e.,the avg.number of steps needed to nd a resource,the probability of locating a resource,and the avg.number of messages generated during the entire search process.

A Novel Multi-Level Trust Algorithm for Mobile Ad Hoc Networks

Firstly, a multilevel trust algorithm for MANET （mobile ad hoe networks） is presented in this paper and the trust level is defined as a three-tuple type in this multilevel trust algorithm. The paper introduces the multilevel trust into MANET, thereby controlling restricted classified information flows among nodes that have different trust levels. Secondly, the infrastructure of MANET that suit to our multi-level trust is presented, Some conclusions are given at lastly.

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%.

Recovery from Wormhole Attack in Mobile Ad Hoc Network (MANET)

Wormhole attack is a serious threat against MANET (mobile ad hoc network) and its routing protocols. A new approach—tunnel key node identification (TKNI) was proposed. Based on tunnel-key-node identification and priority-based route discovery, TKNI can rapidly rebuild the communications that have been blocked by wormhole attack. Compared to previous approaches, the proposed approach aims at both static and dynamic topology environment, involves addressing visible and invisible wormhole attack modes, requires no extra hardware, has a low overhead, and can be easily applied to MANET.

Security: A Core Issue in Mobile <i>Ad hoc</i>Networks

Computation is spanning from PC to Mobile devices. The Mobile Ad hoc Networks (MANETs) are optimal choice to accommodate this growing trend but there is a problem, security is the core issue. MANETs rely on wireless links for communication. Wireless networks are considered more exposed to security attacks as compared to wired networks, especially;MANETs are the soft target due to vulnerable in nature. Lack of infrastructure, open peer to peer connectivity, shared wireless medium, dynamic topology and scalability are the key characteristics of MANETs which make them ideal for security attacks. In this paper, we shall discuss in detail, what does security mean, why MANETs are more susceptible to security attacks than wired networks, taxonomy of network attacks and layer wise analysis of network attacks. Finally, we shall propose solutions to meet the security challenges, according to our framed security criteria.

A LOOP-BASED APPROACH IN CLUSTERING AND ROUTING IN MOBILE AD HOC NETWORKS

Although clustering is a convenient framework to enable traffic control and service support in Mobile Ad hoc NETworks （MANETs）, it is seldom adopted in practice due to the additional traffic overhead it leads to for the resource limited ad hoc network. In order to address this problem, we proposed a loop-based approach to combine clustering and routing. By employing loop topologies, topology information is disseminated with a loop instead of a single node, which provides better robustness, and the nature of a loop that there are two paths between each pair of nodes within a loop composed of setup procedure, regular procedure and emergent route recovering. suggests smart route recovery strategy. Our approach is recovery procedure to achieve clustering, routing and

Improvisation of Node Mobility Using Cluster Routing-based Group Adaptive in MANET

In today's Internet routing infrastructure,designers have addressed scal-ing concerns in routing constrained multiobjective optimization problems examining latency and mobility concerns as a secondary constrain.In tactical Mobile Ad-hoc Network(MANET),hubs can function based on the work plan in various social affairs and the internally connected hubs are almost having the related moving standards where the topology between one and the other are tightly coupled in steady support by considering the touchstone of hubs such as a self-sorted out,self-mending and self-administration.Clustering in the routing process is one of the key aspects to increase MANET performance by coordinat-ing the pathways using multiple criteria and analytics.We present a Group Adaptive Hybrid Routing Algorithm(GAHRA)for gathering portability,which pursues table-driven directing methodology in stable accumulations and on-request steering strategy for versatile situations.Based on this aspect,the research demonstrates an adjustable framework for commuting between the table-driven approach and the on-request approach,with the objectives of enhancing the out-put of MANET routing computation in each hub.Simulation analysis and replication results reveal that the proposed method is promising than a single well-known existing routing approach and is well-suited for sensitive MANET applications.

Modelling a Learning-Based Dynamic Tree Routing Model for Wireless Mesh Access Networks

Link asymmetry in wireless mesh access networks(WMAN)of Mobile ad-hoc Networks(MANETs)is due mesh routers’transmission range.It is depicted as significant research challenges that pose during the design of network protocol in wireless networks.Based on the extensive review,it is noted that the substantial link percentage is symmetric,i.e.,many links are unidirectional.It is identified that the synchronous acknowledgement reliability is higher than the asynchronous message.Therefore,the process of establishing bidirectional link quality through asynchronous beacons underrates the link reliability of asym-metric links.It paves the way to exploit an investigation on asymmetric links to enhance network functions through link estimation.Here,a novel Learning-based Dynamic Tree routing(LDTR)model is proposed to improve network performance and delay.For the evaluation of delay measures,asymmetric link,interference,probability of transmission failure is evaluated.The proportion of energy consumed is used for monitoring energy conditions based on the total energy capacity.This learning model is a productive way for resolving the routing issues over the network model during uncertainty.The asymmetric path is chosen to achieve exploitation and exploration iteratively.The learning-based Dynamic Tree routing model is utilized to resolve the multi-objective routing problem.Here,the simulation is done with MATLAB 2020a simulation environment and path with energy-efficiency and lesser E2E delay is evaluated and compared with existing approaches like the Dyna-Q-network model(DQN),asymmetric MAC model(AMAC),and cooperative asymmetric MAC model(CAMAC)model.The simulation outcomes demonstrate that the anticipated LDTR model attains superior network performance compared to others.The average energy consump-tion is 250 J,packet energy consumption is 6.5 J,PRR is 50 bits/sec,95%PDR,average delay percentage is 20%.

Geographic Drone-based Route Optimization Approach for Emergency Area Ad-Hoc Network

Wireless sensor Mobile ad hoc networks have excellent potential in moving and monitoring disaster area networks on real-time basis.The recent challenges faced in Mobile Ad Hoc Networks(MANETs)include scalability,localization,heterogeneous network,self-organization,and self-sufficient operation.In this background,the current study focuses on specially-designed communication link establishment for high connection stability of wireless mobile sensor networks,especially in disaster area network.Existing protocols focus on location-dependent communications and use networks based on typically-used Internet Protocol(IP)architecture.However,IP-based communications have a few limitations such as inefficient bandwidth utilization,high processing,less transfer speeds,and excessive memory intake.To overcome these challenges,the number of neighbors(Node Density)is minimized and high Mobility Nodes(Node Speed)are avoided.The proposed Geographic Drone Based Route Optimization(GDRO)method reduces the entire overhead to a considerable level in an efficient manner and significantly improves the overall performance by identifying the disaster region.This drone communicates with anchor node periodically and shares the information to it so as to introduce a drone-based disaster network in an area.Geographic routing is a promising approach to enhance the routing efficiency in MANET.This algorithm helps in reaching the anchor(target)node with the help of Geographical Graph-Based Mapping(GGM).Global Positioning System(GPS)is enabled on mobile network of the anchor node which regularly broadcasts its location information that helps in finding the location.In first step,the node searches for local and remote anticipated Expected Transmission Count(ETX),thereby calculating the estimated distance.Received Signal Strength Indicator(RSSI)results are stored in the local memory of the node.Then,the node calculates the least remote anticipated ETX,Link Loss Rate,and information to the new location.Freeway Heuristic algorithm improves the data speed,efficiency and determines the path and optimization problem.In comparison with other models,the proposed method yielded an efficient communication,increased the throughput,and reduced the end-to-end delay,energy consumption and packet loss performance in disaster area networks.

A Systematic Overview of Underwater Wireless Sensor Networks:Applications,Challenge and Research Perspectives

Underwater Wireless Sensor Networks(UWSNs)are becoming increasingly popular in marine applications due to advances in wireless and microelectronics technology.However,UWSNs present challenges in processing,energy,and memory storage due to the use of acoustic waves for communication,which results in long delays,significant power consumption,limited bandwidth,and packet loss.This paper provides a comprehensive review of the latest advancements in UWSNs,including essential services,common platforms,critical elements,and components such as localization algorithms,communication,synchronization,security,mobility,and applications.Despite significant progress,reliable and flexible solutions are needed to meet the evolving requirements of UWSNs.The purpose of this paper is to provide a framework for future research in the field of UWSNs by examining recent advancements,establishing a standard platform and service criteria,using a taxonomy to determine critical elements,and emphasizing important unresolved issues.

Signcryption-Based Key Management for MANETs Applications in Mobile Commerce

Mobile commerce uses wireless device and wireless link to result in the transfer of values in exchange of information, services or goods. Wireless mobile ad hoc networks （MANETs） will bring a revolution to the business model of mobile commerce if such networks are used as the underlying network technology for mobile commerce. Mobile commerce will remain in a niche market until the security issue is properly addressed. Hence, security is also very important for MANET applications in mobile commerce. Robust key management is one of the most crucial technologies for security of MANETs. In this paper, a new solution for key management is proposed using identity-based （ID-based） signcryption and threshold secret sharing. It enables flexible and efficient key management while respecting the constraints of MANETs. In our solution, each mobile host uses its globally unique identity as its public key. It greatly decreases the computation and storage costs of mobile hosts, as well as communication cost for system key management.

Integrating Mobile Ad Hoc Network to the Internet

A novel scheme is presented to integrate mobile ad hoc networks （MANETs） with the lnternet and support mobility across wireless local area networks （WLANs） and MANETs. The mobile nodes, connected as a MANET, employ the optimize d link state routing （OLSR） protocol for routing within the MANET. Mobility management across WLANs and MANETs is achieved through the hierarchical mobile IPv6 （HMIPv6） protocol. The performance is evaluated on a HMIPv6 based test-bed composed of WLANs and MANETs. The efficiency gain obtained from using HMIPv6 in such a hybrid network is investigated. The investigation result shows that the use of HMIPv6 can achieve up to 27% gain on reducing the handoff latency when a mobile roams within a domain. Concerning the reduction of the signaling load on the lnternet, the use of HMIPv6 can achieve at least a 54% gain and converges to 69%.

Dynamic Vehicular Clustering Enhancing Video on Demand Services Over Vehicular Ad-hoc Networks

Nowadays,video streaming applications are becoming one of the tendencies driving vehicular network users.In this work,considering the unpredictable vehicle density,the unexpected acceleration or deceleration of the different vehicles included in the vehicular traffic load,and the limited radio range of the employed communication scheme,we introduce the“Dynamic Vehicular Clustering”(DVC)algorithm as a new scheme for video streaming systems over vehicular ad-hoc networks(VANET).The proposed algorithm takes advantage of the small cells concept and the introduction of wireless backhauls,inspired by the different features and the performance of the Long Term Evolution(LTE)-Advanced network.Vehicles are clustered together to form dynamically ad-hoc sub-networks included in the vehicular network.The goal of our clustering algorithm is to take into account several characteristics,such as the vehicle’s position and acceleration to reduce latency and packet loss.Therefore,each cluster is counted as a small cell containing vehicular nodes and an access point that is elected regarding some particular specifications.Based on the exceptional features of the LTE-Advanced network(small cells and wireless backhauls)the DVC algorithm is a promising scheme for video streaming services over VANET systems.Experiments were carried out with a virtual topology of the VANET network created with four clusters to implement the DVC algorithm.The results were compared with other algorithms such as Virtual Trust-ability Data transmission(VTD),Named Data Networking(NDN),and Socially Aware Security Message Forwarding(SASMF).Our algorithm can effectively improve the transmission rate of data packets at the expense of a slight increase in end-to-end delay and control overhead.