Yurong Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yurong Xu has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Fillia Makedon
Dartmouth College (United States)
2 shared publications - James Ford
DEVLAB, Computer Science Department, Dartmouth College, Hanover, NH 03755; Institute for Security Technology Studies, Dartmouth College, Hanover, NH 03755; Computer Science and Engineering Department, University of Texas at Arlington, Arlington, TX 76019
2 shared publications - Eric Becker1 shared publication
- Fillia Makedon
The University of Texas at Arlington, USA
1 shared publication - James C. Ford
Department of Psychiatry, Geisel School of Medicine at Dartmouth, Lebanon, NH, USA
1 shared publication - Nikos Triandopoulos
DEVLAB, Computer Science Department, Dartmouth College, Hanover, NH 03755; Institute for Security Technology Studies, Dartmouth College, Hanover, NH 03755
1 shared publication
Latest Publications
- 16 October 2008
- Published by Springer Nature
- p. 11-23
A BP-Neural Network Improvement to Hop-Counting for Localization in Wireless Sensor Networks
- 16 October 2008
- Published by Springer Nature
- p. 11-23
A BP-Neural Network Improvement to Hop-Counting for Localization in Wireless Sensor Networks
- 1 July 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 145-148
Providing Anonymity in Wireless Sensor Networks
Sensor networks are often used to monitor sensitive information from the environment or track sensitive objects' movements. Anonymity has become an important problem in sensor networks, and has been widely researched in wireless ad hoc and wired networks. The limited capacity and resources of current sensor networks have brought new challenges to anonymity research. In this paper, two efficient methods are proposed based on using a one-way hash chain to dynamically change the identity of sensor nodes in order to provide anonymity, and their anonymity properties are analyzed and compared.
- 1 July 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 145-148
Providing Anonymity in Wireless Sensor Networks
Sensor networks are often used to monitor sensitive information from the environment or track sensitive objects' movements. Anonymity has become an important problem in sensor networks, and has been widely researched in wireless ad hoc and wired networks. The limited capacity and resources of current sensor networks have brought new challenges to anonymity research. In this paper, two efficient methods are proposed based on using a one-way hash chain to dynamically change the identity of sensor nodes in order to provide anonymity, and their anonymity properties are analyzed and compared.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of 15th International Conference on Computer Communications and Networks
- No. 10952055,p. 155-160
GDL: A Geographic Distributed Localization Algorithm for Wireless Sensor Networks
Localization is a fundamental problem in sensor networks. This paper proposes a new distributed localization algorithm called GDL ("Geographic Distributed Localization") that is based on hop-counting. Although the idea of predicting node position from connectivity information in WSNs is not new, our algorithm improves on other localization algorithms of this type in several key ways. Results from extensive simulation in NS-2 show a significant improvement in the accuracy with which locations can be determined in WSNs with varying density and different number of nodes on irregular placements. In particular, when compared with the MDS-MAP series of algorithms, our algorithm achieves about a 30-40% improvement in accuracy. It also has a lower communication cost (0(n) versus O(nlogn)) than MDS-MAP(P), and has a low constant memory cost per node.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of 15th International Conference on Computer Communications and Networks
- No. 10952055,p. 155-160
GDL: A Geographic Distributed Localization Algorithm for Wireless Sensor Networks
Localization is a fundamental problem in sensor networks. This paper proposes a new distributed localization algorithm called GDL ("Geographic Distributed Localization") that is based on hop-counting. Although the idea of predicting node position from connectivity information in WSNs is not new, our algorithm improves on other localization algorithms of this type in several key ways. Results from extensive simulation in NS-2 show a significant improvement in the accuracy with which locations can be determined in WSNs with varying density and different number of nodes on irregular placements. In particular, when compared with the MDS-MAP series of algorithms, our algorithm achieves about a 30-40% improvement in accuracy. It also has a lower communication cost (0(n) versus O(nlogn)) than MDS-MAP(P), and has a low constant memory cost per node.