메뉴 건너뛰기




Volumn , Issue , 2009, Pages 121-132

Mobility increases the connectivity of K-hop clustered wireless networks

Author keywords

Clustered networks; Connectivity; Mobility; Scaling law

Indexed keywords

AVERAGE ENERGY; CLUSTER HEAD; CLUSTERED NETWORKS; CRITICAL TRANSMISSION RANGES; ENERGY CONSUMPTION; MOBILITY MODEL; MOBILITY SCALING; NETWORK DESIGN; NON-TRIVIAL; POWER-DELAY TRADEOFF; RANDOM WALK MOBILITY; TRANSMISSION DELAYS; TRANSMISSION POWER; WIRELESS SENSOR;

EID: 70450225367     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1614320.1614334     Document Type: Conference Paper
Times cited : (43)

References (27)
  • 1
    • 70450266295 scopus 로고    scopus 로고
    • P. Gupta and P.R. Kumar, Critical Power for Asymptotic Connectivity in Wireless Networks, Stochastic Analysis, Control, Optimization and Applications: A in Honor of W.H. Fleming, W.M. McEneaney, G. Yin, and Q. Zhang, Boston: Birkhauser, 1998.
    • P. Gupta and P.R. Kumar, "Critical Power for Asymptotic Connectivity in Wireless Networks," Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, W.M. McEneaney, G. Yin, and Q. Zhang, Boston: Birkhauser, 1998.
  • 2
    • 0031287494 scopus 로고    scopus 로고
    • The Longest Edge of the Random Minimal Spanning Tree
    • M.D. Penrose, "The Longest Edge of the Random Minimal Spanning Tree," Annals of Applied Probability, vol. 7, pp. 340-361, 1997.
    • (1997) Annals of Applied Probability , vol.7 , pp. 340-361
    • Penrose, M.D.1
  • 3
    • 4444249060 scopus 로고    scopus 로고
    • Asymtotic Critical Transmission Radius and Critical Neighbor Number for K-connectivity in Wireless Ad Hoc Networks
    • Japan, May 24-26
    • P. Wan and C.W. Yi, "Asymtotic Critical Transmission Radius and Critical Neighbor Number for K-connectivity in Wireless Ad Hoc Networks," in Proc. ACM MobiHoc 2004, Roppongi, Japan, May 24-26, 2004.
    • (2004) Proc. ACM MobiHoc 2004, Roppongi
    • Wan, P.1    Yi, C.W.2
  • 4
    • 1042289031 scopus 로고    scopus 로고
    • The Number of Neighbors Needed for Connectivity of Wireless Networks
    • F. Xue and P.R. Kumar, "The Number of Neighbors Needed for Connectivity of Wireless Networks," Wireless Networks, vol. 10, no. 2, pp. 169-181, 2004.
    • (2004) Wireless Networks , vol.10 , Issue.2 , pp. 169-181
    • Xue, F.1    Kumar, P.R.2
  • 5
    • 0035009294 scopus 로고    scopus 로고
    • Distributed Topology Control for Power Efficient Operation in Multi-hop Wireless Ad Hoc Networks
    • Anchorage, AK, USA, April
    • R. Wattenhofer, L. Li, P. Bahl and Y.M. Wang, "Distributed Topology Control for Power Efficient Operation in Multi-hop Wireless Ad Hoc Networks," in Proc. IEEE INFOCOM 2001, pp. 1388-1397, Anchorage, AK, USA, April 2001.
    • (2001) Proc. IEEE INFOCOM , pp. 1388-1397
    • Wattenhofer, R.1    Li, L.2    Bahl, P.3    Wang, Y.M.4
  • 12
    • 0042433239 scopus 로고    scopus 로고
    • Power Control and Clustering in Ad Hoc Networks
    • San Francisco, CA, USA, March 30-April 3
    • V. Kawadia and P. R. Kumar, "Power Control and Clustering in Ad Hoc Networks," in Proc. IEEE INFOCOM 2003, vol. 1, pp. 459-469, San Francisco, CA, USA, March 30-April 3, 2003.
    • (2003) Proc. IEEE INFOCOM , vol.1 , pp. 459-469
    • Kawadia, V.1    Kumar, P.R.2
  • 13
    • 0033906585 scopus 로고    scopus 로고
    • Max-Min D-Cluster Formation in Wireless Ad Hoc Networks
    • Tel Aviv, Israel
    • A.D. Amis, R. Prakash, T.H.P. Vuong and D.T. Huynh, "Max-Min D-Cluster Formation in Wireless Ad Hoc Networks," in Proceedings of INFOCOM 2000, vol. 1, pp. 32-41, Tel Aviv, Israel, 2000.
    • (2000) Proceedings of INFOCOM , vol.1 , pp. 32-41
    • Amis, A.D.1    Prakash, R.2    Vuong, T.H.P.3    Huynh, D.T.4
  • 15
    • 0041472588 scopus 로고    scopus 로고
    • An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks
    • San Francisco, CA, USA, March 30-April 3
    • S. Bandyopadhyay and E.J. Coyle, "An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks," in Proc. IEEE INFOCOM 2003, vol. 3, pp. 1713-1723, San Francisco, CA, USA, March 30-April 3, 2003.
    • (2003) Proc. IEEE INFOCOM , vol.3 , pp. 1713-1723
    • Bandyopadhyay, S.1    Coyle, E.J.2
  • 17
    • 8344229909 scopus 로고    scopus 로고
    • A Cluster-based Security Architecture for Ad Hoc Networks
    • Hong Kong, China, Mar
    • M. Bechler, H.J. Hofi, D. Kraft, F. Pählke and L. Wolf, "A Cluster-based Security Architecture for Ad Hoc Networks," in Proc. IEEE INFOCOM 2004, vol. 4, pp. 2393-2403, Hong Kong, China, Mar 2004.
    • (2004) Proc. IEEE INFOCOM , vol.4 , pp. 2393-2403
    • Bechler, M.1    Hofi, H.J.2    Kraft, D.3    Pählke, F.4    Wolf, L.5
  • 18
    • 0012797660 scopus 로고    scopus 로고
    • WCA: A Weighted Clustering Algorithm for Mobile Ad hoc networks
    • April
    • M. Chatterjee, S.K. Das and D. Turgut, "WCA: A Weighted Clustering Algorithm for Mobile Ad hoc networks," Cluster Computing, vol. 5, no. 2, pp. 193-204, April 2002.
    • (2002) Cluster Computing , vol.5 , Issue.2 , pp. 193-204
    • Chatterjee, M.1    Das, S.K.2    Turgut, D.3
  • 19
    • 1542269187 scopus 로고    scopus 로고
    • Throughput capacity of random ad hoc networks with infrastructure support
    • Annapolis, MD, USA, June
    • U. Kozat and L. Tassiulas, "Throughput capacity of random ad hoc networks with infrastructure support," in Proc. ACM MobiCom 2003, Annapolis, MD, USA, June 2003.
    • (2003) Proc. ACM MobiCom
    • Kozat, U.1    Tassiulas, L.2
  • 20
    • 0036670170 scopus 로고    scopus 로고
    • Mobility Increases the Capacity of Ad Hoc Wireless Networks
    • August
    • M. Grossglauser and D. Tse, "Mobility Increases the Capacity of Ad Hoc Wireless Networks," IEEE/ACM Transactions on Networking, vol. 10, no. 4, pp. 477-486, August 2002.
    • (2002) IEEE/ACM Transactions on Networking , vol.10 , Issue.4 , pp. 477-486
    • Grossglauser, M.1    Tse, D.2
  • 21
    • 0242527339 scopus 로고    scopus 로고
    • Mobility Helps Security in Ad Hoc Networks, in Proc
    • June
    • S. Čapkun, J. Hubaux and L. Buttyán, "Mobility Helps Security in Ad Hoc Networks," in Proc. ACM MobiHoc 2003, June 2003.
    • (2003) ACM MobiHoc 2003
    • Čapkun, S.1    Hubaux, J.2    Buttyán, L.3
  • 23
    • 34548317545 scopus 로고    scopus 로고
    • RMAC: A Routing-Enhanced Duty-Cycle MAC Protocol for Wireless Sensor Networks
    • Anchorage, AK, USA, May
    • Shu Du, David B. Johnson, and Amit Kumar Saha, "RMAC: A Routing-Enhanced Duty-Cycle MAC Protocol for Wireless Sensor Networks," in Proc. IEEE INFOCOM 2007, pp. 1478-1486, Anchorage, AK, USA, May 2007.
    • (2007) Proc. IEEE INFOCOM , pp. 1478-1486
    • Du, S.1    Johnson, D.B.2    Kumar Saha, A.3
  • 24
    • 57349119839 scopus 로고    scopus 로고
    • Yanjun Sun, Shu Du, Omer Gurewitz, and David B. Johnson, DW-MAC: A Low Latency, Energy Efficient Demand-Wakeup MAC Protocol for Wireless Sensor Networks, in Proc. ACM MobiHoc 2008, pp. 53-62, ACM, Hong Kong SAR, China, May 2008.
    • Yanjun Sun, Shu Du, Omer Gurewitz, and David B. Johnson, "DW-MAC: A Low Latency, Energy Efficient Demand-Wakeup MAC Protocol for Wireless Sensor Networks," in Proc. ACM MobiHoc 2008, pp. 53-62, ACM, Hong Kong SAR, China, May 2008.
  • 27
    • 4444236383 scopus 로고    scopus 로고
    • S. Toumpis, Capacity Bounds for Three Classes of Wireless Networks: Asymmetric, Cluster, and Hybrid, in Proc. ACM MobHoc 2004, pp. 133-144, Roppongi, Japan, May 24-26, 2004.
    • S. Toumpis, "Capacity Bounds for Three Classes of Wireless Networks: Asymmetric, Cluster, and Hybrid," in Proc. ACM MobHoc 2004, pp. 133-144, Roppongi, Japan, May 24-26, 2004.


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