- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Abstract and Applied Analysis

Volume 2013 (2013), Article ID 262581, 16 pages

http://dx.doi.org/10.1155/2013/262581

## Continuum Modeling and Control of Large Nonuniform Wireless Networks via Nonlinear Partial Differential Equations

^{1}Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO 80523-1373, USA^{2}Department of Statistics and Operation Research, The University of North Carolina at Chapel Hill, Chapel Hill, NC 27599-3260, USA^{3}Department of Statistics, Colorado State University, Fort Collins, CO 80523-1373, USA

Received 4 January 2013; Revised 27 February 2013; Accepted 8 March 2013

Academic Editor: Lan Xu

Copyright © 2013 Yang Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

We introduce a continuum modeling method to approximate a class of large wireless networks by nonlinear partial differential equations (PDEs). This method is based on the convergence of a sequence of underlying Markov chains of the network indexed by , the number of nodes in the network. As goes to infinity, the sequence converges to a continuum limit, which is the solution of a certain nonlinear PDE. We first describe PDE models for networks with uniformly located nodes and then generalize to networks with nonuniformly located, and possibly mobile, nodes. Based on the PDE models, we develop a method to control the transmissions in nonuniform networks so that the continuum limit is invariant under perturbations in node locations. This enables the networks to maintain stable global characteristics in the presence of varying node locations.

#### 1. Introduction

This paper is concerned with modeling and control of large stochastic networks via nonlinear partial differential equations (PDEs). Recently, we introduced a continuum modeling method for large wireless networks modeled by a certain class of Markov chains. We start with a family of networks indexed by , the number of nodes, and a related sequence of Markov chains. Under appropriate conditions, the sequence of Markov chains converges in a certain sense to a continuum limit, which is the solution of a nonlinear PDE, as goes to infinity. Therefore we can use the limiting PDE to approximate the large network [1–5]. This result assumed uniform networks, that is, networks with immobile and uniformly located nodes. Moreover, the model assumes that the nodes have a *fixed* transmission range in the sense that they communicate (exchange data and interfere) only with their immediate neighbors.

The work in this paper builds on the above method. We consider nonuniform networks, that is, networks with nonuniformly located and possibly mobile nodes. We also consider nodes with more general transmission ranges; that is, they may communicate with neighbors further away than immediate ones. For such networks, a natural problem would be to find their continuum limits (the limiting PDEs). A less obvious but more interesting problem concerns the control of nonuniform networks. For example, suppose that a uniform network with certain transmissions achieves a steady state that is desirable in terms of global traffic distribution (e.g., load is well balanced over the network). Further suppose that we want the network to maintain such global characteristics if the nodes are no longer at their original uniform locations. Then the problem is to control the transmissions in the network such that its continuum limit remains invariant.

We address these problems as follows. First, we present a more general network model than that in the existing results [1, 2] and derive its limiting PDEs in the setting of uniform node locations. This generalization is necessary for the discussion of the control of nonuniform networks later. Second, through transformation between uniform and nonuniform node locations, we derive limiting PDEs for nonuniform networks. Finally, by comparing the limiting PDEs of corresponding uniform and nonuniform networks, we develop a method to control the transmissions of nonuniform networks so that the continuum limit is invariant under node locations. In other words, we can maintain a stable global characteristic for nonuniform networks.

The remainder of the paper is organized as follows. First, to describe and contextualize our contribution in this paper, we provide in Section 2 the existing results on continuum modeling of uniform networks. Next, we present the main results of the paper in Section 3; in Section 3.1, we introduce a more general network model and derive its limiting PDEs; in Section 3.2, we derive limiting PDEs for nonuniform and possibly mobile networks; and in Section 3.3, we present a control method for nonuniform networks so that the continuum limit is invariant under node locations. Then we present some numerical examples in Section 4 and conclude the paper in Section 5.

#### 2. Existing Results on Continuum Modeling of Stochastic Networks

This section is devoted to reviewing our continuum modeling method [1, 2] for stochastic networks whose nodes are uniformly located and have a *fixed* transmission range. The study of nonuniform networks in this paper builds on this result. We first describe the network model and then present the result on the convergence of its underlying Markov chain to its continuum limit, which is the solution of a limiting PDE. We discuss some related literature on stochastic network modeling at the end of this section.

We will generalize this modeling method to uniform networks with more general transmission ranges in Section 3.1 and to nonuniform networks in Section 3.2.

##### 2.1. Network Model

Consider a compact, convex Euclidean domain representing a spatial region, with dimension . In practice, is typically either 1 or 2. However, our analysis in this paper applies to general , though our examples are for . Next, consider points in that form a uniform grid. We refer to these points as grid points and denote the distance between any two neighboring grid points by .

Now consider a network of wireless sensor nodes over , where the nodes are labeled by . By a uniform network we mean that node is located at the grid point , where . We focus on uniform networks in this section.

The sensor nodes generate, according to a probability distribution, data messages that need to be communicated to the *destination nodes* located on the boundary of , which represent specialized devices that collect the sensor data. The sensor nodes also serve as relays for routing messages to the destination nodes. Each sensor node has the capacity to store messages in a *queue* and is capable of either transmitting or receiving messages to or from its *immediate* neighbors. In other words, it has a fixed *1-step* transmission range. (We will generalize to further steps of transmission range later in Section 3.1.) At each time instant , each sensor node probabilistically decides to be a transmitter or receiver, but not both. This simplified rule of transmission allows for a relatively simple representation. We illustrate such a uniform network over a two-dimensional (2D) domain in Figure 1(a).

In this network, communication between nodes is interference limited because all nodes share the same wireless channel. We assume a simple collision protocol: a transmission from a transmitter to an immediate neighboring receiver is successful if and only if none of the other immediate neighbors of the receiver is a transmitter, as illustrated in Figure 1(b). This is the case presented in [1]. (Later, in Section 3.1, when we consider further transmission ranges, interference will occur between not only immediate neighbors, but also neighbors further apart.) In a successful transmission, *one* message is transmitted from the transmitter to the receiver.

We assume that the probability that a node decides to be a transmitter is a function of its normalized queue length (normalized by an “averaging” parameter ). That is, at time , node decides to be a transmitter with probability , where is the queue length of node at time , and is a given function.

The queue lengths (the superscript represents transpose) form a Markov chain whose evolution is given by

Here, the are i.i.d. random vectors that do not depend on the state , and is a given function. As a concrete example, below we present the expression of (1) for a particular network.

For the sake of explanation, we simplify the problem further and consider a 1D domain (2D networks will be treated in the next section). Here, sensor nodes are uniformly located in an interval and labeled by . The destination nodes are located on the boundary of , labeled by and .

We assume that if node is a transmitter at a certain time instant, it randomly chooses to transmit one message to the right or the left immediate neighbor with probability and , respectively, where . In contrast to strict equality, the inequality here allows for a more general stochastic model of transmission: after a sensor node randomly decides to transmit over the wireless channel, there is still a positive probability that the message is not transferred to its intended receiver (what might be called an “outage”).

The special destination nodes at the boundaries of the domain do not have queues; they simply receive any message transmitted to them and never themselves transmit anything. We illustrate the time evolution of the queues in the network in Figure 1(c).

For the particular network introduced above, we have the following expression for in (1) which is a random vector comprising independent random variables: are uniform random variables on used to determine if the node is a transmitter or not; are ternary random variables used to determine the direction in which a message is passed, which take values , , and (representing transmitting to the right, the left, and neither, resp.) with probabilities , , and , respectively; and are the number of messages generated at node at time . We model by independent Poisson random variables with mean and call the incoming traffic to the network.

For a generic , the th component of , where , is where with or are defined to be zero, and is the function that specifies the probability that a node decides to be a transmitter, as defined earlier. Here, the three possible values of correspond to the three events that, at time , node successfully receives one message, successfully transmits one message, and does neither of the above, respectively. The inequalities and equations on the right describe conditions under which these three events occur: for example, corresponds to the choice of node to be a transmitter at time , corresponds to its choice to transmit to the right, and so on.

We assume that . (We will use this assumption throughout the paper.) Under this assumption, the probability that a node is a transmitter increases linearly with its queue length, up to a maximum value of 1 when the normalized queue length exceeds 1. In general, we would naturally adopt a function that is increasing in the queue length, so that nodes with more data are more likely to transmit. Here, we assume this function to be linear purely for the sake of simplicity. We could have used a more complicated increasing function. However, doing so complicates the derivation of the resulting PDE and does not serve any insightful purpose.

##### 2.2. Continuum Limit of the Markov Chain

Next, we present in Theorem 2 a result on the convergence of the Markov chain (1) to its continuum limit, which is the solution of a PDE. Based on this theorem, we can approximate the network introduced above by the limiting PDE. We stress that this theorem is not limited to the particular network model above but holds for uniform networks in a more general setting, which we will introduce later in Section 3.1.

The Markov chain model (1) is related to a deterministic difference equation. We set and define by (“a.s.” is short for “almost surely”).

*Example 1. *For the 1D 1-step network model in Section 2.1, it follows from (3) (with the particular choice of ) that, for , the th component of in its corresponding deterministic difference equation (5), where , is (after some tedious algebra, as described in [3])
where with or are defined to be zero.

We now construct the PDE whose solution describes the limiting behavior of the Markov chain.

For any continuous function , let be the vector in composed of the values of at the grid points ; that is, . Given a point , we let be any sequence of grid points such that as , . Let be the component of the vector corresponding to the location ; that is, if , then is the th component of .

Assume that there exists a function such that as , given in the interior of , for any sequence of grid points , Here, represents all the th order derivatives of , where . These assumptions are technical conditions on the asymptotic behavior of the sequence of functions that insure that is asymptotically close to an expression that looks like the right-hand side of a time-dependent PDE. Such conditions are familiar in the context of PDE limits of Brownian motion. Checking these conditions often amounts to a simple algebraic exercise.

Assume that there exists a unique function that solves the limiting PDE with boundary condition and initial condition . Throughout the paper we assume that a.s. for each . We call the initial state of the network.

Establishing existence and uniqueness for the resulting nonlinear models is a difficult problem in theoretical analysis of partial differential equations in general. The techniques are heavily dependent on the particular form of . Therefore, as is common with numerical analysis, we assume that this has been established. Below, limiting PDE of the network is a nonlinear diffusion-convection problem. Existence and uniqueness for such problems for “small” data and short times can be established under general conditions. Key ingredients are coercivity, which will hold as long as is bounded away from , and diffusion dominance, which will also hold as long as is bounded above.

We now present a convergence theorem from [1], which states that the Markov chain converges uniformly to the solution of its limiting PDE, as and in a *dependent* way. By this we mean that we set to be a function of , written , such that as . Then we can treat as sequences of the *single* index , written . We apply such changes of notation throughout the rest of the paper *whenever * is treated as a function of . Define the time step
and the total number of time steps .

Theorem 2. *Almost surely, there exist a sequence , , , and , such that as , , and for each and each ,
*

Hence we can approximate the Markov chain by its continuum limit, the limiting PDE solution, and the accuracy of the approximation increases with .

*Example 3. *As a concrete example, we now construct the limiting PDE for the 1D 1-step network model in Section 2.1. To satisfy the conditions on introduced above, we make further assumptions to the network model. We assume that there are functions and from to such that
and further that
where and are functions from to . Let . We call the convection.

In order to guarantee that the number of messages entering the system from outside over finite time intervals remains finite throughout the limiting process, we set the incoming traffic
We call the incoming traffic function. Assume that , and are in .

By these assumptions, it follows from (6) that the limiting PDE (8) for the 1D 1-step network is as follows:
with boundary condition . The detailed derivation for this PDE was presented in [3].

This is a nonlinear diffusion-convection PDE. Note that the computations needed to obtain this require tedious but elementary algebraic manipulations. For this purpose, we found it helpful to use the symbolic tools in Matlab. A comparison of this PDE and the simulation of the corresponding network is provide in Section 4.1.1.

##### 2.3. The Related Literature

The modeling and analysis of stochastic networks is a large field of research and much of the previous contributions share goals with our continuum modeling method.

The analysis for establishing our continuum modeling result used Kushner’s ordinary differential equation (ODE) method [6], which is closely related to the line of research called stochastic approximation. This line of research was started by Robbins and Monro [7] and Kiefer and Wolfowitz [8] in the early 1950s and widely used in many areas (see, e.g., [9, 10], for surveys). These results do not study the “large-system” limit in the same sense as our method, and the limits of the system they study are ODEs instead of PDEs. Markov chains modeling’s various systems have also been shown by other endeavors to converge to ODEs [11, 12], abstract Cauchy problems [13], or other stochastic processes [6, 14]. These results use methods different from Kushner’s but share with it the principle idea in weak convergence theory [6, 14, 15].

There are a variety of other analysis methods for large systems taking completely different approaches. For example, the well-cited work of Gupta and Kumar [16], followed by many others (e.g., [17, 18]), derives scaling laws of network performance parameters (e.g., throughput); many efforts based on mean field theory [19–22] or on the theory of large deviations [23–25] study the limit of the so-called empirical (or occupancy) measure or distribution. These approaches differ from our work because they do not study the spatiotemporal characteristics of the system.

There do exist numerous continuum models in a wide spectrum of areas that formulate spatiotemporal phenomena (e.g., [26–29]), many of which use PDEs. All these works differ from our continuum limit method both by the properties of the system being studied and the analytic approaches. In addition, most of them study distributions of limiting processes that are random, while our limiting functions themselves are deterministic.

There is a vast literature on the convergence of a large variety of network models different from ours, to fluid and diffusion limits [30–35]. Unlike our work, this field of research focuses primarily on networks with a fixed number of nodes.

There are well-established mathematical tools to solve PDEs, which include analytical methods, such as the method of characteristics, integral transforms [36], and asymptotic methods [37], and numerical methods such as the finite element method [38] and the finite difference method [39]. The continuum model allows us to use these tools to greatly reduce computation time. The limiting PDEs for the networks in this paper can be solved by computer software packages in Matlab or Comsol that use numerical methods.

#### 3. Main Results

##### 3.1. Continuum Models of Uniform Networks

We introduced the wireless sensor network model in a simple setting in Section 2.1. In this subsection, we consider uniform networks in a more general setting where the network nodes have more general transmission ranges and derive their limiting PDEs. Such generalization is necessary for the control of nonuniform networks to be possible (explained in Section 3.3.1). We consider nonuniform networks in Section 3.2.

###### 3.1.1. A More General Network Model

Recall that in Section 2.1 we introduced 1-step networks where the sensor nodes communicate (exchange data and interfere) with their immediate neighbors. We now consider -step networks where the nodes communicate with their communicating neighbors, which can be further away than the immediate ones. To be specific, at each time instant, a transmitter tries to transmit a message to one of its communicating neighbors; a receiver may receive a message from one of its communicating neighbors. Interference also occurs among communicating neighbors: a transmission from a transmitter to a receiver (one of the communicating neighbors of the transmitter) is successful if and only if none of the other communicating neighbors of the receiver is a transmitter.

For an -step network, we call the positive integer its *communication range* and assume that it determines the communicating neighbors as follows.

In a 1D -step network of nodes, communicating neighbors of the node at are the nodes at , where .

In 2D networks, we consider two types of communicating neighbors. In a 2-D -step network of nodes, for a node at , its communicating neighbors are the nodes at where(i)for Type I networks, , and ;(ii)for Type II networks, and . We illustrate the two types of definition of communicating neighbors for 2-D 1-step networks in Figure 2.

We assume the use of directional antennas and power control to accommodate such routing schemes. Here we consider two types of communicating neighbors because they may correspond to two types of routing schemes, and one may be a better model than the other for networks with different design choices. For example, a Type-II network may offer higher rate in propagating information to the destination nodes at the boundaries but at the same time may require more complex directional antennas and power control to implement.

Next we derive the limiting PDEs for this more general network model.

###### 3.1.2. Limiting PDEs for Uniform Networks

The network model above can again be written as (1), for which Theorem 2 still holds.

We assume that if, at time , node is a transmitter, it randomly chooses to transmit a message to its th communicating neighbor with probability , where the possible values of depend on the number of its communicating neighbors. Note that here depends on , that is, is time variant, which generalizes the case in Section 2.1. Correspondingly, we now assume that
that
where and are functions from to . We call the *direction function*. We have assumed above that the probabilities of the direction of transmission are the values of the continuous functions at the grid points, respectively. This may correspond to stochastic routing schemes where nodes in close vicinity behave similarly based on some local information that they share or to those with an underlying network-wide directional configuration that are continuous in space, designed to relay messages to destination nodes at known locations.

For a D -step network, let be the number of the communicating neighbors of its nodes that are away from the boundaries. We have that

We assume that the communicating neighbors of each node are indexed according only to their *relative* locations with respect to the node. For example, if we call the left immediate neighbor of *any* node its 1st neighbor, then the left immediate neighbor of *all* nodes must be their 1st neighbor, respectively. That is, for a node at , if we denote by the location of its th communicating neighbor, then depends on , but not on .

We present below the limiting PDE in the sense of Theorem 2 for an arbitrary -D -step network with both Type-I and II communicating neighbors. The PDE is derived in a way similar to that of (14) for the 1-D 1-step network in Section 2, which involves writing down the expression of the corresponding Markov chain (1) and then the difference equation (5), except that we now have to consider transmission to and interference from more neighbors instead of only the two immediate ones, requiring more arduous, but still elementary, algebraic manipulation. We omit the algebraic details here.

Let be the standard basis of ; that is, is the element of with the th entry being 1 and other entries 0. Define Then the limiting PDE for a -D -step network is with boundary condition . This general PDE works for both Type-I and II communicating neighbors, provided that is calculated with (18) accordingly. We will present some concrete examples of the PDEs and the corresponding network models in Section 4.1.

##### 3.2. Continuum Models of Nonuniform Networks

In this subsection we extend the continuum models to nonuniform and mobile networks. First we introduce the transformation function, which is the mapping between the node locations of uniform and nonuniform networks. Then, through the transformation function, we derive the continuum limits of nonuniform and mobile networks with given trajectories and transmissions. We consider the domain and a fixed time interval .

###### 3.2.1. Location Transformation Function

For networks with the design of uniform node placement, there may be small perturbations to the uniform grid because of imperfect implementation or landscape limitation; some sensor networks may have nodes with moderate mobility. The study of nonuniform networks here is motivated by the need for modeling these networks. Again we assume the use of directional antennas and power control to preserve the neighborhood structure in the nonuniform or mobile networks.

Consider a nonuniform and possibly mobile network with nodes indexed by over . The nodes no longer are located at the grid points and possibly change their locations at each time step .

We denote by the location of node of the nonuniform network at time . Let and . Assume that there exists a smooth *transformation function * such that, for each and ,
and, for each , is bijective. Hence is the mapping between the nonuniform node locations and uniform grid points.

Note that, for mobile networks, by assuming that is bijective for each , we focus on a subset of all possible node movements, which simplifies the problem. This restricts the mobility of nodes but is still a reasonable model in many practical scenarios, for example, in sensor networks where each node collects environmental data from its designated area and moves in a small neighborhood of, instead of arbitrarily far away from, their original locations.

Since is bijective, its inverse with respect to exists and we denote it by ; that is, for each and , Throughout the paper we assume fixed nodes on the boundary; that is, for on the boundary of .

For *given * and , a transformation function can be constructed using some interpolation scheme. Note that is not unique because of the freedom we have in choosing different schemes. Let and be the th components of and , respectively, where . For the rest of the paper, we assume that for ,
Then equivalently, for , . This assumption can be achieved by choosing a proper interpolation scheme, and it simplifies the analysis below.

On the other hand, a *given *, by (21), specifies a sequence of nonuniform node locations indexed by . We study the continuum limit of a *sequence* of nonuniform networks associated with such ; that is, for each , the -node nonuniform network has node locations .

###### 3.2.2. Continuum Limits of Mirroring Networks

For an -node network (uniform or nonuniform), we define its *transmission-interference rule* to be (i)the probability that node sends a message to node at time ; (ii)the fact of whether nodes and interfere at time ,

for and . The transmission-interference rule specifies how the nodes in a network interact with each other at each time step. At each time step, each node chooses to be a transmitter with a certain probability; if it chooses to be a transmitter, it then chooses one of its communicating neighbors to send a message to. The first component of this definition is determined by the probabilities of the above choices of *all* the nodes at *all* the time steps. The second component of this definition is determined by the neighborhood structure of the network at each time step; that is, which nodes are the communicating neighbors of each node (so that they interfere with it) at each time step.

For each , write . Then we can describe a network during entirely by its states . Define the *network behavior* of a network to be the combination of its initial state , transmission-interference rule, and incoming traffic . Two sequences and of networks indexed by the number of nodes, with different node locations in general, are said to *mirror* each other if, for each , and have the same network behavior. We state in the following theorem the relationship between the continuum limits of mirroring networks.

Theorem 4. *Suppose that a sequence of networks has node locations specified by a given transformation function with inverse . If mirrors a sequence of uniform networks, then converges to a function on in the sense of Theorem 2 if and only if converges to
**
in the sense that almost surely there exist a sequence , , , and , such that as , , and for each and each ,
**
where is the location of node at time in . *

* Proof. *“”: Since and mirror each other, they would converge to the same continuum limit on a uniform grid. Therefore, by Theorem 2, almost surely, there exist a sequence , , , and , such that as , , and for each and each ,
We note that
where the first equality follows from (22) and (24), and the second from (21). Then (26) is equivalent to (25).

“”: Done analogously in the opposite direction.

###### 3.2.3. Sensitivity of Uniform Continuum Models to Location Perturbation

In networks with nodes not necessarily at, but close to, the uniform grid points, we can use *uniform* continuum models to approximate nonuniform networks, that is, treat them as uniform while deriving limiting PDEs. Then a certain approximation error arises from ignoring nonuniformity. If we treat such nonuniformities as perturbations to the uniform models, the above theorem enables us to analyze the error *sensitivity* of these models with respect to such perturbation.

Consider a sequence of nonuniform networks with node locations specified by the transformation function with inverse . Suppose that we ignore the nonuniformity and approximate by the continuum limit of the sequence of uniform networks that mirrors . We now characterize the maximum approximation error by in the following proposition.

Proposition 5. *Almost surely, there exist a sequence , , , and , such that as , , and for each and each ,
*

*Proof. *We have, from the triangle inequality, that
where is defined by (24).

By Theorem 4, almost surely, there exist a sequence , , , and , such that as , , and for each and each , the first term above is smaller than .

The second term represents the error caused by location perturbation. By (24) and Taylor’s theorem, there exists such that
Therefore we have that
By (30) this completes the proof.

This proposition states that, for fixed and for and sufficiently large, is dominated by the supremum location perturbation , when it is close to 0. We note that by definition . In the case where are uniform; that is, , the last two terms on the right-hand side of (29) vanish.

###### 3.2.4. Limiting PDEs for Nonuniform Networks

Consider a sequence of networks with *given* network behavior and with node locations specified by a given transformation function with inverse . If a sequence of uniform networks mirrors , from this given network behavior, we can find the continuum limit of by constructing its limiting PDE as in Section 3.1.2. Suppose that this PDE has the form
with initial condition , where , , and . By Theorem 4, we have that the continuum limit of satisfies (24).

However, in general, we can only solve (33) numerically instead of analytically. In fact, all the limiting PDEs in this paper are solved by software using numerical methods. In this case we cannot find the closed-form expression of from using (24). Instead, we derive a PDE that satisfies so that we can solve it numerically.

Suppose that solves the PDE with initial condition , where and . We now find from the known PDE (33).

By (23), (24), and the chain rule, By (23), the product rule, and the chain rule, Note that, without assumption (23), the expression of the derivatives above would be much more complex. Then by (24), (33), and (34) we have where . Hence we find the limiting PDE (34) of .

We present a concrete numerical example of the nonuniform network and its continuum limit later in Section 4.2.

##### 3.3. Control of Nonuniform Networks

The global characteristic of the network is determined by the transmission-interference rule defined in Section 3.2.2 and is described by its limiting PDE. The transmission-interference rule depends entirely on the transmission range and the probabilities , which in turn by (16) depends on the direction function . On the other hand, and also determine the limiting PDE of a sequence of networks. Therefore we can *control* the transmission-interference rule to obtain the desired limiting PDE, and hence the desired global characteristic of the network, by changing and .

For uniform networks, this procedure is straightforward because and relate directly to the form and coefficients of the limiting PDE. For example, for the 1D 1-step network in Section 2.2 with limiting PDE (14), increasing the convection results in a greater bias of the PDE solution to the left side of the domain. (A numerical example of this network is provided in Section 4.1.1.)

We now study this kind of control for nonuniform and possibly mobile networks. For such networks, we have to take into account the varying node locations in order to still achieve certain global characteristics. The goal is to develop a control method so that the continuum limit is invariant under node locations and mobility, that is, remains the same as a reference, which is the continuum limit of the sequence of corresponding uniform networks with a certain transmission-interference rule. We then say the sequence has a location-invariant continuum limit.

We illustrate this idea in Figure 3. The plus signs in both figures represent the queues of a certain uniform network at a certain time. The solid lines in both figures represent the continuum limit (the limiting PDE solution) of the same uniform network at the same time. Thus they resemble each other. On the left, the diamonds represent the queues of a nonuniform network with the same transmission-interference rule as the uniform network, but no longer resembling the continuum limit because of the changes in node locations. On the right, the circles represent the queues of a second nonuniform network with the same node locations as the first nonuniform network, but under some control over its transmission-interference rule, therefore resembling the continuum limit of the uniform network. In other words, location invariance in the second nonuniform network has been achieved by network control. Apparently, for this particular network, such a control scheme has to be able to direct more (and the right amount of) data traffic to the right-hand side. In what follows, we describe how this can be done by properly increasing the probabilities of the nodes transmitting to the right through the use of the limiting PDEs.

Throughout the paper we assume no control over node location or motion.

###### 3.3.1. Transmission-Interference Rule for Location Invariance

Consider a sequence of nonuniform networks whose node locations are specified by a given transformation function with inverse and a sequence of uniform networks with *given* transmission-interference rule and continuum limit . We want to control the transmission-interference rule of so that it also converges to , that is, obtains the location-invariant continuum limit.

Again we do not assume a known closed-form expression of . Instead, assume that solves (34), except that is now *given*.

Define

Suppose that a sequence of uniform networks has continuum limit . By Theorem 4, for to converge to this desired , it suffices that mirrors . Therefore all we have to do is to specify the transmission-interference rule of to . Next we find this transmission-interference rule.

Suppose that solves (33), except that is now *unknown*. Again using the product rule and the chain rule as we did in Section 3.2.4, by (33), (34), and (38), we have that
and , where .

Since is the continuum limit of a sequence of uniform networks, (33) must be a case of (20), the general limiting PDE. Therefore we can replace the left-hand side of (39) by the right-hand side of (20) and get
We call this the *comparison equation*. If we can solve it for , , and , our goal is accomplished because they determine the network behavior, which includes the transmission-interference rule, for each -node uniform network in the mirroring sequence . If we assign the same transmission-interference rule to , then it has the location-invariant continuum limit .

We note a constraint for (40): by (16), for each , has to be sufficiently small such that, for each and , In turn by (17), and have to be sufficiently small for (41) to hold. By further observing (18) and (19), it follows that the transmission range has to be sufficiently large. For this reason, it is necessary to generalize from 1-step to -step transmission range, as we did in Section 3.1. Note that with this constraint, (40) is still underdetermined. Such freedom gives us a class of transmission-interference rules to assign to instead of just one.

One way to solve (40) is this. Suppose that we have chosen sufficiently large. Since (34) is now given, we know the numerical form of and in turn that of by (38). For fixed , we put in (40). For each , if we fix , then we can solve (40), which is now an ordinary differential equation (ODE), for . Similarly, fixing makes (40) an ODE that we can solve for . Then by (19) we can further choose and and further determine by (17). Thus we have found by (16), which together with determines the transmission-interference rule.

###### 3.3.2. Distributed Control Using Local Information

The control method presented above is centralized in the sense that it requires knowledge of the transformation function over . This assumes that each node knows the location of all other nodes. However, this is generally not the case in practice, especially for networks without a central control unit. In this subsection we present a distributed version of our control method, where only the locations of nearby nodes are needed for each node to determine its transmission-interference rule. We can do this because all the information needed to solve the comparison equation (40) can be approximated locally at each node.

The derivatives of in (40) can be approximated from the locations of neighboring nodes using a certain finite difference method. For example, in the 1-D case, we can use the following approximation:

where and . Note that we can also use the location information of further neighbors to get a more accurate approximation of . The trade-off between locality and accuracy can be flexibly adjusted.

The ODE for or can also be solved based on local information using numerical procedures such as Euler’s method [40].

We present two concrete examples of network control in 1D and 2D case, in Sections 4.3.1 and 4.3.2, respectively.

#### 4. Numerical Examples

We now present numerical examples for continuum model of uniform networks, continuum model of nonuniform networks, and control of nonuniform networks in Sections 4.1, 4.2, and 4.3, respectively.

##### 4.1. Examples of Uniform Networks

###### 4.1.1. 1D Example

We discussed the 1D 1-step network as a running example through Section 2 and derived its limiting PDE (14). We now run Monte Carlo simulation for such a network and compare the simulation result with the limiting PDE solution. (Simulations and PDEs presented in this paper are run and solved using Matlab.) We set the spatial domain . We set the number of nodes and the normalizing parameter . We set the initial condition of the limiting PDE , where is a constant, so that initially the nodes in the middle have messages to transmit, while those near the boundaries have very few. We set the incoming traffic function , where is a constant determining the total load of the network, so that the nodes in the middle generate more messages than those near the boundaries. We set the diffusion function and the convection function , so that each node transmits to the left with a higher probability than to the right; that is, more data traffic in the network is routed to the left. In Figure 4, we show the PDE solution and the simulation result at time , where the -axis denotes the node location and -axis denotes the normalized queue length. As we can see, the PDE well resembles the network.

###### 4.1.2. 2D Examples

We consider 2-D 1-step networks with the two types of communicating neighbors separately (as illustrated in Figure 2).

*Type I Communicating Neighbors*. For 2D 1-step networks of Type I communicating neighbors, we define the probabilities of transmitting to the 4 communicating neighbors as in Figure 2. This is the same as the 2D network studied in [1].

The limiting PDE for this network is as follows: where , , , , and . (As mentioned in Section 3.1.2, we omit the detailed algebraic derivation.)

We consider such a network over the spatial domain . We set the number of nodes and the normalizing parameter . We set the initial condition where the constants , so that initially the nodes near , , , and have more messages to transmit than those far away from these points. We set the incoming traffic function where the constants , so that the nodes near , , , and generate more messages to transmit than those far away from these points. This may correspond to four information sources at these four points that generate different rate of data traffic. Set the diffusion functions , where , and the convection functions , , , and . Hence , , and , so that more data traffic in the network is routed to the south and the east. In Figure 5, we show the contour of the PDE solution and the simulation result at . We can again see the resemblance.

*Type II Communicating Neighbors.* For 2-D 1-step networks of Type II communicating neighbors, we define the probabilities of transmitting to the 8 communicating neighbors as in Figure 2. The limiting PDE is as follows:
where , , , and .

Again the spatial domain . We set the number of nodes and the normalizing parameter . We set the initial condition where the constants , so that initially the nodes near and have more messages to transmit than those far away from these two points. We set the incoming incoming traffic function where the constants , so that the nodes near and generate more messages to transmit than those far away from these two points. This may correspond to two information sources at these two points that generate different rates of data traffic. In Figure 6, we show the contours of the PDE solution and the simulation results with the diffusion functions , for , and convection functions , , , , , , , and . Hence , , and , so that more data traffic in the network is routed to the west and the south.

The reader can verify that the two PDEs (43) and (46) above are special cases of (20).

##### 4.2. Example of Nonuniform Network

We illustrate a 2-D nonuniform network , its continuum limit , and the continuum limit of its mirroring uniform network in Figure 7. The spatial domain . We assume that the mirroring uniform network is a 2D 1-step network of Type-I communicating neighbors. Therefore satisfies the limiting PDE (43). For the mirroring uniform network, we set the initial condition , and incoming traffic where the constants ; we set the diffusion functions and the convection functions , for . The inverse transformation function here is set to be for . (Notice that this satisfies (23)) Therefore the continuum limit of the nonuniform network is .

##### 4.3. Examples of Control of Nonuniform Networks

###### 4.3.1. 1D Example

Let the domain . Let be the continuum limit of a sequence of 1-D 1-step uniform networks with transmission range , the diffusion function , the convection function , and a given incoming traffic function for all . A given transformation function specifies the node locations of a sequence of nonuniform networks. We show how to find the transmission-interference rule for to converge to . As the continuum limit of this particular 1-D 1-step network, solves the PDE with boundary condition and initial condition . This is a special case of (14).

In this case . Let . Then the comparison equation (40) becomes where is the continuum limit of the mirroring sequence of .

We assume that , which corresponds to the assumption that the continuum limit of the incoming traffic is invariant under node locations and mobility. This assumption is feasible in a large class of networks where traffic load depends directly on actual physical location. For example, in a wireless sensor network that detects environmental events such as a forest fire, the event-triggered data traffic depends on the distribution of heat rather than the node locations.

Suppose that we set Since is known to be the solution of (49), (50) has now become a first-order linear ODE for .

We can use Euler’s method to solve this ODE based on local information. For fixed , suppose the ODE is written in the form . We first choose such that satisfies (41), where . Then we can approximate by , where , and , for .

With this given , the transmission range of the mobile network has to be greater or equal to 2 for (41) to hold. We choose . Then any , where , that satisfy (50) and (51) will give us the desired transmission-interference rule of networks in and, hence, that of .

We simulate a 51-node controlled mobile network in the sequence that mirrors , whose node locations are specified by this given . In Figure 8, we compare the simulation result with the continuum limit of , at . We set the initial condition and the incoming traffic function , where the constants . As we can see, the global characteristic of resembles , the continuum limit of .

###### 4.3.2. 2D Example

Let the domain . Let be the continuum limit of a sequence of 2-D 1-step uniform networks of Type-II communicating neighbors with transmission range , the diffusion functions , for , the convection functions , for , and given incoming traffic function for all . Again denote the given transformation function that specifies the node locations of by .

As the continuum limit of this particular 1D 1-step network, solves the PDE with boundary condition and initial condition . This is a special case of (46).

Let . Then the comparison equation (40) becomes where is the continuum limit of the mirroring sequence of . Assume that and Since is known to be the solution of (52), we have two first-order linear ODEs of , where .

For this given , is sufficient for (41) to hold. Then any that satisfy (53) and (54) will give us the desired transmission-interference rule for and, hence, .

We simulate a -node controlled mobile network in the sequence that mirrors , whose node locations are specified by . In Figure 9, we compare the simulation result with the continuum limit of , at . We set the initial condition and the incoming traffic function where the constants . Again, the global characteristic of resembles , the continuum limit of .

#### 5. Conclusion

In this paper we study the modeling of nonuniform and possibly mobile networks via nonlinear PDEs and develop a distributed method to control their transmission-interference rules to maintain certain global characteristics. We demonstrate our method with a family of wireless sensor networks. Our method can be extended to other network models. The freedom in the control method mentioned in Section 3.3 can also be further exploited to improve the network performance.

#### Acknowledgments

Yang Zhang and Edwin K. P. Chong’s research was supported in part by NSF under ECCS-0700559 and ONR under Grant N00014-08-1-110. Jan Hannig’s research was supported in part by NSF under Grant nos 1007543 and 1016441. Donald Estep’s work was supported in part by the Defense Threat Reduction Agency (HDTRA1-09-1-0036), Department of Energy (DE-FG02-04ER25620, DE-FG02-05ER25699, DE-FC02-07ER54909, DE-SC0001724, DE-SC0005304, and INL00120133), Lawrence Livermore National Laboratory (B573139, B584647, and B590495), the National Aeronautics and Space Administration (NNG04GH63G), the National Institutes of Health (5R01GM096192-02), the National Science Foundation (DMS-0107832, DMS-0715135, DGE-0221595003, MSPA-CSE-0434354, ECCS-0700559, DMS-1016268, and DMS-FRG-1065046), and Idaho National Laboratory (00069249, 00115474). A preliminary version of parts of the work of this paper was presented at the 49th Annual Allerton Conference on Communication, Control, and Computing, 2011.

#### References

- Y. Zhang, E. K. P. Chong, J. Hannig, and D. J. Estep, “Continuum limits of Markov chains with application to network modeling,” http://arxiv.org/abs/1106.4288.
- Y. Zhang, E. K. P. Chong, J. Hannig, and D. Estep, “On continuum limits of markov chains and network modeling,” in
*Proceedings of the 49th IEEE Conference on Decision and Control (CDC '10)*, pp. 6779–6784, Atlanta, Ga, USA, December 2010. View at Publisher · View at Google Scholar · View at Scopus - E. K. P. Chong, D. Estep, and J. Hannig, “Continuum modeling of large networks,”
*International Journal of Numerical Modelling*, vol. 21, no. 3, pp. 169–186, 2008. View at Publisher · View at Google Scholar · View at Scopus - N. J. Burch,
*Continuum modeling of stochastic wireless sensor networks [M.S. thesis]*, Colorado State University, 2008. - N. Burch, E. Chong, D. Estep, and J. Hannig, “Analysis of routing protocols and interference-limited communication in large wireless networks,”
*Journal of Engineering Mathematics*, pp. 1–17, 2012. - H. J. Kushner,
*Approximation and Weak Convergence Methods for Random Processes, with Applications to Stochastic Systems Theory*, MIT Press Series in Signal Processing, Optimization, and Control, 6, MIT Press, Cambridge, Mass, USA, 1984. View at Zentralblatt MATH · View at MathSciNet - H. Robbins and S. Monro, “A stochastic approximation method,”
*Annals of Mathematical Statistics*, vol. 22, pp. 400–407, 1951. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Kiefer and J. Wolfowitz, “Stochastic estimation of the maximum of a regression function,”
*Annals of Mathematical Statistics*, vol. 23, pp. 462–466, 1952. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. Benaïm, “Dynamics of stochastic approximation algorithms,” in
*Séminaire de Probabilités, XXXIII*, vol. 1709 of*Lecture Notes in Mathematics*, pp. 1–68, Springer, Berlin, Germany, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - T. L. Lai, “Stochastic approximation,”
*The Annals of Statistics*, vol. 31, no. 2, pp. 391–406, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - T. G. Kurtz, “Solutions of ordinary differential equations as limits of pure jump Markov processes,”
*Journal of Applied Probability*, vol. 7, pp. 49–58, 1970. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - R. W. R. Darling, “Fluid limits of pure jump Markov processes: a practical guide,” http://arxiv.org/abs/math/0210109.
- R. McVinish and P. Pollett, “The deterministic limit of heterogeneous density dependent Markov chains,” submitted to
*Annals of Applied Probability*. - S. N. Ethier and T. G. Kurtz,
*Markov Processes: Characterization and Convergence*, Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics, John Wiley & Sons Inc., New York, NY, USA, 1986. View at Publisher · View at Google Scholar · View at MathSciNet - P. Billingsley,
*Convergence of Probability Measures*, Wiley Series in Probability and Statistics: Probability and Statistics, John Wiley & Sons, New York, NY, USA, 2nd edition, 1999. View at Publisher · View at Google Scholar · View at MathSciNet - P. Gupta and P. R. Kumar, “The capacity of wireless networks,”
*IEEE Transactions on Information Theory*, vol. 46, no. 2, pp. 388–404, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. Grossglauser and D. N. C. Tse, “Mobility increases the capacity of ad hoc wireless networks,”
*IEEE/ACM Transactions on Networking*, vol. 10, no. 4, pp. 477–486, 2002. View at Publisher · View at Google Scholar · View at Scopus - J. D. Herdtner and E. K. P. Chong, “Throughput-storage tradeoff in ad hoc networks,” in
*Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '05)*, vol. 4, pp. 2536–2542, March 2005. View at Scopus - M. Benaïm and J.-Y. L. Boudec, “A class of mean field interaction models for computer and communication systems,”
*Performance Evaluation*, pp. 11–12, 2008. - P. E. Caines, “Bode lecture: mean field stochastic control,” in
*Proceedings of the 48th IEEE Conference on Decision and Control*, Shanghai, China, 2009. - D. A. Dawson, J. Tang, and Y. Q. Zhao, “Balancing queues by mean field interaction,”
*Queueing Systems*, vol. 49, no. 3-4, pp. 335–361, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - C. Graham and P. Robert, “Self-adaptive congestion control for multiclass intermittent connections in a communication network,”
*Queueing Systems*, vol. 69, no. 3-4, pp. 237–257, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - C. S. Chang, “Sample path large deviations and intree networks,”
*Queueing Systems*, vol. 20, no. 1-2, pp. 7–36, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - N. G. Duffield, “A large deviation analysis of errors in measurement based admission control to buffered and bufferless resources,”
*Queueing Systems*, vol. 34, no. 1-4, pp. 131–168, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - S. Ahn and J. Jeon, “Analysis of $G/D/1$ queueing systems with inputs satisfying large deviation principle under ${\text{weak}}^{*}$ topology,”
*Queueing Systems*, vol. 40, no. 3, pp. 295–311, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - D. Blount, “Law of large numbers in the supremum norm for a chemical reaction with diffusion,”
*The Annals of Applied Probability*, vol. 2, no. 1, pp. 131–141, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - C.-f. Huang and H. Pagès, “Optimal consumption and portfolio policies with an infinite horizon: existence and convergence,”
*The Annals of Applied Probability*, vol. 2, no. 1, pp. 36–64, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - G.-L. Xu and S. E. Shreve, “A duality method for optimal consumption and investment under short-selling prohibition. II. Constant market coefficients,”
*The Annals of Applied Probability*, vol. 2, no. 2, pp. 314–328, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. Burger, P. A. Markowich, and J.-F. Pietschmann, “Continuous limit of a crowd motion and herding model: analysis and numerical simulations,”
*Kinetic and Related Models*, vol. 4, no. 4, pp. 1025–1047, 2011. View at Publisher · View at Google Scholar · View at MathSciNet - H. Chen and W. Whitt, “Diffusion approximations for open queueing networks with service interruptions,”
*Queueing Systems*, vol. 13, no. 4, pp. 335–359, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. M. Harrison and V. Nguyen, “Brownian models of multiclass queueing networks: current status and open problems,”
*Queueing Systems*, vol. 13, no. 1–3, pp. 5–40, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - H. Chen, O. Kella, and G. Weiss, “Fluid approximations for a processor-sharing queue,”
*Queueing Systems*, vol. 27, no. 1-2, pp. 99–125, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - R.-R. Chen and S. Meyn, “Value iteration and optimization of multiclass queueing networks,”
*Queueing Systems*, vol. 32, no. 1–3, pp. 65–97, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - R. C. Hampshire, M. Harchol-Balter, and W. A. Massey, “Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates,”
*Queueing Systems*, vol. 53, no. 1-2, pp. 19–30, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - F. J. Piera, R. R. Mazumdar, and F. M. Guillemin, “Existence and characterization of product-form invariant distributions for state-dependent stochastic networks in the heavy-traffic diffusion limit,”
*Queueing Systems*, vol. 58, no. 1, pp. 3–27, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - R. B. Guenther and J. W. Lee,
*Partial Differential Equations of Mathematical Physics and Integral Equations*, Dover, Mineola, NY, USA, 1996. View at MathSciNet - J.-H. He, “Asymptotic Methods for Solitary Solutions and Compactons,”
*Abstract and Applied Analysis*, vol. 2012, Article ID 916793, 130 pages, 2012. View at Publisher · View at Google Scholar - G. R. Liu and S. S. Quek,
*The Finite Element Method: A Practical Course*, Butterworth-Heinemann, 2003. - A. R. Mitchell and D. F. Griffiths,
*The Finite Difference Method in Partial Differential Equations*, John Wiley & Sons, Chichester, UK, 1980. View at MathSciNet - J. C. Robinson,
*An Introduction to Ordinary Differential Equations*, Cambridge University Press, Cambridge, UK, 2004. View at Publisher · View at Google Scholar · View at MathSciNet