메뉴 건너뛰기




Volumn 9, Issue 4, 2013, Pages

Results on finite wireless sensor networks: Connectivity and coverage

Author keywords

Connectivity; Coverage; Data communications; Finite networks; Random geometric graphs; Unreliable grids; Wireless sensor networks

Indexed keywords

COMPUTER NETWORKS; SENSOR NETWORKS; WIRELESS SENSOR NETWORKS;

EID: 84897001494     PISSN: 15504859     EISSN: 15504867     Source Type: Journal    
DOI: 10.1145/2489253.2489268     Document Type: Conference Paper
Times cited : (6)

References (40)
  • 3
    • 4344610803 scopus 로고    scopus 로고
    • The distance-2 matching problem and its relationship to mac-layer capacity of ad hoc wireless networks
    • Balakrishan, H., Barrett, C. L., Kumar, V. S. A., Marathe, M. V., And Thite, S. 2004. The Distance-2 Matching Problem And Its Relationship To Mac-Layer Capacity Of Ad Hoc Wireless Networks. Ieee J. Select. Areas Commun. 22, 1069-1079.
    • (2004) Ieee J. Select. Areas Commun. , vol.22 , pp. 1069-1079
    • Balakrishan, H.1    Barrett, C.L.2    Kumar, V.S.A.3    Marathe, M.V.4    Thite, S.5
  • 7
    • 11944253901 scopus 로고    scopus 로고
    • 2Nd Ed. Cambridge University Press, Cambridge, U.K
    • Bollobas, B. 2001. Random Graphs 2Nd Ed. Cambridge University Press, Cambridge, U.K.
    • (2001) Random Graphs
    • Bollobas, B.1
  • 8
    • 21144445765 scopus 로고    scopus 로고
    • Covering algorithms, continuum percolation and the geometry of wireless networks
    • Booth, L., Bruck, J., Franceschetti, M., And Meester, R. 2003. Covering Algorithms, Continuum Percolation And The Geometry Of Wireless Networks. Ann. Appl. Probab. 13, 2.
    • (2003) Ann. Appl. Probab , vol.13 , pp. 2
    • Booth, L.1    Bruck, J.2    Franceschetti, M.3    Meester, R.4
  • 9
    • 24644495240 scopus 로고    scopus 로고
    • Continuum percolation with unreliable and spread out connections
    • Booth, L., Bruck, J., Cook, M., Franceschetti, M., And Meester, R. 2005. Continuum Percolation With Unreliable And Spread Out Connections. J. Stat. Physics 118, 3-4, 721-734.
    • (2005) J. Stat. Physics , vol.118 , Issue.3-4 , pp. 721-734
    • Booth, L.1    Bruck, J.2    Cook, M.3    Franceschetti, M.4    Meester, R.5
  • 10
    • 0036810628 scopus 로고    scopus 로고
    • On the connectivity in finite ad hoc networks
    • Desai, M. Andmanjunath, D. 2002. On The Connectivity In Finite Ad Hoc Networks. Ieee Communi. Lett. 6, 10, 437-439.
    • (2002) Ieee Communi. Lett. , vol.6 , Issue.10 , pp. 437-439
    • Desai, M.1    Manjunath, D.2
  • 11
    • 33745179499 scopus 로고    scopus 로고
    • On the throughput scaling of wireless relay networks
    • Dousse, O., Franceschetti, M., And Thiran, P. 2006. On The Throughput Scaling Of Wireless Relay Networks. Ieee Trans. Inform. Theory 52, 6, 2756-2761.
    • (2006) Ieee Trans. Inform. Theory , vol.52 , Issue.6 , pp. 2756-2761
    • Dousse, O.1    Franceschetti, M.2    Thiran, P.3
  • 15
    • 77956210432 scopus 로고    scopus 로고
    • Results on finite wireless networks on a line
    • Eslami, A., Nekoui, M., And Pishro-Nik, H. 2010. Results On Finite Wireless Networks On A Line. Ieee Trans. Communi. 58, 8, 2204-2211.
    • (2010) Ieee Trans. Communi. , vol.58 , Issue.8 , pp. 2204-2211
    • Eslami, A.1    Nekoui, M.2    Pishro-Nik, H.3
  • 16
    • 0002748055 scopus 로고
    • Correlation inequalities on some partially ordered sets
    • Fortuin, C. M., Kasteleyn, P. W., And Ginibre, J. 1971. Correlation Inequalities On Some Partially Ordered Sets. Commun. Math. Physics 22, 2, 89-103.
    • (1971) Commun. Math. Physics , vol.22 , Issue.2 , pp. 89-103
    • Fortuin, C.M.1    Kasteleyn, P.W.2    Ginibre, J.3
  • 18
    • 33745173440 scopus 로고    scopus 로고
    • Critical node lifetimes in random networks via the chen-stein method
    • Freanceschetti, M. And Meester, R. 2006. Critical Node Lifetimes In Random Networks Via The Chen-Stein Method. Ieee Trans. Inform. Theory 52, 2, 2831-2837.
    • (2006) Ieee Trans. Inform. Theory , vol.52 , Issue.2 , pp. 2831-2837
    • Freanceschetti, M.1    Meester, R.2
  • 19
    • 33645827349 scopus 로고    scopus 로고
    • Exact probability of connectivity in one-dimensional ad hoc wireless networks
    • Ghasemi, A. Andnader-Esfahani, S. 2006. Exact Probability Of Connectivity In One-Dimensional Ad Hoc Wireless Networks. Ieee Commun. Lett. 10, 251-253.
    • (2006) Ieee Commun. Lett. , vol.10 , pp. 251-253
    • Ghasemi, A.1    Nader-Esfahani, S.2
  • 20
    • 32444440984 scopus 로고    scopus 로고
    • Comments on the connectivity in finite ad hoc networks
    • Gore, A. 2006. Comments On The Connectivity In Finite Ad Hoc Networks. Ieee Communi. Lett. 10, 2, 88-90.
    • (2006) Ieee Communi. Lett. , vol.10 , Issue.2 , pp. 88-90
    • Gore, A.1
  • 23
    • 33747142749 scopus 로고    scopus 로고
    • The capacity of wireless networks
    • Gupta, P. And Kumar, P. R. 2000. The Capacity Of Wireless Networks. Ieee Trans. Inform. Theory 46, 2, 388-404.
    • (2000) Ieee Trans. Inform. Theory , vol.46 , Issue.2 , pp. 388-404
    • Gupta, P.1    Kumar, P.R.2
  • 24
    • 0043268120 scopus 로고    scopus 로고
    • Towards an information theory of large networks: An achievable rate region
    • Gupta, P. And Kumar, P. R. 2003. Towards An Information Theory Of Large Networks: An Achievable Rate Region. Ieee Trans. Inform. Theory 49, 1877-1894.
    • (2003) Ieee Trans. Inform. Theory , vol.49 , pp. 1877-1894
    • Gupta, P.1    Kumar, P.R.2
  • 25
    • 0001337216 scopus 로고
    • Random coverings in several dimensions
    • Janson, S. 1986. Random Coverings In Several Dimensions. Acta Mathematica 156.
    • (1986) Acta Mathematica , vol.156
    • Janson, S.1
  • 28
    • 43949127767 scopus 로고    scopus 로고
    • On k-coverage in mostly sleeping sensor network
    • Kumar, S., Lai, T. H., And Balogh, J. 2008. On K-Coverage In Mostly Sleeping Sensor Network. Wireless Netw. 277-294.
    • (2008) Wireless Netw. , pp. 277-294
    • Kumar, S.1    Lai, T.H.2    Balogh, J.3
  • 32
  • 34
    • 0031287494 scopus 로고    scopus 로고
    • The longest edge of the random minimal spanning tree
    • Penrose, M. D. 1997. The Longest Edge Of The Random Minimal Spanning Tree. Ann. Appl. Probab. 7, 2, 340-361.
    • (1997) Ann. Appl. Probab , vol.7 , Issue.2 , pp. 340-361
    • Penrose, M.D.1
  • 39
    • 1042289031 scopus 로고    scopus 로고
    • The number of neighbors needed for connectivity of wireless networks
    • Xue, F. And Kumar, P. R. 2004. The Number Of Neighbors Needed For Connectivity Of Wireless Networks.Wireless Netw. 10, 2, 169-181.
    • (2004) Wireless Netw , vol.10 , Issue.2 , pp. 169-181
    • Xue, F.1    Kumar, P.R.2


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