Localized Sensor Self-deployment with Coverage Guarantee in Complex Environment
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Relative bearing estimation from commodity radios
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Swarm dispersion via potential fields, leader election, and counting hops
SIMPAR'10 Proceedings of the Second international conference on Simulation, modeling, and programming for autonomous robots
Undirected connectivity of sparse Yao graphs
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Hi-index | 0.00 |
Neighbor-Every-Theta (NET) graphs are such that each node has at least one neighbor in every theta angle sector of its communication range. We show that for θ