Xl Guo

Mr. Xl Guo


Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 January 2011 in Sensors
Verified
Journal Article
Open access
PDF file
Renjian FengRenjian Feng
Renjian Feng
XXXiaofeng Xu
Xiaofeng Xu
XZXiang Zhou
Xiang Zhou
XGXl Guo
Xl Guo
For wireless sensor networks (WSNs), many factors, such as mutual interference of wireless links, battlefield applications and nodes exposed to the environment without good physical protection, result in the sensor nodes being more vulnerable to be attacked and compromised. In order to address this network security problem, a novel trust evaluation algorithm defined as NBBTE (Node Behavioral Strategies Banding Belief Theory of the Trust Evaluation Algorithm) is proposed, which integrates the approach of nodes behavioral strategies and modified evidence theory. According to the behaviors of sensor nodes, a variety of trust factors and coefficients related to the network application are established to obtain direct and indirect trust values through calculating weighted average of trust factors. Meanwhile, the fuzzy set method is applied to form the basic input vector of evidence. On this basis, the evidence difference is calculated between the indirect and direct trust values, which link the revised D-S evidence combination rule to finally synthesize integrated trust value of nodes. The simulation results show that NBBTE can effectively identify malicious nodes and reflects the characteristic of trust value that ‘hard to acquire and easy to lose’. Furthermore, it is obvious that the proposed scheme has an outstanding advantage in terms of illustrating the real contribution of different nodes to trust evaluation.

20 October 2009 in Sensors
Verified
Journal Article
Open access
PDF file
XGXl Guo
Xl Guo
XXXiaofeng Xu
Xiaofeng Xu
Renjian FengRenjian Feng
Renjian Feng
YWYinfeng Wu
Yinfeng Wu
In wireless sensor networks (WSNs), there are numerous factors that may cause network congestion problems, such as the many-to-one communication modes, mutual interference of wireless links, dynamic changes of network topology and the memory-restrained characteristics of nodes. All these factors result in a network being more vulnerable to congestion. In this paper, a cross-layer active predictive congestion control scheme (CL-APCC) for improving the performance of networks is proposed. Queuing theory is applied in the CL-APCC to analyze data flows of a single-node according to its memory status, combined with the analysis of the average occupied memory size of local networks. It also analyzes the current data change trends of local networks to forecast and actively adjust the sending rate of the node in the next period. In order to ensure the fairness and timeliness of the network, the IEEE 802.11 protocol is revised based on waiting time, the number of the node‟s neighbors and the original priority of data packets, which dynamically adjusts the sending priority of the node. The performance of CL-APCC, which is evaluated by extensive simulation experiments. is more efficient in solving the congestion in WSNs. Furthermore, it is clear that the proposed scheme has an outstanding advantage in terms of improving the fairness and lifetime of networks.

31 March 2011 in Sensors
Verified
Journal Article
Open access
PDF file
JWJiangwen Wan
Jiangwen Wan
XGXiaolei Guo
Xiaolei Guo
XGXl Guo
Xl Guo
YWYinfeng Wu
Yinfeng Wu
Renjian FengRenjian Feng
Renjian Feng
For large-scale wireless sensor networks (WSNs) with a minority of anchor nodes, multi-hop localization is a popular scheme for determining the geographical positions of the normal nodes. However, in practice existing multi-hop localization methods suffer from various kinds of problems, such as poor adaptability to irregular topology, high computational complexity, low positioning accuracy, etc. To address these issues in this paper, we propose a novel Multi-hop Localization algorithm based on Grid‑Scanning (MLGS). First, the factors that influence the multi-hop distance estimation are studied and a more realistic multi-hop localization model is constructed. Then, the feasible regions of the normal nodes are determined according to the intersection of bounding square rings. Finally, a verifiably good approximation scheme based on grid-scanning is developed to estimate the coordinates of the normal nodes. Additionally, the positioning accuracy of the normal nodes can be improved through neighbors’ collaboration. Extensive simulations are performed in isotropic and anisotropic networks. The comparisons with some typical algorithms of node localization confirm the effectiveness and efficiency of our algorithm.

1 August 2007
Verified
Conference Paper
Closed access
XGXl Guo
Xl Guo
JWJiangwen Wan
Jiangwen Wan
Localization is one of the supporting technologies in wireless sensor networks. In this paper, a novel ODL (On Demand Localization) algorithm is formally described, designed, implemented and evaluated. It is put forward so as to the characters that a few new comers or moved nodes, instead of whole network, need to be located or relocated in WSNs. It only computes coordinates of nodes on demand and avoids being concerned with all nodes in networks. In this way, the energy consumption is reduced greatly and localization speed is improved. The performance of ODL algorithm is evaluated in different topology and connectivity. Simulation results show location accuracy of ODL in two methods and required bounds of neighbors for localization. The algorithm is also adaptive to irregular distribution of sensor nodes.