Location Information Of Nodes Research Articles

SD-GPSR: A Software-Defined Greedy Perimeter Stateless Routing Method Based on Geographic Location Information

To mitigate the control overhead of Software-Defined Mobile Ad Hoc Networks (SD-MANETs), this paper proposes a novel approach, termed Software-Defined Greedy Perimeter Stateless Routing (SD-GPSR), which integrates geographical location information. SD-GPSR optimizes routing functions by decentralizing them within the data plane of SD-MANET, utilizing the geographic location information of nodes to enhance routing efficiency. The controller is primarily responsible for providing location services and facilitating partial centralized decision-making. Within the data plane, nodes employ an enhanced distance and angle-based greedy forwarding algorithm, denoted as GPSR_DA, to efficiently forward data. Additionally, to address the issue of routing voids in the data plane, we employ the A* algorithm to compute an optimal routing path that circumvents such voids. Finally, we conducted a comparative analysis with several state-of-the-art approaches. The evaluation experiments demonstrate that SD-GPSR significantly reduces the control overhead of the network. Simultaneously, there is a notable improvement in both end-to-end latency and packet loss rate across the network.

A large-scale graph clustering method for cell conditions spatio-temporal localization in aluminum electrolysis

Sensor nodes (industrial nodes) clustering is an efficacious method for gaining local working conditions real-timely in the production process. The existing deep graph neural networks-based industrial nodes clustering studies construct static graphs to describe the potential spatial correlation among industrial nodes, but the temporal correlation among industrial nodes is ignored, resulting in inferior real-time performance. Meanwhile, these deep learning models fail to obtain good clustering results due to the large-scale and noise-containing characteristics of industrial nodes. In this paper, a large-scale graph clustering method (LsGCM) is proposed for cell conditions spatio-temporal localization in aluminum electrolysis to address the above issues. Specifically, a spatio-temporal graph construction method based on industrial process mechanism knowledge and local working condition boundary types statistical feature fusion is proposed for capturing effective spatio-temporal correlations between industrial nodes. Then, hysteresis knowledge of industrial production system is used to guide the nodes merging, thereby avoiding the incorrect merging of time-asynchronous nodes when performing the spatio-temporal region detection of local working conditions. Finally, combined with the actual spatio-temporal location information of industrial nodes, a novel spatio-temporal information expansion method (StIEM) of the sub-spatio-temporal graph describing local working condition is proposed for obtaining spatio-temporal feature information of the neighborhood, which is beneficial to improve the performance of industrial node clustering. Validation studies on a numerical simulation example and multiple real aluminum electrolysis industrial datasets certificate the effectiveness and superiority of the proposed method. In particular, compared with existing graph clustering methods, our method improves the clustering accuracy by 7.79%.

GTLP: A graph transformer based link prediction framework with unified feature pre-processing

In the realm of graph representation learning, Graph Neural Networks (GNNs) have demonstrated exceptional efficacy across diverse tasks. Typically, GNNs employ message-passing schemes to disseminate node features along graph structures, culminating in learned graph representations. However, their heavy reliance on smoothed node features over graph structures, coupled with limited expressiveness in the presence of node attributes, often constrains link prediction performance. To surmount this challenge, we propose GTLP, a Graph Transformer based link prediction framework. GTLP integrates unsupervised GNNs and structure encoding, enabling a holistic consideration of both topological structures and node features. This approach preserves critical node location and role information, enhancing the model’s expressiveness. By introducing the Graph Transformer model, GTLP adeptly incorporates neighbor information, refining embedding quality and bolstering the model’s learning and generalization capabilities. Notably, our method exhibits superior scalability, accommodating diverse techniques for information extraction, embedding learning, and sampling. Experimental results underscore GTLP’s state-of-the-art performance, outpacing various baselines across five real-world datasets.

Location privacy protection of nodes in the perception layer of the Internet of things based on Radio Frequency Identification location aware algorithm

AbstractTo ensure the security of node location privacy in the perception layer of the Internet of Things, this study proposes a location privacy protection method based on RFID location awareness algorithm. This method first introduces an adaptive multi tree anti‐collision algorithm based on collision trees when perceiving and locating the location information of nodes in the perception layer of the Internet of Things, to prevent signal collisions between multiple readers and writers. Then, based on the obtained node location results, a IoT perception layer node location privacy protection scheme based on virtual ring strategy is used to randomly initiate directed co hop routing using the virtual nodes generated after random walking, avoiding the visible area of the source node location, and transmitting data to the aggregation node in the form of the shortest routing path to protect the privacy and security of the node location. Finally, experiments are carried out to prove the progressiveness of the proposed method. The experimental results show that this method can prolong the security period of the source and aggregation nodes in the perception layer of the Internet of Things, protect the privacy and security of node positions, and has great application value.

A New Method of Fuzzy Multicriteria Routing in Vehicle Ad Hoc Network

The internet of vehicles (IoVs) provides delay-sensitive services, but high-latency communication with roadside units causes service failures and high costs. Mobile edge computing (EC) is migrating cloud computing platforms from the core network to the edge of mobile networks, giving vehicles local access to numerous computing resources. The classic greedy boundary stateless routing (GPSR) method is widely used to meet the communication requirements of vehicle self-organizing networks. In order to solve the problems of GPSR&#x2019;s neighbor node position acquisition lag and single routing criterion, a new routing method based on the fuzzy logic system Geographic Routing method based on Velocity, Angle, and Density (GRVAD) is proposed. This method gets the relative velocity between the nodes and the angle between the current node, the neighbor node and the target node, and the node density of the neighbor node as the input of fuzzy logic, and the unscented Kalman filter is used to predict the location of the neighbor node to obtain more accurate location information of neighbor nodes. Simulation results show that the routing method compensates for some of the shortcomings of the GPSR method and reasonably considers the delivery rate and end-to-end delay of data packets and is more in line with the communication requirements of the vehicle <i>ad hoc</i> network.

Identifying key spreaders in complex networks based on local clustering coefficient and structural hole information

Identifying key spreaders in a network is one of the fundamental problems in the field of complex network research, and accurately identifying influential propagators in a network holds significant practical implications. In recent years, numerous effective methods have been proposed and widely applied. However, many of these methods still have certain limitations. For instance, some methods rely solely on the global position information of nodes to assess their propagation influence, disregarding local node information. Additionally, certain methods do not consider clustering coefficients, which are essential attributes of nodes. Inspired by the quality formula, this paper introduces a method called Structural Neighborhood Centrality (SNC) that takes into account the neighborhood information of nodes. SNC measures the propagation power of nodes based on first and second-order neighborhood degrees, local clustering coefficients, structural hole constraints, and other information, resulting in higher accuracy. A series of pertinent experiments conducted on 12 real-world datasets demonstrate that, in terms of accuracy, SNC outperforms methods like CycleRatio and KSGC. Additionally, SNC demonstrates heightened monotonicity, enabling it to distinguish subtle differences between nodes. Furthermore, when it comes to identifying the most influential Top-k nodes, SNC also displays superior capabilities compared to the aforementioned methods. Finally, we conduct a detailed analysis of SNC and discuss its advantages and limitations.

Novel High-Precision and High-Robustness Localization Algorithm for Underwater-Environment-Monitoring Wireless Sensor Networks

In marine ecological environment monitoring, the acquisition of node location information is crucial, and the absence of location information can render the collected data meaningless. Compared to the rest of the distance-based localization methods, the received signal strength (RSS)-based localization technique has gained significant interest due to its low cost and the absence of time synchronization. However, the acoustic signal propagates in the complex and changeable aqueous medium, and, in addition to the time-varying path loss factor (PLF), there is often a certain absorption loss, which seriously deteriorates the localization accuracy of the RSS-based technique. To address the above challenges, we propose a novel high-precision and high-robustness localization (NHHL) algorithm that introduces an estimation parameter to conjointly estimate the marine node location and the ambient PLF. Firstly, the original non-convex localization problem is converted into an alternating nonnegative constrained least squares (ANCLS) framework with the unknown PLF and absorption loss, and a two-step localization method based on the primitive dual interior point method and block co-ordinate update method is presented to find the optimal solution. In the first step, the penalty function is utilized to reformulate the localization problem and find an approximate solution. Nevertheless, due to inherent errors, it is unable to approximate the constraint boundary and the global optimum solution. Subsequently, in the second step, the original localization problem is further transformed into a generalized trust region sub-problem (GTRS) framework, and the approximate solution of the interior point method is utilized as the initial estimation, and then iteratively solved by block co-ordinate update to obtain the precise location and PLF conjointly. Furthermore, the closed-form expression of the Cramér–Rao lower bound (CRLB) for the case of the unknown path loss factor and absorption loss is derived to evaluate the our NHHL algorithm. Finally, the simulation results demonstrate the superiority of the presented NHHL algorithm compared with the selected benchmark methods in various marine simulation scenarios.

An Ensemble Filter for Indoor Positioning Technology of Mobile Home Service with Agile iBeacon Deployment

In this article, we undertake a thorough investigation into the theory of indoor location, adopt an effective and quick positioning algorithm, and make use of a network of lowpower iBeacons. An iBeacon-based indoor positioning system (IPS) is presented to investigate how to utilize iBeacon for accurate location and whether it can successfully replace the current dominant positioning technology based on the analysis that was conducted. However, the first things that should be taken into account at this point in the design of house robots for indoor environments are how to quickly and precisely gather target node location information as well as how to regulate and plan a course. This article examined the more popular and often used indoor positioning techniques, provided a succinct summary of current indoor positioning technologies and regulators, and examined ultrasonic locating technology in depth. Based on this, a system for mobile home service robots was developed, and simulation tests were performed to assess the accuracy of node locating, node reception and arrival times, the best level of route planning, and navigation and path estimation errors in both absolute and comparative terms. Additionally, we go into detail about the difficulties in developing a practical IPS, the solutions that are already available, a thorough performance comparison, and some potential future IPS development trends.

A Survey of Localization Techniques for Underwater Wireless Sensor Networks

With the continuous development of marine resources, the position of Underwater Wireless Sensor Network (UWSN) is becoming more and more important, and UWSN needs to know the location of sensor nodes when completing tasks such as marine data collection, environmental monitoring, and aiding navigation, etc. Accurate sensor node location information is the key to effective acquisition of underwater data. The key to effective underwater data acquisition is accurate sensor node location information. Due to the influence of the environment, global positioning system (GPS) signals cannot be propagated underwater, so hydroacoustic communication becomes the best choice for node positioning. However, the unstable underwater environment brings a series of challenges to hydroacoustic communication, such as high channel bit error rate, low bandwidth, large propagation delay, and obvious multipath effect. According to the characteristics and challenges of hydroacoustic communication, this paper classifies the localization algorithms of underwater wireless sensor networks into (i) distance-based and distance-free localization algorithms, (ii) single-hop and multi-hop localization algorithms, and (iii) distributed and centralized localization algorithms.

A simple and efficient graph Transformer architecture for molecular properties prediction

Graph Transformer architecture started to catch fire in molecular properties prediction due to its ability to represent complex interactions between all nodes. However, the self-attention mechanism in Transformer encoder part transforms the graph data into a fully-connected graph for graph representation learning, causing the loss of the original structural information of the graph. In this work, Local Transformer is proposed to keep the original graph structure and aggregate local information of nodes. In the model, a simple graph convolution is designed to replace the self-attention module, which reaches the state-of-the-art performance on ZINC dataset. Further, in order to rectify the problem that graph neural networks(GNNs) cannot capture long-range interactions of atoms, a novel end-to-end framework combined the GNN with Local and Global Transformer is proposed, which achieves good results on QM9 dataset.

Edge-weights-based method to identify influential spreaders in complex networks

Identifying influential nodes has drawn great attention in recent years. In this paper, a novel method for identifying influential spreaders based on potential edge weights (WDK for simplicity) for both undirected and unweighted networks is proposed. Degree and k-shell of a node and its neighbors are considered simultaneously, which are regarded as the weight of the edge directly connected to the node. The algorithm considers not only the local information of nodes but also their location information. The proposed method not only improves the accuracy of node mining but also has approximately linear time complexity, which indicates that the proposed method is suitable for large-scale networks. In order to validate the effectiveness of the proposed method, different evaluation indexes are introduced in nine real networks. Compared with five classical key nodes identification methods, the experimental results show that the proposed method performs optimally in all networks.

A Reliable Low-Latency Multipath Routing Algorithm for Urban Rail Transit Ad Hoc Networks

With the advancement of urban rail transit towards intelligence, the demand for urban rail transit communication has increased significantly, but the traditional urban rail transit vehicle–ground communication system has been unable to meet the future vehicle–ground communication requirements. To improve the performance of vehicle–ground communication, the paper proposes a reliable low-latency multipath routing (RLLMR) algorithm for urban rail transit ad hoc networks. First, RLLMR combines the characteristics of urban rail transit ad hoc networks and uses node location information to configure a proactive multipath to reduce route discovery delay. Second, the number of transmission paths is adaptively adjusted according to the quality of service (QoS) requirements for vehicle–ground communication, and then the optimal path is selected based on the link cost function to improve transmission quality. Third, in order to enhance the reliability of communication, a routing maintenance scheme has been added, and the static node-based local repair scheme is used in routing maintenance to reduce the maintenance cost and time. The simulation results show that compared with traditional AODV and AOMDV protocols, the proposed RLLMR algorithm has good performance in improving latency and is slightly inferior to the AOMDV protocol in improving reliability. However, overall, the throughput of the RLLMR algorithm is better than that of the AOMDV.

Ranking nodes in complex networks based on TsRank

It is theoretically and practically meaningful to rank and identify nodes in complex networks in various fields, however, many existing methods consider single feature of graph. To utilize multiple attributes of graph, a novel ranking method based on Tsallis entropy is proposed in this paper, which considers information transfer efficiency as global information of nodes and takes extended mixed degree and core neighborhood centrality as local information of nodes. We utilize the monotonicity function index, cumulative distribution (CDF), Kendall’s tau coefficient, Jaccard similarity coefficient, and the total number of infected nodes based on susceptible–infected–recovered (SIR) model as evaluation metrics to measure the performance of the proposed method. The simulation results demonstrate that the proposed method has great superiority in terms of monotonicity, resolution, the accuracy of both the whole ranking results and top-c ranked nodes, and spreading ability of the top-10 nodes.

A Distance Vector Hop-Based Secure and Robust Localization Algorithm for Wireless Sensor Networks

Location information of sensor nodes in a wireless sensor network is important. The sensor nodes are usually required to ascertain their positions so that the data collected by these nodes can be labeled with this information. On the other hand, certain attacks on wireless sensor networks lead to the incorrect estimation of sensor node positions. In such situations, when the location information is not correct, the data may be labeled with wrong location information that may subvert the desired operation of the wireless sensor network. In this work, we formulate and propose a distance vector hop-based algorithm to provide secure and robust localization in the presence of malicious sensor nodes that result in incorrect position estimation and jeopardize the wireless sensor network operation. The algorithm uses cryptography to ensure secure and robust operation in the presence of adversaries in the sensor network. As a result of the countermeasures, the attacks are neutralized and the sensor nodes are able to estimate their positions as desired. Our secure localization algorithm provides a defense against various types of security attacks, such as selective forwarding, wormhole, Sybil, tampering, and traffic replay, compared with other algorithms which provide security against only one or two types. Simulation experiments are performed to evaluate the performance of the proposed method, and the results indicate that our secure localization algorithm achieves the design objectives successfully. Performance of the proposed method is also compared with the performance of basic distance vector hop algorithm and two secure algorithms based on distance vector hop localization. The results reveal that our proposed secure localization algorithm outperforms the compared algorithms in the presence of multiple attacks by malicious nodes.

A Distance Estimation Model for DV-Hop Localization in WSNs

The localization of sensor nodes in wireless sensor networks (WSNs) has been a thorny research problem. Existing DV-Hop based range-free localization algorithms estimate the distance from an unknown node to an anchor node by the multi-hop forwarding principle and the location information of anchor nodes. However, they lack an accurate distance estimation model of anchor nodes under different hops, resulting in inaccurate localization. To address this issue, this paper proposes a distance estimation model (DEM) for DV-Hop localization in WSNs. Specifically, DEM mathematically derives the farthest distance detected by an anchor node under different hops. Then, the average distance is calculated by the upper and lower boundaries according to the derived farthest distance. Finally, the average distance is embedded into a multi-objective optimization to solve the DV-Hop localization problem. The simulation results show that the proposed model is significantly superior to the state of the art in terms of sensor localization accuracy and cost effectiveness.

P2AE: Preserving Privacy, Accuracy, and Efficiency in Location-Dependent Mobile Crowdsensing

With the widespread prevalence of smart devices, mobile crowdsensing (MCS) becomes a new trend to encourage mobile nodes to participate in cooperative data collection in various Internet of Things (IoT) applications. In location-dependent MCS, location information of mobile nodes are collected and analyzed by service provider to assist in task allocation. If the service provider is not fully trusted, mobile node's privacy is leaked and accessed by unauthorized parties. How to preserve privacy while maintaining task allocation accuracy and efficiency becomes challenging. To this end, we propose a learning-based mechanism that involves two parts: 1) privacy-preserving task release and task allocation; 2) accurate and efficient task allocation. In the first part, we design a location-based symmetric key generator, which enables two parties to self-generate a symmetric key without depending on fully trusted authorities. By utilizing this key generator and Proxy Re-encryption, we propose a privacy preserving protocol to protect location information in task release and task allocation. In the second part, we design a reinforcement learning based task allocation algorithm to optimize the winners selection, which obtains high accuracy and efficiency. The performance analysis reveals that our proposed mechanism achieves accurate and efficient task allocation while preserving privacy in location-dependent MCS.

Improved Hybrid Routing Protocol (IHRP) in MANETs Based on Situation Based Adaptive Routing

Without the need of a fixed foundation or base station, the Mobile Ad hoc Network creates its own wireless network. One of the most troublesome aspects of Mobile Ad hoc Network (MANET) is the occurrence of unexpected loss of network connectivity. As a result of this problem, packets continue to drop, and we must restore the connection by sending Route Request (RREQ) and Route Reply (RREP). As a result, network performance will suffer yet another setback. We used the scenario routing technique to combine the Dream Multipath Routing (DMR), Ad hoc on-demand multipath distance vector (AOMDV), Optimized link-state routing (OLSR), and Ad-hoc on Demand Vector (AODV) routing protocols to build the IHRP routing protocol in this work. According to previous studies, (AODV) is more suited when node motion is high. The purpose of DREAM Multipath Routing (DMR) is to maintain node mobility and location information coordinated. Route packet flooding is prevented by computing the expected chance of node relocation. The number of mobile nodes in the wireless network fluctuates, and the DMR operates on each one individually. In the network, each node maintains a list of nearby nodes and their current locations. Using the AOMDV routing protocol is effective for load balancing and preventing congestion on the network. OLSR is a good fit for networks that priorities link reliability above other considerations when routing traffic. When using the aforementioned (DMR, AODV, AOMDV, and OLSR) protocols to create the IHRP routing protocol, we are capable of better regulation of network behavior and perform. In the case of 100 nodes, data is sent for analysis for The Improved Hybrid Routing Protocol (IHRP), Zone Routing Protocol (ZRP), AOMDV, AODV, and OLSR routing protocols. For data send, the performance of IHRP, ZRP, AOMDV, AODV, and OLSR is 11513, 10240, 10225, 10558, and 9184, respectively, and for 50 nodes, the performance of IHRP, ZRP, AOMDV, AODV, and OLSR is 11151, 9807, 9636, 9586, and 7470, respectively. Thus, with 100 and 50 nodes, the Improved Hybrid Routing Protocol (IHRP) outperforms the AOMDV, ZRP, AODV, and OLSR routing protocols. In the case of 100 nodes and 50 nodes, the data receive analysis for IHRP, ZRP, AOMDV, AODV, and OLSR routing protocols is 11513, 10240, 10225, 10558, and 9184, respectively, and 9367, 8714, 8370, 6730, and 7298, respectively, So IHRP also receives data faster than ZRP, AOMDV, AODV, and OLSR routing protocols. The IHRP outperforms AOMDV, AODV, ZRP, and OLSR routing protocols in terms of data transmit, receive, data drop, PDR, throughput, E-E latency, and NRL.

IEA-GNN: Anchor-aware graph neural network fused with information entropy for node classification and link prediction

Graph neural networks are essential in mining complex relationships in graphs. However, most methods ignore the global location information of nodes and the discrepancy between symmetrically located nodes, resulting in the inability to distinguish between nodes with homogeneous network neighborhoods. We propose an Anchor-aware Graph Neural Network fused with Information Entropy (IEA-GNN) to capture the global location information of nodes in the graph. IEA-GNN first calculates the information entropy of nodes and constructs candidate sets of anchors. We define the calculation method of the distance from any node to the anchor points and incorporate the relative distance information between nodes at initialization. The nonlinear distance-weighted aggregation learning strategy based on the anchor points of candidate sets is used to obtain the nodes' feature information, which can be captured more effectively by fusing the global location information to the node representation with the selected anchor points. Selecting anchor points based on information entropy avoid the aggregation of anchor points in the graph, highlighting the positional differences between nodes and making it easier to distinguish homogeneous neighborhood nodes. Experimental results of node classification and link prediction on five datasets show that IEA-GNN outperforms the baseline model.

Structural controllability of general edge dynamics in complex network

Dynamic processes that occur on the edge of complex networks are relevant to a variety of real-world systems, where states are defined on individual edges, and nodes are active components with information processing capabilities. In traditional studies of edge controllability, all adjacent edge states are assumed to be coupled. In this paper, we release this all-to-all coupling restriction and propose a general edge dynamics model. We give a theoretical framework to study the structural controllability of the general edge dynamics and find that the set of driver nodes for edge controllability is unique and determined by the local information of nodes. Applying our framework to a large number of model and real networks, we find that there exist lower and upper bounds of edge controllability, which are determined by the coupling density, where the coupling density is the proportion of adjacent edge states that are coupled. Then we investigate the proportion of effective coupling in edge controllability and find that homogeneous and relatively sparse networks have a higher proportion, and that the proportion is mainly determined by degree distribution. Finally, we analyze the role of edges in edge controllability and find that it is largely encoded by the coupling density and degree distribution, and are influenced by in- and out-degree correlation.

GAUSS-NEWTON MULTILATERATION LOCALIZATION ALGORITHM IN LARGE-SCALE WIRELESS SENSOR NETWORKS FOR IoT APPLICATIONS

The location information of sensor nodes plays an important role in critical applications like health monitoring, fire detection, and intruder detection. Installing global positioning system (GPS) modules with the sensor node hardware is not a cost-effective solution for knowing the location coordinates. This has lead to rigorous research in defining nascent localization techniques for wireless sensor networks. But, the existing localization techniques use more number of anchor nodes to compute the location coordinates of sensor nodes, and the network deployment becomes costly. This article presents a low complex, range-based localization algorithm called gauss-newton multilateration that uses received signal strength indicator (RSSI) values of the anchor nodes' signals received at the target nodes. The proposed algorithm uses only four static anchor nodes, which are deployed at the corners of the network terrain to locate the sensor nodes with localization accuracy of 90.21&amp;#37; and increased up to 98.59&amp;#37;. Based on the results obtained, the proposed algorithm provides higher localization accuracy, and it is well suited for locating sensor nodes with high accuracy in large scale wireless sensor networks.