Hyeong-Ah Choi

Learn More
Network survivability is a crucial requirement in high-speed optical networks. Typical approaches of providing survivability have considered the failure of a single component such as a link or a node. In this paper, we consider a failure model in which any two links in the network may fail in an arbitrary order. Three loopback methods of recovering from(More)
Location-based services (LBS) have become an immensely valuable source of real-time information and guidance. Nonetheless, the potential abuse of users’ sensitive personal data by an LBS server is evolving into a serious concern. Privacy concerns in LBS exist on two fronts: location privacy and query privacy. In this paper we investigate issues related to(More)
As the commercial success of the IEEE 802.11 protocol has made wireless infrastructure widely deployed, user organizations are increasingly concerned about the new vulnerabilities to their networks. While various security issues have been extensively studied, the threats posed by denial-of-service (DoS) attacks have not been fully exploited. In this paper,(More)
Summary form only given. As the energy consumption in wireless sensor nodes is dominated by the radio transmission circuitry, the network configuration must be designed to minimize the power consumption by transmission radios. Sensor nodes are generally equipped with short-range radios that require low power consumption. But the current technology allows(More)
Network survivability is a crucial requirement in high-speed optical networks. Typical approaches of providing survivability have considered the failure of a single component such as a link or a node. In this paper, we motivate the need for considering double-link failures and present three loopback methods for handling such failures. In the first two(More)
This paper considers the problem of maximizing the system throughput in IEEE 802.16 broadband access networks with mesh topology, and the following results are presented. We first consider a simplified linear network with only uplink traffic and provide an optimal scheduling algorithm and establish an analytical result on the length of the schedule. We then(More)