Sparse Power Efficient Topology for Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Localized algorithms for energy efficient topology in wireless ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Approximating geometric bottleneck shortest paths
Computational Geometry: Theory and Applications
A cone-based distributed topology-control algorithm for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
A unified energy-efficient topology for unicast and broadcast
Proceedings of the 11th annual international conference on Mobile computing and networking
Proceedings of the 5th international conference on Information processing in sensor networks
Multibeam Antenna-Based Topology Control with Directional Power Intensity for Ad Hoc Networks
IEEE Transactions on Mobile Computing
Asymptotic critical total power for k-connectivity of wireless networks
IEEE/ACM Transactions on Networking (TON)
Using Local Geometry for Tunable Topology Control in Sensor Networks
IEEE Transactions on Mobile Computing
A survey on localization for mobile wireless sensor networks
MELT'09 Proceedings of the 2nd international conference on Mobile entity localization and tracking in GPS-less environments
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Relative location estimation in wireless sensor networks
IEEE Transactions on Signal Processing
| Hi-index | 0.00 |
Given a finite set S of points in the plane and a real value d 0, the d--radius disk graph Gd contains all edges connecting pairs of points in S that are within distance d of each other. For a given graph G with vertex set S, the Yao subgraph Yk[G] with integer parameter k 0 contains, for each point p ∈ S, a shortest edge pq ∈ G (if any) in each of the k sectors defined by k equally-spaced rays with origin p. Motivated by communication issues in mobile networks with directional antennas, we study the connectivity properties of Yk[Gd], for small values of k and d. In particular, we derive lower and upper bounds on the minimum radius d that renders Yk[Gd] connected, relative to the unit radius assumed to render Gd connected. We show that d = [EQUATION] is necessary and sufficient for the connectivity of Y4[Gd]. We also show that, for d ≤ 5 − 2/3 [EQUATION], the graph Y3[Gd] can be disconnected, but Y3[G2/[EQUATION]] is always connected. Finally, we show that Y2[Gd] can be disconnected, for any d ≥ 1.