Peng Xie
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Peng Xie has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Jun-Hong Cui
Department of Computer Science and Engineering, University of Connecticut, Storrs, CT 06269 USA
2 shared publications - Andrew See
Department of Computer Science and Engineering, University of Connecticut, Storrs, CT 06269-2155, USA
1 shared publication - Dario Maggiorini
Department of Computer Science, University of Milan, Milan, Italy
1 shared publication - Jun-Hong Cui
Department of Computer Science and Engineering, University of Connecticut, Storrs, CT, USA
1 shared publication - Nicolas Nicolaou
Algolysis Ltd, Limassol, 4630, Cyprus
1 shared publication
Latest Publications
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10952055,p. 747-753
An FEC-based Reliable Data Transport Protocol for Underwater Sensor Networks
In this paper, we investigate the reliable data transport problem in underwater sensor networks. Underwater sensor networks are significantly different from terrestrial sensor networks in two aspects: acoustic channels are used for communication and most sensor nodes are mobile due to water current. These distinctions feature underwater sensor networks with low bandwidth capacity, large propagation delay, high error probability, half-duplex channels, and highly dynamic topology, which pose many new challenges for reliable data transport in underwater sensor networks. In this paper, we propose a protocol, called segmented data reliable transport (SDRT), to achieve reliable data transfer in underwater sensor networks. SDRT is essentially a hybrid approach of ARQ and FEC. It adopts efficient erasure codes (so-called SVT codes in this paper), transferring encoded packets block by block and hop by hop. Compared with other existing reliable data transport approaches for underwater networks, SDRT can reduce the total number of transmitted packets, improve channel utilization, and simplify protocol management. In addition, we develop a mathematic model to estimate the expected number of packets actually needed. Based on this model, we can set the block size appropriately for SDRT, as helps to address the node mobility issue. We conduct simulations to evaluate our model and SDRT. The results show that our model can closely predict the number of packets actually needed, and SDRT is energy efficient and can achieve high channel utilization.
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10952055,p. 747-753
An FEC-based Reliable Data Transport Protocol for Underwater Sensor Networks
In this paper, we investigate the reliable data transport problem in underwater sensor networks. Underwater sensor networks are significantly different from terrestrial sensor networks in two aspects: acoustic channels are used for communication and most sensor nodes are mobile due to water current. These distinctions feature underwater sensor networks with low bandwidth capacity, large propagation delay, high error probability, half-duplex channels, and highly dynamic topology, which pose many new challenges for reliable data transport in underwater sensor networks. In this paper, we propose a protocol, called segmented data reliable transport (SDRT), to achieve reliable data transfer in underwater sensor networks. SDRT is essentially a hybrid approach of ARQ and FEC. It adopts efficient erasure codes (so-called SVT codes in this paper), transferring encoded packets block by block and hop by hop. Compared with other existing reliable data transport approaches for underwater networks, SDRT can reduce the total number of transmitted packets, improve channel utilization, and simplify protocol management. In addition, we develop a mathematic model to estimate the expected number of packets actually needed. Based on this model, we can set the block size appropriately for SDRT, as helps to address the node mobility issue. We conduct simulations to evaluate our model and SDRT. The results show that our model can closely predict the number of packets actually needed, and SDRT is energy efficient and can achieve high channel utilization.
- Top Cited Papers
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Improving the Robustness of Location-Based Routing for Underwater Sensor Networks
This paper investigates a fundamental networking problem in underwater sensor networks: robust and energy-efficient routing. We present an adaptive location-based routing protocol, called hop-by-hop vector-based forwarding (HH-VBF). It uses the notion of a "routing vector" (a vector from the source to the sink) acting as the axis of the "routing pipe", similar to the vector based forward (VBF) routing in the work of P. Xie, J.-H. Cui and L. Lao (VBF: Vector-Based Forwarding Protocol for Underwater Sensor Networks. Technical report, UCONN CSE Technical Report: UbiNet-TR05-03 (BECAT/CSE-TR-05-6), Feb. 2005). Unlike the original VBF approach, however, HH-VBF suggests the use of a routing vector for each individual forwarder in the network, instead of a single network-wide source-to-sink routing vector. By the creation of the hop-by-hop vectors, HH-VBF can overcome two major problems in VBF: (1) too small data delivery ratio for sparse networks; (2) too sensitive to "routing pipe" radius threshold. We conduct simulations to evaluate HH-VBF, and the results show that HH-VBF yields much better performance than VBF in sparse networks. In addition, HH-VBF is less sensitive to the routing pipe radius threshold. Furthermore, we also analyze the behavior of HH-VBF and show that assuming proper redundancy and feedback techniques, HH-VBF can facilitate the avoidance of any "void" areas in the network.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Top Cited PapersImproving the Robustness of Location-Based Routing for Underwater Sensor Networks
This paper investigates a fundamental networking problem in underwater sensor networks: robust and energy-efficient routing. We present an adaptive location-based routing protocol, called hop-by-hop vector-based forwarding (HH-VBF). It uses the notion of a "routing vector" (a vector from the source to the sink) acting as the axis of the "routing pipe", similar to the vector based forward (VBF) routing in the work of P. Xie, J.-H. Cui and L. Lao (VBF: Vector-Based Forwarding Protocol for Underwater Sensor Networks. Technical report, UCONN CSE Technical Report: UbiNet-TR05-03 (BECAT/CSE-TR-05-6), Feb. 2005). Unlike the original VBF approach, however, HH-VBF suggests the use of a routing vector for each individual forwarder in the network, instead of a single network-wide source-to-sink routing vector. By the creation of the hop-by-hop vectors, HH-VBF can overcome two major problems in VBF: (1) too small data delivery ratio for sparse networks; (2) too sensitive to "routing pipe" radius threshold. We conduct simulations to evaluate HH-VBF, and the results show that HH-VBF yields much better performance than VBF in sparse networks. In addition, HH-VBF is less sensitive to the routing pipe radius threshold. Furthermore, we also analyze the behavior of HH-VBF and show that assuming proper redundancy and feedback techniques, HH-VBF can facilitate the avoidance of any "void" areas in the network.
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01977385,p. 1-6
Exploring Random Access and Handshaking Techniques in Large-Scale Underwater Wireless Acoustic Sensor Networks
In this paper, we study the medium access control (MAC) problem in large-scale underwater wireless acoustic sensor networks. We specially explore the random access and handshaking (i.e., RTS/CTS) techniques. We first formally model the two approaches, and then conduct extensive numerical experiments to study their performance in various network conditions. Based on our results, we observe that the performance of random access and RTS/CTS are affected by many factors such as data rate, transmission range, network topology, packet size, and traffic pattern. And our results show that RTS/CTS is more suitable for dense networks with high date rate, low/medium transmission range and bursty traffic, whereas random access is preferred in sparse networks with low data rate and non-bursty traffic. We believe this work will supply useful guidelines for energy-efficient adaptive MAC design in large-scale underwater wireless acoustic sensor networks
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01977385,p. 1-6
Exploring Random Access and Handshaking Techniques in Large-Scale Underwater Wireless Acoustic Sensor Networks
In this paper, we study the medium access control (MAC) problem in large-scale underwater wireless acoustic sensor networks. We specially explore the random access and handshaking (i.e., RTS/CTS) techniques. We first formally model the two approaches, and then conduct extensive numerical experiments to study their performance in various network conditions. Based on our results, we observe that the performance of random access and RTS/CTS are affected by many factors such as data rate, transmission range, network topology, packet size, and traffic pattern. And our results show that RTS/CTS is more suitable for dense networks with high date rate, low/medium transmission range and bursty traffic, whereas random access is preferred in sparse networks with low data rate and non-bursty traffic. We believe this work will supply useful guidelines for energy-efficient adaptive MAC design in large-scale underwater wireless acoustic sensor networks