On Deploying Wireless Sensors to Achieve Both Coverage and Connectivity
By Xiaole Bai, Santosh Kumar, Dong Xuan, Ziqiu Yun, Ten-Hwang Lai. International Conference on Wireless Communications, Networking and Mobile Computing, 2006
608 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/dc27b418956fcae01588aae96d6d9156983c0e82
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Andreas Krause
- Carlos Guestrin
- Kemal Akkaya
- Dusist Niyato
- Mohamed F. Younis
- Falko Dressler
- Zhu Han
- Dong In Kim
In Electrical and Electronic Engineering
Citations in the corpus
- Sensor Deployment and Scheduling for Target Coverage Problem in Wireless Sensor Networks (2014, methodology): “[20] use Voronoi-based methodology to solve deployment problem.”
- A Survey on Topology Control in Wireless Sensor Networks: Taxonomy, Comparative Study, and Open Issues (2008, neutral): “In [7], Bai et al.”
- Topology management techniques for tolerating node failures in wireless sensor networks: A survey (2014, background): “Recovery from simultaneous failure of multiple nodes will be covered in Section 5.”
- On the lifetime of wireless sensor networks (2009, background): “routing and data dissemination schemes [4], self-organization issues [5], the efficient deployment of sensor nodes [6], and the interaction of sensor/actuator networks [7], while others are still work in progress.”
- Near-optimal Observation Selection using Submodular Functions (2007, background): “With every potential sensing location s ∈ V, one associates a geometric shape R s , a sensing region, which is usually taken as a disk (c.f., Bai et al. 2006), or a cone (for modeling camera viewing fields).”
- Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies (2008, neutral): “The most common approaches for optimizing sensor placements using geometric criteria assume that sensors have a fixed region (cf. Hochbaum and Maas, 1985; Gonzalez-Banos and Latombe, 2001; Bai et al., 2006).”
- Coverage and connectivity issues in wireless sensor networks: A survey (2008, background): “Extending the above work, which is only applicable for Rc/Rs = 1, an optimal deployment pattern is proposed in [6] to achieve both full coverage and 2-connectivity of a square region.”
- Coverage problems in sensor networks: A survey (2011, background): “Some researchers [Kar and Banerjee 2003; Lyengar et al. 2005; Wang et al. 2005c; Bai et al. 2006; Han et al. 2008] have proposed and analyzed a kind of strip-based node placement pattern to address v the network connectivity for Rc < 3Rs.”
- Efficient Informative Sensing using Multiple Robots (2014, methodology): “, 1995), information disk model (Bai et al., 2006) and alphabetical optimality criterion such as A-, D- and E-optimal have also been used to associate sensing quality with observation locations in related problem domain.”
- Energy provisioning in wireless rechargeable sensor networks (2011, methodology): “It is well known that according to the disc sensing model, deploying sensor nodes on the vertices of equilateral triangles obtains the minimum number of nodes to ensure full coverage of a plane [18][13].”
- Wireless Charging Technologies: Fundamentals, Standards, and Network Applications (2015, positive): “It is shown by simulation that, compared with traditional triangular deployment approach in sensing disc model [343], the proposed approach for point provisioning resulted in dramatic reduction in the number of chargers.”