Yang Song
Abstract
In this article, we propose a constrained queueing model to investigate the performance of multihop wireless sensor networks. Specifically, the cross-layer interactions of rate admission control, traffic engineering, dynamic routing, and adaptive link scheduling are studied jointly with the proposed queueing model. In addition, the stochastic network utility maximization problem in wireless sensor networks is addressed within this framework. We propose an adaptive network resource allocation scheme, called the ANRA algorithm, which provides a joint solution to the multiple-layer components of the stochastic network utility maximization problem. We show that the proposed ANRA algorithm achieves a near-optimal solution, that is, (1-ϵ) of the global optimum network utility where ϵ can be arbitrarily small, with a trade-off with the average delay experienced in the network. The proposed ANRA algorithm enjoys the merit of self-adaptability through its online nature and thus is of particular interest for time-varying scenarios such as multihop wireless sensor networks.
- Akyildiz, I. F. and Kasimoglu, I. H. 2004. Wireless sensor and actor networks: Research challenges. Elsevier Comput. Networks.Google Scholar
- Akyol, U., Andrews, M., Gupta, P., Hobby, J., Saniee, I., and Stolyar, A. 2008. Joint scheduling and congestion control in mobile ad-hoc networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom).Google Scholar
- Chiang, M. 2005. Balancing transport and physical layer in wireless multihop networks: Jointly optimal congestion control and power control. IEEE J. Select. Areas Comm. 1, 104--116. Google ScholarDigital Library
- Chiang, M., Low, S. H., Calderbank, A. R., and Doyle, J. C. 2007. Layering as optimization decomposition: A mathematical theory of network architectures. Proc. IEEE 95, 255--312.Google ScholarCross Ref
- Eryilmaz, A. and Srikant, R. 2005. Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom).Google Scholar
- Georgiadis, L., Neely, M. J., and Tassiulas, L. 2006. Resource Allocation and Cross-Layer Control in Wireless Networks. Foundations and Trends in Networking. Google ScholarDigital Library
- Gupta, A., Lin, X., and Srikant, R. 2007. Low-complexity distributed scheduling algorithms for wireless networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom).Google Scholar
- Gupta, G. R. and Shroff, N. 2009. Delay analysis for multi-hop wireless networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom).Google Scholar
- Jiang, L. and Walrand, J. 2008. A distributed csma algorithm for throughput and utility maximization in wireless networks. In Proceedings of the Allerton Conference of Communication Control, and Computing.Google Scholar
- Joo, C. 2008. A local greedy scheduling scheme with provable performance guarantee. In Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). Google ScholarDigital Library
- Kelly, F., Maulloo, A., and Tan, D. 1998. Rate control for communication networks: Shadow prices, proportional fairness and stability. J. Oper. Res. Soc. 49, 237--252.Google ScholarCross Ref
- Lin, X. 2006. On characterizing the delay performance of wireless scheduling algorithms. In Proceedings of the Allerton Conference of Communication Control, and Computing.Google Scholar
- Low, S. H. and Lapsley, D. E. 1999. Optimization flow control, i: Basic algorithm and convergence. IEEE/ACM Trans. Netw. 7, 861--875. Google ScholarDigital Library
- Modiano, E., Shah, D., and Zussman, G. 2006. Maximizing throughput in wireless networks via gossiping. In Proceedings of the ACM SIGMETRICS Conference. Google ScholarDigital Library
- Neely, M. J. 2003. Dynamic power allocation and routing for satellite and wireless networks with time varying channels. Ph.D. thesis, Masssachusetts Institute of Technology. Google ScholarDigital Library
- Neely, M. J. 2006. Energy optimal control for time varying wireless networks. IEEE Trans. Inf. Theory 52, 2915--2934. Google ScholarDigital Library
- Neely, M. J., Modiano, E., and Li, C.-P. 2008. Fairness and optimal stochastic control for heterogeneous networks. IEEE/ACM Trans. Netw. 16, 396--409. Google ScholarDigital Library
- Neely, M. J., Modiano, E., and Rohrs, C. E. 2005. Dynamic power allocation and routing for time-varying wireless networks. IEEE J. Select. Areas Comm. 23, 89--103. Google ScholarDigital Library
- Radunovic, B., Gkantsidis, C., Gunawardena, D., and Key, P. 2008. Horizon: Balancing tcp over multiple paths in wireless mesh network. In Proceedings of the 14th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiCom). Google ScholarDigital Library
- Shakkottai, S. and Srikant, R. 2008. Network Optimization and Control. Foundations and Trends in Networking. Google ScholarDigital Library
- Sharma, A. B., Golubchik, L., Govindan, R., and Neely, M. J. 2009. Dynamic data compression in multi-hop wireless networks. In Proceedings of the ACM SIGMETRICS Conference. Google ScholarDigital Library
- Song, Y. and Fang, Y. 2007. Distributed rate control and power control in resource-constrained wireless sensor networks. In Proceedings of the IEEE MILCOM Conference.Google Scholar
- Srikant, R. 2003. The Mathematics of Internet Congestion Control. Birkhauser Boston. Google ScholarDigital Library
- Stolyar, A. 2005. Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm. Queu. Syst. 50, 401--457. Google ScholarDigital Library
- Stolyar, A. 2006. Large deviations of queues under qos scheduling algorithms. In Proceedings of the Allerton Conference of Communication Control, and Computing.Google Scholar
- Stolyar, A. 2008. Dynamic distributed scheduling in random access networks. J. Appl. Probab. 45, 297--313.Google ScholarCross Ref
- Tassiulas, L. and Ephremides, A. 1992. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Autom. Control 37, 1936--1949.Google ScholarCross Ref
- Trench, W. F. 2003. Introduction to Real Analysis. Prentice Hall.Google Scholar
- Wu, X., Srikant, R., and Perkins, J. 2007. Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks. IEEE Trans. Mobile Comput. Google ScholarDigital Library
- Yick, J., Mukherjee, B., and Ghosal, D. 2007. Wireless sensor network survey. Elsevier Comput. Networks. Google ScholarDigital Library
- Ying, L., Shakkottai, S., and Reddy, A. 2009. On combining shortest-path and back-pressure routing over multihop wireless networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom).Google Scholar
Recommendations
On the cross-layer interactions between congestion and contention in wireless sensor and actor networks
Wireless Sensor and Actor Networks (WSAN) are composed of large number of sensor nodes collaboratively observing a physical phenomenon and relatively smaller number of actor nodes, which act upon the sensed phenomenon. Due to the limited capacity of ...
Cross-layer design and optimisation for wireless sensor networks
Cross-layer design and optimisation is a new technique which can be used to design and improve the performance in both wireless and wireline networks. The central idea of cross-layer design is to optimise the control and exchange of information over two ...
Cross layer optimization for efficient data aggregation in multi-hop wireless sensor networks
IWCMC '10: Proceedings of the 6th International Wireless Communications and Mobile Computing ConferenceWireless Sensor Networks (WSN) is the most promising technological paradigm to support the next generation highly efficient emergency management systems. Optimal design of WSN involves all the layers of the protocol stack: from the physical (PHY), the ...
Comments