Abstract
In order to increase node lifetime and system throughput, the topology of wireless Ad Hoc networks can be controlled by changing the transmission power at each node. In this paper, we propose an energy-efficient distributed topology-control algorithm, Varying Cone on Gabriel Graph (VCGG). By selecting logical neighbor nodes through deleting the farthest node, VCGG builds a degree-bounded, power spanner and planar sub-graph using the merits of a varying cone. The simulation results show that our proposed VCGG outperforms the existing SΘGG and SYaoGG algorithms in terms of power efficiency, the number of communication neighbors and interference reduction.
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.
