Abstract
In wireless networks, inter-session and intra-session network coding can potentially reduce the energy consumption for information transmission. However, the optimal routing and channel selection render the problem non-convex and NP-hard. Given the coordinates of terminal nodes and the transmission tasks, we formulate the problem as a cost minimization problem, which we refer to as the wireless space information flow (WSIF) problem. We then employ a filled function method to compute the global optimal solution to the WSIF problem. The filled function method enables simultaneous optimization of the routing scheme, as well as the coordinates of the relay nodes.
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.
