王新兵
个性化签名
- 姓名:王新兵
- 目前身份:
- 担任导师情况:
- 学位:
-
学术头衔:
- 职称:-
-
学科领域:
通信技术
- 研究兴趣:
王新兵,男,1975年12月生()。1994年9月至1998年6月于上海交通大学自动化系学习,获学士学位与上海市优秀毕业生。1998年9月至2001年6月在清华大学计算机科学与技术系学习,获硕士学位。2001年9月至2006年8月在美国North Carolina State University学习,获得博士学位。2006年9月以学院级人才引进方式加入上海交通大学电子信息与电气工程学院,为电子工程系讲师,IEEE和ACM会员,美国工程领域荣誉组织Eta-Kappa-Nu的成员(/)。目前的研究成果有国际国内会议报告7次,出版专著/章节2本,已发表论文30篇,其中SCI收录7篇,EI收录23篇。获得IEEE IPCCC 2006“最佳论文奖”。IPCCC全称是IEEE International Performance,Computing and Communication Conference,是网络领域中有影响力的国际会议,收录于公认的著名网络会议的统计网站中(~almeroth/conf/stats/ 和 ~ timm/netconf/)。文章发表在网络研究的著名国际会议ACM MobiHoc 2008,IEEE INFOCOM 2005;2篇文章收录在无线通信知名国际核心期刊IEEE Transactions on Networking, IEEE Transactions on Wireless Communications,其中一篇被美国北卡罗莱纳州立大学选为特色文章;其他著名国际网络通信会议论文有Globecom会议3篇,ICC会议10篇,WCNC会议1篇。同时担任多项本研究领域的相关学术服务(/service.htm):
(a) 担任3种国际期刊的编委,如Associate Editor, Wireless Communications and Mobile Computing;
(b) 担任多种国际知名网络通信会议的技术委员会成员(Technical Program Committee,TPC),如IEEE INFOCOM,ICC, Globecom, WCNC,IPCCC,ICCCN等;
(c) 担任多种国际核心期刊的审稿人,如IEEE Trans on Networking, IEEE Trans on Wireless Communications, IEEE Trans on Automatic Control,IEEE JSAC等;
(d) 担任国际著名网络通信会议的审稿人,如ACM MobiHoc,IEEE INFOCOM等。
个人主页: /index.htm
-
主页访问
8017
-
关注数
0
-
成果阅读
411
-
成果数
9
【期刊论文】A Game Approach for Multi-Channel Allocation in Multi-Hop Wireless Networks
王新兵, Lin Gao, Xinbing Wang
,-0001,():
-1年11月30日
Channel allocation was extensively investigated in the framework of cellular networks, but it was rarely studied in the wireless ad-hoc networks, especially in the multi-hop ad-hoc networks. In this paper, we study the competitive multi-radio channel allocation problem in multi-hop wireless networks in detail. We model the channel allocation problem as a static cooperative game, in which some players collaborate to achieve high date rate. We propose the min-max coalition-proof Nash equilibrium (MMCPNE) channel allocation scheme in the game, which aims to max the achieved date rates of communication links. We analyze the existence of MMCPNE and prove the necessary conditions for MMCPNE. Furthermore, we propose several algorithms that enable the selfish players to converge to MMCPNE. Simulation results show that MMCPNE outperforms CPNE and NE schemes in terms of achieved data rates of the multi-hop links due to cooperation gain.
Multi-Radio, Channel Allocation, Game Theory, Nash Equilibria
-
36浏览
-
0点赞
-
0收藏
-
0分享
-
413下载
-
0评论
-
引用
【期刊论文】Achieving 100% Throughput in TCP/AQM under Aggressive Packet Marking with Small Buffer
王新兵, Do Young Eun, Xinbing Wang
,-0001,():
-1年11月30日
We consider a TCP/AQM system with large link capacity (NC) shared by many flows. The traditional rule-of-thumb suggests that the buffer size be chosen in proportion to the number of flows (N) for full link utilization, while recent research outcomes show that O( √N) buffer sizing is sufficient for high utilization and O(1) buffer sizing makes the system stable at the cost of reduced link utilization. In this paper, we consider a system where the AQM is scaled as O(Nα) with a buffer of size O(Nβ) (0 < α < β < 0.5). By capturing randomness both in packet arrivals and in packet markings, we develop a doubly-stochastic model for a TCP/AQM system with many flows. We prove that, under such a scale, the system always performs well in the sense that the link utilization goes to 100% and the loss ratio decreases to zero as the system size N increases. Our results assert that the system enjoys benefit of largeness with no tradeoff between full link utilization, zero packet loss, and small buffer size, at least asymptotically. This is in stark contrast to existing results showing that there always exists a tradeoff between full link utilization and the required buffer size. Extensive ns-2 simulation results under various configurations also confirm our theoretical findings. Our study illustrates that blind application of fluid modeling may result in strange results and exemplifies the importance of choosing a right modeling approach for different scaling regimes.
-
46浏览
-
0点赞
-
0收藏
-
0分享
-
127下载
-
0评论
-
引用
王新兵, Xinbing Wang, Do Young Eun, Wenye Wang
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL.6, NO.9, SEPTEMBER 2007,-0001,():
-1年11月30日
Traditional Call Admission Control (CAC) schemes only consider call-level performance and are mainly designed for circuit-switched wireless network. Since future wireless communications will become packet-switched systems, the packet-level features could be explored to improve the system performance. This is especially true when the TCP-type of elastic applications are running over such packet-switched wireless networks, as the elasticity of TCP applications has more tolerance toward the throughput/delay variation than non-elastic traffic does. In order to efficiently utilize the system resource from an admission control perspective, we propose a TCP-aware CAC scheme to regulate the packet-level dynamics of TCP flows. We analyze the system performance under realistic scenarios in which (i) the call holding time for non-elastic traffic like voice is independent of system states and (ii) the call holding time for TCP type of traffic depends on the system state, i. e., on the TCP flow’s transmission rate. Extensive simulations are presented under different scenarios to show that the proposed scheme can effectively improve the system performance in terms of call blocking probability, call-level throughput (call/min) and link utilization, in accordance with our theoretical results.
Admission control, wireless networks, TCP
-
40浏览
-
0点赞
-
0收藏
-
0分享
-
103下载
-
0评论
-
引用
【期刊论文】Improve throughput of TCP-Vegas in multihop ad hoc networks
王新兵, Lianghui Ding, Xinbing Wang, Youyun Xu, , Wenjun Zhang
Computer Communications xxx (2008) xxx–xxx,-0001,():
-1年11月30日
Performance of TCP-Vegas is not satisfactory in multihop ad hoc networks over IEEE 802.11 MAC protocol. We analyze the problem with a unified network model and a TCP source window model. We observe that Vegas cannot maintain the optimal window with maximum average throughput when the network capacity is smaller than the reset slow start threshold of Vegas. The aggregate throughput of all traffics decreases as the load of network increases. The main reasons lie in Vegas’s large minimum congestion window, large reset slow start threshold and aggressive window increase policy. All of them induce overload of the network, which cause packet losses at MAC layer and over-reaction at routing layer. These in return result in the breakup of end-to-end connections and reduce the throughput. To fix these problems, we propose a modified TCP protocol based on TCP-Vegas for multihop ad hoc networks, called Vegas-W. We extend congestion window to fraction with a rate control timer under the TCP sending process. Probing mechanisms of legacy TCP-Vegas in both slow start and congestion avoidance phases are changed to increase congestion window after receiving more than one ACK. Furthermore, we update slow start threshold by tracking stable window. We evaluate the performance of Vegas-W through ns-2. Extensive simulation results show that Vegas-W can improve the throughput up to 87% over legacy TCP-Vegas over a variety of topologies including chain, grid, star, dumbbell and hammer, etc.
TCP, Vegas, Throughput, Ad hoc, DSR, 802., 11
-
71浏览
-
0点赞
-
0收藏
-
0分享
-
294下载
-
0评论
-
引用
【期刊论文】VoIP over IEEE 802.11 WLANs and Effective Admission Control by Adapting Transmitting Interval
王新兵, Zhuo Chen, Lingyun Wang, Xinbing Wang, Hsiao-Hwa Chen
,-0001,():
-1年11月30日
-
48浏览
-
0点赞
-
0收藏
-
0分享
-
159下载
-
0评论
-
引用
【期刊论文】Achieving weighted fairness and efficient channel utilization in IEEE 802. 11e WLANs
王新兵, Wei Zhang, Jun Sun, Xinbing Wang
,-0001,():
-1年11月30日
This paper addresses the problem of maximizing the protocol capacity of 802.11e networks, under the assumption that each access category (AC) has the same packet length. We prove that the maximal protocol capacity can be achieved at an optimal operating point with the medium idle probability of e−√2/T*c, where T*c is the duration of collision time in terms of slot unit. Our results indicate that the optimal operating point is independent of the number of stations and throughput ratio among ACs, which means the proposed analytical results still hold even when throughput ratio and station number are time-varying. Further, we show that the maximal protocol capacity can be achieved in saturated cases by properly choosing the protocol parameters. We present a parameter configuration algorithm to achieve both efficient channel utilization and proportional fairness in IEEE 802.11e EDCA networks. Extensive simulation and analytical results are presented to verify the proposed ideas.
IEEE 802., 11e, parameter configuration, performance analysis, protocol capacity, wireless LAN
-
39浏览
-
0点赞
-
0收藏
-
0分享
-
168下载
-
0评论
-
引用
【期刊论文】Performance Analysis of TCP/AQM with Generalized AIMD under Intermediate Buffer Sizes
王新兵, Do Young Eun, Xinbing Wang
Preprint submitted to Elsevier Science 29 March 2007,-0001,():
-1年11月30日
For TCP/AQM systems, the issue of buffer sizing has recently received much attention. The classical rule-of-thumb suggests O(N) buffer size to ensure full link utilization when N TCP flows share a bottleneck link of capacity O(N), while recent empirical study shows the buffer of size O(√N) is enough to yield high utilization (say, 95%) for large N. However, these results are all limited to the drop-tail scheme and there has been no systematic modeling framework for any buffer sizing between O(√N) and O(N). In this paper, we study the limiting behavior of a TCP/AQM system for an intermediate buffer sizing of O(Nγ) (0.5 ≤γ< 1). We develop a stochastic model in a discrete-time setting to characterize the system dynamics and then show that we can have 100% link utilization and zero packet loss probability for a large number of flows when the buffer size is chosen anywhere between O(√N) and O(N). Our model is general enough to cover any queue-based AQM scheme with ECN marking (including the drop-tail) and various generalized AIMD (Additive-Increase-Multiplicative-Decrease) algorithms for each TCP flow. We also provide arguments showing that the discrete-time based modeling can effectively capture all the essential system dynamics under our choice of scaling (0.5 ≤γ< 1) for buffer size as well as AQM parameters.
Congestion Control, Buffer Sizing, Active Queue Management, Discrete-time Stochastic Models, Performance Analysis
-
39浏览
-
0点赞
-
0收藏
-
0分享
-
110下载
-
0评论
-
引用
【期刊论文】Local and global stability of TCP-newReno/RED with many flows
王新兵, Xinbing Wang, Do Young Eun
Computer Communications xxx (2007) xxx–xxx ,-0001,():
-1年11月30日
Stability is one of the important issues for a TCP/AQM (Active Queue Management) system. In this paper, we study the local and global stability of TCP-newReno/RED under many flows regime. The existing results of the local stability are mostly for TCP-Reno, not for new Reno. These results are obtained based on a small scale model with a few number of flows and thus cannot be blindly applied to a large system with many flows. Moreover, traditional approaches for the global stability based on Lyapunov functions is not suitable for a system with a large amount of flows due to its complexity. Motivated by this, we present a normalized discrete-time model to capture the essential dynamics of TCP-newReno/RED with many flows and obtain its local stability criterion. The normalized model allows us to proceed numerical iterations to analyze the global stability in an efficient manner. Our results show that by properly choosing some ‘free’ parameters, we can always ensure that a locally stable TCP-newReno/RED system is in fact globally stable. Our results become more accurate as the number of flows increases. Finally, we extend our normalized model to the case of heterogeneous RTTs.
TCP, NewReno, Local stability, Global stability
-
45浏览
-
0点赞
-
0收藏
-
0分享
-
125下载
-
0评论
-
引用
王新兵, Wenye Wang, Xinbing Wang, Arne A. Nilsson
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL.5, NO.5, MAY 2006,-0001,():
-1年11月30日
In this paper, we present a new energy-efficient bandwidth allocation scheme for wireless networks. First of all, we investigate the intrinsic relationship between the energy consumption and transmission rates of mobile terminals, in which transmission rate is determined through channel allocations. Then, we propose two schemes for connection admission control: Victim Selection Algorithm (VSA) and Beneficiary Selection Algorithm (BSA) with the intent to reduce energy consumption of each terminal. Moreover, we introduce an adjustment algorithm to statistically meet the demands for quality of service (QoS) during the resource allocation. The performance of the proposed schemes is evaluated with respect to energy consumption rate of each successfully transmitted bit, throughput and call blocking probabilities. An extensive analysis and simulation study is conducted for Poisson and self-similar, multi-class traffic.
Wireless networks, energy consumption, connection admission control
-
47浏览
-
0点赞
-
0收藏
-
0分享
-
135下载
-
0评论
-
引用