An analysis of k-connectivity in shadowing and nakagami fading wireless multi-hop networks

Lili Zhang; Boon Hee Soong; Yan Zhang; Maode Ma; Yongliang Guan

doi:10.1109/VETECS.2008.94

An analysis of k-connectivity in shadowing and nakagami fading wireless multi-hop networks

Lili Zhang^*, Boon Hee Soong, Yan Zhang, Maode Ma, Yongliang Guan

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

7 Citations (Scopus)

Abstract

In this paper, we develop k-connectivity in wireless multi-hop networks in the presence of both the lognormal shadowing and Nakagami-m fading. The formula are generally applicable in a variety of realistic physical situations. Based on the results, we are able to find the critical node density to satisfy node k-connectivity almost with probability 1. In addition, k-connectivity shows significant difference with distinct channel conditions, which necessitates a generic result. The result is useful for the design of a wireless multi-hop network in practice.

Original language	English
Title of host publication	2008 IEEE 67th Vehicular Technology Conference-Spring, VTC
Pages	395-399
Number of pages	5
DOIs	https://doi.org/10.1109/VETECS.2008.94
Publication status	Published - 2008
Externally published	Yes
Event	2008 IEEE 67th Vehicular Technology Conference-Spring, VTC - Marina Bay, Singapore Duration: May 11 2008 → May 14 2008

Publication series

Name	IEEE Vehicular Technology Conference
ISSN (Print)	1550-2252

Conference

Conference	2008 IEEE 67th Vehicular Technology Conference-Spring, VTC
Country/Territory	Singapore
City	Marina Bay
Period	5/11/08 → 5/14/08

ASJC Scopus Subject Areas

Computer Science Applications
Electrical and Electronic Engineering
Applied Mathematics

Access to Document

10.1109/VETECS.2008.94

Cite this

@inproceedings{78223cacbca342a89c63676d8e11cd88,

title = "An analysis of k-connectivity in shadowing and nakagami fading wireless multi-hop networks",

abstract = "In this paper, we develop k-connectivity in wireless multi-hop networks in the presence of both the lognormal shadowing and Nakagami-m fading. The formula are generally applicable in a variety of realistic physical situations. Based on the results, we are able to find the critical node density to satisfy node k-connectivity almost with probability 1. In addition, k-connectivity shows significant difference with distinct channel conditions, which necessitates a generic result. The result is useful for the design of a wireless multi-hop network in practice.",

author = "Lili Zhang and Soong, {Boon Hee} and Yan Zhang and Maode Ma and Yongliang Guan",

year = "2008",

doi = "10.1109/VETECS.2008.94",

language = "English",

isbn = "9781424416455",

series = "IEEE Vehicular Technology Conference",

pages = "395--399",

booktitle = "2008 IEEE 67th Vehicular Technology Conference-Spring, VTC",

note = "2008 IEEE 67th Vehicular Technology Conference-Spring, VTC ; Conference date: 11-05-2008 Through 14-05-2008",

}

Zhang, L, Soong, BH, Zhang, Y, Ma, M & Guan, Y 2008, An analysis of k-connectivity in shadowing and nakagami fading wireless multi-hop networks. in 2008 IEEE 67th Vehicular Technology Conference-Spring, VTC., 4525650, IEEE Vehicular Technology Conference, pp. 395-399, 2008 IEEE 67th Vehicular Technology Conference-Spring, VTC, Marina Bay, Singapore, 5/11/08. https://doi.org/10.1109/VETECS.2008.94

TY - GEN

T1 - An analysis of k-connectivity in shadowing and nakagami fading wireless multi-hop networks

AU - Zhang, Lili

AU - Soong, Boon Hee

AU - Zhang, Yan

AU - Ma, Maode

AU - Guan, Yongliang

PY - 2008

Y1 - 2008

N2 - In this paper, we develop k-connectivity in wireless multi-hop networks in the presence of both the lognormal shadowing and Nakagami-m fading. The formula are generally applicable in a variety of realistic physical situations. Based on the results, we are able to find the critical node density to satisfy node k-connectivity almost with probability 1. In addition, k-connectivity shows significant difference with distinct channel conditions, which necessitates a generic result. The result is useful for the design of a wireless multi-hop network in practice.

AB - In this paper, we develop k-connectivity in wireless multi-hop networks in the presence of both the lognormal shadowing and Nakagami-m fading. The formula are generally applicable in a variety of realistic physical situations. Based on the results, we are able to find the critical node density to satisfy node k-connectivity almost with probability 1. In addition, k-connectivity shows significant difference with distinct channel conditions, which necessitates a generic result. The result is useful for the design of a wireless multi-hop network in practice.

UR - http://www.scopus.com/inward/record.url?scp=47749154906&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=47749154906&partnerID=8YFLogxK

U2 - 10.1109/VETECS.2008.94

DO - 10.1109/VETECS.2008.94

M3 - Conference contribution

AN - SCOPUS:47749154906

SN - 9781424416455

T3 - IEEE Vehicular Technology Conference

SP - 395

EP - 399

BT - 2008 IEEE 67th Vehicular Technology Conference-Spring, VTC

T2 - 2008 IEEE 67th Vehicular Technology Conference-Spring, VTC

Y2 - 11 May 2008 through 14 May 2008

ER -

An analysis of k-connectivity in shadowing and nakagami fading wireless multi-hop networks

Abstract

Publication series

Conference

ASJC Scopus Subject Areas

Access to Document

Other files and links

Fingerprint

Cite this