Seeing the bigger picture: How nodes can learn their place within a complex ad hoc network topology

IEEE Signal Processing Magazine

Volumn 30, Issue 3, 2013, Pages 71-82

  Bertrand, Alexander ^a   Moonen, Marc ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; CLUSTERING ALGORITHMS; GRAPH THEORY; SIGNAL PROCESSING; TOPOLOGY;

ALGEBRAIC CONNECTIVITY; CLUSTER-HEAD SELECTIONS; DISTRIBUTED ESTIMATION; DISTRIBUTED IMPLEMENTATION; DISTRIBUTED LEARNING; DISTRIBUTED SIGNAL PROCESSING; EXTERNAL OBSERVER; SPECTRAL GRAPH THEORY;

COMPLEX NETWORKS;

EID: 85032751678     PISSN: 10535888     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2012.2232713     Document Type: Article

References (48)

1. R. Olfati-Saber, J. Fax, and R. Murray, "Consensus and cooperation in networked multi-agent systems," Proc. IEEE, vol. 95, no. 1, pp. 215-233, Jan. 2007.
2. S.-Y. Tu and A. H. Sayed, "Mobile adaptive networks," IEEE J. Select. Topics Signal Processing, vol. 5, no. 4, pp. 649-664, Aug. 2011.
3. F. Cattivelli and A. H. Sayed, "Diffusion LMS strategies for distributed estimation," IEEE Trans. Signal Processing, vol. 58, no. 3, pp. 1035-1048, Mar. 2010.
4. S. Kar and J. Moura, "Sensor networks with random links: Topology design for distributed consensus," IEEE Trans. Signal Processing, vol. 56, no. 7, pp. 3315-3326, July 2008.
5. G. Mateos and G. B. Giannakis, "Distributed recursive least-squares: Stability and performance analysis," IEEE Trans. Signal Processing, vol. 60, no. 7, pp. 3740-3754, July 2012.
6. L. Xiao and S. Boyd, "Fast linear iterations for distributed averaging," Syst. Control Lett., vol. 53, no. 1, pp. 65-78, 2004.
7. J. Lavaei and R. Murray, "On quantized consensus by means of gossip algorithm. Part II: Convergence time," in Proc. American Control Conf., June 2009, pp. 2958-2965.
8. S. Sardellitti, S. Barbarossa, and A. Swami, "Optimal topology control and power allocation for minimum energy consumption in consensus networks," IEEE Trans. Signal Processing, vol. 60, no. 1, pp. 383-399, Jan. 2012.
9. C. Asensio-Marco and B. Beferull-Lozano, "A greedy perturbation approach to accelerating consensus algorithms and reducing its power consumption," in Proc. IEEE Statistical Signal Processing Workshop (SSP), June 2011, pp. 365-368.
10. M. Newman, Networks: An Introduction. London: Oxford Univ. Press, 2010.
11. M. Fiedler, "Algebraic connectivity of graphs," Czech. Math. J., vol. 23, no. 98, pp. 298-305, 1973.
12. B. Mohar, "Laplace eigenvalues of graphs: A survey," Discrete Math., vol. 109, no. 1-3, pp. 171-183, 1992.
13. B. Mohar, "The Laplacian spectrum of graphs," in Graph Theory, Combinatorics, and Applications, Y. Alavi, G. Chartrand, O. Oellermann, and A. Schwenk, Eds. New Yor k : Wiley, 1991, pp. 871-898.
14. T. F. Chan, T. C. Ciarlet, and W. K. Szeto, "On the optimality of the median cut spectral bisection graph partitioning method," SIAM J. Sci. Comput., vol. 18, pp. 943-948, 1997. (Pubitemid 127640890)
15. S. Brin and L. Page, "The anatomy of a large-scale hypertextual web search engine," Comput. Networks ISDN Syst., vol. 30, pp. 107-117, Apr. 1998.
16. L. Hagen and A. Kahng, "New spectral methods for ratio cut partitioning and clustering," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 11, no. 9, pp. 1074-1085, Sept. 1992. (Pubitemid 23555831)
17. W. Richards and A. Seary, "Spectral methods for analyzing and visualizing networks: An introduction," Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers, pp. 209-228, 2003.
18. S. Barnard and H. Simon, "Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems," Concurrency: Practice and Experience, vol. 6, no. 2, pp. 101-117, 1994.
19. S. E. Schaeffer, "Graph clustering," Comput. Sci. Rev., vol. 1, no. 1, pp. 27-64, 2007.
20. P. Orponen and S. Schaeffer, "Local clustering of large graphs by approximate Fiedler vectors," in Experimental and Efficient Algorithms, vol. 3503 (Lecture Notes in Computer Science), S. Nikoletseas, Ed. Berlin, Germany: Springer, 2005, pp. 524-533. (Pubitemid 41322472)
21. A. D. Sarma, "Algorithms for large graphs," Ph.D. dissertation, College Comput., Georgia Inst. Technol., Atlanta, 2010.
22. D. Nanongkai, "Graph and geometric algorithms on distributed networks and databases," Ph.D. dissertation, Collete Comput., Georgia Inst. Technol., Atlanta, 2011.
23. A. Bertrand and M. Moonen, "Distributed computation of the Fiedler vector with application to topology inference in ad hoc networks," Signal Processing, vol. 93, no. 5, pp. 1105-1117, May 2013.
24. P. Yang, R. A. Freeman, G. J. Gordon, K. M. Lynch, S. S. Srinivasa, and R. Suk-thankar, "Decentralized estimation and control of graph connectivity for mobile sensor networks," Automatica, vol. 46, no. 2, pp. 390-396, Feb. 2010.
25. R. K. Williams and G. S. Sukhatme, "Distributed connectivity control in mobile networks under local topology constraints," Depts. Elect. Eng. Comput. Sci., Univ. Southern California, Los Angeles, Internal Rep., 2012.
26. R. Aragues, G. Shi, D. V. Dimarogonas, C. Sagues, and K. H. Johansson, "Distributed algebraic connectivity estimation for adaptive event-triggered consensus," in Proc. American Control Conf., Montreal, Canada, June 2012, pp. 32-37.
27. D. Kempe and F. McSherry, "A decentralized algorithm for spectral analysis," J. Comput. Syst. Sci., vol. 74, no. 1, pp. 70-83, 2008. (Pubitemid 47625406)
28. T. Sahai, A. Speranzon, and A. Banaszuk, "Hearing the clusters of a graph: A distributed algorithm," Automatica, vol. 48, no. 1, pp. 15-24, 2012.
29. C. Gkantsidis, G. Goel, M. Mihail, and A. Saberi, "Towards topology aware networks," in Proc. IEEE Int. Conf. Computer Communications (INFOCOM), May 2007, pp. 2591-2595. (Pubitemid 47334527)
30. A. Banaszuk, V. A. Fonoberov, T. A. Frewen, M. Kobilarov, G. Mathew, I. Mezic, A. Pinto, T. Sahai, H. Sane, A. Speranzon, and A. Surana, "Scalable approach to uncertainty quantification and robust design of interconnected dynamical systems," Annu. Rev. Control, vol. 35, no. 1, pp. 77-98, 2011.
31. D. Bickson and D. Malkhi, "A unifying framework of rating users and data items in peer-to-peer and social networks," Peer-to-Peer Networking and Applications., vol. 1, no. 2, pp. 93-103, 2008.
32. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Belmont, MA: Athena Scientific, 1997.
33. G. L. Thompson, "Lectures on game theory, Markov chains and related topics," Sandia Corp., Albuquerque, NM, Monogr. SCR-11, 1958.
34. L. Katz, "A new status index derived from sociometric analysis," Psychometri-ka, vol. 18, no. 1, pp. 39-43, 1953.
35. M. Jelasity, G. Canright, and K. Engo-Monsen, "Asynchronous distributed power iteration with gossip-based normalization," in Lecture Notes in Computer Science, vol. 4641. Berlin, Germany: Springer, 2007, pp. 514-525.
36. D. A. Spielman and S.-H. Teng, "Spectral partitioning works: Planar graphs and finite element meshes," Linear Algebra Appl., vol. 421, no. 23, pp. 284-305, 2007. (Pubitemid 46096985)
37. B. Elbhiri, S. El Fkihi, R. Saadane, and D. Aboutajdine, "Clustering in wireless sensor networks based on near optimal bi-partitions," in Proc. Conf. Next Generation Internet (NGI), June 2010, pp. 1-6.
38. A. Tahbaz-Salehi and A. Jadbabaie, "A one-parameter family of distributed consensus algorithms with boundary: From shortest paths to mean hitting times," in Proc. IEEE Conf. Decision and Control, Dec. 2006, pp. 4664-4669. (Pubitemid 351284005)
39. B. Deosarkar, N. Yadav, and R. Yadav, "Clusterhead selection in clustering algorithms for wireless sensor networks: A survey," in Proc. Int. Conf. Computing, Communication and Networking (ICCCN), Dec. 2008, pp. 1-8.
40. M. H. Degroot, "Reaching a consensus," J. Amer. Stat. Assoc., vol. 69, no. 345, pp. 118-121, 1974.
41. A. Ghosh and S. Boyd, "Growing well-connected graphs," in Proc. IEEE Conf. Decision and Control, Dec. 2006, pp. 6605-6611. (Pubitemid 351283465)
42. M. C. DeGennaro and A. Jadbabaie, "Decentralized control of connectivity for multiagent systems," in Proc. IEEE Conf. Decision and Control, San Diego, CA, Dec. 2006, pp. 3628-3633. (Pubitemid 351283394)
43. A. Bertrand and M. Moonen, "Distributed adaptive estimation of node-specific signals in wireless sensor networks with a tree topology," IEEE Trans. Signal Processing, vol. 59, no. 5, pp. 2196-2210, 2011.
44. C. G. Lopes and A. H. Sayed, "Incremental adaptive strategies over distributed networks," IEEE Trans. Signal Processing, vol. 55, no. 8, pp. 4064-4077, Aug. 2007. (Pubitemid 47261528)
45. A. Robles-Kelly and E. R. Hancock, "Spanning tree recovery via random walks in a Riemannian manifold," in Proc. Iberoamerican Congress Pattern Recognition (Lecture Notes in Computer Science, vol. 3287). Berlin, Germany: Springer, 2004, pp. 303-311. (Pubitemid 39741514)
46. A. Bertrand, J. Szurley, P. Ruckebusch, I. Moerman, and M. Moonen, "Efficient calculation of sensor utility and sensor removal in wireless sensor networks for adaptive signal estimation and beamforming," IEEE Trans. Signal Processing, vol. 60, pp. 5857-5869, Nov. 2012.
47. S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina, "The EigenTrust algorithm for reputation management in P2P networks," in Proc. Int. Conf. World Wide Web, New York, 2003, pp. 640-651.
48. J. R. Seeley, "The net of reciprocal influence: A problem in treating sociometric data," Can. J. Psychol., vol. 3, no. 4, pp. 234-240, 1949.