Analysis of Wireless Ad-Hoc and Sensor Networks in Finite Regime

Pishro-Nik, Hossein; Fekri, Faramarz

doi:10.1109/sahcn.2008.19

Cited by 4 publications

(3 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, in real world we have to face small or moderate-size networks which consist of a limited number of nodes. As previously shown by the authors, asymptotic results often cease to be valid for such networks [11], [12]. Here, we study a model which is extensively used in analyzing these networks: the random geometric graph.…”

Section: Introductionmentioning

confidence: 93%

“…Moving on, we extend our approach to other models of random networks such as networks with random Poisson node deployment and unreliable sensor grids. Note that previous studies on finite networks are limited to specific properties such as coverage and connectivity (see for example [11]- [16]). However, our method is a comprehensive one which leads to a bound, true for all monotone properties.…”

Section: Introductionmentioning

confidence: 99%

“…The MAC-layer capacity is defined in [17] as the maximum possible number of concurrent transmissions at the medium access layer. However, the asymptotic result obtained there is not as precise when we consider finite networks [11]. In this paper, we analyze the average MAC-layer capacity for finite line networks.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Results on Finite Wireless Networks on a Line

Eslami

Nekoui

Pishro-Nik

2010

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real world we have to face finite networks for which the asymptotic results cease to be valid. We refer to networks as being finite when the number of nodes is less than a few hundred. Here we study a model of wireless networks, represented by random geometric graphs. In order to address a wide class of the network's properties, we study the threshold phenomena. Being extensively studied in the asymptotic case, the threshold phenomena occurs when a graph theoretic property (such as connectivity) of the network experiences rapid changes over a specific interval of the underlying parameter. Here, we find an upper bound for the threshold width of finite line networks represented by random geometric graphs. These bounds hold for all monotone properties of such networks. We then turn our attention to an important non-monotone characteristic of line networks which is the medium access (MAC) layer capacity, i.e. the maximum number of possible concurrent transmissions. Towards this goal, we provide an algorithm which finds a maximal set of concurrent non-interfering transmissions and further derive lower and upper bounds for the cardinality of the set. Using simulations, we show that these bounds serve as reasonable estimates for the actual value of the MAC-layer capacity.

show abstract

Section: Introductionmentioning

confidence: 93%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Results on Finite Wireless Networks on a Line

Eslami

Nekoui

Pishro-Nik

2010

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

Results on finite wireless networks on a line

Eslami

Nekoui

Pishro-Nik

2010

IEEE Information Theory Workshop 2010 (ITW 2010)

View full text Add to dashboard Cite

Today, due to the vast amount of literature on large-scale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real world we have to face finite networks for which the asymptotic results cease to be valid. We refer to networks as being finite when the number of nodes is less than a few hundred. Here we study a model of wireless networks, represented by random geometric graphs. In order to address a wide class of the network's properties, we study the threshold phenomena. Being extensively studied in the asymptotic case, the threshold phenomena occurs when a graph theoretic property (such as connectivity) of the network experiences rapid changes over a specific interval of the underlying parameter. Here, we find an upper bound for the threshold width of finite line networks represented by random geometric graphs. These bounds hold for all monotone properties of such networks. We then turn our attention to an important non-monotone characteristic of line networks which is the medium access (MAC) layer capacity, i.e. the maximum number of possible concurrent transmissions. Towards this goal, we provide an algorithm which finds a maximal set of concurrent non-interfering transmissions and further derive lower and upper bounds for the cardinality of the set. Using simulations, we show that these bounds serve as reasonable estimates for the actual value of the MAC-layer capacity.

show abstract

First passage time and first passage percolation models for analysing network resilience and effective strategies in strategic information warfare research: a brief survey and perspective

2013

IJICS

View full text Add to dashboard Cite

Analysis of Wireless Ad-Hoc and Sensor Networks in Finite Regime

Cited by 4 publications

References 37 publications

Results on Finite Wireless Networks on a Line

Results on Finite Wireless Networks on a Line

Results on finite wireless networks on a line

First passage time and first passage percolation models for analysing network resilience and effective strategies in strategic information warfare research: a brief survey and perspective

Contact Info

Product

Resources

About