Page 36 - ITU KALEIDOSCOPE, ATLANTA 2019

2019 ITU Kaleidoscope Academic Conference

Frontiers in Dynamic Spectrum Access Networks, 2005.
DySPAN 2005., pp. 259-268. IEEE, 2005.

[6] P.H. Pathak, and R. Dutta. Designing for network and
service continuity in wireless mesh networks. Springer
Science & Business Media, 2012.
[7] H. Karl, and A. Willig. Protocols and architectures for
wireless sensor networks. John Wiley & Sons, 2007.
[8] F. Zhao, L.J. Guibas, and L. Guibas. Wireless sensor
networks: an information processing approach. Morgan
Kaufmann, 2004.
[9] N. Li, J.C. Hou, and L. Sha. “Design and analysis
of an MST-based topology control algorithm,” IEEE
Transactions on Wireless Communications 4, no. 3
(2005): 1195-1206.
[10] A. Vázquez-Rodas, and L.J. de la Cruz Llopis,
“Topology control for wireless mesh networks based
on centrality metrics,” In Proceedings of the 10th ACM
symposium on Performance evaluation of wireless ad
hoc, sensor, & ubiquitous networks, pp. 25-32. ACM,
2013.
[11] P.M.W. Rojas. Topology control in wireless sensor
networks. University of South Florida, 2010.

[12] E.W. Dijkstra, “A note on two problems in connexion
with graphs.” Numerische mathematik 1, no. 1 (1959):
269-271.
[13] K. Sohraby, D. Minoli, and T. Znati. Wireless sensor
networks: technology, protocols, and applications. John
Wiley & Sons, 2007.
[14] A.B. Bagula, and A.E. Krzesinski, “Traffic engineering
label switched paths in IP networks using a
pre-planned flow optimization model,” In MASCOTS
2001, Proceedings Ninth International Symposium on
Modeling, Analysis and Simulation of Computer and
Telecommunication Systems, pp. 70-77. IEEE, 2001.
[15] R. Coudé. Radio Mobile - RF propagation simulation
software, 1998. http://radiomobile.pe1mew.nl/.
[16] J. Magliacane. SPLAT! Because the world isn’t flat!,
1997.
ITUurlhttps://www.qsl.net/kd2bd/splat.html.
[17] J. Yu, N. Wang, G. Wang, and D. Yu,
“Connected dominating sets in wireless ad hoc and
sensor networks?A comprehensive survey,” Computer
Communications 36, no. 2 (2013): 121-134.
[18] F. Dai, and J. Wu, “On constructing k-connected
k-dominating set in wireless ad hoc and sensor
networks,” Journal of parallel and distributed computing
66, no. 7 (2006): 947-958.
[19] S. Kutten, and D. Peleg, “Fast distributed construction
of smallk-dominating sets and applications,” Journal of
Algorithms 28, no. 1 (1998): 40-66.

– 16 –