Wen-Shyong Hsieh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Wen-Shyong Hsieh has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Hsin-Te Wu
National Ilan University
1 shared publication - Kuan-Yen Yang
Department of Computer Science and Information Engineering, Shu-Te University, Kaohsiung, Taiwan
1 shared publication Mei-Wen Huang
Department of Computer Science and Engineering, National Sun-Yat-Sen University, No. 70, Lienhai Rd., Kaohsiung 80424, Taiwan
1 shared publicationMing-Cheng Huang
Department of Computer Science and Information Engineering, Shu-Te University, Kaohsiung, Taiwan
1 shared publicationTung-Shih Su
Department of Information Management, Fortune Institute of Technology, No. 1-10, Nongchang Rd., Neighborhood 28, Lyouciyou Village, Daliao Township, Kaohsiung County 831, Taiwan
1 shared publicationWei-Shou Li
Department of Computer Science and Information Engineering, SHU-TE University, No. 59, Hengshan Rd., Yanchao Dist., Kaohsiung City 82445, Taiwan
1 shared publication
Latest Publications
- Open Access
- 1 January 2012
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 8 (7)
Aggregation Scheme with Secure Hierarchical Clustering for Wireless Sensor Networks
In a large-scale wireless sensor network, a topology is needed to gather state-based data from sensor network and efficiently aggregate the data given the requirements of balanced load, minimal energy consumption, and prolonged network lifetime. In this study, we proposed a ring-based hierarchical clustering scheme (RHC) consisting of four phases: predeployment, parent-child relationship building, deployment, and member join phases. Two node types are distributed throughout the network: cluster head nodes (type 1 node) and general sensor nodes (type 2 node). The type 1 node has better battery life, software capability, and hardware features than the type 2 node; therefore, the type 1 node is a better cluster head than type 2 node. Due to our IP naming rules and type 1 nodes as cluster heads, public key cryptography, such as RSA (Rivest, Shamir, Adleman), or ECC (Elliptic Curve Cryptosystem), is easily implanted to our system to strengthen our security. The sink node is the only certification authority in our system, but n level cluster heads can be extended to n level certification authorities if needed, where n is maximum number of level.
- 1 January 2012
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 8 (7)
Open AccessAggregation Scheme with Secure Hierarchical Clustering for Wireless Sensor Networks
In a large-scale wireless sensor network, a topology is needed to gather state-based data from sensor network and efficiently aggregate the data given the requirements of balanced load, minimal energy consumption, and prolonged network lifetime. In this study, we proposed a ring-based hierarchical clustering scheme (RHC) consisting of four phases: predeployment, parent-child relationship building, deployment, and member join phases. Two node types are distributed throughout the network: cluster head nodes (type 1 node) and general sensor nodes (type 2 node). The type 1 node has better battery life, software capability, and hardware features than the type 2 node; therefore, the type 1 node is a better cluster head than type 2 node. Due to our IP naming rules and type 1 nodes as cluster heads, public key cryptography, such as RSA (Rivest, Shamir, Adleman), or ECC (Elliptic Curve Cryptosystem), is easily implanted to our system to strengthen our security. The sink node is the only certification authority in our system, but n level cluster heads can be extended to n level certification authorities if needed, where n is maximum number of level.
- 15 April 2011
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 66 (2) , 215-227
RSU-based message authentication for vehicular ad-hoc networks
- 15 April 2011
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 66 (2) , 215-227
RSU-based message authentication for vehicular ad-hoc networks
- 1 December 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 776-779
Using Probing Packets to Recover the Incomplete IP Traceback
An enhancement of probability packet marking (PPM) used to trace back the denial-of-service attacker is proposed. Through sending probing packets, the proposed scheme is used to recover missing attacking paths, resulting from successive non-PPM routers, which do not support PPM scheme along the attack path. Furthermore, according to the proposed scheme, the probing packet with IP record routing or loose source routing can detect consecutive non-PPM routers and help to recover lost paths because of non-PPM routers in a row. Especially, this scheme with the loosen source routing algorithm can record all traveled routers' IP addresses into probing packet's IP header
- 1 December 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 776-779
Using Probing Packets to Recover the Incomplete IP Traceback
An enhancement of probability packet marking (PPM) used to trace back the denial-of-service attacker is proposed. Through sending probing packets, the proposed scheme is used to recover missing attacking paths, resulting from successive non-PPM routers, which do not support PPM scheme along the attack path. Furthermore, according to the proposed scheme, the probing packet with IP record routing or loose source routing can detect consecutive non-PPM routers and help to recover lost paths because of non-PPM routers in a row. Especially, this scheme with the loosen source routing algorithm can record all traveled routers' IP addresses into probing packet's IP header