The field of wireless networks is moving towards the development of more efficient distributed algorithms and cooperative game theory models. Researchers are focusing on designing fast and optimal algorithms for basic communication tasks such as k-gathering and k-broadcasting, as well as analyzing the stability of coalitions in wireless networks. The use of cooperative game theory is providing new insights into the feasibility of stable cooperative multicast strategies. Additionally, the analysis of beaconless geocast protocols and local dominance in mixed-strength populations is leading to a deeper understanding of the dynamics of wireless networks. Noteworthy papers include: The paper on Optimal-Length Labeling Schemes and Fast Algorithms for k-gathering and k-broadcasting, which presents asymptotically optimal size of advice for k-gathering problems. The paper on Singing a MIS, which introduces a broadcast model where agents compete with their neighbors and converge to an MIS in logarithmic time for dynamic networks.