Abstract
Wireless sensor network (WSN) such as vehicular ad hoc network (VANET) usually has a bunch of nodes on the move, thus, connectivity and network coverage for WSN has now been recognized as a thorny issue which should take the range of area, the number of nodes into consideration. A better WSN coverage scheme can not only optimize network resources, but improve the efficiency of the network as well. Till now, many scholars have studied the very coverage scheme by means of node deployment or connectivity analysis, while others have studied the coverage hole repairing scheme in case of any end nodes fails; coverage studies for WSN in specified scenario like VANET with vehicle nodes moving in a certain range of area are still hard to be found. In this paper, based on the analysis of the specified requirements in VANET, a coverage approach for such kind of WSN has been proposed with algorithm in detail, and by setting 2 cases as examples, the effectiveness of such approach has been verified. The coverage algorithm proposed may not be the optimal coverage scheme, but it can be applied in specified scenario with moving nodes and be supposed to get coverage result timely for its simple arithmetic logic efficiently.
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.
