TY - GEN

T1 - Traffic matrix estimation in a dense multihop wireless network

AU - Hyytiä, Esa

PY - 2006

Y1 - 2006

N2 - The traffic matrix estimation based on the measurements at the certain points of a fixed network poses an interesting problem, which has also been studied extensively in the literature. In this paper, we consider a similar problem in the setting of dense multihop wireless network. In particular, we assume a large number of nodes with multihop routes using the shortest path routing, so that the routes can be modelled as straight line segments. Furthermore, we assume that we are able to measure the number of transmissions occurring in the different parts of the network during the measurement periods. In this setting we study the problem of inferring the end-to-end traffic demands (traffic matrix) based on the available information. As this information is not sufficient we make some additional Poissonian assumptions on the nature of the traffic in order to have a well-defined problem with a unique solution. Analysing the problem in the framework of stochastic geometry, we are able to give an exact solution for the formulated traffic matrix estimation problem. The methodology is further illustrated by numerical examples.

AB - The traffic matrix estimation based on the measurements at the certain points of a fixed network poses an interesting problem, which has also been studied extensively in the literature. In this paper, we consider a similar problem in the setting of dense multihop wireless network. In particular, we assume a large number of nodes with multihop routes using the shortest path routing, so that the routes can be modelled as straight line segments. Furthermore, we assume that we are able to measure the number of transmissions occurring in the different parts of the network during the measurement periods. In this setting we study the problem of inferring the end-to-end traffic demands (traffic matrix) based on the available information. As this information is not sufficient we make some additional Poissonian assumptions on the nature of the traffic in order to have a well-defined problem with a unique solution. Analysing the problem in the framework of stochastic geometry, we are able to give an exact solution for the formulated traffic matrix estimation problem. The methodology is further illustrated by numerical examples.

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

U2 - 10.1109/ISCN.2006.1662500

DO - 10.1109/ISCN.2006.1662500

M3 - Conference contribution

AN - SCOPUS:34247513990

SN - 1424404916

SN - 9781424404919

T3 - Proceedings of ISCN'06: 7th International Symosium on Computer Networks

BT - Proceedings of ISCN'06

T2 - ISCN'06: 7th International Symosium on Computer Networks

Y2 - 16 June 2006 through 18 June 2006

ER -