Bo Sun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Bo Sun has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Yang Xiao
The University of Alabama
4 shared publications - Kui Wu
University of Victoria
3 shared publications - Chung-Chih Li
School of Information Technology, Illinois State University, Normal, IL, USA
1 shared publication - Dennis Dreef
Department of Computer Science, University of Victoria, Victoria BC, Canada V8W 3P6
1 shared publication - Kui Wu
University of Victoria, Victoria, Canada
1 shared publication - Ruhai Wang
Lamar University
1 shared publication
Latest Publications
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15555798,p. 86-89
Experimental Study of an Online Game over Wireless Networks
Online games usually require the delivery of realtime multimedia contents over networks. While online games have become increasingly popular over the Internet, it is still challenging to build online games over wireless networks, where link quality changes from time to time and link capacity is usually much smaller compared to wired networks. Packet losses and large delay of wireless networks may make online gaming an unpleasant experience, especially when a large amount of multimedia traffic is exchanged between players. In this paper, we implement a two-player competitive online game over wireless LAN and test its performance. To reduce the impact of message delay, we introduce a design pattern to deduce the traffic of multimedia contents by coding game context at the application layer instead of transmitting actual multimedia data. Experimental results demonstrate that even with a high bit error rate, the application-layer quality deterioration is negligible for most game players.
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15555798,p. 86-89
Experimental Study of an Online Game over Wireless Networks
Online games usually require the delivery of realtime multimedia contents over networks. While online games have become increasingly popular over the Internet, it is still challenging to build online games over wireless networks, where link quality changes from time to time and link capacity is usually much smaller compared to wired networks. Packet losses and large delay of wireless networks may make online gaming an unpleasant experience, especially when a large amount of multimedia traffic is exchanged between players. In this paper, we implement a two-player competitive online game over wireless LAN and test its performance. To reduce the impact of message delay, we introduce a design pattern to deduce the traffic of multimedia contents by coding game context at the application layer instead of transmitting actual multimedia data. Experimental results demonstrate that even with a high bit error rate, the application-layer quality deterioration is negligible for most game players.
- 1 January 2007
- Published by Elsevier in Ad Hoc Networks
- Vol. 5 (1) , 100-111
Secure data aggregation without persistent cryptographic operations in wireless sensor networks
- 1 January 2007
- Published by Elsevier in Ad Hoc Networks
- Vol. 5 (1) , 100-111
Secure data aggregation without persistent cryptographic operations in wireless sensor networks
- 18 September 2006
- Published by Wiley in International Journal of Communication Systems
- Vol. 20 (6) , 695-721
Integration of mobility and intrusion detection for wirelessad hocnetworks
One of the main challenges in building intrusion detection systems (IDSs) for mobilead hocnetworks (MANETs) is to integrate mobility impacts and to adjust the behaviour of IDSs correspondingly. In this paper, we first introduce two different approaches, a Markov chain‐based approach and a Hotelling'sT2test based approach, to construct local IDSs for MANETs. We then demonstrate that nodes' moving speed, a commonly used parameter in tuning IDS performances, is not an effective metric to tune IDS performances under different mobility models. To solve this problem, we further propose anadaptivescheme, in which suitable normal profiles and corresponding proper thresholds can be selectedadaptivelyby each local IDS through periodically measuring its locallink change rate, a proposed unified performance metric. We study the proposed adaptive mechanism at different mobility levels, using different mobility models such as random waypoint model, random drunken model, and obstacle mobility model. Simulation results show that our proposed adaptive scheme is less dependent on the underlying mobility models and can further reduce false positive ratio. Copyright © 2006 John Wiley & Sons, Ltd.
- 18 September 2006
- Published by Wiley in International Journal of Communication Systems
- Vol. 20 (6) , 695-721
Integration of mobility and intrusion detection for wirelessad hocnetworks
One of the main challenges in building intrusion detection systems (IDSs) for mobilead hocnetworks (MANETs) is to integrate mobility impacts and to adjust the behaviour of IDSs correspondingly. In this paper, we first introduce two different approaches, a Markov chain‐based approach and a Hotelling'sT2test based approach, to construct local IDSs for MANETs. We then demonstrate that nodes' moving speed, a commonly used parameter in tuning IDS performances, is not an effective metric to tune IDS performances under different mobility models. To solve this problem, we further propose anadaptivescheme, in which suitable normal profiles and corresponding proper thresholds can be selectedadaptivelyby each local IDS through periodically measuring its locallink change rate, a proposed unified performance metric. We study the proposed adaptive mechanism at different mobility levels, using different mobility models such as random waypoint model, random drunken model, and obstacle mobility model. Simulation results show that our proposed adaptive scheme is less dependent on the underlying mobility models and can further reduce false positive ratio. Copyright © 2006 John Wiley & Sons, Ltd.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 8, 3627-3632
A LCG-based Secure Protocol for Wireless Sensor Networks
In this paper, based on a Linear Congruential Generator (LCG), we propose a new block cipher that is suitable for constructing a lightweight secure protocol for resource-constrained wireless sensor networks. Based on the Plumstead's inference algorithm, we are motivated to embed the generated pseudo-random numbers with sensor data messages in order to provide security. Specifically, the security of our proposed cipher is achieved by adding random noise and random permutations to the original data messages. The analysis of our cipher indicates that it can satisfy the security requirements of wireless sensor networks. We demonstrate that secure protocols based on our proposed cipher satisfy the baseline security requirements: data confidentiality, authenticity, and integrity with low overhead. Performance analysis demonstrates that our proposed block cipher is more lightweight than RC5 in terms of the number of basic operations.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 8, 3627-3632
A LCG-based Secure Protocol for Wireless Sensor Networks
In this paper, based on a Linear Congruential Generator (LCG), we propose a new block cipher that is suitable for constructing a lightweight secure protocol for resource-constrained wireless sensor networks. Based on the Plumstead's inference algorithm, we are motivated to embed the generated pseudo-random numbers with sensor data messages in order to provide security. Specifically, the security of our proposed cipher is achieved by adding random noise and random permutations to the original data messages. The analysis of our cipher indicates that it can satisfy the security requirements of wireless sensor networks. We demonstrate that secure protocols based on our proposed cipher satisfy the baseline security requirements: data confidentiality, authenticity, and integrity with low overhead. Performance analysis demonstrates that our proposed block cipher is more lightweight than RC5 in terms of the number of basic operations.