Abstract
For dense ad hoc networks, clustering is an appropriate strategy for improving scalability. Moreover, dense networks such as public safety or military networks are also structured through a hierarchical organization via operational groups. This organization usually impacts both the mobility of nodes which move in group, and the data flow since the traffic is mainly intra-group rather than inter-group. In this work, we extend two distributed clustering algorithms, GDMAC and VOTE, by taking into account the group structure. Our simulations of dense ad hoc networks show that our extensions lead to a lower end-to-end communication delay and offer a better stability to mobility.
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.
