This article is part of the series Theoretical and Algorithmic Foundations of Wireless Ad Hoc and Sensor Networks.

Open Access Research Article

A Stochastic Multiobjective Optimization Framework for Wireless Sensor Networks

Shibo He1, Jiming Chen12, Weiqiang Xu1, Youxian Sun1, Preetha Thulasiraman2 and Xuemin(Sherman) Shen2*

Author Affiliations

1 State Key Lab of Industrial Control Technology, Zhejiang University, Hangzhou 310027, China

2 Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada, N2L 3G1

For all author emails, please log on.

EURASIP Journal on Wireless Communications and Networking 2010, 2010:430615  doi:10.1155/2010/430615


The electronic version of this article is the complete one and can be found online at: http://jwcn.eurasipjournals.com/content/2010/1/430615


Received:31 October 2009
Accepted:17 February 2010
Published:20 May 2010

© 2010 The Author(s).

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.

In wireless sensor networks (WSNs), there generally exist many different objective functions to be optimized. In this paper, we propose a stochastic multiobjective optimization approach to solve such kind of problem. We first formulate a general multiobjective optimization problem. We then decompose the optimization formulation through Lagrange dual decomposition and adopt the stochastic quasigradient algorithm to solve the primal-dual problem in a distributed way. We show theoretically that our algorithm converges to the optimal solution of the primal problem by using the knowledge of stochastic programming. Furthermore, the formulation provides a general stochastic multiobjective optimization framework for WSNs. We illustrate how the general framework works by considering an example of the optimal rate allocation problem in multipath WSNs with time-varying channel. Extensive simulation results are given to demonstrate the effectiveness of our algorithm.

1. Introduction

The layered architecture approach has achieved great success in traditional wired network design by dividing the whole architecture into several modules, called layers, each of which performs a separate functionality. As each layer design only needs some interface variables from the layer below, the complexity of other layers can be hidden. The layered architecture approach suggests that the network design can be scalable, evolvable, and implementable. However, it may have limitations in improvement of efficiency and fairness, and suffer potential risks of manageability [1], which motivates the optimization of network design. Chiang et al. [1, 2] propose an optimization decomposition technique to systematically understand the network architecture, known as "layering as optimization decomposition". They model the network as an optimization problem and decompose the problem into many subproblems. They classify the decompositions into vertical decomposition and horizontal decomposition. Vertical decomposition layers the network architecture into several modules and horizontal decomposition provides distributed algorithms to fulfill the functionality within the modules. According to the requirements of the applications, the decomposition may be different, yielding different layers and distributed algorithms. There are usually two steps in the process of layering as optimization decomposition: () modeling the network problem as a specific NUM problem, and () exploring the alternative decompositions to design different modules and distributed algorithms. Most existing efforts have been put to the second step and simply assume that the network problems can be modeled by a unified utility function at the first step [36]. However, not all network problems can be modeled by a unified utility function in a tractable way since there may exist many objectives to be achieved, such as guaranteeing fairness, maximizing throughput, reducing packet dropping and delay, prolonging the network lifetime, and so forth. It may not be possible to integrate all these objectives into a single unified utility function, that is, network problems should be formulated as multiobjective optimization problems.

While the performance of the network can be greatly enhanced by adopting the NUM approach, the corresponding cost of algorithm implementation also increases. As we usually design and implement an algorithm for a specific application from scratch, the implementation can hardly be transplantable to other applications. This is especially aggravated in wireless sensor networks (WSNs) due to the application-oriented and infrastructureless nature of these networks. For example, if we design an efficient algorithm for events monitoring, the network lifetime is the main concern and the propagation delay can be tolerant, but it is difficult to apply such algorithm to online query applications, where the query delay is the primary objective.

In this paper, we utilize the concept of multiobjective optimization and provide a general framework for a specific class of applications in WSNs. It is well known that the TCP/IP reference model, one of the most popular layered architectures, divides the whole architecture into five layers (modules), and each layer only communicates with the layers next to it, while recent work on the NUM approach divides the architectures according to applications. We first list all the constraints and objectives which the applications may have. Then the network architecture is divided into modules, each of which has several interface variables with other modules. In this way, we can inherit the advantages of both the layered architectures (as we have fixed modules) and the NUM approach (as each module can communicate with other modules). We illustrate this in Figure 1, in which and are the interface variables (see Section 3 for detailed definition of and ), and is the objective vector function in each module . We transform the objectives of the network into specific modules through the interface variables. Each sensor optimizes its own objective vector function to achieve the global optimal solution of the whole network. In this way, for different requirements from the network, we do not redesign the framework, that is, the modules and interfaces in Figure 1 can be kept unchanged. We only need to introduce multiobjective methods to optimize the vector function in each module. This will greatly simplify network design for WSNs.

thumbnailFigure 1. An illustration of our proposed framework.

In WSNs, some parameters (e.g., the topology of the networks or channel condition) are time-varying. In [7], Lee et al. demonstrated that the state of the network can be more efficiently utilized to improve the performance of the network (e.g., increasing the throughput and reducing packet delay), by appropriately exploiting the variability of the time-varying channels. Also there are measurement errors in the implementation of distributed algorithms, such as the noisy feedback [8] or lossy links [9]. Therefore, we also characterize these random factors in our model. Our contributions in this paper are summarized as follows.

(1)We formulate a general multiobjective stochastic optimization problem for WSNs. We decompose the optimization problem through Lagrange dual decomposition and adopt the stochastic quasigradient method to solve the primal-dual problem. In other words, we transform the multiple objectives of WSNs into the multiple objectives of each individual sensor node. The global optimal solution can be obtained when each sensor node maximizes its own objective vector function. Therefore, our approach provides a general framework for multiobjective optimization for WSNs.

(2)We study the stability of the algorithm by using the knowledge of stochastic programming, and show that our algorithm for stochastic multiobjective optimization problem (ASMOP) can converge to the optimal solution of the primal problem.

(3)We demonstrate how the general framework can be applied to different applications, by considering the rate allocation problem as an example. We introduce three multiobjective optimization methods: () constraint method, () linear weighted method, and () hierarchical sequence method. The three paradigms show that although different requirements may lead to different models [6, 10], we can solve them in the general framework.

The remainder of the paper is organized as follows: in Section 2, we discuss related work regarding the NUM problem and stochastic network utility maximization (SNUM). We formulate a general mathematical model and design a distributed algorithm to solve the problem in Section 3, and the stability of the algorithm is also discussed. We provide three paradigms in Section 4 to demonstrate the general framework for different applications. Simulation results are given in Section 5. We conclude the paper in Section 6.

2. Related Work

There are several research works in the literature studying the NUM problem [4, 1114]. Kelly et al. were the first to propose the optimization approach, which provides a mathematical foundation for NUM problem [11]. In [12], Chiang adopted the NUM approach to obtain a cross-layer design including the physical layer and the transport layer. Zhu et al. [13] considered the energy model in the cross-layer design. In [1], Chiang et al. provided a mathematical theory of network architectures. Wang et al. studied joint interference-aware routing and TDMA link scheduling to improve the throughput in multihop wireless networks [15]. Zhang et al. [8] elaborated on the impact of the feedback in the implementation of distributed NUM algorithms. Since feedback is often collected using error-prone measurement mechanisms, for example, biased estimator or unbiased estimator, they adopted the knowledge of stochastic approximation and proved stability of the algorithms of single-time scale and two-time scale. Lee et al. utilized the variation of channels to guide power and rate control in cross-layer design [7]. In this paper, we formulate a more general mathematical model by considering stochastic multiple objectives in objective functions. We apply our approach to rate allocation problem in multipath WSNs with time-varying channels. Rate allocation is a fundamental problem and has been extensively investigated [1619]. Low and Lapsley [16] first introduced the Lagrange dual method to decompose the problem and proposed two algorithms under synchronous and asynchronous scenarios. A multipath formulation for rate control in multi-cast networks was proposed in [20], and three distributed algorithms were proposed to solve the problem. The goal is to maximize the aggregate utility. In [6], Srinivasan et al. considered two objectives: utility maximization and guaranteeing prespecified network lifetime for multipath wireless ad hoc networks. In [10], Zhu et al. also focused on the network lifetime and application performance (utility), and employed the linear weighted method from the multiobjective optimization to transform these two objective functions into a single one which was named to the utility-lifetime tradeoff function.

3. General Multiobjective Formulation and Solutions

Throughout the paper, we will denote sets by capital letters, variables by lowercase letters, vectors by bold lowercase letters, and matrices by bold capital letters. For a vector , we denote its th component by and its transpose by . We use capital letters for both the sets and the cardinality of sets.

Consider sensing nodes and sink nodes in the region of interest. Let be a probability space with a -algebra of random events, and have a finite set with the corresponding probability . There are objective functions , defined on the subset of a Hilbert space. Let , . Then is the objective vector function of sensing node . Let be the column vector of variables of sensing node , , and a column vector function. We can formulate the primal problem (PP) as follows:

(1)

The objective function, , may be a coupled one. In order to design a distributed algorithm, we introduce auxiliary variable to decouple it. Assume that the node set associated with coupled variables of is . Let , which denotes the node set associated with coupled variables of of sensing node , then the decoupled primal problem (DPP) can be given by

(2)

(3)

where is the th decoupled objective function, and is the corresponding vector of auxiliary variables.

In our formulation, the objective functions are deterministic, taking the advantage that each sensing node can be obtained from the network. The constraint set contains the random factors of the networks, such as message exchange, and environmental effect. If we know the distribution, , , of , we can transform the problem into a deterministic one, by calculating the expectation. However, in WSNs, there is often no prior knowledge about the randomness from the networks themselves and the environmental effect. Therefore, we develop an algorithm without this prior knowledge, which can be achieved by the stochastic quasigradient method [7].

To decompose the problem, we take Lagrange dual approach. The Lagrange function [21] of (3) is given by

(4)

where is the objective vector function of sensing node . It is a formal expression which can be transformed into different objective functions for different applications.

We call and decoupled prices ( is used to decouple the coupling of variables and is used to decouple the coupling of objective functions). Since (4) is separable, we exploit the decomposable structure of Lagrangian function and decompose the problem into subproblems. Maximization is achieved in each sensing node , , with the knowledge of local variables ) and the current state , by solving the following optimization problem .

(5)

(6)

At iteration , each sensing node updates its resource variables and auxiliary variables according to

(7)

We proceed to solve the dual problem. Let . Then the dual problem () is given by

(8)

At iteration , each sensing node can acquire the state of random variables . The stochastic quasigradient method only needs this current state information of the system and utilizes it to form the stochastic subgradients of at iteration . For the dual problem, , prices are updated according to

(9)

(10)

where and are the stochastic quasigradients of .

In our algorithm, we set

(11)

(12)

(13)

where is the state of at iteration .

We summarize our algorithm for the general formulation of stochastic multiobjective optimization problem (ASMOP) in the Algorithm 1.

Algorithm 1: ASMOP.

() Price update algorithm: At times , decoupled prices are updated according to

           

         

() Sensor node 's Algorithm: At time , each sensing node updates its variables

according to

           

To prove that the algorithm can converge to the optimal solution of the primal problem, we make the following assumptions.

(1) as well as the objective vector function (which can be transformed into a single function in applications), , are twice continuous differentiable concave functions.

(2), , are convex and twice continuous differentiable functions in , for all .

Theorem 1.

If (1) hold, then from an arbitrary point of , and , the sequence generated by (7), (9), and (10) converges. Every limit point of the sequence is primal-dual optimal.

Proof.

Let the sequences of iteration and be generated by (9) and (10), respectively. Then to guarantee the convergence of the algorithm, according to [7, 22], the current stepsize and quasigradients , and should be chosen such that

(14)

(15)

(16)

It can be seen that , , satisfy (14). From [22]; we know that and from (12) and (13) also satisfy (15) and (16).

From assumptions (1) and (2), the primal function is concave and the dual function is convex in and for a fixed . From (7), (9), (10), (11), (12), and (13), we can conclude that the sequence converges to the optimal solution by solving the dual problem [22]. As the primal problem is a convex optimization problem, there is no gap between the primal and dual problems. So the sequence generated by the algorithm is primal-dual optimal.

Remarks 3.

Because of multipath routing, the problem, , may not be strictly concave even if is strictly concave. This may lead to oscillation of the sequences generated by the algorithms. There are several ways to cope with this problem. For example, we can first add some augmented variables to and adopt the first-order Lagrangian method to solve it [23].

The main difference of our proposed approach is that we adopt the knowledge of multiobjective optimization and provide some potential interfaces for each layer. In this way, we can take the advantages of both the layered architectures and cross-layer design. In other words, we can implement different algorithms in each module according to specific applications. In Figure 1, and act as the interface variables between different modules and sensor nodes. Through and , the network architectures can be decomposed into different modules and each module fulfills corresponding functionality distributively. From (7), we can transform the multiple objectives of the whole network into the multiple objectives of each sensor node. Optimizing the objective vector function of each sensor node can achieve the global optimal solution. Therefore, it is very convenient to implement algorithms in each module to solve the objective vector function independently according to different requirements.

4. Paradigms of Objective Optimization in WSNs

In the proposed general framework, in is a vector function and can be transformed into a single function according to different requirements. Therefore, solving is application-dependent, which provides the flexibility of solving a class of applications by the general framework.

In this section, we consider the rate allocation problem as an example and show how the general framework works. Rate allocation problem is a well-investigated problem [24], and has different requirements for different applications. There are usually three methods to cope with the requirements: () Constraint Method [6], () Linear Weighted Method [10], and () Hierarchical Sequence Method. While these methods are extensively studied in existing works, we can integrate these methods together into the general framework. Hence, our approach can be applied to a class of applications with different background, which will offer significant convenience to the designers.

4.1. Preliminary Knowledge

In this section, we give a brief introduction to the three multiobjective methods.

(1)The constraint method tries to solve the multiobjective problems by placing the most important one in the objective function, while other objective functions are constrained within the constraint set. In other words, constraint method can solve the following of each sensing node . (without loss of generality, we assume that is the most important objective function)

(17)

where , , are constant constraints imposed by applications.

(2)The linear weighted method focuses on solving the multiobjective optimization problems by first associating each objective function with a weight and then taking the weighted sum as a new objective function. Using linear weighted method to solve , the variables in each sensing node are updated according to

(18)

where , , are weight coefficients.

(3)The hierarchical sequence method is concerned with solving the multiobjective optimization problems sequentially, that is, solving the most important problem first and then the less important problems. Let and divide (5) into functions , . Maximization is achieved by solving the following subproblems sequentially.

(19)

4.2. Rate Allocation Problem under ASMOP Formulation

In this section, we consider the rate allocation problem with two objectives: () maximizing aggregate utility and () prolonging the network lifetime.

Assume the sensing nodes can transmit their rates to the sink nodes over a set of links, each of which has capacity . Each sensing node can transmit its rate through of the routes. Each route traverses over a set of links with a rate . Let be the rate vector of sensing node , the set of sensing nodes using link and the subset of routes used by sensing node to traverse over link . We denote the set of sensing nodes that use sensing node as an interim relay node by (not including the sensing node itself). Let be the subset of routes which use sensing node as a relay node and the relay nodes used by route . Let be finite number of state that the channels have and the probability of the state , . Each sensing node is characterized by three parameters , where is a strictly concave utility function, and which are the required minimum and maximum transmission rates for each sensing node , respectively.

From [11, 16], we know utility maximization can be formulated as follows.

(20)

(21)

where describes the distribution of the states of link channel condition and is the capacity of link under state . We will establish algorithms that can guarantee convergence without prior knowledge of the underlying probability distribution of the system channel state.

The network lifetime is often defined as the time interval between initialization of the network and the exhaustion of the battery of the first sensing node. The total power dissipation, , at sensing node is equal to

(22)

where and are the energy consumptions at sensing node for transmitting or receiving unit data flow over route , respectively.

Let denote the initial energy of sensing node . Its lifetime is . Following [10], we have the energy model for the network lifetime:

(23)

(24)

where .

We can have the multiobjective model for rate allocation problem:

(25)

(26)

where

(27)

Here, parameter scales the values of the two objective functions into the same order of magnitude.

4.3. Algorithm Design

Similar to (3), the decoupled form of (25) is

(28)

(29)

where and is given by

(30)

Then we have the Lagrange function:

(31)

where and .

Notice that for given , , , , the update for each sensing node is deterministic, no matter what the channel condition is. So at iteration , each sensing node updates its rate and auxiliary variable by solving the optimization below

(32)

where is the objective vector function for sensing node .

At iteration , , sensing node first receives , and , , , from the network, and then updates its rate and auxiliary variables according to

(33)

Notice that the update of decoupled prices, , does not depend on the channel condition. At each iteration , with , , , , being collected, the decoupled price is updated according to

(34)

To update price , without prior knowledge about the distribution of the channel state, each sensing node can measure channel condition and get the link capacity for each link at time . Then can be updated according to

(35)

So far, we have introduced interface variables ( and ) for a fully distributed implementation and provided a framework for rate allocation in WSNs with time-varying channels. Next, we show how to apply the framework to applications under different methods.

4.4. Paradigms: Applications under Different Methods

() Constraint Method. To maximize the utility of a network under the condition that the network lifetime exceeds a prespecified threshold time , the constraint method can be used to solve the optimization problem below of each sensing node .

(36)

(37)

() Linear Weighted Method. In [10, 13], Zhu et al. considered the tradeoff between lifetime and rate allocation. By introducing the weight parameter, , to evaluate the importance of the two objectives, they can be combined into a single one. For (29), the desired tradeoff between network utility and lifetime can be achieved by solving the optimization problem below.

(38)

(39)

where , is the weight coefficient.

() Hierarchical Sequence Method. In our rate allocation paradigm, we have two objectives: () find a rate allocation strategy to maximize the total utility and () prolong the networks lifetime. To the best of our knowledge, this method has not been applied to the rate allocation problem before. We can achieve the two objectives by solving the two subproblems below sequentially.

(40)

(41)

It is sufficient to employ optimization methods to solve (37), (39), or (40), and (41) for different applications, while and updates are kept unchanged (according to (34) and (35)).

5. Simulation Results

5.1. Simulation Setting

We use 9 sensing nodes and 1 sink node in our simulations. These sensor nodes are randomly deployed in an area of size to perform a sensing task. The randomly generated topology of the sensor nodes is shown in Figure 2, in which sensing nodes are marked by triangle icons and the sink node is marked by a square icon. In our simulations, we only focus on the rate allocation problem. The study of the routing in the network layer is beyond the scope of our paper. We assume that there are 15 routes available for data transmission. , , , , , , , , , , , , , , . Every sensing node can transmit its sensing data to the sink node from a set of routes: , , , , , , , , and .

thumbnailFigure 2. Topology of the simulated WSN.

We have two objectives: maximizing the aggregate utility and the network lifetime. For the utility objective, we set for each sensor node , where . From [10], the function can have a ratio higher than 0.95 to approximate the original lifetime problem when . In our simulations, we use . The link capacities vary from time to time according to a uniform distribution with the expected capacities of links 1–13 to be 2000, 2000, 2200, 2000, 2000, 2500, 2800, 3500, 3500,  2000, 3000, 2800 (bit/s). For the energy consumption model, from [10], is a constant and , where is the length of the outgoing link of sensing node for transmitting rate of route . We set  nJ/bit,  pJ/bit/, ,  nJ/bit. The initial energy of the sensing nodes 1–9 is set to be (J) and the sink node (node 10) is assumed to have enough energy. The minimum and maximum rates of each sensing node are set to be and , respectively.

5.2. Simulation Results for Paradigms

First, we show the performance of the ASMOP algorithm by using the constraint method. Let the threshold of the network lifetime  h. We collect the rate of each route at each iteration. For each sensing node , the rates are updated according to (37) and the decoupled price is updated according to (34). Each link first collects information about the channel condition and computes its corresponding capacity, then updates its link price according to (35). The results are shown in Figure 3. Since there are 9 sensing nodes and 15 routes in our simulations, due to space limitation, we only show the aggregate rate of each sensing node. In Figure 3, we can be see that the rates first change sharply and then converge to the optimal one, which indicates the effectiveness of our ASMOP algorithm.

thumbnailFigure 3. Convergence of the ASMOP algorithm by using constraint method.

Next, we show the simulation results of the ASMOP algorithm using the linear weighted method. Here we set and . At each iteration , each sensing node updates its rates according to (39), and the decoupled price and are updated as the same in paradigm I. The results are shown in Figure 4, and similar conclusions can be made as in the paradigm I.

thumbnailFigure 4. Convergence of the ASMOP algorithm by using linear weighted method.

A similar simulation is performed for the hierarchical sequence method and the corresponding results are shown in Figure 5. We can see that the rates change sharply at the beginning of each iteration, and then converge to the optimal one in Figure 5.

thumbnailFigure 5. Convergence of the ASMOP algorithm by using hierarchical sequence method.

We further set the threshold of the network lifetime to be 800 h in the simulation for the constraint method and for linear weighted method. These two methods mainly target the energy-constraint in WSNs. For the hierarchical sequence method, we focus on the utility of the network. From Figures 3, 4, and 5, it can seen that the rates in Figure 5 are much larger than those in Figures 3 and 4. On the other hand, as the rates in each sensor node become large, the energy consumption increases. So the network lifetime under the hierarchical sequence method is less than that under the constraint method or linear weighted method. In addition, different multiobjective methods obtain different network performances. The results of the three simulations also demonstrate the efficiency and convenience of our proposed framework.

6. Conclusions

In this paper, we have proposed a general stochastic multiobjective optimization framework for WSNs. Our approach inherits advantages of both layered architectures and cross-layer design. Therefore, even the requirements and objectives are changed, it is not necessary to redesign the optimization framework but to have minor modifications of specific modules to meet the corresponding requirements. Although there may be uncertainty in WSNs, our approach can still achieve desired performance. In our future work, we will focus on investigating the general multiobjective optimization problem, instead of transforming the multiple objectives into a single one. We will study the distributed algorithms to optimize the objective vector function under some criteria, for example, Pareto optimality.

Acknowledgment

The research was supported in parts by NSFC Guangdong joint Project grant U0735003, NSFC grants 60736021 and 60974122, China 863 High-Tech Project 2007AA041201, the Fundamental Research Funds for the Central Universities grant 2009QNA5007.

References

  1. M Chiang, S Low, A Calderbank, J Doyle, Layering as optimization decomposition: a mathematical theory of network architectures. Proceedings of the IEEE 95(1), 255–312 (2007)

  2. Y Yi, M Chiang, Stochastic network utility maximisation. European Transactions on Telecommunications 19(4), 421–442 (2008). Publisher Full Text OpenURL

  3. L Chen, S Low, M Chiangs, J Doyle, Cross-layer congestion control, routing and scheduling design in ad hoc wireless networks. Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM '06), April 2006, Barcelona, Spain, 1–13

  4. C Long, B Li, Q Zhang, B Zhao, B Yang, X Guan, The end-to-end rate control in multiple-hop wireless networks: cross-layer formulation and optimal allocation. IEEE Journal on Selected Areas in Communications 26(4), 719–731 (2008)

  5. J Jin, W Wang, M Palaniswami, Application-oriented flow control forwireless sensor networks. Proceedings of the 3rd International Conference on Networking and Services (ICNS '07), June 2007, Athens, Greece, 71

  6. V Srinivasan, C Chiasserini, P Nuggehalli, R Rao, Optimal rate allocation for energy-efficient multipath routing in wireless ad hoc networks. IEEE Transactions on Wireless Communications 3(3), 891–899 (2004). Publisher Full Text OpenURL

  7. J Lee, R Mazumdar, N Shroff, Joint opportunistic power scheduling and end-to-end rate control for wireless ad hoc networks. IEEE Transactions on Vehicular Technology 56(2), 801–809 (2007)

  8. J Zhang, D Zheng, M Chiang, The impact of stochastic noisy feedback on distributed network utility maximization. IEEE Transactions on Information Theory 54(2), 645–665 (2008)

  9. Q Gao, J Zhang, S Hanly, Cross-layer rate control in wireless networks with lossy links: leaky-pipe flow, effective network utility maximization and hop-by-hop algorithms. IEEE Transactions on Wireless Communications 8(6), 3068–3076 (2009)

  10. J Zhu, K Hung, B Bensaou, F Nait-Abdesselam, Rate-lifetime tradeoff for reliable communication in wireless sensor networks. Computer Networks 52(1), 25–43 (2008). Publisher Full Text OpenURL

  11. F Kelly, A Maulloo, D Tan, Rate control for communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society 49(3), 237–252 (1998)

  12. M Chiang, Balancing transport and physical layers in wireless multihop networks: jointly optimal congestion control and power control. IEEE Journal on Selected Areas in Communications 23(1), 104–116 (2005)

  13. J Zhu, S Chen, B Bensaou, K Hung, Tradeoff between lifetime and rate allocation in wireless sensor networks: a cross layer approach. Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM '07), May 2007, Anchorage, Alaska, USA, 267–275

  14. J Chen, S He, Y Sun, P Thulasiraman, X(Sherman) Shen, Optimal flow control for utility-lifetime tradeoff in wireless sensor networks. Computer Networks 53(18), 3031–3041 (2009). Publisher Full Text OpenURL

  15. Y Wang, W Wang, X Li, W Song, Interference-aware joint routing and TDMA link scheduling for static wireless networks. IEEE Transactions on Parallel and Distributed Systems 19(12), 1709–1726 (2008)

  16. S Low, D Lapsley, Optimization flow control—I: basic algorithm and convergence. IEEE/ACM Transactions on Networking 7(6), 861–874 (1999). Publisher Full Text OpenURL

  17. L Cai, X(Sherman) Shen, J Pan, J Mark, Performance analysis of TCP-friendly AIMD algorithms for multimedia applications. IEEE Transactions on Multimedia 7(2), 339–355 (2005)

  18. L Wang, L Cai, X Liu, X(Sherman) Shen, Stability and TCP-friendliness and delay performance of AIMD/RED system. Computer Networks 51(15), 4475–4491 (2007). Publisher Full Text OpenURL

  19. J Zhang, M Gursoy, Achievable rates and resource allocation strategies for imperfectly-known fading relay channels. EURASIP Journal on Wireless Conmunications and Networking 2009 (2009)

  20. T Cui, L Chen, T Ho, Optimization based rate control for multicast with network coding: a multipath formulation. Proceedings of the 46th IEEE Conference on Decision and Control (CDC '07), December 2007, New Orleans, La, USA, 6041–6046

  21. D Bertsekas, Parallel and Distributed Computation: Numerical Methods, 2nd edn. (Athena Scientific, Belmont, Mass, USA, 1999)

  22. P Kall, S Wallace, Stochastic Programming (John Wiley & Sons, Chichester, UK, 2003)

  23. W Wang, M Palaniswami, S Low, Optimal flow control and routing in multi-path networks. Performance Evaluation 52(2-3), 119–132 (2003). Publisher Full Text OpenURL

  24. J Chen, W Xu, S He, Y Sun, P Thulasiraman, X(Sherman) Shen, Utility-based asynchronous flow control algorithm for wireless sensor networks (IEEE Journal on Selected Areas in Communications), . In press