781 research outputs found
Distributed consensus in wireless network
Connected autonomous systems, which are powered by the synergistic integration of the Internet of Things (IoT), Artificial Intelligence (AI), and 5G technologies, predominantly rely on a central node for making mission-critical decisions. This reliance poses a significant challenge that the condition and capability of the central node largely determine the reliability and effectiveness of decision-making. Maintaining such a centralized system, especially in large-scale wireless networks, can be prohibitively expensive and encounters scalability challenges. In light of these limitations, thereās a compelling need for innovative methods to address the increasing demands of reliability and latency, especially in mission-critical networks where cooperative decision-making is paramount. One promising avenue lies in the distributed consensus protocol, a mechanism intrinsic to distributed computing systems. These protocols offer enhanced robustness, ensuring continued functionality and responsiveness in decision-making even in the face of potential node or communication failures.
This thesis pivots on the idea of leveraging distributed consensus to bolster the reliability of mission-critical decision-making within wireless networks, which delves deep into the performance characteristics of wireless distributed consensus, analyzing and subsequently optimizing its attributes, specifically focusing on reliability and latency. The research begins with a fundamental model of consensus reliability in an crash fault tolerance protocol Raft. A novel metric termed ReliabilityGain is introduced to analyze the performance of distributed consensus in wireless network. This innovative concept elucidates the linear correlation between the reliability inherent to consensus-driven decision-making and the reliability of communication link transmission. An intriguing discovery made in my study is the inherent trade-off between the time latency of achieving consensus and its reliability. These two variables appear to be in contradiction, which brings further performance optimization issues.
The performance of the Crash and Byzantine fault tolerance protocol is scrutinized and they are compared with original centralized consensus. This exploration becomes particularly pertinent when communication failures occur in wireless distributed consensus. The analytical results are juxtaposed with performance metrics derived from a centralized consensus mechanism. This comparative analysis illuminates the relative merits and demerits of these consensus strategies, evaluated from the dual perspectives of comprehensive consensus reliability and communication latency.
In light of the insights gained from the detailed analysis of the Raft and Hotstuff BFT protocols, my thesis further ventures into the realm of optimization strategies for wireless distributed consensus. A central facet of this exploration is the introduction of a tailored communication resource allocation scheme. This scheme, rooted in maximizing the performance of consensus mechanisms, dynamically assesses the network conditions and allocates communication resources such as transmit power and bandwidth to ensure efficient and timely decision-making, which ensures that even in varied and unpredictable network conditions, consensus can be achieved with minimized latency and maximized reliability.
The research introduces an adaptive protocol of distributed consensus in wireless network. This proposed adaptive protocolās strength lies in its ability to autonomously construct consensus-enabled network even if node failures or communication disruptions occur, which ensures that the networkās decision-making process remains uninterrupted and efficient, irrespective of external challenges. The sharding mechanism, which is regarded as an effective solution to scalability issues in distributed system, does not only aid in managing vast networks more efficiently but also ensure that any disruption in one shard cannot compromise the functionality of the entire network. Therefore, this thesis shows the reliability and security analysis of sharding that implemented in wireless distributed system. In essence, these intertwined strategies, rooted in the intricate dance of communication resource allocation, adaptability, and sharding, together form the bedrock of my contributions to enhancing the performance of wireless distributed consensus
Misbehavior aware on-demand intrusion detection system to enhance security in VANETs with efficient rogue nodes detection and prevention techniques
Vehicular ad-hoc networks (VANETs) facilitate vehicles to broadcast beacon messages to ensure road safety. The goal behind sharing the information through beacon messages is to disseminate network state or emergency information. The exchange of information is susceptible to security attacks of different kinds. Amongst various problems to be solved in VANETs is the issue of rogue nodes and their impact on the network. Rogue nodes are malicious vehicles that are vicious to cause severe damage to the network by modifying or altering false data in beacon messages that could lead to catastrophic consequences like trapping a group of vehicles, road accidents, vehicle collisions, etc. This thesis discusses the problems associated with the security VANETs in the presence of rogue nodes.
We proposed three novel intrusion detection frameworks to detect the rogue nodes responsible for false information, Sybil, and platoon control maneuver attacks only by analyzing and comparing the beacon messages broadcast over the network. The novelty of our frameworks lies in containing network damage and securing VANETs from the harmful impact of rogue nodes. The proposed frameworks are simulated using SUMO, OMNET++, and VENTOS, and the results obtained have been presented, discussed, and compared to existing frameworks. Results show that the developed methods improve the systemsā performance compared to existing methods even when the number of rogue nodes increases in the region
Predicting and Recovering Link Failure Localization Using Competitive Swarm Optimization for DSR Protocol in MANET
Portable impromptu organization is a self-putting together, major construction-less, independent remote versatile hub that exists without even a trace of a determined base station or government association. MANET requires no extraordinary foundation as the organization is unique. Multicasting is an urgent issue in correspondence organizations. Multicast is one of the effective methods in MANET. In multicasting, information parcels from one hub are communicated to a bunch of recipient hubs all at once, at a similar time. In this research work, Failure Node Detection and Efficient Node Localization in a MANET situation are proposed. Localization in MANET is a main area that attracts significant research interest. Localization is a method to determine the nodesā location in the communication network. A novel routing algorithm, which is used for Predicting and Recovering Link Failure Localization using a Genetic Algorithm with Competitive Swarm Optimization (PRLFL-GACSO) Algorithm is proposed in this study to calculate and recover link failure in MANET. The process of link failure detection is accomplished using mathematical modelling of the genetic algorithm and the routing is attained using the Competitive Swarm optimization technique. The result proposed MANET method makes use of the CSO algorithm, which facilitates a well-organized packet transfer from the source node to the destination node and enhances DSR routing performance. Based on node movement, link value, and endwise delay, the optimal route is found. The main benefit of the PRLFL-GACSO Algorithm is it achieves multiple optimal solutions over global information. Further, premature convergence is avoided using Competitive Swarm Optimization (CSO). The suggested work is measured based on the Ns simulator. The presentation metrix are PDR, endwise delay, power consumption, hit ratio, etc. The presentation of the proposed method is almost 4% and 5% greater than the present TEA-MDRP, RSTA-AOMDV, and RMQS-ua methods. After, the suggested method attains greater performance for detecting and recovering link failure. In future work, the hybrid multiway routing protocols are presented to provide link failure and route breakages and liability tolerance at the time of node failure, and it also increases the worth of service aspects, respectively
Security and Privacy for Modern Wireless Communication Systems
The aim of this reprint focuses on the latest protocol research, software/hardware development and implementation, and system architecture design in addressing emerging security and privacy issues for modern wireless communication networks. Relevant topics include, but are not limited to, the following: deep-learning-based security and privacy design; covert communications; information-theoretical foundations for advanced security and privacy techniques; lightweight cryptography for power constrained networks; physical layer key generation; prototypes and testbeds for security and privacy solutions; encryption and decryption algorithm for low-latency constrained networks; security protocols for modern wireless communication networks; network intrusion detection; physical layer design with security consideration; anonymity in data transmission; vulnerabilities in security and privacy in modern wireless communication networks; challenges of security and privacy in nodeāedgeācloud computation; security and privacy design for low-power wide-area IoT networks; security and privacy design for vehicle networks; security and privacy design for underwater communications networks
An Overview of Manet Power Management Approaches
One of the primary issues with MANET is power optimization and utilization because it relies on the node's internal battery power to operate the wireless network. The performance of the MANET is also affected by one of the parameters of energy consumption and utilization. Each operation in the MANET requires some amount of energy to complete. This article elaborated on MANET power management from its inception to the present, as well as doing comparison research to recommend new methods for improving MANET power utilization. This study examines MANET power management options in terms of numerous parameter metrics, including Mobility Aware, Clustering, Topology, Transmission Range, QOS, and link-based. Finally, the methodologies used in MANET power management and performance factor improvement were summarised. To surpass all performance indicators in MANET utilization, new manipulative tactics are necessary. The innovative method is the most effective
Secure Routing Protocol To Mitigate Attacks By Using Blockchain Technology In Manet
MANET is a collection of mobile nodes that communicate through wireless
networks as they move from one point to another. MANET is an
infrastructure-less network with a changeable topology; as a result, it is very
susceptible to attacks. MANET attack prevention represents a serious
difficulty. Malicious network nodes are the source of network-based attacks. In
a MANET, attacks can take various forms, and each one alters the network's
operation in its unique way. In general, attacks can be separated into two
categories: those that target the data traffic on a network and those that
target the control traffic. This article explains the many sorts of assaults,
their impact on MANET, and the MANET-based defence measures that are currently
in place. The suggested SRA that employs blockchain technology (SRABC) protects
MANET from attacks and authenticates nodes. The secure routing algorithm (SRA)
proposed by blockchain technology safeguards control and data flow against
threats. This is achieved by generating a Hash Function for every transaction.
We will begin by discussing the security of the MANET. This article's second
section explores the role of blockchain in MANET security. In the third
section, the SRA is described in connection with blockchain. In the fourth
phase, PDR and Throughput are utilised to conduct an SRA review using
Blockchain employing PDR and Throughput. The results suggest that the proposed
technique enhances MANET security while concurrently decreasing delay. The
performance of the proposed technique is analysed and compared to the routing
protocols Q-AODV and DSR.Comment: https://aircconline.com/ijcnc/V15N2/15223cnc07.pd
Efficiency and Sustainability of the Distributed Renewable Hybrid Power Systems Based on the Energy Internet, Blockchain Technology and Smart Contracts-Volume II
The climate changes that are becoming visible today are a challenge for the global research community. In this context, renewable energy sources, fuel cell systems, and other energy generating sources must be optimally combined and connected to the grid system using advanced energy transaction methods. As this reprint presents the latest solutions in the implementation of fuel cell and renewable energy in mobile and stationary applications, such as hybrid and microgrid power systems based on the Energy Internet, Blockchain technology, and smart contracts, we hope that they will be of interest to readers working in the related fields mentioned above
Modelling, Dimensioning and Optimization of 5G Communication Networks, Resources and Services
This reprint aims to collect state-of-the-art research contributions that address challenges in the emerging 5G networks design, dimensioning and optimization. Designing, dimensioning and optimization of communication networks resources and services have been an inseparable part of telecom network development. The latter must convey a large volume of traffic, providing service to traffic streams with highly differentiated requirements in terms of bit-rate and service time, required quality of service and quality of experience parameters. Such a communication infrastructure presents many important challenges, such as the study of necessary multi-layer cooperation, new protocols, performance evaluation of different network parts, low layer network design, network management and security issues, and new technologies in general, which will be discussed in this book
Scalable Schedule-Aware Bundle Routing
This thesis introduces approaches providing scalable delay-/disruption-tolerant routing capabilities in scheduled space topologies. The solution is developed for the requirements derived from use cases built according to predictions for future space topology, like the future Mars communications architecture report from the interagency operations advisory group. A novel routing algorithm is depicted to provide optimized networking performance that discards the scalability issues inherent to state-of-the-art approaches. This thesis also proposes a new recommendation to render volume management concerns generic and easily exchangeable, including a new simple management technique increasing volume awareness accuracy while being adaptable to more particular use cases. Additionally, this thesis introduces a more robust and scalable approach for internetworking between subnetworks to increase the throughput, reduce delays, and ease configuration thanks to its high flexibility.:1 Introduction
1.1 Motivation
1.2 Problem statement
1.3 Objectives
1.4 Outline
2 Requirements
2.1 Use cases
2.2 Requirements
2.2.1 Requirement analysis
2.2.2 Requirements relative to the routing algorithm
2.2.3 Requirements relative to the volume management
2.2.4 Requirements relative to interregional routing
3 Fundamentals
3.1 Delay-/disruption-tolerant networking
3.1.1 Architecture
3.1.2 Opportunistic and deterministic DTNs
3.1.3 DTN routing
3.1.4 Contact plans
3.1.5 Volume management
3.1.6 Regions
3.2 Contact graph routing
3.2.1 A non-replication routing scheme
3.2.2 Route construction
3.2.3 Route selection
3.2.4 Enhancements and main features
3.3 Graph theory and DTN routing
3.3.1 Mapping with DTN objects
3.3.2 Shortest path algorithm
3.3.3 Edge and vertex contraction
3.4 Algorithmic determinism and predictability
4 Preliminary analysis
4.1 Node and contact graphs
4.2 Scenario
4.3 Route construction in ION-CGR
4.4 Alternative route search
4.4.1 Yenās algorithm scalability
4.4.2 Blocking issues with Yen
4.4.3 Limiting contact approaches
4.5 CGR-multicast and shortest-path tree search
4.6 Volume management
4.6.1 Volume obstruction
4.6.2 Contact sink
4.6.3 Ghost queue
4.6.4 Data rate variations
4.7 Hierarchical interregional routing
4.8 Other potential issues
5 State-of-the-art and related work
5.1 Taxonomy
5.2 Opportunistic and probabilistic approaches
5.2.1 Flooding approaches
5.2.2 PROPHET
5.2.3 MaxProp
5.2.4 Issues
5.3 Deterministic approaches
5.3.1 Movement-aware routing over interplanetary networks
5.3.2 Delay-tolerant link state routing
5.3.3 DTN routing for quasi-deterministic networks
5.3.4 Issues
5.4 CGR variants and enhancements
5.4.1 CGR alternative routing table computation
5.4.2 CGR-multicast
5.4.3 CGR extensions
5.4.4 RUCoP and CGR-hop
5.4.5 Issues
5.5 Interregional routing
5.5.1 Border gateway protocol
5.5.2 Hierarchical interregional routing
5.5.3 Issues
5.6 Further approaches
5.6.1 Machine learning approaches
5.6.2 Tropical geometry
6 Scalable schedule-aware bundle routing
6.1 Overview
6.2 Shortest-path tree routing for space networks
6.2.1 Structure
6.2.2 Tree construction
6.2.3 Tree management
6.2.4 Tree caching
6.3 Contact segmentation
6.3.1 Volume management interface
6.3.2 Simple volume manager
6.3.3 Enhanced volume manager
6.4 Contact passageways
6.4.1 Regional border deļ¬nition
6.4.2 Virtual nodes
6.4.3 Pathļ¬nding and administration
7 Evaluation
7.1 Methodology
7.1.1 Simulation tools
7.1.2 Simulator extensions
7.1.3 Algorithms and scenarios
7.2 Oļ¬ine analysis
7.3 Eliminatory processing pressures
7.4 Networking performance
7.4.1 Intraregional unicast routing tests
7.4.2 Intraregional multicast tests
7.4.3 Interregional routing tests
7.4.4 Behavior with congestion
7.5 Requirement fulļ¬llment
8 Summary and Outlook
8.1 Conclusion
8.2 Future works
8.2.1 Next development steps
8.2.2 Contact graph routin
Routing protocol for V2X communications for Urban VANETs
Intelligent Transportation Systems (ITSs) have been attracting tremendous attention in both academia and industry due to emerging applications that pave the way towards safer enjoyable journeys and inclusive digital partnerships. Undoubtedly, these ITS applications will demand robust routing protocols that not only focus on Inter-Vehicle Communications but also on providing fast, reliable, and secure access to the infrastructure. This thesis aims mainly to introduce the challenges of data packets routing through urban environment using the help of infrastructure.
Broadcasting transmission is an essential operational technique that serves a broad range of applications which demand different restrictive QoS provisioning levels. Although broadcast communication has been investigated widely in highway vehicular networks, it is undoubtedly still a challenge in the urban environment due to the obstacles, such as high buildings. In this thesis, the Road-Topology based Broadcast Protocol (RTBP) is proposed, a distance and contention-based forwarding scheme suitable for both urban and highway vehicular environments. RTBP aims at assigning the highest forwarding priority to a vehicle, called a mobile repeater, having the greatest capability to send the packet in multiple directions. In this way, RTBP effectively reduces the number of competing vehicles and minimises the number of hops required to retransmit the broadcast packets around the intersections to cover the targeted area. By investigating the RTBP under realistic urban scenarios against well-known broadcast protocols, eMDR and TAF, that are dedicated to retransmitting the packets around intersections, the results showed the superiority of the RTBP in delivering the most critical warning information for 90% of vehicles with significantly lower delay of 58% and 70% compared to eMDR and TAF. The validation of this performance was clear when the increase in the number of vehicles.
Secondly, a Fast and Reliable Hybrid routing (FRHR) protocol is introduced for efficient infrastructure access which is capable of handling efficient vehicle to vehicle communications. Interface to infrastructure is provided by carefully placed RoadSide Units (RSUs) which broadcast beacons in a multi-hop fashion in constrained areas. This enables vehicles proactively to maintain fresh minimum-delay routes to other RSUs while reactively discovering routes to nearby vehicles. The proposed protocol utilizes RSUs connected to the wired backbone network to relay packets toward remote vehicles. A vehicle selects an RSU to register with according to the expected mean delay instead of the deviceās remoteness. The FRHR performance is evaluated against established infrastructure routing protocols, Trafroute, IGSR and RBVT-R that are dedicated to for urban environment, the results showed an improvement of 20% to 33% in terms of packet delivery ratio and lower latency particularly in sparse networks due to its rapid response to changes in network connectivity.
Thirdly, focusing on increasing FRHRās capability to provide more stable and durable routes to support the QoS requirements of expected wide-range ITS applications on the urban environment, a new route selection mechanism is introduced, aiming at selecting highly connected crossroads. The new protocol is called, Stable Infrastructure Routing Protocol (SIRP). Intensive simulation results showed that SIRP offers low end-to-end delay and high delivery ratio with varying traffic density, while resolving the problem of frequent link failures
- ā¦