Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Haniph A. Latchman

dblp:67/2263 · DBLP profile ↗
← Back
14ranked-venue papers
1as first author
0since 2021 · last 2016
0000-0002-9155-8290ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 11Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Physical-layer communications · 87% Wireless networking · 13%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computing education · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
cooperative communication
0.212016
Cooperative In-Home Power Line Communication: Analyses Based on a Measurement Campaign · IEEE Trans. Commun. 2016
Physical-layer communications › digital transmission systems › wireline communication
power line communication
0.212016
Cooperative In-Home Power Line Communication: Analyses Based on a Measurement Campaign · IEEE Trans. Commun. 2016
Physical-layer communications › relaying
relay protocol
0.212016
Cooperative In-Home Power Line Communication: Analyses Based on a Measurement Campaign · IEEE Trans. Commun. 2016
Physical-layer communications › modulation › multicarrier modulation
OFDM
0.112016
Cooperative In-Home Power Line Communication: Analyses Based on a Measurement Campaign · IEEE Trans. Commun. 2016
Wireless networking › medium access control
backoff algorithm
0.012003
A Novel Medium Access Control Protocol with Fast Collision Resolution for Wireless LANs · INFOCOM 2003
Wireless networking
collision resolution
0.012003
A Novel Medium Access Control Protocol with Fast Collision Resolution for Wireless LANs · INFOCOM 2003
Wireless networking
medium access control
0.012003
A Novel Medium Access Control Protocol with Fast Collision Resolution for Wireless LANs · INFOCOM 2003

Methods — techniques the papers use, named apart from their topics

selection combining · 0.2maximal ratio combining · 0.2equal gain combining · 0.2decode-and-forward · 0.2amplify-and-forward · 0.2simulation · 0.0synchronized streaming video · 0.0asynchronous learning networks · 0.0
YearPublicationVenuePosition
2016 Cooperative In-Home Power Line Communication: Analyses Based on a Measurement Campaign
abstract
This work focuses on analyses of cooperative protocols to enhance the performance of power line communication systems. Based on a measurement campaign and considering a sum power constraint, achievable data rates for amplify-and-forward (AF) and decode-and-forward (DF) protocols are analyzed. Similar investigations are performed for the maximum data rates attained using Hermitian-symmetric orthogonal frequency division multiplexing (HS-OFDM) together with equal gain combining (EGC), selection combining (SC) and maximal ratio combining (MRC) techniques. The influences of optimally and uniformly allocated transmission power and frequency bandwidth are are also analyzed and the efficiency of combination before and after equalization is compared. Results show that the relative distances among source, relay and destination nodes significantly impact system performance. Also, they reveal a range of total transmission power and bandwidth in which benefits can be verified. Among combining techniques, MRC and SC present similar results, but MRC offers a slightly better performance. In relation to computational complexity, SC is the most favorable. Maximum data rate analyses of HS-OFDM with frequency domain equalization based on zero forcing and minimum mean square error criteria show that the former scheme offers almost the same performance as the latter. Furthermore, it is shown that equalization after combination is more advantageous.
Michelle S. P. Facina, Haniph A. Latchman, H. Vincent Poor, Moisés Vidal Ribeiro
IEEE Trans. Commun.2
2006 A DNS Based New Route Optimization Scheme with Fast Neighbor Discovery in Mobile IPv6 Networks
Byungjoo Park, Haniph A. Latchman
APNOMS2
2006 Allocation Requirements for Supporting Latency Bound Traffic in HomePlug AV Networks
abstract
Impulse noise sources such as dimmers, halogen lamps etc., are quite common in power line networks. Hence, high-speed power line communications systems should be designed to deal effectively with them. HomePlug AV uses aggressive channel adaptation at the physical layer and efficient retransmissions at the MAC layer to deal with impulse noise. This approach can lead to very high probability (up to 20%) of Forward Error Correction (FEC) block errors under some channel conditions. HomePlug AV also has large transmission overhead to ensure reliable communication over the powerline. Transmission overhead can negatively impact the MAC efficiency on channels with high FEC Block Error Rate (BLER) due the need for a large number of retransmissions to successfully deliver packets. This paper studies the complex interaction between FEC block errors, transmission overhead, Quality of Service (QoS) requirements of a multimedia stream and its TDMA allocation requirements. Our results show that, to support low latency applications at high BLERs, the average allocation size has to be increased by one or more transmission overheads. Further, the increase in average allocation is not a strong function of application data rate. Hence, low data rate applications can suffer significant loss in efficiency at high BLERs. Our results also show that using a fixed size TDMA allocation can lead to poor utilization when the latency requirements of the application are less than four beacon periods. These results indicate that channel adaptation in HPAV should take into consideration the application QoS requirements to optimize the overall system capacity.
Srinivas Katar, Brent Mashburn, Richard E. Newman, Haniph A. Latchman
GLOBECOM4
2006 Performance analysis of enhanced-mobile IPv6 with fast handover over end-to-end TCP
abstract
Mobile IPv6 (MIPv6) has been proposed to support host mobility in the Internet, yet during a handover mobile IPv6 suffers from packet disruption and packet loss. It is therefore critical to reduce or mask the handover interval from the correspondent nodes by optimizing movement detection and duplicate address detection (DAD) to reduce delays and packet loss due to handovers. In this paper, we specify a more efficient fast neighbor discovery and DAD scheme which requires each access point to execute movement detection by unicast transmission of the stored router advertisement message and implement a modified neighbor cache to handle configuration of the care-of-address (CoA) under fast DAD. We also present a performance analysis of the current IETF proposals for MIPv6 and fast mobile IPv6 relative to our proposal for enhanced mobile IPv6. Finally we demonstrate by simulation that managing the handover process in our proposed scheme greatly reduces the overall handover latency
Byungjoo Park, Sunguk Lee, Haniph A. Latchman
WCNC3
2005 Periodic Contention-Free Multiple Access for Power Line Communication Networks
abstract
There is industrial intent to use powerline communication (PLC) networks in the home for delivery of multimedia data, with associated challenging quality of service (QoS) requirements. Existing protocols for PLC, for wireless networks, or even for wired networks cannot meet these challenges efficiently. This paper proposes and analyzes a new protocol designed to provide the high QoS needed for delivery of multiple multimedia streams in a PLC environment. The proposed protocol, periodic contention-free multiple access (PCF/MA), directly addresses the issues of channel noise, hidden nodes and near-far effects. The proposed PCF/MA performance is analyzed theoretically and its performance is simulated. The results show that 85Mbps MAC throughput is possible with 100Mbps channel data rate, even when there are hidden nodes in the network.
Haniph A. Latchman, Jonathan C. L. Liu, Richard E. Newman
AINA2
2004 Design of MAC protocols with fast collision resolution for wireless local area networks
abstract
Development of efficient medium access control (MAC) protocols providing both high throughput performance for data traffic and good quality of service (QoS) support for real-time traffic is the current major focus in distributed contention-based MAC protocol research. In this paper, we propose an efficient contention resolution algorithm for wireless local area networks, namely, the fast collision resolution (FCR) algorithm. The MAC protocol with this new algorithm attempts to provide significantly higher throughput performance for data services than the IEEE 802.11 MAC algorithm and more advanced dynamic tuning backoff (DTB) algorithm. We demonstrate that this algorithm indeed resolves collisions faster and reduces the idle slots more effectively. To provide good fairness performance and to support good QoS for real-time traffic, we incorporate the self-clocked fair queueing algorithm and a priority scheme into the FCR algorithm and come up with the real-time FCR (RT-FCR) algorithm, and show that RT-FCR can simultaneously achieve high throughput and good fairness performance for nonreal-time traffic while maintaining satisfactory QoS support for real-time traffic.
Younggoo Kwon, Yuguang Fang, Haniph A. Latchman
IEEE Trans. Wirel. Commun.3
2004 Performance Analysis for a New Medium Access Control Protocol in Wireless LANs
Younggoo Kwon, Yuguang Fang, Haniph A. Latchman
Wirel. Networks3
2003 A Novel Medium Access Control Protocol with Fast Collision Resolution for Wireless LANs
abstract
Design of efficient medium access control (MAC) protocols with both high throughput performance and high-degree of fairness performance is a major focus in distributed contention-based MAC protocol research. In this paper, we propose a novel and efficient contention-based MAC protocol for wireless local area networks, namely, the fast collision resolution (FCR) algorithm. This algorithm is developed based on the following innovative ideas: to speed up the collision resolution, we actively redistribute the backoff timers for all active nodes; to reduce the average number of idle slots, we use smaller contention window sizes for nodes with successful packet transmissions and reduce the backoff timers exponentially fast when a fixed number of consecutive idle slots are detected. We show that the proposed FCR algorithm provides high throughput performance and low latency in wireless LANs. The extensive simulation studies show that the FCR algorithm could significantly improve the performance of the IEEE 802.11 MAC protocol if our efficient collision resolution algorithm is used and that the fairly scheduled FCR (FS-FCR) algorithm could simultaneously achieve high throughput performance and a high degree of fairness.
Younggoo Kwon, Yuguang Fang, Haniph A. Latchman
INFOCOM3
2002 Fast collision resolution (FCR) MAC algorithm for wireless local area networks
abstract
Development of efficient medium access control (MAC) protocols is a fundamental research issue in high-speed wireless local area networks (LANs). We focus on the throughput efficiency of medium access algorithms for high-speed wireless LANs which use carrier sense multiple access/collision avoidance (CSMA/CA). We propose an efficient distributed contention-based MAC protocol for wireless local area networks, namely, the fast collision resolution (FCR) algorithm, and show that the proposed FCR algorithm provides high throughput and low latency in wireless LANs. The performance of FCR algorithm is compared with that of the IEEE 802.11 MAC algorithm via extensive simulation studies. The results show that FCR algorithm achieves a significantly higher efficiency than the IEEE 802.11 MAC algorithm and is easy to implement in wireless LANs.
Younggoo Kwon, Yuguang Fang, Haniph A. Latchman
GLOBECOM3
2002 Medium Access Control Protocols with Fast Collision Resolution: Supporting Real-Time and Data Services in Wireless LANs
abstract
Development of efficient medium access control (MAC) protocols which provide both high throughput performance for data traffic and good quality of service (QoS) support for real-time traffic is the current major focus in distributed contention-based MAC research. We propose an efficient contention algorithm for wireless local area networks, namely the fast collision resolution (FCR) algorithm. The MAC protocol with this new algorithm attempts to provide significantly high throughput performance for data services. To support QoS for real-time services, we incorporate the priority algorithm based on service differentiations with the FCR algorithm, and show that this prioritized FCR algorithm can simultaneously achieve high throughput and good QoS support for real-time and data services.
Younggoo Kwon, Yuguang Fang, Haniph A. Latchman
LCN3
2002 Field Performance Comparison of IEEE 802.11b and HomePlug 1.0
abstract
The HomePlug 1.0 standard allows high-speed communication on low-voltage power lines without a requirement for new wires. Effective use of the power line bandwidth requires a robust medium access control (MAC) protocol to mitigate the harsh conditions of the power line channel as well as the capability to support prioritized multimedia traffic. This paper briefly describes the HomePlug 1.0 MAC and PHY protocols, which allow prioritized channel access. It then presents field test results comparing this with the more familiar IEEE 802.11b protocol.
Haniph A. Latchman, Richard E. Newman, Srinivas Katar, Larry Yonge
LCN2
2002 Improving transport layer performance by using A novel medium access control protocol with fast collision resolution in wireless LANs
abstract
Development of efficient medium access control (MAC) protocols is a fundamental research issue in high-speed wireless local area networks (LANs). In this paper, we focus on the performance improvement both of MAC layer and transport layer by using a novel medium access control protocol in high-speed wireless LANs which use carrier sense multiple access/collision avoidance(CSMA/CA). We propose an efficient distributed contention-based MAC protocol, namely, the Fast Collision Resolution (FCR) algorithm, and show that the proposed FCR algorithm provides high throughput and low latency while improving the fairness performance for serving users in wireless LANs. The performance of the FCR algorithm is compared with that of the IEEE 802.11 MAC algorithm via extensive simulation studies both in MAC layer and transport layer. The results show that the FCR algorithm achieves a significantly higher efficiency than the IEEE 802.11 MAC algorithm and is well suited for transport layer protocols such as transmission control protocol (TCP) and user datagram protocol (UDP).
Younggoo Kwon, Yuguang Fang, Haniph A. Latchman
MSWiM3
2000 Online M.S. Degree in Electrical and Computer Engineering-user perspectives and key implementation issues
abstract
The Department of Electrical and Computer Engineering, University of Florida, has developed an online M.S. degree program that utilizes synchronized streaming video and audio as well as asynchronous learning networks to facilitate interactivity. In this paper, we describe some of the technical and administrative issues involved in this venture, as well as the experiences accumulated thus far in offering these courses online.
Haniph A. Latchman
Proc. IEEE1
1999 A global optimization method for continuous-time adaptive recursive filters
abstract
A major drawback of recursive adaptive filters based on gradient methods is that convergence to a global minimum is not always achieved. This is due to a nonconvex mean square error (MSE) performance surface. This article develops a continuous-time least mean square algorithm that converges to the global minimum with probability one.
William W. Edmonson, Juan Carlos Palacios, Chang An Lai, Haniph A. Latchman
IEEE Signal Process. Lett.4