In our prior work, we presented a highly effective local search based heuristic algorithm called the Largest Expanding Sweep Search (LESS) to solve the minimum energy broadcast (M...
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
Although most wireless terrestrial networks are based on twodimensional (2D) design, in reality, such networks operate in threedimensions (3D). Since most often the size (i.e., th...
In this paper, we study the wireless synchronization problem which requires devices activated at different times on a congested single-hop radio network to synchronize their roun...
Sensor networks are fundamentally constrained by the difficulty and energy expense of delivering information from sensors to sink. Our work has focused on garnering additional si...