Abstract
Multi-Point Relay (MPR) mechanism is a selection algorithm to reduce the number of control packets in ad-hoc network routing protocols. This study presents a new MPR selection method using genetic algorithm (GA) while the MPR sets follow the maximal independent concept. Although original greedy algorithm works well in sparse networks, as MPR selection is an NP-hard problem, the proposed method can improve MPR selection phase in the presence of large number of nodes. The simulation shows that our method obtains up to 35% more independent sets when node density is high and incurs less memory usage, less power-consumption, and less retransmissions due to interferences.
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.
