Abstract
This letter theoretically formulates the coded cooperative data exchange (CCDE) problem in multi-channel multi-hop wireless networks, where a set of nodes initially hold a subset of packets and wish to retrieve all desired packets via multi-hop wireless communication. At first, we propose the model of tentative transmission, with which we can jointly consider resource allocation, transmission scheduling, and transmitted packet scheduling. Then, based on the time expanded graph, we convert the CCDE problem in multiple time slots into a single source and multiple sinks network (SSMN) within a time slot. Finally, the relationship between the required time slots and the number of channels is theoretically formulated based on the constructed SSMN. Experiments demonstrate that the gain due to the increasing number of channels flattens.
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.
