메뉴 건너뛰기




Volumn 5, Issue 12, 2006, Pages 1663-1677

A theory of network localization

Author keywords

Algorithm protocol design and analysis; Analysis of algorithms and problem complexity; Architectures; Communication networking and IT; Computer systems organization; Mobile computing; Nonnumerical algorithms and problems; Theory of computation

Indexed keywords

COMPUTER SYSTEMS ORGANIZATION; GROUNDED GRAPHS; NETWORK LOCALIZATION;

EID: 33750831866     PISSN: 15361233     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMC.2006.174     Document Type: Article
Times cited : (561)

References (61)
  • 2
    • 0002740666 scopus 로고    scopus 로고
    • Solving euclidean distance matrix completion problems via semidefinite programming
    • A.Y. Alfakih, A. Khandani, and H. Wolkowicz, "Solving Euclidean Distance Matrix Completion Problems via Semidefinite Programming," Computational Optimization and Applications, vol. 12, nos. 1-3, pp. 13-30, 1999.
    • (1999) Computational Optimization and Applications , vol.12 , Issue.1-3 , pp. 13-30
    • Alfakih, A.Y.1    Khandani, A.2    Wolkowicz, H.3
  • 6
    • 8344242239 scopus 로고    scopus 로고
    • A proof of connelly's conjecture on 3-connected generic cycles
    • A. Berg and T. Jordan, "A Proof of Connelly's Conjecture on 3-Connected Generic Cycles," J. Combinatorial Theory B, 2002.
    • (2002) J. Combinatorial Theory B
    • Berg, A.1    Jordan, T.2
  • 9
    • 0013173620 scopus 로고    scopus 로고
    • Unit disk graph recognition is NP-hard
    • H. Breu and D.G. Kirkpatrick, "Unit Disk Graph Recognition is NP-Hard," Computational Geometry, vol. 9, nos. 1-2, pp. 3-24, 1998.
    • (1998) Computational Geometry , vol.9 , Issue.1-2 , pp. 3-24
    • Breu, H.1    Kirkpatrick, D.G.2
  • 10
    • 0034291601 scopus 로고    scopus 로고
    • GPS-less low-cost outdoor localization for very small devices
    • Oct.
    • N. Bulusu, J. Heidemann, and D. Estrin, "GPS-Less Low-Cost Outdoor Localization for Very Small Devices," IEEE Personal Comm. Magazine, vol. 7, no. 5, pp. 28-34, Oct. 2000.
    • (2000) IEEE Personal Comm. Magazine , vol.7 , Issue.5 , pp. 28-34
    • Bulusu, N.1    Heidemann, J.2    Estrin, D.3
  • 16
    • 8344246255 scopus 로고    scopus 로고
    • Technical Report LSI-02-72-R, Dept. de Llenguatges i Sistemes Informátics, Univ. Politécnica de Catalunya, Dec.
    • J. Díaz, J. Petit, and M. Serna, "A Random Graph Model for Optical Networks of Sensors," Technical Report LSI-02-72-R, Dept. de Llenguatges i Sistemes Informátics, Univ. Politécnica de Catalunya, Dec. 2002.
    • (2002) A Random Graph Model for Optical Networks of Sensors
    • Díaz, J.1    Petit, J.2    Serna, M.3
  • 17
    • 84855460105 scopus 로고    scopus 로고
    • Technical Report LSI-02-47-R, Dept. de Llenguatges i Sistemes Informatics, Univ. Politécnica de Catalunya, June
    • J. Díaz, J. Petit, and M. Serna, "Random Scaled Sector Graphs," Technical Report LSI-02-47-R, Dept. de Llenguatges i Sistemes Informatics, Univ. Politécnica de Catalunya, June 2002.
    • (2002) Random Scaled Sector Graphs
    • Díaz, J.1    Petit, J.2    Serna, M.3
  • 18
    • 0035013232 scopus 로고    scopus 로고
    • Convex position estimation in wireless sensor networks
    • Apr.
    • L. Doherty, K.S.J. Pister, and L.E. Ghaoui, "Convex Position Estimation in Wireless Sensor Networks," Proc. IEEE INFOCOM '01, pp. 1655-1633, Apr. 2001.
    • (2001) Proc. IEEE INFOCOM '01 , pp. 1655-11633
    • Doherty, L.1    Pister, K.S.J.2    Ghaoui, L.E.3
  • 23
    • 0028422189 scopus 로고
    • The challenges of mobile computing
    • Apr.
    • G.H. Forman and J. Zahorjan, "The Challenges of Mobile Computing," Computer, vol. 27, no. 4, pp. 38-47, Apr. 1994.
    • (1994) Computer , vol.27 , Issue.4 , pp. 38-47
    • Forman, G.H.1    Zahorjan, J.2
  • 25
    • 0000595574 scopus 로고
    • Computational complexity of probabilistic turing machines
    • J. Gill, "Computational Complexity of Probabilistic Turing Machines," SIAM J. Computing, vol. 6, no. 4, pp. 675-695, 1977.
    • (1977) SIAM J. Computing , vol.6 , Issue.4 , pp. 675-695
    • Gill, J.1
  • 29
    • 0026821495 scopus 로고
    • Conditions for unique graph realizations
    • B. Hendrickson, "Conditions for Unique Graph Realizations," SIAM J. Computing, vol. 21, no. 1, pp. 65-84, 1992.
    • (1992) SIAM J. Computing , vol.21 , Issue.1 , pp. 65-84
    • Hendrickson, B.1
  • 30
    • 0013558430 scopus 로고
    • The molecule problem: Exploiting structure in global optimization
    • B. Hendrickson, "The Molecule Problem: Exploiting Structure in Global Optimization," SIAM J. Optimization, vol. 5, no. 4, pp. 835-857, 1995.
    • (1995) SIAM J. Optimization , vol.5 , Issue.4 , pp. 835-857
    • Hendrickson, B.1
  • 33
    • 0001243769 scopus 로고
    • Dividing a graph into triconnected components
    • J.E. Hopcroft and R. Tarjan, "Dividing a Graph into Triconnected Components," SIAM J. Computing, vol. 3, pp. 135-158, 1973.
    • (1973) SIAM J. Computing , vol.3 , pp. 135-158
    • Hopcroft, J.E.1    Tarjan, R.2
  • 34
    • 15444370051 scopus 로고    scopus 로고
    • Connected rigidity matroids and unique realizations of graphs
    • B. Jackson and T. Jordan, "Connected Rigidity Matroids and Unique Realizations of Graphs," J. Combinatorial Theory B, vol. 94, pp. 1-29, 2005.
    • (2005) J. Combinatorial Theory B , vol.94 , pp. 1-29
    • Jackson, B.1    Jordan, T.2
  • 36
    • 0031281604 scopus 로고    scopus 로고
    • An algorithm for two dimensional rigidity percolation: The pebble game
    • D. Jacobs and B. Hendrickson, "An Algorithm for Two Dimensional Rigidity Percolation: The Pebble Game," J. Computational Physics, vol. 137, no. 2, pp. 346-365, 1997.
    • (1997) J. Computational Physics , vol.137 , Issue.2 , pp. 346-365
    • Jacobs, D.1    Hendrickson, B.2
  • 37
    • 8344227634 scopus 로고    scopus 로고
    • Sensor positioning in wireless ad-hoc sensor networks with multidimensional scaling
    • Apr.
    • X. Ji, "Sensor Positioning in Wireless Ad-Hoc Sensor Networks with Multidimensional Scaling," Proc. IEEE INFOCOM '04, Apr. 2004.
    • (2004) Proc. IEEE INFOCOM '04
    • Ji, X.1
  • 40
    • 0014856102 scopus 로고    scopus 로고
    • On graphs and rigidity of plane skeletal structures
    • G. Laman, "On Graphs and Rigidity of Plane Skeletal Structures," J. Eng. Math., vol. 4, pp. 331-340, 2002.
    • (2002) J. Eng. Math. , vol.4 , pp. 331-340
    • Laman, G.1
  • 42
    • 25844459662 scopus 로고    scopus 로고
    • Localization for anisotropic sensor networks
    • Apr.
    • H. Lim and J. Hou, "Localization for Anisotropic Sensor Networks," Proc. IEEE INFOCOM '05, Apr. 2005.
    • (2005) Proc. IEEE INFOCOM '05
    • Lim, H.1    Hou, J.2
  • 43
    • 0005321931 scopus 로고
    • A new graph triconnectivity algorithm and its parallelization
    • G.L. Miller and V. Ramachandran, "A New Graph Triconnectivity Algorithm and Its Parallelization," Combinatorial, vol. 12, pp. 53-76, 1992.
    • (1992) Combinatorial , vol.12 , pp. 53-76
    • Miller, G.L.1    Ramachandran, V.2
  • 45
    • 0031285908 scopus 로고    scopus 로고
    • Global continuation for distance geometry problems
    • J. More and Z. Wu, "Global Continuation for Distance Geometry Problems," SIAM J. Optimization, vol. 7, pp. 814-836, 1997.
    • (1997) SIAM J. Optimization , vol.7 , pp. 814-836
    • More, J.1    Wu, Z.2
  • 48
    • 0033471867 scopus 로고    scopus 로고
    • On k-connectivity for a geometric random graph
    • M.D. Penrose, "On k-Connectivity for a Geometric Random Graph," Random Structures and Algorithms, vol. 15, no. 2, pp. 145-164, 1999.
    • (1999) Random Structures and Algorithms , vol.15 , Issue.2 , pp. 145-164
    • Penrose, M.D.1
  • 51
    • 0003167703 scopus 로고
    • Rigid and flexible frameworks
    • B. Roth, "Rigid and Flexible Frameworks," Am. Math. Monthly, vol. 88, pp. 6-21, 1981.
    • (1981) Am. Math. Monthly , vol.88 , pp. 6-21
    • Roth, B.1
  • 52
  • 55
    • 0038457531 scopus 로고    scopus 로고
    • Constraining plane configurations in CAD: Combinatorics of lengths and directions
    • B. Servatius and W. Whiteley, "Constraining Plane Configurations in CAD: Combinatorics of Lengths and Directions," SIAM J. Discrete Math., vol. 12, pp. 136-153, 1999.
    • (1999) SIAM J. Discrete Math. , vol.12 , pp. 136-153
    • Servatius, B.1    Whiteley, W.2
  • 58
    • 0022911518 scopus 로고
    • NP is as easy as detecting unique solutions
    • L.G. Valiant and V.V. Vazirani, "NP Is as Easy as Detecting Unique Solutions," Theoretical Computer Science, vol. 47, no. 1, pp. 85-93, 1986.
    • (1986) Theoretical Computer Science , vol.47 , Issue.1 , pp. 85-93
    • Valiant, L.G.1    Vazirani, V.V.2
  • 59
    • 84976653144 scopus 로고
    • Some computer science problems in ubiquitous computing
    • July
    • M. Weiser, "Some Computer Science Problems in Ubiquitous Computing," Comm. ACM, July 1993.
    • (1993) Comm. ACM
    • Weiser, M.1
  • 60
    • 0002856165 scopus 로고    scopus 로고
    • Some matroids from discrete applied geometry
    • J.E. Bonin, J.G., Oxley, and B. Servatius, eds., Am. Math. Soc.
    • W. Whiteley, "Some Matroids from Discrete Applied Geometry," Contemporary Math., J.E. Bonin, J.G., Oxley, and B. Servatius, eds., vol. 197, Am. Math. Soc., 1996.
    • (1996) Contemporary Math. , vol.197
    • Whiteley, W.1
  • 61
    • 8744294682 scopus 로고    scopus 로고
    • Rigidity and scene analysis
    • J. Goodman and J. O'Rourke, eds., CRC Press
    • W. Whiteley, "Rigidity and Scene Analysis," Handbook of Discrete and Computational Geometry, J. Goodman and J. O'Rourke, eds., pp. 1327-1354, CRC Press, 2004.
    • (2004) Handbook of Discrete and Computational Geometry , pp. 1327-1354
    • Whiteley, W.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.