Abstract
In this paper, a strip-shaped multi-hop ad hoc network is analyzed using a spatial Poisson point process (PPP) and stochastic geometry. The decode-and-forwardprotocol is considered for transmission over the multi-hop network where cooperative communications is employed at each hop. An analytical expression for the probability density function of the received power at an arbitrary node is derived, given a set of nodes transmits in the previous hop, which is further used to characterize the coverage performance of the network. The received power at a node becomes a doubly stochastic process owing to random path loss and a Rayleigh fading channel. The notions of one-hop success probability and coverage range are analyzed for various network parameters. An algorithm for conserving energy is also proposed by considering PPP thinning and its performance in terms of the fraction of energy saved is quantified. It is shown that the proposed algorithm is more energy efficient as compared with an independent thinning algorithm.
| Original language | English |
|---|---|
| Article number | 7769218 |
| Pages (from-to) | 8925-8937 |
| Number of pages | 13 |
| Journal | IEEE Access |
| Volume | 4 |
| DOIs | |
| Publication status | Published - 2016 |
Fingerprint
Keywords
- Cooperative systems
- energy conservation
- fading channel
- Poisson process
ASJC Scopus subject areas
- Computer Science(all)
- Materials Science(all)
- Engineering(all)
Cite this
Propagation modeling in large-scale cooperative multi-hop Ad hoc networks. / Ahsen, Muhammad; Hassan, Syed Ali; Jayakody, Dushantha Nalin K.
In: IEEE Access, Vol. 4, 7769218, 2016, p. 8925-8937.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Propagation modeling in large-scale cooperative multi-hop Ad hoc networks
AU - Ahsen, Muhammad
AU - Hassan, Syed Ali
AU - Jayakody, Dushantha Nalin K.
PY - 2016
Y1 - 2016
N2 - In this paper, a strip-shaped multi-hop ad hoc network is analyzed using a spatial Poisson point process (PPP) and stochastic geometry. The decode-and-forwardprotocol is considered for transmission over the multi-hop network where cooperative communications is employed at each hop. An analytical expression for the probability density function of the received power at an arbitrary node is derived, given a set of nodes transmits in the previous hop, which is further used to characterize the coverage performance of the network. The received power at a node becomes a doubly stochastic process owing to random path loss and a Rayleigh fading channel. The notions of one-hop success probability and coverage range are analyzed for various network parameters. An algorithm for conserving energy is also proposed by considering PPP thinning and its performance in terms of the fraction of energy saved is quantified. It is shown that the proposed algorithm is more energy efficient as compared with an independent thinning algorithm.
AB - In this paper, a strip-shaped multi-hop ad hoc network is analyzed using a spatial Poisson point process (PPP) and stochastic geometry. The decode-and-forwardprotocol is considered for transmission over the multi-hop network where cooperative communications is employed at each hop. An analytical expression for the probability density function of the received power at an arbitrary node is derived, given a set of nodes transmits in the previous hop, which is further used to characterize the coverage performance of the network. The received power at a node becomes a doubly stochastic process owing to random path loss and a Rayleigh fading channel. The notions of one-hop success probability and coverage range are analyzed for various network parameters. An algorithm for conserving energy is also proposed by considering PPP thinning and its performance in terms of the fraction of energy saved is quantified. It is shown that the proposed algorithm is more energy efficient as compared with an independent thinning algorithm.
KW - Cooperative systems
KW - energy conservation
KW - fading channel
KW - Poisson process
UR - http://www.scopus.com/inward/record.url?scp=85009090880&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85009090880&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2016.2635718
DO - 10.1109/ACCESS.2016.2635718
M3 - Article
VL - 4
SP - 8925
EP - 8937
JO - IEEE Access
JF - IEEE Access
SN - 2169-3536
M1 - 7769218
ER -