Display of Sensor Networks : a Feasibility Study

Executive Summary..............................................................................................................................2

[1]  John Q. Walker,et al.  A node‐positioning algorithm for general trees , 1990, Softw. Pract. Exp..

[2]  Branka Vucetic,et al.  Simulated annealing based localization in wireless sensor network , 2005, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l.

[3]  Michael Jünger,et al.  Improving Walker's Algorithm to Run in Linear Time , 2002, GD.

[4]  Erik D. Demaine,et al.  Anchor-Free Distributed Localization in Sensor Networks , 2003 .

[5]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[6]  Ulrik Brandes,et al.  Drawing on Physical Analogies , 2001, Drawing Graphs.

[7]  Daniel Tunkelang.  A Practical Approach to Drawing Undirected Graphs , 1994 .

[8]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[9]  Jian Ma,et al.  Anchor-free localization with refinement in sensor networks , 2004 .

[10]  Anthony Bloesch,et al.  Aesthetic layout of generalized trees , 1993, Softw. Pract. Exp..

[11]  Ioannis G. Tollis,et al.  Proceedings of the DIMACS International Workshop on Graph Drawing , 1994 .

[12]  Charles Wetherell,et al.  Tidy Drawings of Trees , 1979, IEEE Transactions on Software Engineering.

[14]  Alfred O. Hero,et al.  Indirect Radio Interferometric Localization via Pairwise Distances , 2006 .

[15]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[16]  Robert J. Cimikowski,et al.  Algorithms for the fixed linear crossing number problem , 2002, Discret. Appl. Math..

[17]  Edward M. Reingold,et al.  Tidier Drawings of Trees , 1981, IEEE Transactions on Software Engineering.

[18]  Andreas Ludwig,et al.  A Fast Adaptive Layout Algorithm for Undirected Graphs , 1994, GD.