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

Joo-Han Song

dblp:02/1544 · DBLP profile ↗
← Back
9ranked-venue papers
6as first author
0since 2021 · last 2011
—ORCID · none

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

Computer networks · 8 · 6 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
1 paper
Routing and switching · 79% Wireless networking · 21%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Routing and switching
ad hoc network routing
0.012004
Efficient on-demand routing for mobile ad hoc wireless access networks · IEEE J. Sel. Areas Commun. 2004
Routing and switching › ad hoc network routing
on-demand routing
0.012004
Efficient on-demand routing for mobile ad hoc wireless access networks · IEEE J. Sel. Areas Commun. 2004
Wireless networking
mobile ad hoc networks
0.012004
Efficient on-demand routing for mobile ad hoc wireless access networks · IEEE J. Sel. Areas Commun. 2004
Wireless networking › wireless access
multi-hop access
0.012004
Efficient on-demand routing for mobile ad hoc wireless access networks · IEEE J. Sel. Areas Commun. 2004

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

simulation · 0.0gossip-based routing comparison · 0.0
YearPublicationVenuePosition
2011 Next generation mobility management: an introduction
abstract
Abstract Mobility management, which includes location management and handoff management, is essential in cellular wireless networks to provide service to mobile users. Location management enables call delivery to mobile users, while handoff management maintains the connectivity of ongoing calls while users move between cells. In next generation networks, mobile users will avail themselves with terminals capable of accessing wireless networks employing multiple technologies, thus making the task of mobility management more challenging. This paper reviews recent developments in location management, and surveys methods for handoff management between heterogeneous systems. Methods for inter‐system handoffs in packet‐switched inter‐networks are discussed according to the protocol layer in which the handoffs take place, i.e., network layer, transport layer, and application layer. Open problems for mobility management in future wireless networks are also presented. Copyright © 2010 John Wiley & Sons, Ltd.
F. Richard Yu, Vincent W. S. Wong 0001, Joo-Han Song, Victor C. M. Leung, Henry C. B. Chan
Wirel. Commun. Mob. Comput.3
2010 Wireless Location Privacy Protection in Vehicular Ad-Hoc Networks
Joo-Han Song, Vincent W. S. Wong 0001, Victor C. M. Leung
Mob. Networks Appl.1
2009 Wireless Location Privacy Protection in Vehicular Ad-Hoc Networks
abstract
Advances in mobile networks and positioning technologies have made location information a valuable asset in vehicular ad-hoc networks (VANETs). However, the availability of such information must be weighted against the potential for abuse. In this paper, we investigate the problem of alleviating unauthorized tracking of target vehicles by adversaries in VANETs. We propose a vehicle density-based location privacy (DLP) scheme which can provide location privacy by utilizing the neighboring vehicle density as a threshold to change the pseudonyms. We derive the delay distribution and the average total delay of a vehicle within a density zone. Given the delay information, an adversary may still be available to track the target vehicle by a selection rule. We investigate the effectiveness of DLP based on extensive simulation study. Simulation results show that the probability of successful location tracking of a target vehicle by an adversary is inversely proportional to both the traffic arrival rate and the variance of vehicles' speed. Our proposed DLP scheme also has a better performance than both Mix-Zone scheme and AMOEBA with random silent period.
Joo-Han Song, Vincent W. S. Wong 0001, Victor C. M. Leung
ICC1
2009 Cooperative Protocols Design for Wireless Ad-Hoc Networks with Multi-hop Routing
Yuxia Lin 0001, Joo-Han Song, Vincent W. S. Wong 0001
Mob. Networks Appl.2
2008 Secure Location Verification for Vehicular Ad-Hoc Networks
abstract
In this paper, we examine one of the security issues in vehicular ad-hoc network (VANETs): position-spoofing attack. We propose a novel Secure Location Verification (SLV) scheme to detect and prevent position-spoofing attack. SLV uses distance bounding, plausibility checks, and ellipse-based location estimation to verify the claimed location of a vehicle. Simulation results show that our proposed SLV scheme has a better performance than both autonomous position verification (APV) and greedy forwarding algorithms.
Joo-Han Song, Vincent W. S. Wong 0001, Victor C. M. Leung
GLOBECOM1
2008 Cooperative protocols design for wireless ad-hoc networks with multi-hop routing
abstract
Wireless ad-hoc networks can experience significant performance degradation under fading channels. Diversity through space has been shown to be an effective way of combating wireless fading with the multiple-input-multiple-output (MIMO) technique by transmitting correlated information through multip
Yuxia Lin 0001, Joo-Han Song, Vincent W. S. Wong 0001
QSHINE2
2007 Secure position-based routing protocol for mobile ad hoc networks
Joo-Han Song, Vincent W. S. Wong 0001, Victor C. M. Leung
Ad Hoc Networks1
2004 Efficient on-demand routing for mobile ad hoc wireless access networks
abstract
In this paper, we consider a mobile ad hoc wireless access network in which mobile nodes can access the Internet via one or more stationary gateway nodes. Mobile nodes outside the transmission range of the gateway can continue to communicate with the gateway via their neighboring nodes over multihop paths. On-demand routing schemes are appealing because of their low routing overhead in bandwidth restricted mobile ad hoc networks, however, their routing control overhead increases exponentially with node density in a given geographic area. To control the overhead of on-demand routing without sacrificing performance, we present a novel extension of the ad hoc on-demand distance vector (AODV) routing protocol, called LB-AODV, which incorporates the concept of load-balancing (LB). Simulation results show that as traffic increases, our proposed LB-AODV routing protocol has a significantly higher packet delivery fraction, a lower end-to-end delay and a reduced routing overhead when compared with both AODV and gossip-based routing protocols.
Joo-Han Song, Vincent W. S. Wong 0001, Victor C. M. Leung
IEEE J. Sel. Areas Commun.1
2003 Efficient on-demand routing for mobile ad-hoc wireless access networks
abstract
In this paper, we consider a mobile ad-hoc wireless access network in which mobile nodes can access the Internet via a stationary gateway node or access point. Mobile nodes that are outside the transmission range of the gateway can continue to communicate with the gateway via a multi-hop connection with their neighboring nodes. The ad-hoc on-demand distance vector (AODV) routing protocol is extended by incorporating the concept of load-balancing (LB). We call this the LB-AODV routing protocol. Simulation results show that in a congested network environment, our proposed LB-AODV has a higher packet delivery fraction, a lower end-to-end delay and control overhead when compared with both AODV and gossip-based routing protocols.
Joo-Han Song, Vincent W. S. Wong 0001, Victor C. M. Leung
GLOBECOM1