oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 12 )

2018 ( 40 )

2017 ( 49 )

2016 ( 49 )

Custom range...

Search Results: 1 - 10 of 6871 matches for " Wai Chong Chia "
All listed articles are free for downloading (OA Articles)
Page 1 /6871
Display every page Item
Embedded Descendent-Only Zerotree Wavelet Coding for Image Compression
Wai Chong Chia,Li Minn Ang,Kah Phooi Seng
Lecture Notes in Engineering and Computer Science , 2009,
Abstract:
A New Configuration of Adaptive Arithmetic Model for Video Coding with 3D SPIHT
Wai Chong Chia,Li Minn Ang,Kah Phooi Seng
Lecture Notes in Engineering and Computer Science , 2009,
Abstract:
2D One-Bit-Transform Motion Estimation Algorithm with Smoothing and Preprocessing
Wai Chong Chia,Li Wern Chew,Li Minn Ang,Kah Phooi Seng
Lecture Notes in Engineering and Computer Science , 2009,
Abstract:
3D Face Recognition System with Compression
Wei Jen Chew,Kah Phooi Seng,Wai Chong Chia,Li Minn Ang
Lecture Notes in Engineering and Computer Science , 2009,
Abstract:
An Optimum Approach for Image Compression: Tuned Degree-K Zerotree Wavelet Coding
Li Wern Chew,Wai Chong Chia,Li-minn Ang,Kah Phooi Seng
IAENG International Journal of Computer Science , 2009,
Abstract:
Energy Efficiency Performance Improvements for Ant-Based Routing Algorithm in Wireless Sensor Networks
Adamu Murtala Zungeru,Kah Phooi Seng,Li-Minn Ang,Wai Chong Chia
Journal of Sensors , 2013, DOI: 10.1155/2013/759654
Abstract:
Very Low-Memory Wavelet Compression Architecture Using Strip-Based Processing for Implementation in Wireless Sensor Networks
Li Wern Chew,Wai Chong Chia,Li-minn Ang,Kah Phooi Seng
EURASIP Journal on Embedded Systems , 2009, DOI: 10.1155/2009/479281
Abstract: This paper presents a very low-memory wavelet compression architecture for implementation in severely constrained hardware environments such as wireless sensor networks (WSNs). The approach employs a strip-based processing technique where an image is partitioned into strips and each strip is encoded separately. To further reduce the memory requirements, the wavelet compression uses a modified set-partitioning in hierarchical trees (SPIHT) algorithm based on a degree-0 zerotree coding scheme to give high compression performance without the need for adaptive arithmetic coding which would require additional storage for multiple coding tables. A new one-dimension (1D) addressing method is proposed to store the wavelet coefficients into the strip buffer for ease of coding. A softcore microprocessor-based hardware implementation on a field programmable gate array (FPGA) is presented for verifying the strip-based wavelet compression architecture and software simulations are presented to verify the performance of the degree-0 zerotree coding scheme.
Energy Efficiency Performance Improvements for Ant-Based Routing Algorithm in Wireless Sensor Networks
Adamu Murtala Zungeru,Kah Phooi Seng,Li-Minn Ang,Wai Chong Chia
Journal of Sensors , 2013, DOI: 10.1155/2013/759654
Abstract: The main problem for event gathering in wireless sensor networks (WSNs) is the restricted communication range for each node. Due to the restricted communication range and high network density, event forwarding in WSNs is very challenging and requires multihop data forwarding. Currently, the energy-efficient ant based routing (EEABR) algorithm, based on the ant colony optimization (ACO) metaheuristic, is one of the state-of-the-art energy-aware routing protocols. In this paper, we propose three improvements to the EEABR algorithm to further improve its energy efficiency. The improvements to the original EEABR are based on the following: (1) a new scheme to intelligently initialize the routing tables giving priority to neighboring nodes that simultaneously could be the destination, (2) intelligent update of routing tables in case of a node or link failure, and (3) reducing the flooding ability of ants for congestion control. The energy efficiency improvements are significant particularly for dynamic routing environments. Experimental results using the RMASE simulation environment show that the proposed method increases the energy efficiency by up to 9% and 64% in converge-cast and target-tracking scenarios, respectively, over the original EEABR without incurring a significant increase in complexity. The method is also compared and found to also outperform other swarm-based routing protocols such as sensor-driven and cost-aware ant routing (SC) and Beesensor. 1. Introduction A sensor network is an infrastructure composed of sensing, computing, and communication elements that give a user or administrator the ability to instrument, observe, and react to events and phenomena in a specific environment [1, 2]. wireless sensor networks (WSNs) are collections of compact-size, relatively inexpensive computational nodes that measure local environmental conditions, or other parameters and forward such information to a central point for appropriate processing. Each node is equipped with embedded processors, sensor devices, storage, and radio transceivers. The sensor nodes typically have limited resources in terms of battery supplied energy, processing capability, communication bandwidth, and storage. WSN nodes can sense the environment, communicate with neighboring nodes, and in many cases perform basic computations on the data being collected. WSNs applications include commercial applications such as healthcare, target tracking, monitoring, smart homes, surveillance, and intrusion detection. Many applications of sensor networks deal with the static nature of nodes
NBgossip: An Energy-Efficient Gossip Algorithm for Wireless Sensor Networks
Feng Lu,Liang-Tien Chia,Kok-Leong Tay,Wai-Hoe Chong,
Feng Lu
,Liang-Tien Chia,Kok-Leong Tay,and Wai-Hoe Chong

计算机科学技术学报 , 2008,
Abstract: Gossip-based algorithms for information dissemination have recently received significant attention for sensor and ad hoc network applications because of their simplicity and robustness.However,a common drawback of many gossip- based protocols is the waste of energy in passing redundant information over the network.Thus gossip algorithms need to be re-engineered in order to become applicable to energy constrained networks.In this paper,we consider a scenario where each node in the network holds a piece of information(message)at the beginning,and the objective is to simultaneously disseminate all information(messages)among all nodes quickly and cheaply.To provide a practical solution to this problem for ad hoc and sensor networks,NBgossip algorithm is proposed,which is based on network coding and neighborhood gossip. In NBgossip,nodes do not simply forward messages they receive,instead,the linear combinations of the messages are sent out.In addition,every node exchanges messages with its neighboring nodes only.Mathematical proof and simulation studies show that the proposed NBgossip terminates in the optimal O(n)-order rounds and outperforms the existing gossip-based approaches in terms of energy consumption incurred in spreading all the information.
3-D Grid-Based Localization Technique in Mobile Sensor Networks  [PDF]
Jia Li, Lei Sun, Wai Yee Leong, Peter H J Chong
Wireless Sensor Network (WSN) , 2010, DOI: 10.4236/wsn.2010.211100
Abstract: Considering the environmental protection, forest fire becomes a more and more serious problem and requires more concerns. This paper provides an efficient method for fire monitoring and detection in forests using wireless sensor network technology. The proposed technique estimates the location of a sensor node based on the current set of hop-count values, which are collected through the anchor nodes’ broadcast. Our algorithm incorporates two salient features; grid-based output and event-triggering mechanism, to improve the accuracy while reducing the power consumption. Through the computer simulation, the output region obtained from our algorithm can always cover the target node. In addition, the algorithm was implemented and tested with a set of Crossbow sensors. Experimental results demonstrated the high feasibility and worked well in real environment.
Page 1 /6871
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.