Full Text:   <1272>

CLC number: TP202

On-line Access: 

Received: 2006-02-23

Revision Accepted: 2006-08-03

Crosschecked: 0000-00-00

Cited: 2

Clicked: 3302

Citations:  Bibtex RefMan EndNote GB/T7714

-   Go to

Article info.
1. Reference List
Open peer comments

Journal of Zhejiang University SCIENCE A 2006 Vol.7 No.12 P.2110~2117

10.1631/jzus.2006.A2110


Optimal congestion control algorithm for ad hoc networks: Penalty function-based approach


Author(s):  XU Wei-qiang, WU Tie-jun

Affiliation(s):  School of Information Science and Engineering, Zhejiang University, Hangzhou 310027, China; more

Corresponding email(s):   tjwu@zju.edu.cn

Key Words:  Ad hoc networks, Congestion control, Subgradient, Penalty function


XU Wei-qiang, WU Tie-jun. Optimal congestion control algorithm for ad hoc networks: Penalty function-based approach[J]. Journal of Zhejiang University Science A, 2006, 7(12): 2110~2117.

@article{title="Optimal congestion control algorithm for ad hoc networks: Penalty function-based approach",
author="XU Wei-qiang, WU Tie-jun",
journal="Journal of Zhejiang University Science A",
volume="7",
number="12",
pages="2110~2117",
year="2006",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2006.A2110"
}

%0 Journal Article
%T Optimal congestion control algorithm for ad hoc networks: Penalty function-based approach
%A XU Wei-qiang
%A WU Tie-jun
%J Journal of Zhejiang University SCIENCE A
%V 7
%N 12
%P 2110~2117
%@ 1673-565X
%D 2006
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2006.A2110

TY - JOUR
T1 - Optimal congestion control algorithm for ad hoc networks: Penalty function-based approach
A1 - XU Wei-qiang
A1 - WU Tie-jun
J0 - Journal of Zhejiang University Science A
VL - 7
IS - 12
SP - 2110
EP - 2117
%@ 1673-565X
Y1 - 2006
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2006.A2110


Abstract: 
In this paper, based on the inherent characteristic of the contention relation between flows in ad hoc networks, we introduce the notion of the link’s interference set, extend the utility maximization problem representing congestion control in wireline networks to ad hoc networks, apply the penalty function approach and the subgradient method to solve this problem, and propose the congestion control algorithm penalty function-based Optical congestion control (POCC) which is implemented in NS2 simulator. Specifically, each link transmits periodically the information on its congestion state to its interference set; the session at each source adjusts the transmission rate based on the optimal tradeoff between the utility value and the congestion level which the interference set of the links that this session goes though suffers from. MATLAB-based simulation results showed that POCC can approach the globally optimal solution. The NS2-based simulation results showed that POCC outperforms default TCP and ATCP to achieve efficient and fair resource allocation in ad hoc networks.

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article

Reference

[1] Chen, L., Low, S., Doyle, J., 2005. Joint Congestion Control and Media Access Control Design for Ad Hoc Wireless Networks. Proc. Infocom 2005, Miami, USA.

[2] Chiang, M., 2005. 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.

[3] Gupta, P., Kumar, P.R., 2000. The capacity of wireless network. IEEE Trans. on Information Theory, 46(2):388-404.

[4] Kelly, F.P., Maulloo, A.K., Tan, D.K.H., 1998. Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49(3):237-252.

[5] Lee, J.W., Chiang, M., Calderbank, R.A., 2006. Jointly optimal congestion and contention control in wireless ad hoc networks. IEEE Communications Letters, 10(3):216-218.

[6] Liu, J., Singh, S., 2001. ATCP: TCP for mobile ad hoc networks. IEEE Journal on Selected Areas in Communications, 19(7):1300-1315.

[7] Low, S.H., Lapsley, D.E., 1999. Optimal flow control I: basic algorithm and convergence. IEEE/ACM Trans. on Networking, 7(6):861-874.

[8] Mokhtar, S., Bazaraa, C., Shetty, M., 1979. Nonlinear Programming: Theory and Algorithms. Wiley, New York, p.338.

[9] Shor, N.Z., 1985. Minimization Methods for Non-differentiable Functions. Springer-Verlag.

[10] Wang, X., Kar, K., 2005. Cross-layer Rate Control for End-to-end Proportional Fairness in Wireless Networks with Random Access. Proc. ACM MobiHoc’05, Chicago, IL, USA, p.157-168.

[11] Xu, W., Wu, T., 2006. TCP issues in mobile ad hoc networks: challenges and solutions. Journal of Computer Science and Technology, 21(1):72-81.

[12] Xue, Y., Li, B., Nahrstedt, K., 2006. Optimal resource allocation in wireless ad hoc networks: A price-based approach. IEEE Trans. on Mobile Computing, 5(4):347-364.

Open peer comments: Debate/Discuss/Question/Opinion

<1>

Please provide your name, email address and a comment





Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952783; E-mail: cjzhang@zju.edu.cn
Copyright © 2000 - Journal of Zhejiang University-SCIENCE