Abstract
We consider two strategies for communication in ad hoc networks with local node cooperation. Groups of adjacent nodes transmit and relay information simultaneously in order to increase the throughput. For the proposed schemes we derive achievability bounds on the communication rates and demonstrate sizable gains over the corresponding time division multiple access based strategies. The obtained bounds closely follow recently derived information theoretic upper bounds on communication rates. Additionally we address the impact of traffic localization on the achievable rates and the receiver complexity.
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.
