M. Saoudi, F. Lalem, A. Bounceur, R. Euler, M. T. Kechadi et al., D-LPCN: A Distributed Least Polar-angle Connected Node Algorithm for Finding the Boundary of a Wireless Sensor Network, Ad Hoc Networks, vol.56, pp.56-71, 2017.

M. , Distributed algorithms for message-passing systems, vol.500, 2013.

D. S. Hirschberg and J. B. Sinclair, Decentralized extrema finding in circular configuration of processors, Communications of the ACM, vol.23, issue.11, pp.627-628, 1980.

D. Dolev, M. Klawe, and M. Rodeh, An O(n log n) unidirectional distributed algorithm for extrema finding in a circle, Journal of Algorithms, vol.3, issue.3, pp.245-260, 1982.

R. G. Gallager, P. A. Humblet, and P. M. Spira, A distributed algorithm for minimum-weight spanning trees, ACM Transactions on Programming Languages and systems, vol.5, issue.1, pp.66-77, 1983.

D. Peleg, Time-optimal leader election in general networks, Journal of parallel and distributed computing, vol.8, issue.1, pp.96-99, 1990.

N. Malpani, J. L. Welch, and N. Vaidya, Leader election algorithms for mobile ad hoc networks, Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications, pp.96-103, 2000.

V. D. Park and M. S. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, the Proceedings of the Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies, vol.3, pp.1405-1413, 1997.

S. Vasudevan, B. Decleene, N. Immerman, J. Kurose, and D. Towsley, Leader election algorithms for wireless ad hoc networks, the Proceedings of the IEEE DARPA Information Survivability Conference and Exposition, vol.1, pp.261-272, 2003.

S. Vasudevan, J. Kurose, and D. Towsley, Design and analysis of a leader election algorithm for mobile ad hoc networks, the Proceedings of the 12th IEEE International Conference on Network Protocols. ICNP 2004, pp.350-360, 2004.

A. Boukerche and K. Abrougui, An efficient leader election protocol for mobile networks, Proceedings of the ACM international conference on Wireless communications and mobile computing, pp.1129-1134, 2006.

R. Ingram, P. Shields, J. E. Walter, and J. L. Welch, An asynchronous leader election algorithm for dynamic networks, IEEE International Symposium on Parallel & Distributed Processing, IPDPS'09, pp.1-12, 2009.

M. Hammoudeh, Modelling clustering of sensor networks with synchronised hyperedge replacement, International Conference on Graph Transformation, pp.490-492, 2008.

M. Hammoudeh and T. Alsbou'i, Building programming abstractions for wireless sensor networks using watershed segmentation, Smart Spaces and Next Generation Wired/Wireless Networking, pp.587-597, 2011.

N. Santoro, Design and analysis of distributed algorithms, vol.56, 2007.

N. A. Lynch, Distributed algorithms, 1996.

C. Simulator,

K. Mehdi, M. Lounis, A. Bounceur, and T. Kechadi, CupCarbon: A Multi-Agent and Discrete Event Wireless Sensor Network Design and Simulation Tool, IEEE 7th International Conference on Simulation Tools and Techniques (SIMUTools'14), 2014.
URL : https://hal.archives-ouvertes.fr/hal-00963926

A. S. Tanenbaum and D. J. Wetherall, Computer Networks, pp.368-370, 2010.