Title :
Filling Gap between Discrete and Continuous Space Flow Models in Dense Wireless Networks
Author :
Anaraki, Sina Z. ; Kalantari, Mehdi
Author_Institution :
Electr. & Comput. Eng. Dept., Univ. of Maryland, College Park, MD, USA
Abstract :
Optimizing information flow in a dense wireless network using discrete methods can be computationally prohibitive. Instead of treating the nodes as discrete entities, these networks can be modeled as continuum of nodes providing a medium for information transport. To model information routes in continuous space, information flow vector field is defined over the geographical domain of the network. At each point of the network, the orientation of the vector field shows the direction of the flow of information, and its magnitude shows the density of information flow. Using multivariate calculus techniques in continuous domain, an information flow vector field can be found such that it minimizes a suitable cost function. Then the solution is discretized. Conventionally, a centralized method of calculating the optimal information flow in the network is suggested; however, using a centralized method to optimize information flow in a dynamic network is prohibitive. Additionally, the value of information flow vector field is needed only at the locations of nodes in the network. This poses a gap between the continuous space and discrete space models of information flow in dense wireless networks. This gap is how to calculate and apply the optimum information flow derived in continuous domain in a network with finite number of nodes. As a first step to fill this gap, a specific quadratic cost function is considered. It is proved that the the vector field that minimizes this cost function is irrotational, thus it is written as the gradient of a potential function. This potential function satisfies a Poisson Partial Differential Equation (PDE) which in conjunction with Neumann boundary condition has a unique solution up to a constant. The PDE resulted by optimization in continuous domain is first discretized and then solved in a distributed fashion. The solution requires only neighboring nodes to communicate with each other. The gradient of the resulting potential defines the r- - outes that the traffic should be forwarded.
Keywords :
optimisation; partial differential equations; radio networks; Neumann boundary condition; Poisson partial differential equation; continuous space flow model; dense wireless networks; discrete space flow model; information flow vector field; information transport; optimal information flow; optimization; quadratic cost function; Boundary conditions; Computational modeling; Cost function; Equations; Mathematical model; Peer to peer computing; Wireless networks;
Conference_Titel :
Communications (ICC), 2011 IEEE International Conference on
Conference_Location :
Kyoto
Print_ISBN :
978-1-61284-232-5
Electronic_ISBN :
1550-3607
DOI :
10.1109/icc.2011.5962992