Abstract
A quasi-unit disk graph has been used as a realistic model of an ad-hoc or a sensor wireless network. A wireless ad-hoc network is location aware if each node knows its geographic coordinates. Some network backbones proposed for data gathering in a wireless network are based on dominating sets of the network graph. The location awareness of ad-hoc networks corresponding to unit disk graph was used in [6] to obtain a local algorithm for a dominating set of a unit disk graph. In this paper we generalize this algorithm to location aware ad-hoc networks corresponding to quasi-unit graphs. The competitive ratio of the algorithm is determined for several ranges of the parameter r of an r--quasi-unit disk graph. For each range of r the competitive ratio is shown to be a constant value. An experimental evaluation of the algorithm is also carried out, which confirms very good performance of our algorithm.
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.