Showing papers on "Geographic routing published in 2023"
TL;DR: In this paper , a new privacy protection technique named position independent and section-based source location privacy (PSSLP) is developed, where a biased random walk and greedy routing using a three- or four-phase routing strategy is employed.
Abstract: Privacy of critical locations (or events) is essential when monitored by wireless sensor networks. To mitigate such issues, in this article, a new privacy protection technique named position-independent and section-based source location privacy (PSSLP) is developed. A biased random walk and greedy walk using a three- or four-phase routing strategy is employed here, where the number of phases depends on the network segment in which the source is situated. The biased random walk is intended to send packets away from the source of information and make routing paths appear dynamic to the eavesdropper, whereas, the greedy routing ensures that the packets converge at the base station. The objective of the solution is to achieve a uniform amount of privacy irrespective of the position of the asset in the network without compromising the network lifetime. Performance evaluation is done using developed analytical models and simulation results reveal that PSSLP achieves 8247.06- and 33.0- folds improvement in terms safety period and network lifetime, respectively, compared to no SLP protection technique (i.e., shortest path routing technique).
2 citations
1 citations
06 Jan 2023
TL;DR: In this article , the optimal game routing protocol (OGR) protocol is proposed for UAV ad hoc networks, which takes eigenvector centrality, total energy and delay as key measures to select the next hop.
Abstract: Unmanned Aerial Vehicular networks play a vital role in future wireless networks due to their flexible network architecture. UAVs are deployed in the military operation, live streaming of events, agriculture farming and the internet of things in smart cities. The UAV adhoc networks are at their initial stages due to unique challenges such as high mobility and, 3D mobility leads to the unstable topology. To tackle this issue position-based routing schemes were introduced to offer high throughput and reduce packet overhead. Though offering many benefits, positionbased routing schemes offers higher delay due to the absence of routing table information. To counter this problem, we have proposed Optimal Game Routing Protocol in which each UAV gets position information of next hope UAV node as well as its neighbouring position. Moreover, we have formulated a game theory function which takes eigenvector centrality, total energy and delay as key measures to select the next hop. To evaluate the efficiency of the proposed scheme, we have compared our scheme with benchmark schemes. Results show OGR outer performs on different load scenarios.
23 Jan 2023
TL;DR: In this article , the authors proposed the Enhanced Geographic multipath (EGMPIP) architecture, which constructs the base station routing algorithm by computing the Neighbor node discovery (NND) function in the network using the G-ND.
Abstract: Many paths between the source and sink nodes may be detected using multi-path routing in WSNs. The reliability, energy efficiency, and other benefits of data transmission may be increased by using many channels. The topic of multi-path routing has been the subject of several academic studies. These multi-path routing protocols, however, are ineffective because of the time and energy needed to build several channels. The elimination of bottlenecks and delays in data transmission is made possible by multipath routing in WSNs. Network QoS (Quality of Service), load balancing, and communication dependability may all benefit from multipath routing systems. To identify multipath routing in WSN, we suggested the Enhanced Geographic multipath (EGMPIP) architecture. The proposed framework first constructs the base station routing algorithm by computing the Neighbor node discovery (NND) function in the network using the G-ND. Each node in the network may make use of multipath routing thanks to the network-wide routing mechanism. In the end, simulation data are shown to validate the suggested technique, and the findings demonstrate that the routing strategy described in this work is superior to past methods.
TL;DR: In this article , the authors proposed a Geographic Forwarding Energy Efficient Routing Protocol (GF-EERP), an enhanced version of the Geographic Energy Aware Routing (GEAR) protocol that helps to extend the network's lifespan and performance.
Abstract: In situations where a regular network may not be appropriate or is unable to function correctly, data collection and real-time transmission are commonly done using Wireless Sensor Networks (WSNs). In order to accomplish this type of operation, the network's durability and performance are extremely vital. One of the key elements that directly affect a network's lifespan and performance is the routing protocol. This study proposes a Geographic Forwarding Energy Efficient Routing Protocol (GF-EERP), an enhanced version of the Geographic Energy Aware Routing (GEAR) protocol that helps to extend the network's lifespan and performance. The introduction of node categorization, a unique technique for choosing the region head, use of multi-hop communication method and removal of dead nodes serve as the foundation of the GF-EERP. In this study, the proposed protocol's performance is also compared to other protocols already in use, like Geographic Adaptive Fidelity (GAF), Geographic Energy Aware Routing (GEAR), Greedy Perimeter Stateless Routing (GPSR) and Multihop-Geographic Energy Aware Routing (M-GEAR), using a variety of performance metrics including Network Delay, Data Delivery Ratio and Network Throughput. The simulation outcomes prove that the performance of GF-EERP, with its distinct node categorization and region head selection mechanism is superior to the existing protocols.
TL;DR: In this article , the authors synthesize the classification and arrangement of energy-efficient and secure routing protocols, as well as provide a method to calculate attack probability for secure routing in WSNs.
Abstract: A wireless sensor network (WSN) is a collection of wirelessly connected multifunction sensor devices (referred to as wireless sensor nodes) in an area that requires sensing. In WSNs, wireless sensor nodes have a short transmission range, and processing capacity, storage, and power supply to the node are also limited. In addition, WSNs often include a significant number of sensor nodes, deployed in a large area to meet the requirements set forth, and communication in WSNs must be through multi-hop communication connections. Therefore, the secure routing protocols (SRPs) in WSNs are responsible for finding and maintaining secure and reliable connection routes and are especially energy-efficient (because the wireless sensor node is limited in terms of the power supply). Therefore, energy-efficient routing, as well as secure communication and data transmission between wireless sensor nodes are fundamental challenges for providing security services in WSNs. Currently, many energy-efficient and SRPs in WSNs have been proposed. In this paper, we synthesize the classification and arrangement of energy-efficient and SRPs, as well as provide a method to calculate attack probability (AP) for secure routing in WSN.
09 Jan 2023
TL;DR: In this paper , two types of routing protocols, static and dynamic routing, are examined and compared in WSNs and open research challenges are defined based on the study, and the results show that dynamic routing is preferred in the current scenario due to robust, low cost and node position is dynamic.
Abstract: Wireless sensor network (WSN) is deployed in number of applications for real-time data collection. Sensors that are smaller, cheaper, and more sophisticated have made this possible in recent years. These sensors are outfitted with wireless interfaces through which they can connect with one another to build a network. In the WSN, routing plays an important role to determine the optimal path to successfully deliver the data from source to destination node. In the literature, two types of routing available such as static and dynamic. Out of these, dynamic routing is preferred in the current scenario due to robust, low cost, and node position is dynamic. Further, dynamic nodes are classified into three protocols such as proactive, reactive, and hybrid protocols. Therefore, in this paper, initially, these routing protocols are examined. After that, we have studied and analysed the various research papers are published in these routing protocols. Finally, open research challenges are defined based on the study.
20 Apr 2023
TL;DR: In this article , the adaptive graphical routing (AGR) for wireless sensor networks has been proposed to solve the collision problem by prevention of looping and identifying the better path for routing.
Abstract: Abstract Increasing the scalability and location identification are the prime issues in Wireless Sensor Networks. The Geographical routing is used for getting solution to this kind of issues, but the main disadvantage of Geographical routing is its rely on greedy method and void node problem is the main issue of providing quality of routing. This paper demonstrates the Adaptive Graphical Routing methodology (AGR) for wireless sensor networks. In AGR, the adjacent hop is elected from nodes accessible dynamically with density of the network in some specific angle. The selection of forwarding node within the nodes in a solid angle is computed using the delay aware contention methodology. The proposed AGR methodology will solve the collision problem by prevention of looping and identifying the better path for routing. Moreover, the proposed methodology will utilize the outside of the solid angle using RTS and CTS concepts in dynamic routing. Reducing the traffic overhead by dynamic routing methodology will increase the quality of routing in wireless sensor networks. The performance of the proposed method is compared with the related methods using NS2 simulator. The simulation results specify that AGS achieves an improved packet delivery ratio by increasing the residual energy and reducing the traffic overhead.
23 Feb 2023
TL;DR: In this article , the authors proposed a transverse wave zone-based secure location aided routing technique called TWRect with Dynamic Adaptive Secure Routing that makes forwarding decisions based on the node location information and wave zone selection.
Abstract: A Mobile Ad-Hoc Sensor Network (MASNET) is made up of several wireless mobile nodes that lack some predetermined architecture. It is independent of any centralized access point or management. Due to these traits, it suffers from significant network overhead and energy-related problems. Several routing methods have been created and developed for reducing routing overhead also increase MASNET's packet delivery ratio. Particularly, the use and expansion of location-aided routing techniques in these networks have been phenomenal. Hence, in this research proposed a novel transverse wave zone-based secure location aided routing technique called TWRect with Dynamic Adaptive Secure Routing that makes forwarding decisions based on the node location information and wave zone selection. This will significantly lower the number of flooding control packets and shrink the search zone. At the end, it will reduce network routing overhead while enhancing security. The zone selection and route discovery processes are repeated with node mobility analysis. The flooding approach, however, has a number of downsides, including data duplication, congestion when security is violated, etc. The availability of the network's energy resources is another significant drawback. The novel ways to address security and path dependability are constrained by a lack of battery and energy-based resources. Therefore, an energy efficient routing method is required for the distribution of information in MASNET. The proposed framework is used for optimizing the energy consumption. The simulation results demonstrate how the TWRDASR zone impacts data transmission and energy reduction efficiency.
TL;DR: In this paper , the authors propose a method that assigns virtual coordinates to network nodes, which can be used as input for geographic routing protocols, which exhibits convergence advantages over conventional approaches and outperforms them in terms of the total number of discovered paths.
Abstract: Wireless ad hoc networks are the solution for providing network connectivity in challenging environments with a lack or absence of infrastructure. Data transmission in such networks typically adopts geographic routing protocols, which use geographic coordinates as addresses of network devices. However, geographic coordinates are not always obtainable, as traditional localization systems (GNSS, Wi-Fi, terrestrial infrastructure) might not be available due to signal loss. In this paper, we propose a method that assigns virtual coordinates to network nodes, which can be used as input for geographic routing protocols. The numerical results demonstrate the high topological similarity between the physical and the virtual network. Our method exhibits convergence advantages over conventional approaches and outperforms them in terms of the total number of discovered paths.
01 Mar 2023
TL;DR: In this article , a routing algorithm based on area segmentation for LEO mega-constellations is proposed according to the topological characteristics of the network, which can achieve higher throughput, decrease the packet loss rate by 22% and reduce the signalling overhead significantly.
Abstract: Low earth orbit (LEO) mega-constellations in future 6G have attracted the attention from both academia and industry. However, due to the high dynamic characteristic of the LEO satellite network topology and the limited on-board resources, existing approaches relying on high on-board processing capabilities and monitoring the global network state, result in intolerable packet loss rate and excessive signalling overhead. In this paper, a routing algorithm based on area segmentation for LEO mega-constellations is proposed according to the topological characteristics of the network. Specifically, we divide the LEO mega-constellations into multiple areas with four quadrant parts. In addition, the transmission cluster is defined consisted of two adjacent parts based on transmission direction. With the relative geographical location and transmission clusters, we joint intra-area and inter-area routing to realize multi-path routing and forwarding by periodically updating the link state, instead of globally calculating. Simulation results demonstrate that the proposed algorithm can achieve higher throughput, decrease the packet loss rate by 22% and reduce the signalling overhead significantly.
TL;DR: In this paper , the authors introduce several classical routing algorithms from the following categories: location, sector, reinforcement learning, and intelligent optimization algorithms, and summarize and prospect the research direction of underwater wireless sensor network routing algorithms.
Abstract: With the rise of the upsurge of exploiting marine resources and the rapid development of the research of terrestrial wireless sensor networks, the research of underwater wireless sensor networks (UWSNs,) has become a new research hotspot. In UWSNs, routing protocol plays a very important role as one of the important components. This paper introduces several classical routing algorithms from the following categories: location, sector, reinforcement learning, and intelligent optimization algorithms. Finally, the paper also summarizes and prospects the research direction of underwater wireless sensor network routing algorithms.
TL;DR: In this article , a greedy perimeter comprehensive evaluation routing (GCER) algorithm is designed on the basis of geographic routing greedy perimeter stateless routing (GPSR), by estimating the energy, link stability, and data throughput of the UAV neighboring nodes, the optimal next-hop UAV node is synthetically evaluated using the analytic hierarchy process (AHP).
Abstract: Unmanned aerial vehicle (UAV) ad hoc networks can be deployed flexibly and rapidly without any infrastructure, so as to play an irreplaceable role in postdisaster relief. However, the dynamic topology and energy constraints of UAVs always bring new challenges to the design of effective network architectures and routing strategies. In this article, a three-layer UAV network architecture is constructed, and the UAV channel models for the different layers are discussed categorically. A greedy perimeter comprehensive evaluation routing (GCER) algorithm is designed on the basis of geographic routing greedy perimeter stateless routing (GPSR). By estimating the energy, link stability, and data throughput of the UAV neighboring nodes, the optimal next-hop UAV node is synthetically evaluated using the analytic hierarchy process (AHP). In particular, the use of nonorthogonal multiple access (NOMA) technology in ad hoc networks is considered, and a nonconvex optimization problem for maximizing the throughput estimation of UAV relay nodes based on NOMA is proposed to solve for the optimal allocation of UAV transmission power in routing. Numerical results show that the proposed GCER routing algorithm has significant advantages over GPSR in improving link stability. The use of NOMA access technology in UAV ad hoc networks has a significant increase in the throughput of the data links.
TL;DR: In this article , the authors propose a routing mechanism for LoRa networks that helps route messages considering the messages' QoS requirements. But despite the recent rise in research and development centered around LoRa network, not much research addresses the routing mechanisms in LoRa Networks.
Abstract: LoRa technology endows unprecedented ability to connect isolated geographical landscapes and build community networks that serve specific purposes. As the network grows, coherent routing of messages becomes imperative to meet the network’s objectives and Quality of Service (QoS) requirements. However, despite the recent rise in research and development centered around LoRa networks, not much research addresses the routing mechanisms in LoRa networks. Moreover, the LoRa routing mechanisms must run on low-power and resource-constrained devices, as these networks primarily target far-off locations or volatile environments such as volcanoes. Hence, this work proposes routing mechanisms (LoRaute) for LoRa networks that help route messages considering the messages’ QoS requirements. Also, a multi-purpose network hardware is proposed, which serves as a LoRa network base station or a WiFi to LoRa bridge for TCP/IP communication. Additionally, this work furnishes and assesses the implementation of the LoRa network and the routing mechanisms in a real environment. The implementation results indicate a seamless and rapid setup of multi-hop LoRa networks. Moreover, the implementation achieves a routing table record size of 9B, 24.45ms routing latency, and 171mA peak current consumption by the proposed LoRa node. Finally, the proposed system serves as a backhaul network for essential long-range communications, as demonstrated by the experimental setup.
TL;DR: In this article , a routing method with memory information has been proposed to alleviate the congestion of large volumes of packet flow in communication networks with scale-free properties, but the method exhibits poor performance for networks with local triangular connections and long distances between nodes.
Abstract: Finding the shortest paths for packets from sources to destinations in packet-switched communication networks is an inevitable problem in building a future high-speed information society. A routing method with memory information has already been proposed to alleviate the congestion of large volumes of packet flow. This routing method shows a high transmission completion rate even for large volumes of packet flows in communication networks with scale-free properties. However, the method exhibits poor performance for networks with local triangular connections and long distances between nodes. To overcome these problems, in this study, we first enhanced the routing performance of the conventional communication network models by using the betweenness centrality of nodes, which is one of the network centralities that measures the number of shortest paths that pass through each node in the networks. Subsequently, we adaptively changed the transmitting paths of packets by using only local information. Numerical simulations indicated that our routing method performs successfully for various topologies of communication networks by avoiding the congested node, and effectively using the memory information.
01 Jan 2023
TL;DR: In this paper , the authors proposed an efficient packet flow path allocation (EPF) algorithm to establish the optimized route between source and destination, which analyzes the packet forwarding behavior of each node and packet size for each node transmission.
Abstract: In the mobile ad hoc network, the mobile nodes activities are different; if the node activity is good, then it performs normal routing process, otherwise it performs abnormal routing. Such abnormal routing node is called as omission node. This node does not transmit and receive data packet at the given specific time slot. Data packets are not reached to destination; it decreases the packet delivery ratio, increases the energy consumption, and decreases the network overall performance. Detection of such nodes is difficult. So the proposed technique, efficient packet flow path allocation (EPF), is used to establish the optimized route between source and destination. EPF analyzes the packet forwarding behavior of each node and packet size of each node transmission. The node proclivity tracing algorithm is used to measure the every node’s characteristics in the particular routing path and capture the omission attacker node in the path. This improves the detection efficiency and minimizes the overall energy consumption of the network.
TL;DR: In this paper , a Taylor based Gravitational Search Algorithm (TBGSA) is proposed to solve the energy problem in WSN, which combines the Taylor series with a Gravitational search algorithm to discover the best hops for multi-hop routing.
Abstract: A group of small sensors can participate in the wireless network infrastructure and make appropriate transmission and communication sensor networks. There are numerous uses for drones, including military, medical, agricultural, and atmospheric monitoring. The power sources available to nodes in WSNs are restricted. Furthermore, because of this, a diverse method of energy availability is required, primarily for communication over a vast distance, for which Multi-Hop (MH) systems are used. Obtaining the optimum routing path between nodes is still a significant problem, even when multi-hop systems reduce the cost of energy needed by every node along the way. As a result, the number of transmissions must be kept to a minimum to provide effective routing and extend the system's lifetime. To solve the energy problem in WSN, Taylor based Gravitational Search Algorithm (TBGSA) is proposed, which combines the Taylor series with a Gravitational search algorithm to discover the best hops for multi-hop routing. Initially, the sensor nodes are categorised as groups or clusters and the maximum capable node can access the cluster head the next action is switching between multiple nodes via a multi-hop manner. Initially, the best (CH) Cluster Head is chosen using the Artificial Bee Colony (ABC) algorithm, and then the data is transmitted utilizing multi-hop routing. The comparison result shows out the extension of networks longevity of the proposed method with the existing EBMRS, MOGA, and DMEERP methods. The network lifetime of the proposed method increased by 13.2%, 21.9% and 29.2% better than DMEERP, MOGA, and EBMRS respectively.
29 Apr 2023
TL;DR: In this paper , a novel approach for geographic routing is proposed, which uses the extrapolative locations of automobiles to find the exact location of stirring vehicles is very difficult and may incur in the existing routing networks.
Abstract: Previously, vehicular ad hoc networks (VANETs) were designed by using several geographic routing schemes. That doesn’t sustain any routing configurations in the existing geographic routing methods. Vehicular Ad hoc Network is networks which consist of mobile nodes, consequently it is very harsh to make and remain up end-to-end links. The main aim of this research work is widespread inter vehicle distance, high speed of vehicles also supports the density of vehicle is altered. The exact real time location information of vehicles is accessed with high reliability via vehicle to vehicle inter connection. Due to frequent link entrapped and rapid topology changes it is not easy to augment well-organized routing etiquettes for VANETs. To find the exact location of stirring vehicles is very difficult and may incur in the existing routing networks. Additionally, the position information about stirring vehicle accessible to other vehicles is usually time-lagged as it is always stirring over time. Luckily, we scrutinize that the interim upcoming locations of vehicles can be forecast. Anchored in the significant surveillance, we propose a novel approach for geographic routing. It uses the extrapolative locations of automobiles. The etiquettes anchored in the vehicles' positions also called as geographic routing protocols (GR) were uncovered to be the most adequate to the VANETs because of their sturdiness in making with the dynamic environment changes and the high- ceilinged mobility of the automobiles. The etiquette is incorporated with a multi-hop information delivery virtualization deal that works on the crest of the transportation stratum and gives soaring speed for multi-hop one after the other information broadcasts. We demeanor practical computer imitations to display the recital advantage of the etiquette over additional approaches at the indistinguishable time vigor efficiency will be enhanced.
01 Jan 2023
TL;DR: In this paper , the authors proposed a geographical routing scheme that utilizes a delay-tolerant routing protocol for on FANETs, where the source node chooses the forwarder node based on the time that neighbor nodes take to reach the destination and the zone to which that node belongs.
Abstract: Existing routing protocols are suitable for the well-connected network but are not suitable for the sparse network. This article presents a geographical routing scheme that utilizes a delay-tolerant routing protocol for on FANETs. The proposed ferry mobility-aware direction and time-based greedy DTN combines position routing strategy with DTN to reduce routing errors. Ferry unmanned aerial vehicles (UAVs) broadcast the beacons to make the other nodes aware of their next anchor location. The node that receives the beacon, calculates its nearest destination among the base station and ferry node. The source node chooses the forwarder node based on the time that neighbor nodes take to reach the destination and the zone to which that node belongs. Each node in the network uses the store-carry-and-forward technique. This paper proposes a new communication protocol with two-fold solutions, wherein low latency is the intrinsic aim. This trend highlights the impact of delivering data with lower routing overhead and lower latency in communication protocols. The proposed model proves its efficiency through the simulation scenarios, in the form of increased packet delivery, reduced end-to-end delay, and reduced overhead.
TL;DR: In this article , the authors compare several local routing protocols within networks with wireless sensors and define protocols on either the grounds of scalability, energy consciousness, data aggregation, QoS, and versatility.
Abstract: Nowadays, location-based wireless sensor network (WSN) routings are attracting a lot of attention throughout the research field, especially due to their scalability. Sensor networks offer a comprehensive and integrated taxonomy of location-based routing protocols. The whole paper is aimed at contrasting several local routing protocols within networks with wireless sensors. Though localized routing protocols seem to be constrained, multi-hop data transfer may be facilitated. In order to relay position information, location-based routing protocols also require a lot of resources. We define protocols on either the grounds of scalability, energy consciousness, data aggregation, QoS, and versatility.
24 Feb 2023
TL;DR: A comparative analysis of OR protocols for Underwater Wireless Sensor Networks (UWSNs) is presented in this article , where the parameters such as complexity, packet delivery ratio, etc. are expressed through a comparative analysis.
Abstract: Due to their usefulness in many fields, Underwater Wireless Sensor Networks (UWSN) have gained more focus in the present. It relies on data collected and sent through a network of sensor nodes distributed around the ocean at varying depths. There has been a lot of interest from researchers in Opportunistic Routing (OR) because of its potential to improve the efficiency of wireless networks. For sensor networks to effectively communicate, a dynamic routing strategy is required. UWSNs have their own set of challenges, like dynamic topology, energy consumption, and delay. For these reasons, efficient routing protocols are being developed specifically for use in UWSNs. It is difficult to build OR procedures for UWSNs because of the unique properties of underwater communication. In this paper, the parameters such as complexity, packet delivery ratio, etc. that are involved in the analysis of OR protocols are expressed through a comparative analysis. Also being highlighted are several issues that are still open with the OR methods.
14 Feb 2023
TL;DR: In this paper , the authors presented modified methods to address some issues of GPSR (greedy perimeter stateless routing): dynamically adjusting the time interval of sending beacons according to the radio transmission; not only considering the distance between each neighbor and the destination, but also the neighbor node surviving ratio.
Abstract: As the population application of GPS, some greedy forwarding algorithms based on geographic information for MANETs (mobile ad hoc networks) are proposed in recent years. These algorithms have been well-designed from different aspects to improve its performance. On the basis of analysis of these algorithms, this paper presents modified methods to address some issues of GPSR (greedy perimeter stateless routing): dynamically adjusting the time interval of sending beacons according to the radio transmission; not only considering the distance between each neighbor and the destination, but also the neighbor node surviving ratio. Some relevant algorithms are described in the paper as well. The simulation results show the improved routing algorithm excels GPSR markedly in terms of delivery ratio and routing overhead while the transmission range is larger or the motion velocity of nodes is greater.
TL;DR: In this paper , an improved probabilistic routing algorithm (M-Prophet) based on moving direction prediction is proposed, which is based on the node transmission probability update stage of the traditional Prophet algorithm and improves by updating the encounter probability according to the moving direction between nodes.
Abstract: In a delay-tolerant network (DTN), nodes use a store-and-forward mechanism to forward messages from a source node to an encounter node until the message reaches the destination node. The traditional probabilistic routing protocol using history of encounters and transitivity (Prophet) is one of the important routes in DTN, to decide whether the node carrying the message should pass the message to the encountering node. The scene of this paper focuses on some DTNs with a large moving area. Most of the default communication devices are mobile, and the moving direction is random. If the encountering node is close to the destination node, the next encounter is still close. When trending, we will record the movement direction between nodes and use the prediction of the movement direction to make more reasonable decisions on the routing algorithm. Therefore, an improved probabilistic routing algorithm (M-Prophet) based on moving direction prediction is proposed, which is based on the node transmission probability update stage of the traditional Prophet algorithm and improves by updating the encounter probability according to the moving direction between nodes. M-Prophet first records the delay of the encounter between nodes and defines the moving direction according to the comparison between the last delay and the delay of this encounter, so as to design a new node delivery probability formula. The final simulation results show that the M-Prophet algorithm proposed in this paper can improve the performance of the message delivery success rate by up to 11% compared with the traditional Prophet algorithm and reduce the average delay by about 10 s.
02 Mar 2023
TL;DR: In this paper , an Energy Efficient Colliding Body Body Body Optimization based Routing Protocol (EECBO-RP) is proposed for WSNs, where the end goal of the algorithm lies in the optimal election of routes to a destination.
Abstract: Wireless sensor network (WSN) contains millions of small, low-power gadgets with a lack of resources are memory and battery power. Such gadgets were deployed in a dispersed manner and were often utilized to monitor and sense applications. Owing to constraints and limited resources of WSNs, routing can be a great difficulty. Routing in WSN was the process of choosing the optimal path for data to travel from a source node to a destination node. The goal of routing in WSN offer dependable and effective transmission while minimizing network overhead and energy consumption. This study designs an Energy Efficient Colliding Bodies Optimization based Routing Protocol (EECBO-RP) for WSN. The end goal of the EECBO-RP algorithm lies in the optimal election of routes to a destination. For achieving reasonable results for the minimization of energy exploitation, the EECBO-RP system derives the fitness function using the following variables: residual energy, distance to BS, and node degree. The EECBO-RP technique chooses the relay nodes so that a way that the overall efficiency of the WSN gets maximized. The simulation values of the EECBO-RP system are tested under several dimensions and the outcomes pointed out the betterment of the EECBO-RP technique.
TL;DR: In this article , a k-step double Q-learning routing (K-DQLR) algorithm is proposed, which integrates the multi-step and double Q learning algorithms to make an unbiased, accurate and efficient routing decision in DTNs.
Abstract: Delay tolerant networks (DTNs) refer to a kind of novel wireless mobile network, where there is no constant end-to-end connection between network nodes due to frequent movement, sparse distribution and limited communication range of nodes. Instead of the traditional store-forward routing strategy, in DTNs, the new store-carry-forward routing strategy is adopted for data transmission. Therefore, how to select the best next-hop node among network nodes is the main challenge of the routing in DTNs. To this end, here, a k-step double Q-learning routing (K-DQLR) algorithm is proposed, which integrates the multi-step and double Q-learning algorithms to make an unbiased, accurate and efficient routing decision in DTNs. Besides, a new dynamic reward mechanism is proposed, which combines the number of routing hops and the node centrality to adopt the dynamic network environment of DTNs. The simulation results show that K-DQLR can significantly increase the delivery ratio while reducing the delivery delay and overhead compared with the related state-of-the-art routing protocols of DTNs.
03 Mar 2023
TL;DR: In this paper , an intelligent and adaptive multipath routing scheme (IAMRS) is proposed to improve the overall routing performance by considering node lifetime and signal power to estimate reward factor during route establishment process.
Abstract: Nodes in Mobile Ad Hoc Network (MANET) forward information from one hop to another through wireless links. These mobile nodes are dependent on battery power and recharging of node batteries is usually not feasible in critical environment. Moreover, due to continuous node movements, link breakage is also one of the major concerns. Considering these factors, an intelligent and adaptive multipath routing scheme (IAMRS) has been proposed in this paper to improve the overall routing performance. The proposed algorithm considers node lifetime and signal power to estimate reward factor during route establishment process. Also, every node maintains local neighborhood information on the basis of distance. The work has been implemented on network simulator and outcomes reveal that the IAMRS outperforms existing multipath routing scheme.
20 Feb 2023
TL;DR: In this paper , the authors proposed a time-topology routing method that defines a series of variable-length time frames, its associated temporal topology, and corresponding routing information to provide stable communication in time-varying 3D networks with node mobility and environment changes.
Abstract: Future network infrastructure in beyond 5G/6G era requires new network architecture to increase network coverage in an efficient way rather than extending conventional terrestrial networks. Networks in three-dimensional (3D) space including non-terrestrial networks (NTN) are a promising architecture in beyond 5G/6G, where satellites and flying vehicles behave as network nodes such as routers and base stations to complement terrestrial networks. Hence, in future network infrastructure, not only user equipment (UE) but also routers and base stations move in 3D space, which makes neighbor nodes of each node change at every moment. Additionally, communication quality between each pair of nodes may fluctuate due to environment changes such as weather. Therefore, new routing paradigm, instead of using message exchanges, is necessary to provide stable communication in time-varying 3D networks with node mobility and communication environment change. This paper proposes a time-topology routing method that defines a series of variable-length time frames, its associated temporal topology, and corresponding routing information to provide stable communication in time-varying 3D networks with node mobility and environment changes. Evaluation results show that the proposed method outperforms the existing routing methods based on message exchanges in terms of packet delivery rate with comparable latency, where the proposed method provides stable communication in 3D networks even under severe weather condition.
01 Jan 2023
TL;DR: In this article , the authors proposed a routing protocol combining link stability, node density and distance scale, which improves the geographical forwarding of data packets located at the intersection in VANETs.
Abstract: VANET has a good application prospect in the current vehicle communication. As one of MANET, it has the characteristics of dynamic network topology and indirect connection, which makes the wireless connection between nodes unstable. Aiming at this problem, we propose a routing protocol combining link stability, node density and distance scale. When data packets are transmitted to the intersection, the optimal adjacent intersection is selected to determine the forwarding path, which improves the geographical forwarding of data packets located at the intersection. Through simulation, we find that the proposed geographic routing protocol based on node scoring and intersection evaluation (GRNSIE) has good routing performance in PDR and latency when compared with GPSR, GyTAR and GROOV.
29 Apr 2023
TL;DR: Geographic routing is a routing method used in communication networks that is effective, dependable, and resilient as mentioned in this paper , it is based on the actual locations of the network nodes and can keep a safe and stable connection even when there are barriers or other nodes in the way.
Abstract: Geographic routing is a routing method used in communication networks that is effective, dependable, and resilient. It is based on the actual locations of the network nodes. The source and destination nodes' geographic coordinates are used to determine the route, taking into consideration any obstacles or other nodes along the path. Geographic routing is especially useful in sensor networks where the nodes have limited capabilities. Geographic routing works by using the geographic coordinates of the nodes to select the shortest and most reliable path. The route is then determined by taking into account any obstacles or other nodes along the path. This ensures that the route is reliable and secure. The main advantages of geographic routing are its scalability, robustness, and reliability. The geographic routing is reliable. It is able to maintain a reliable and secure connection even in the presence of environmental changes. This is because the route is determined based on the geographic coordinates of the nodes, which are not affected by the environment. The geographic routing is an efficient, reliable and robust routing technique used in communication networks. It is based on the actual locations of the network nodes and can keep a safe and stable connection even when there are barriers or other nodes in the way. Additionally, it is very trustworthy, robust, and scalable.