Abstract
The packing problem is a well known-problem. There are several versions of this problem. In this paper we consider packing or covering of a disc of a given radius r by a number of discs of unit radius. We introduced two types of packing, hexagonal packing and square packing. We show that hexagonal packing is better in the sense that it needs less discs to cover a disc of higher radius. Coverage problem is similar to the packing problem in continuous domain. Coverage is essential in wireless sensor networks. In this paper we also discuss the coverage problem in random deployment scenario.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.