Rule-based fine-grained IP geolocation methods are hard to generalize in computer networks which do not follow hypothetical rules. Recently, deep learning methods, like multi-layer perceptron (MLP), are tried to increase generalization capabilities. However, MLP is not so suitable for graph-structured data like networks. MLP treats IP addresses as isolated instances and ignores the connection information, which limits geolocation accuracy. In this work, we research how to increase the generalization capability with an emerging graph deep learning method – Graph Neural Network (GNN). First, IP geolocation is re-formulated as an attributed graph node regression problem. Then, we propose a GNN-based IP geolocation framework named GNN-Geo. GNN-Geo consists of a preprocessor, an encoder, messaging passing (MP) layers and a decoder. The preprocessor and encoder transform measurement data into the initial node embeddings. MP layers refine the initial node embeddings by modeling the connection information. The decoder maps the refined embeddings to nodes' locations and relieves the convergence problem by considering prior knowledge. The experiments in 8 real-world IPv4/IPv6 networks in North America, Europe and Asia show the proposed GNN-Geo clearly outperforms the state-of-art rule-based and learning-based baselines. This work verifies the great potential of GNN for fine-grained IP geolocation.
14 May 2024 in IEEE Transactions on Network and Service Management
IP scanning is crucial for network management and security. However, the brute-force scanning is infeasible in IPv6 networks due to the vast address space. Consequently, target generation algorithms (TGAs) have become necessary to address this issue. Nevertheless, existing algorithms often struggle with low hit rates due to coarse-grained pattern mining. To address this problem, we propose 6Subpattern, a target generation algorithm based on subpattern analysis for Internet-wide IPv6 scanning. 6Subpattern first clusters seeds into high-density regions according to the seed structure information. Subsequently, pattern mining and subpattern analysis are carried out in these regions. Different from previous works, 6Subpattern can obtain all fine-grained patterns while automatically avoiding the influence of outlier addresses and the quandary of setting heuristic thresholds through subpattern analysis. Moreover, pattern refining is conducted based on the distribution of nibbles in address regions to further narrow the scanning space. Finally, targets are effectively generated according to the density of the patterns. Experimental results on real-world networks demonstrate that the address patterns discovered by 6Subpattern provide a superior scanning space than existing algorithms. Further results of hit rates on nine candidate seed sets reveal that 6Subpattern can achieve a 53%-315% improvement over the static TGAs on all seed sets and achieve a 15%-25% improvement on all randomly sampled seed sets compared with dynamic TGAs in Internet-wide IPv6 scanning.
8 January 2025 in IEEE Transactions on Network Science and Engineering
IP geolocation accuracy heavily relies on the availability of numerous high-quality network landmarks. However, IPv6 geolocation faces challenges due to its vast address space and rotating prefixes. Existing landmark mining methods struggle to meet the stringent demands of IPv6 street-level geolocation. We introduce IPv6Landmarker, a novel approach that enhances IPv6 geolocation precision through landmark mining and targeted updates. By associating WAN IPv6 addresses with WiFi BSSIDs in wireless routers, we employ a multi-association coordinate filtering algorithm to select reliable IPv6 street-level landmarks. We also implement targeted updates based on IPv6 prefix rotation patterns. Using real-world data, we demonstrate significant improvements, including a range increase of 16.75% to 46.68% in candidate landmarks acquired globally and of 10.06% to 126.39% in landmarks acquired specifically within target cities. In particular, there is a range of 16.67% to 66.67% enhancement in the geolocation success of ground truth landmarks, coupled with a range of 6.09% to 40.34% reduction in geolocation error. Additionally, it shows a remarkable 82.36% improvement in landmark set stability.
Recently, some criminals have begun to use multimedia steganography to conduct covert communication, such as transmitting stolen trade secrets. After using steganalysis to find covert communication entities, obtaining their locations can effectively help criminal forensics. This paper proposes a novel localization method of wireless covert communication entity for post-steganalysis. The method is based on hybrid particle swarm optimization and gray wolf optimization to improve localization precision (ILP-PSOGWO). In this method, firstly, the relationship model between received signal strength (RSS) and distance is constructed for the indoor environment where the target node exists. Secondly, dichotomy is used to narrow the region where the target node is located. Then, the weighted distance strategy is used to select the reference point locations with strong and stable RSS. Finally, the intersection region of the reference points is taken as the region where the target node is located, and the hybrid PSOGWO is used to locate and optimize the target node location. Experimental results demonstrate that ILP-PSOGWO can maintain high stability, and 90% of the localization errors are lower than 0.9012 m. In addition, compared with the existing methods of PSO, GWO and extended weighted centroid localization (EWCL), the average localization error of ILP-PSOGWO is also reduced by 28.2–49.0%.