Abstract
In this letter, we investigate the node’s dynamic selfishness and the rate allocation in time-varying selfish wireless networks (SeWNs). We model the dynamics of the node’s selfishness by designing a virtual forwarding selfishness queue (v-FSQ) and a virtual receiving selfishness queue (v-RSQ). Specifically, the v-FSQ is constructed with the consideration of the node’s residual energy and employed incentives, while the v-RSQ is constructed with the consideration of the node’s data queue state information. By virtual of nodes’ v-RSQs and v-FSQs, a stochastic optimization problem is formulated to maximize the time-average network utility, which is related to the SeWNs throughput, whilst bounding the nodes’ selfishness queues. The dynamic rate allocation is obtained with the aid of the Lyapunov optimization theory. Simulation results verify the theoretical analysis of our proposed scheme.
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.
