Analysis of polling systems
Multi-agent cooperation, dynamic workflow and XML for e-commerce automation
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Self-management in chaotic wireless deployments
Proceedings of the 11th annual international conference on Mobile computing and networking
Video Streaming in 3.5G: On Throughput-Delay Performance of Proportional Fair Scheduling
MASCOTS '06 Proceedings of the 14th IEEE International Symposium on Modeling, Analysis, and Simulation
Challenges in Virtual Collaboration: Videoconferencing Audioconferencing and Computer--Mediated Communications
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Methods for task allocation via agent coalition formation
Artificial Intelligence
Evolutionary network formation games and fuzzy coalition in heterogeneous networks
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
Continuous polling with rerouting and applications to ferry assisted wireless LANs
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Controlled mobility in stochastic and dynamic wireless networks
Queueing Systems: Theory and Applications
Mixed polling with rerouting and applications
Performance Evaluation
Hi-index | 0.00 |
Autonomous agents such as unmanned aerial vehicles (UAVs) have a great potential for deployment in next generation wireless networks. While current literature has been mainly focused on the use of UAVs for connectivity enhancement and routing in military ad hoc networks, this paper proposes a novel usage model for UAVs in wireless communication networks. In the proposed model, a number of UAVs are required to collect data from a number of randomly located tasks and transmit this data wirelessly to a common receiver (such as the central command). Each task represents a queue of packets that require collection and transmission to the central receiver. This problem is modeled as a hedonic coalition formation game between the UAVs and the tasks that interact in order to form disjoint coalitions. Each formed coalition is modeled as a polling system consisting of a number of UAVs, designated as collectors, which act as a single server that moves between the different tasks present in the coalition, collects and transmits the packets to a common receiver. Within each coalition, some UAVs might also take the role as a relay for improving the packet success rate of the transmission. The proposed coalition formation algorithm allows the tasks and the UAVs to take local selfish decisions to join or leave a coalition, based on the achieved benefit, in terms of effective throughput, and the cost in terms of delay. Simulation results show how the proposed algorithm allows the UAVs and tasks to self-organize into independent coalitions, while improving the performance, in terms of average player (UAV or task) payoff, of at least 30.26% relatively to a scheme that allocates nearby tasks equally among UAVs.