Abstract
This chapter focuses on the problem of joint k-coverage, sensor scheduling, and geographic forwarding in two-and three-dimensional wireless sensor networks. Specifically, it studies geographic forwarding in duty-cycled, k-covered wireless sensor networks and proposes the first design of protocols for geographic forwarding on duty-cycled sensors with and without data aggregation. The proposed protocols exploit the geometry of the configurations, which result from our connected k-coverage protocols, and the concept of virtual potential fields.KeywordsSensor NetworkWireless Sensor NetworkGood RelayCandidate RelayPotential RelayThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
