A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
On the stability of network distance estimation
ACM SIGMETRICS Performance Evaluation Review
Properties of Embedding Methods for Similarity Searching in Metric Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Constructing internet coordinate system based on delay measurement
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Virtual landmarks for the internet
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
PIC: Practical Internet Coordinates for Distance Estimation
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Structural analysis of network traffic flows
Proceedings of the joint international conference on Measurement and modeling of computer systems
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Modeling distances in large-scale networks by matrix factorization
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Triangulation and Embedding Using Small Sets of Beacons
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
A Scalable Logical Coordinates Framework for Routing in Wireless Sensor Networks
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Proceedings of the 3rd international conference on Embedded networked sensor systems
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
A Hierarchical Approach to Internet Distance Prediction
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
ATPC: adaptive transmission power control for wireless sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
Beacon vector routing: scalable point-to-point routing in wireless sensornets
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Principal components analysis of 3-D scanned human heads
ACM SIGGRAPH 2007 posters
GRAP: Grey risk assessment based on projection in ad hoc networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Connectivity-based routing protocols provide an attractive option for point to point communication in wireless networks due to its potential for low routing overhead. However, when the entire hopcount vector is used to address each node, the communication and storage overhead in the packets are often so high that it is not feasible to implement existing connectivity-based routing protocols infeasible on resource-constrained sensor networks. In this paper, we apply the technique of dimension reduction, in particular Principle Component Analysis(PCA), to the hopcount vectors. Compared to the original hopcount vector, the embedding coordinates preserve the network geometry with much lower overhead, making their use much more practical on current sensor platform. Simulation results show that the coordinates computed by PCA can achieve higher packet delivery ratio, lower path stretch and shorter flooding range in local minimum cases. We have also implemented the PCA algorithm on MICAz motes and conducted experiments in a testbed containing 48 nodes deployed on two floors of an office building. With the use of 9 landmark nodes and only 3 dominant components, the PCA coordinates can achieve 95% of the delivery ratio obtained using full hopcount vector and maintain an low path stretch of 1.12.