On the modeling of randomized distributed cooperation for linear multi-hop networks

Author

Hassan, S.A. ; Ingram, M.A.

Author_Institution

Sch. of EECS, Nat. Univ. of Sci. & Technol., Islamabad, Pakistan

fYear

2012

fDate

10-15 June 2012

Firstpage

366

Lastpage

370

Abstract

A one-dimensional cooperative network is modeled stochastically, such that the nodes are randomly placed according to a Bernoulli process. A discrete time quasi-stationary Markov chain model is considered to characterize the multi-hop transmissions and its transition probability matrix has been derived. By the Perron-Frobenious theorem, the eigen-decomposition of the matrix gives useful information about the coverage of the network and signal-to-noise (SNR) margin that is required for obtaining a given quality of service or packet delivery ratio. An SNR penalty for the random placement of nodes, compared to regular placement, is quantified.

Keywords

Markov processes; cooperative communication; discrete time systems; eigenvalues and eigenfunctions; matrix algebra; probability; quality of service; Bernoulli process; Perron-Frobenious theorem; SNR margin; SNR penalty; discrete time quasistationary Markov chain model; linear multihop networks; matrix eigen-decomposition; one-dimensional cooperative network; packet delivery ratio; quality of service; random nodes placement; randomized distributed cooperation; signal-to-noise margin; transition probability matrix; Ad hoc networks; Eigenvalues and eigenfunctions; Markov processes; Quality of service; Receivers; Signal to noise ratio; Spread spectrum communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications (ICC), 2012 IEEE International Conference on

Conference_Location

Ottawa, ON

ISSN

1550-3607

Print_ISBN

978-1-4577-2052-9

Electronic_ISBN

1550-3607

Type

conf

DOI

10.1109/ICC.2012.6363675

Filename

6363675