Browsing by Author "Su, Yi-Sheng"

Now showing 1 - 5 of 5

35 An Effective Routing Protocol with Guaranteed Route Preference for Mobile Ad Hoc Networks
(2014)
Chien, Feng-Tsun
;
Wu, Kuo-Guan
;
Chan, Yu-Wei
;
Chang, Min-Kuan
;
Su, Yi-Sheng
Battery power and queue conservation are critical issues in mobile ad hoc network (MANET). These two factors not only affect the delivery ratio but also the lifetime of the network. In this work, we will propose a simple and effective routing protocol to extend the lifetime and to evenly distribute the traffic loads of the networks as possible. Furthermore, a concept of serving capacity is introduced to reflect the level of congestion around a node. In this way, the proposed routing protocols can avoid network congestion and achieve higher packet delivery ratios. The extensive computer simulation is conducted to compare the proposed protocol against many existing routing protocols. The results show that the proposed routing protocol can have better performance in terms of queueing length, lifetime, and packet delivery ratio and have comparable end-to-end delays.
Design and Analysis of Unequal Missing Protection for the Grouping of RFID Tags
(2015-11-01)
Su, Yi-Sheng
;
Wang, Chung-Hsuan
;
電機資訊學士班
;
Undergraduate Honors Program of Electrical Engineering and Computer Science
In this paper, we address the issue of unequalmissing protection (UMP) for the design of grouping of radio-frequency identification (RFID) tags. While relying on group generation matrices, grouping of RFID tags allows verifying the integrity of a collection of tags without the requirement for accessing external systems, and can be extended to identify missing tags. Motivated by application needs that call for UMP among the tags, we first introduce the concepts of UMP for grouping of RFID tags and its extended counterpart, with which missing tags with high missing protection levels are more easily counted or identified than those with low missing protection levels. We then present simple yet effective schemes to realize grouping of RFID tags with UMP and its extended counterpart. The proposed schemes not only can easily fulfill the requirement of UMP among the tags, but also offer flexibility in constructing UMP group generation matrices. We also characterize key objects in order to further study grouping of RFID tags with UMP and its extended counterpart, called consistent and unidentifiable sets, respectively. This characterization in turn enables theoretical analysis of the error rate from the perspective of a tag. Theoretical and simulation results are presented to demonstrate the efficiencies of the proposed schemes for the design of grouping of RFID tags with UMP.
Dynamic Scheduling-Aided Decoding Strategies for LDPC Convolutional Codes with Rational Parity-Check Matrices
(2011)
Weng, Jian-Jia
;
Wu, Mu-Chen
;
Wang, Chung-Hsuan
;
Su, Yi-Sheng
;
Wu, Tsung-Cheng
In this paper, decoding of LDPC convolutional codes with rational parity-check matrices (LDPC-CC-RPCM) is investigated. We show that Tanner graph of every LDPC-CC-RPCM can always be transformed into an equivalent one with enlarged girth and finite memory order suitable for practical pipeline decoder. Based on the transformed graph, a dynamic scheduling-aided decoding scheme with the enhancement of signal perturbation and error cancellation is presented to improve the convergence speed and bit-error-rate performance in both of the waterfall and error-floor regions. Simulation results also reveal that LDPC-CC-RPCM may outperform ordinary LDPC-CC with polynomial parity-check matrices in some cases under the same code rate and decoding complexity.
Generation of Two-Dimensional Optical Reference Signals Based on Parametric Minimum Cross Entropy
(2011-06-15)
Su, Yi-Sheng
;
Wu, Tsung-Cheng
;
Wang, Chung-Hsuan
;
Chang, Min-Kuan
;
電機工程學系
In this letter, a novel design of two-dimensional (2-D) zero reference codes (ZRCs) based on parametric minimum cross entropy (PMCE) is proposed to generate 2-D optical zero reference signals (ZRSs) with low second maximum for grating alignment systems. An optical ZRS is necessary to obtain an absolute measurement in grating alignment systems. A method to acquire an optical ZRS is by means of illuminating two identical superimposed ZRCs. Because the movement between the two ZRCs is in two-axis, 2-D ZRCs are required. However, they are hard to design due to the high computational complexity, especially for large codes. The proposed PMCE method not only reduces the second maximum of 2-D optical ZRSs, but also decreases the computational complexity. Simulation results indicate that there are 8.33%similar to 22.22% reductions in the second maximum of several 2-D optical ZRSs, as compared with those of the recently proposed cross-entropy (CE) method. The PMCE method proves to be a powerful tool for the design of 2-D ZRCs.
On Unequal Missing Protection of the Grouping of RFID Tags
(2015)
Su, Yi-Sheng
;
Wang, Chung-Hsuan
;
Siao, Huei-Yun
;
電機學院
;
College of Electrical and Computer Engineering
In this paper, we address the issue of unequal missing protection (UMP) for the design of grouping of radio-frequency identification (RFID) tags. While relying on group generation matrices, grouping of RFID tags allows verifying the integrity of a collection of RFID tags without the requirement for accessing external systems, and can be extended to identify missing RFID tags. Motivated by application needs that call for UMP among RFID tags, we first introduce the concepts of UMP for grouping of RFID tags and its extended counterpart. We then present a simple scheme to realize extended grouping of RFID tags with UMP. Simulation results are presented to demonstrate the efficiencies of the proposed UMP scheme for extended grouping of RFID tags.