Kin Yeung Wong

Odor descriptors are words used to express human olfactory perception. At a certain level, predicting the odor descriptor rating using an electronic nose(E-nose) equips the machine with the ability to perceive odors. In this paper, we propose a novel deep learning framework for predicting odor descriptor rating via E-nose signals. The proposed fram...

Semantic odor perception descriptors, such as “sweet”, are widely used for product quality assessment in food, beverage, and fragrance industries to profile the odor perceptions. The current literature focuses on developing as many as possible odor perception descriptors. A large number of odor descriptors poses challenges for odor sensory assessme...

Predicting odor’s pleasantness with electronic nose can simplify the evaluation process of odors, and it has potential applications in the perfumes and environmental monitoring industry. Classical algorithms for predicting odor’s pleasantness generally use a manual feature extractor and an independent classifier. The feature extractor is the key to...

Predicting odor's pleasantness simplifies the evaluation of odors and has the potential to be applied in perfumes and environmental monitoring industry. Classical algorithms for predicting odor's pleasantness generally use a manual feature extractor and an independent classifier. Manual designing a good feature extractor depend on expert knowledge...

In recent years, more and more machine learning algorithms have been applied to odor recognition. These odor recognition algorithms usually assume that the training dataset is static. However, for some odor recognition tasks, the odor dataset is dynamically growing where not only the training samples but also the number of classes increase over tim...

In this paper, we study the social properties, including community, friendship, and individual selfishness of cognitive radio networks and analyze the effect of these social properties on the performance of routing protocols. We first introduce the concept of cooperation willingness considering social relations and individual selfishness. Then, we...

The limited storage and computing capacity hinder the development of cognitive radio ad hoc networks (CRAHNs). To solve the problem, a new paradigm of cloud-based CRAHN has been proposed, in which a CRAHN will make use of the computation and storage resources of the cloud. This paper envisions an integrated CRAHN-cloud network architecture. In this...

In this article, extensive experiments were conducted to investigate how received-signalstrength indicator (RSSI) values in Wi-Fi packets change when different hand gestures are performed. Furthermore, we were able to positively recognize some hand gestures by detecting the changes in RSSI values. In our experiments, a broadband router and wireless...

In this paper, we address the problem of routing disruption attacks in Cognitive Radio Networks (CRNs). In routing disruption attacks, the malicious node intentionally drop data packets to consume more network resources or degrade routing performance. We propose a trust management model to mitigate such attacks in CRNs. Through monitoring forwardin...

Delay-tolerant Network (DTN) is a computer network architecture that operates effectively over an extreme distance and communicates with heterogeneous networks that may affect the continuous network connectivity. DTN is particularly useful for the areas in which there are no direct connection (either physical or wireless) between source and destina...

Cognitive radio ad hoc networks (CRAHNs) were developed to improve the utilization ratio of licensed spectrum. Since spectrum opportunities for users are varied over time and location, enhancing the spectrum effectiveness is a goal and also a challenge for CRAHNs. Besides, due to the energy limitation of the devices in CRAHNs, energy efficiency is...

Online social networks have been typically created for convenience--so they haven't been built from the ground up with security in mind. They often have confusing privacy settings and are susceptible to various kinds of attacks that exploit users' trust and privacy. In this article, the authors discuss security pitfalls in today's social networks,...

One critical issue for routing in cognitive radio ad hoc networks (CRAHNs) is how to select a reliable path for forwarding traffic. This is because mobility may cause radio links to break frequently. The reliability of a path depends on the availability of those links that constitutes the path. In this letter, we present a novel approach to predict...

The growths of online Social Networks in scale and amount of information are immense in recent years. The analyses of the structure of online social networks have thus drawn much research interests. Before the analyses, the information and the characteristics of the structure have to be obtained. However, the complexity of today's web technologies...

In this paper, we present an analytical framework to evaluate the effects of spectrum handoffs on the performance of the real-time traffic in cognitive radio (CR) networks. In CR networks, CR users (CUs) are secondary users to the licensed spectrum and they are required to vacate the spectrum when a primary user (PU) reclaims it. We consider a gene...

a b s t r a c t Due to the popularity and growth of online social networks, security in these networks becomes a critical problem. Previous works have proved that a virus can spread effectively in social networks. In this paper, groups in social networks are studied. We notice that groups on social network services sites can assemble people with si...

Cascading failure in a network refers to a situation when the failure of a node causes the failure of its neighbouring nodes, which in turn leads to the failure of other nodes in the network. Cascading failure happens in many real world networks e.g., power grid, packet routing networks. In this paper, we investigate cascading failure in Coupled Ma...

a b s t r a c t Since cognitive radio (CR) networks could solve the spectrum scarcity problem, they have drawn much research in recent years. Artificial intelligence(AI) is introduced into CRs to learn from and adapt to their environment. Nonetheless, AI brings in a new kind of attacks specific to CR networks. The most powerful one is a self-propag...

The conventional web proxy servers use hard disk as their primary cache storage. However, as disks use mechanical operations, they are typically the slowest component of the servers. Though, in the last decade, various solutions have been proposed to improve the proxy performance, disks are still the performance bottleneck. Consider that the mainst...

in IPv6 networks, a solution called Secure paper. Unlike the previous solutions that mainly use the The major merit of SAC6 is that its operations are transparent to the network and do not require the infrastructure. in a network. Examples of this kind of protocols are server centrally administers the IPv6 addresses in the network. minimizes the am...

There are different types of portable devices on the market: portable media players (PMPs), personal digital assistants (PDAs), smartphones, and basic mobile phones. Although they have overlapping functions, each has its own characteristics and targeted customers, so one can hardly completely replace another.

Single portal association used in current WMN has bottleneck problem to make WMN potentially inefficient and bad-user-experie nced. Even the existing multiple path solutions cannot tackle such problem well. In this paper, we propose MR-TBMPA (Multi­ path Routing using Tree-Base Multi-Portal Association) to reduce the impact brought by WMN's bottlen...

Cognitive radio ad hoc networks (CRAHNs) are the ad hoc networks equipped with the intrinsic capabilities of the cognitive radio. As CRAHNs devices are mainly powered by battery, efficient consumption of energy is a key issue in CRAHNs. This paper focuses on energy-efficient routing in CRAHNs. It first compares CRAHNs with mobile ad hoc networks (M...

The existing designs and solutions for web caching systems commonly make caching decisions based on document or uniform resource locator (URL) information. While this conventional approach works, the authors deliver insights into the alternative approach using site information for web caching design. This site-based approach makes caching decisions...

Increases in the computational power of mobile processors, improvements in mobile operating systems, and the popularity of mobile broadband make cell phones the best candidate for sophisticated mobile computing devices. Learn about potential applications and their corresponding challenges.

E d it or s : S h e ng r u Tu • s he ngr u@c s .uno .e du J a s o n N ie h • nie h@c s .co l umb ia .e du T he Internet employs many different types of communication networks. A local area network (LAN) covers a small geographic area, such as a school or company; a metro-politan area network (MAN) usually spans a larger area, such as a city or stat...

This paper presents the idea of an online social network that makes use of the face recognition technology. With the technology, friend relationship can be established without the need of having the text-based information of a user, friend recommendation algorithm can be more accurate, and face tagging can be done automatically. The design and impl...

Trust management is turning out to be essential for further and wider acceptance of contemporary IT solutions. In IT world it was first addressed some ten years ago when the suggested approaches were actually tackling security and not trust directly. ...

This chapter gives a study on the network services related to infrastructure security. The services covered are Dynamic Host Configuration Protocol (DHCP) and Domain Name System (DNS), as address configuration and naming are ones of the key components in the network infrastructure. The operations, vulnerability and mitigations of them are discussed...

In this chapter, a number of tools are required to finish the attack experiments. They are mostly open source and freely available under the GNU General Public License (GPL) (http://www.gnu.org/copyleft/gpl.html). Therefore, it is not difficult to modify the tools to suit one’s particular need.

This chapter aims to provide an overview on network infrastructure security. It first reviews the key components of network infrastructure, and then points out the differences between information security and infrastructure security. Examples of network infrastructure attacks are also shown. This chapter lays the foundation for understanding the re...

This chapter serves as a summary of the previous chapters and discusses a new approach on building secure network infrastructure — separated networks for data and signal. It is our research work. We believe the approach could solve the fundamental problems of network infrastructure security, and solve most problems listed in the previous chapters.

Swamp poisoning in BitTorrent corrupts files sharing between peers. The worst case causes the swamp unusable as the protocol does not provide sufficient data integrity checking. This paper proposes two solutions in order to resolve this attack.

The Border Gateway Protocol (BGP) is the critical routing protocol in the Internet infrastructure. However, there is no security concern in the original design of BGP, which suffers from various kinds of threats for attacks. To secure the BGP operation, this paper proposes an algorithm called consistent check. The algorithm is to verify the correct...

Because of their intuitive interaction styles, multiple-touch devices could trigger a revolution in user interfaces. But how can designers advance this technology?

It is projected that mobile phones with a large storage (at least a few Giga bytes) will be widely available in the market in a few years. This kind of phone has its own characteristics and hence creates a new application domain. This article reviews some potential applications that fit into this domain and discusses the challenges involved in thei...

Research on Internet security over the past few decades has focused mainly on information assurance, issues of data confidentiality and integrity as explored through cryptograph algorithms, digital signature, authentication code, etc. Unlike other books on network information security, Network Infrastructure Security by Angus Wong and Alan Yeung ad...

Triangle routing is one of the serious attacks to the Internet infrastructure. It can be caused by malicious routers which misroute packets to wrong directions. This kind of attacks creates network problems such as network congestion, denial of service and network partition and results in degrade of network performance. This paper gives a comprehen...

Choosing an optimal placement of mesh points (MPs) to maximize the network throughput is one of the key concerns in building a wireless mesh network (WMN). The routing protocol used in the WMN, which governs the traffic distribution over the network, also affects the network throughput. Therefore, in this paper, we take account of the multi-path ro...

Network infrastructure security concerns the protection of a network instead of the confidentiality and integrity of packet content. Most of the existing methods require the modifications of routers or require them to run background processes. These kinds of methods are less reliable because they rely on the cooperation of routers in the network to...

A strategic placement of mesh points (MPs) in a Wireless Mesh Network (WMN) is essential to maximize the throughput of the network. In this paper, we address the problem of MPs placement for throughput optimization in WMN with consideration of routing protocols. Specifically, we formulate the routing paths among the MPs and mesh routers (MRs), calc...

Data Link layer is considered as the weakest link in a secured network. If an initial attack comes in at Layer 2, the whole network can be compromised. To illustrate the weakness of Layer 2 networks, attacking tools for this layer are surveyed and discussed in this paper. The main functions of these tools and how they can be used to launch attacks...

DNSSEC provides origin authentication and data verification. It uses public key cryptography to build an chain of trust between parent and child name servers. There are two pairs of keys are used in DNSSEC, but only one of them, namely, KSK-Public is used to build the chain between name servers. This could cause a failure threat from a single point...

In Wireless Mesh Networks (WMNs), wireless nodes exchange routing messages among themselves to build routing tables. Since routing messages are sensitive and critical information, they should be kept confidential and protected. However, the existing WMNs convey the routing messages in an open medium (air) where the messages can be accessed publicly...

A cache replacement algorithm called probability based replacement (PBR) is proposed in this paper. The algorithm makes replacement decision based on the byte access probabilities of documents. This concept can be applied to both small conventional web documents and large video documents. The performance of PBR algorithm is studied by both analysis...

A distributed computing application uses multiple networked computers to work together to accomplish a big task. It can be used to solve calculation-intensive problems such as weather forecasting and astronomical analyzing. There are many common tasks among different kinds of applications. To reduce the development cycle, the goal of this paper is...

This paper proposes a simple location-based service which can be used to learn places people visit in their everyday lives. Unlike the similar services provided by mobile operators which typically use trilateration calculation to derive location from multiple based stations, our proposal relies on a location server to store the location information...

Malicious misrouting of packets is a kind of packet mistreatment attack. In such attack a malicious router misroute packets so that triangle routing is formed. This kind of attack is very difficult to detect, and the problem is considered as an open problem. In this paper, a solution to the problem is proposed. The paper first discusses a simple bu...

A simple system providing location-based service is proposed in this paper. The major advantage of the system is that, unlike the similar services provided by mobile operators which typically use trilateration calculation to derive location from multiple based stations, our proposal relies on a location server to store the location information of s...

The automatic address configuration simplifies the IP configuration task in IPv6 networks. Two protocols have been developed for automatic address configuration: Neighbor Discovery Protocol (NDP) and Dynamic Host Configuration Protocol for IPv6 (DHCPv6). However, these protocols create security holes in a network that expose network nodes to variou...

This paper provides an analytically study on the conventional Internet caching system and the caching system using a load reduction technique. The performance metrics are request response time, disk utilization, and system throughput gain. The two systems are modeled as closed queuing networks, and the technique used to solve the networks is Mean V...

This paper presents a technique to solve the overloading conditions of HTTP proxy servers. It is achieved by eliminating the unnecessary requests reaching the proxy servers. These unnecessary requests are the miss requests which cause the proxy to store copies of requested objects, but the copies will not be accessed again. To identify this kind of...

Research involving Web cache replacement policy has been active for at least a decade. In this-article we would like to claim that there is a sufficient number of good policies, and further proposals would only produce minute improvements. We argue that the focus should be fitness for purpose rather than proposing any new policies. Up to now, almos...

This paper presents a technique to solve the overloading conditions of HTTP proxy servers. It is achieved by eliminating the unnecessary requests reaching the proxy servers. These unnecessary requests are the miss requests which cause the proxy to store copies of requested objects, but the copies will not be accessed again. To identify this kind of...

This paper provides an analytically study on the conventional Internet caching system and the caching system using a load reduction technique. The performance metrics are request response time, disk utilization, and system throughput gain. The two systems are modeled as closed queuing networks, and the technique used to solve the networks is Mean V...

Propositional satisfiability problem (SAT) is a well-known NP-complete problem. It can be categorized as NP-complete because it has a phase transition point between satisfiable or unsatisfiable. Instances within the phase transition region are hard to solve. To reduce computation time in this region, we designed and implemented a Fail Detection (FD...

Triangle routing is one of the serious attacks to the Internet infrastructure. It can be caused by malicious routers which misroute packets to wrong directions. This kind of attacks creates network problems such as network congestion, denial of service and network partition and results in degrade of network performance. This paper gives a comprehen...

In this paper, we describe the design and implementation of a Web server cluster. We first discuss the design criteria of a good server cluster. Based on the criteria, we present the design of our proposed Web server cluster which consists of a central server and multiple Web servers. The central server stores the whole document set, while the Web...

Personal mobility is a feature in future communication systems. In the context of instant messaging, personal mobility enables users to send and receive messages using different kinds of communication devices daily (e.g., computers, PDAs, and mobile phones). When a user switches from one device to the other, the messaging service will seamlessly ad...

Many mapping schemes for parallel proxy servers have been proposed in previous research. The operations of these schemes are mainly URL-based, and therefore cannot fully benefit from the new persistent connection feature of HTTP/1.1. In this article we propose a site-based mapping scheme that forwards all requests targeting the same Web site to the...

A cache replacement policy which take the transcoding time into account in making replacement decisions, for the emerging transcoding proxy servers is proposed. Simulation results show the proposed policy outperforms the conventional LRU in both the cache hit rate and the average object transcoding time.

In wireless LAN communication, weak signal strength or high frame error rate of communication channels may cause performance problems. The common approach to cope with weak signal strength is to change association to a better access point. However, client may still suffer from poor system performance because of high error rate. It is because when t...

The authors study the performance of a disk storing WWW data by using a broadcast polling model. The model has single message queues, an exponential server and asymmetric exponential arrivals. Numerical examples show that the analytical results are close to the simulation results.

The authors study the performance of a disk storing WWW data by using a broadcast polling model. The model has single message queues, an exponential server and asymmetric exponential arrivals. Numerical examples show that the analytical results are close to the simulation results.

A least load dispatching algorithm for distributing requests to parallel Web server nodes is described. In this algorithm, the load offered to a node by a request is estimated based on the expected transfer time of the corresponding reply through the Internet. This loading information is then used by the algorithm to identify the least load node of...

There are many mapping schemes proposed in previous research on parallel proxy servers. The operations of these schemes are mainly URL-based, and therefore cannot fully benefit from the new persistent connection feature of HTTP/1.1. We propose a site-based mapping scheme that forwards all requests targeting on the same Web site to the same proxy se...

A site-based approach to Web caching tracks documents by site rather than individual document names or URLs, bringing different benefits to several different types of applications. One problem, however, is that while maintaining only site information is sufficient in many cases, it is sometimes necessary to track individual documents. For example,...

Due to the explosive growth of the World-Wide Web, Web proxy becomes very important in today's Internet systems. Among these proxy servers, most of them will make cache decision based on document names. However, we propose in this paper a new direction in making these caching decisions, namely a site-based approach. What we mean by site-based appro...