The population protocols of Angluin, Aspnes et al provide a theoretical framework for computability reasoning about algorithms for Mobile Ad-Hoc Networks (MANETs) and Wireless Sensor Networks (WSNs). By developing two example protocols and proving convergence results using the Event- B/RODIN and TLA frameworks, we explore the potential for formal analysis of these protocols.