Fengyuan Ren
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Fengyuan Ren has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Chuang Lin
Tsinghua University
6 shared publications - Hao Wen
Tsinghua University, Beijing China
2 shared publications - Bo Wei
Department of Electrical Engineering, Southern Methodist University, Dallas, TX 75275, USA
1 shared publication Dejun Mu
College of Automation, Northwestern Polytechnical University, Xi'An 710072, China
1 shared publication- Eryk Dutkiewicz
Macquarie University, Sydney, Australia
1 shared publication - Guangwen Yang
Tsinghua University
1 shared publication
Latest Publications
- 24 June 2010
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 16 (5) , 576-585
A-ADHOC: An Adaptive Real-time Distributed MAC Protocol for Vehicular Ad Hoc Networks
- 24 June 2010
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 16 (5) , 576-585
A-ADHOC: An Adaptive Real-time Distributed MAC Protocol for Vehicular Ad Hoc Networks
- 1 December 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10972641,p. 303-310
Joint Adaptive Redundancy and Partial Retransmission for Reliable Transmission in Wireless Sensor Networks
As a potentially competitive technique, erasure coding has been employed in wireless sensor networks (WSNs) to enhance transmission reliability. In this paper, to design a practical and efficient redundancy mechanism in WSNs, we firstly provide a theoretical study of packet delivery probability and average energy consumption for retransmission and redundancy mechanisms. The theoretical results indicate that in WSNs, the adaptive redundancy coding mechanism is more energy efficient than retransmission while keeping the same level of reliability in most scenarios. Then based on the mapping table and two basic design principles obtained from the theoretical analysis, we propose a reliable transport protocol ARRTP which combines the adaptive redundancy mechanism and partial retransmission. The simulation and trace-driven results both verify that when the loss probability varies from low to high, our protocol provides reliability with comparably lower energy consumption. Furthermore, compared with fixed redundancy degrees, the robustness of the adaptive mechanism are also evaluated.
- 1 December 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10972641,p. 303-310
Joint Adaptive Redundancy and Partial Retransmission for Reliable Transmission in Wireless Sensor Networks
As a potentially competitive technique, erasure coding has been employed in wireless sensor networks (WSNs) to enhance transmission reliability. In this paper, to design a practical and efficient redundancy mechanism in WSNs, we firstly provide a theoretical study of packet delivery probability and average energy consumption for retransmission and redundancy mechanisms. The theoretical results indicate that in WSNs, the adaptive redundancy coding mechanism is more energy efficient than retransmission while keeping the same level of reliability in most scenarios. Then based on the mapping table and two basic design principles obtained from the theoretical analysis, we propose a reliable transport protocol ARRTP which combines the adaptive redundancy mechanism and partial retransmission. The simulation and trace-driven results both verify that when the loss probability varies from low to high, our protocol provides reliability with comparably lower energy consumption. Furthermore, compared with fixed redundancy degrees, the robustness of the adaptive mechanism are also evaluated.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21556806,p. 1-7
Retransmission or Redundancy: Transmission Reliability in Wireless Sensor Networks
As an application-driven network, wireless sensor network generally requires high data reliability to maintain detection and response capabilities. Although two approaches, which are retransmission and redundancy, have been proposed to enhance data reliability, the theoretical work is required to evaluate their impact on transmission reliability and energy efficiency. In this paper, we offer a comprehensive theoretical study on the packet arrival probability and average energy consumption for both approaches. Our analysis indicates that when loss probability remains low or moderate, erasure coding, a scheme based on redundancy, is more reliable and energy efficient than retransmission. However, the performance of erasure coding would largely deteriorate under high packet loss condition. We also demonstrate that its resistance capability against packet loss weakens as hop number increases. Furthermore, with the increase in redundancy, erasure coding has to sacrifice the advantage of energy efficiency for reliability.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21556806,p. 1-7
Retransmission or Redundancy: Transmission Reliability in Wireless Sensor Networks
As an application-driven network, wireless sensor network generally requires high data reliability to maintain detection and response capabilities. Although two approaches, which are retransmission and redundancy, have been proposed to enhance data reliability, the theoretical work is required to evaluate their impact on transmission reliability and energy efficiency. In this paper, we offer a comprehensive theoretical study on the packet arrival probability and average energy consumption for both approaches. Our analysis indicates that when loss probability remains low or moderate, erasure coding, a scheme based on redundancy, is more reliable and energy efficient than retransmission. However, the performance of erasure coding would largely deteriorate under high packet loss condition. We also demonstrate that its resistance capability against packet loss weakens as hop number increases. Furthermore, with the increase in redundancy, erasure coding has to sacrifice the advantage of energy efficiency for reliability.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 206-215
Improving the Convergence and Stability of Congestion Control Algorithm
The traditional TCP congestion control is inefficient for high speed networks and it is a challenge to design a high speed replacement for TCP. By simulating some existing high speed protocols, we find that these high speed protocols have limitations in convergence and stability. To address these problems, we apply a population ecology model to design a novel congestion control algorithm-Coupling Logistic TCP(CLTCP). It is based on bandwidth pre-assignment that is similar to XCP and MaxNet. The pre-assignment rate factor is computed in the routers based on the information of the router capacity, the aggregate incoming traffic and the queue length. Then the senders adjust the sending rate according to the pre-assignment rate factor which carries by the packet to strengthen the convergence and stability of transport protocol. The theoretical analysis and simulation results show that CLTCP provides not only fast convergence and strong stability, but also high utilization and fair bandwidth allocation regardless of round trip time.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 206-215
Improving the Convergence and Stability of Congestion Control Algorithm
The traditional TCP congestion control is inefficient for high speed networks and it is a challenge to design a high speed replacement for TCP. By simulating some existing high speed protocols, we find that these high speed protocols have limitations in convergence and stability. To address these problems, we apply a population ecology model to design a novel congestion control algorithm-Coupling Logistic TCP(CLTCP). It is based on bandwidth pre-assignment that is similar to XCP and MaxNet. The pre-assignment rate factor is computed in the routers based on the information of the router capacity, the aggregate incoming traffic and the queue length. Then the senders adjust the sending rate according to the pre-assignment rate factor which carries by the packet to strengthen the convergence and stability of transport protocol. The theoretical analysis and simulation results show that CLTCP provides not only fast convergence and strong stability, but also high utilization and fair bandwidth allocation regardless of round trip time.
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 208-212
Utilizing TTL to Enhance TCP Fairness
The existed work shows that TCP has serious unfairness problem in multiple congested router. To improve TCP fairness, some queue management schemes, such as FRED, Balanced RED, have been developed to solve this problem, but most of them require to maintain per-flow state in routers. In our previous work, we have designed a two-category classifier for Active Queue Management (AQM) to enhance TCP fairness. Although it can achieve better TCP fairness in multiple congested router, it requires some modification to TCP header. Because it is incompatible for the standard TCP, it lacks of feasibility. In this paper, we will utilize TTL field in IP header to improve TCP fairness. A three-dimensional two-category classifier is designed by extending our previous work, and a based-hops fairness enhancement algorithm (BHFE) for AQM is developed. Simulation results show that it is not only effective to enhance TCP fairness in multiple congested router but also very well to keep queue length stable and small. Moreover, a very important advantage of BHFE is that it does not requires per-flow state in router and any modifications to the standard TCP/IP.
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 208-212
Utilizing TTL to Enhance TCP Fairness
The existed work shows that TCP has serious unfairness problem in multiple congested router. To improve TCP fairness, some queue management schemes, such as FRED, Balanced RED, have been developed to solve this problem, but most of them require to maintain per-flow state in routers. In our previous work, we have designed a two-category classifier for Active Queue Management (AQM) to enhance TCP fairness. Although it can achieve better TCP fairness in multiple congested router, it requires some modification to TCP header. Because it is incompatible for the standard TCP, it lacks of feasibility. In this paper, we will utilize TTL field in IP header to improve TCP fairness. A three-dimensional two-category classifier is designed by extending our previous work, and a based-hops fairness enhancement algorithm (BHFE) for AQM is developed. Simulation results show that it is not only effective to enhance TCP fairness in multiple congested router but also very well to keep queue length stable and small. Moreover, a very important advantage of BHFE is that it does not requires per-flow state in router and any modifications to the standard TCP/IP.
- 1 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 579-584
Security mechanisms Analysis of Wireless Sensor Networks specific Routing attacks
Secure routing is a challenging task because ad-hoc and resource constrained nature of wireless sensor networks. In this paper, we discuss several specific routing attacks, such as wormhole attack, sinkhole attack, Sybil attack, false data insert attack etc. Some security mechanisms, which are used to defend against these attacks, are analyzed. This paper also points out the open research challenges in this field
- 1 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 579-584
Security mechanisms Analysis of Wireless Sensor Networks specific Routing attacks
Secure routing is a challenging task because ad-hoc and resource constrained nature of wireless sensor networks. In this paper, we discuss several specific routing attacks, such as wormhole attack, sinkhole attack, Sybil attack, false data insert attack etc. Some security mechanisms, which are used to defend against these attacks, are analyzed. This paper also points out the open research challenges in this field
- 23 March 2005
- Published by Elsevier in Computer Communications
- Vol. 28 (5) , 485-493
A robust active queue management algorithm in large delay networks
- 23 March 2005
- Published by Elsevier in Computer Communications
- Vol. 28 (5) , 485-493
A robust active queue management algorithm in large delay networks