• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.398-398
• /
• 2004

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.179-179
• /
• 2004

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.465-465
• /
• 2004

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.461-461
• /
• 2004

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.455-455
• /
• 2004

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.67-67
• /
• 2004

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1422-1430
• /
• 2000

S(Synchronous)-CDMA is a new cable modem technology applicable to the upstream channel for high speed multimedia communication using CATV networks. In this paper we analyze the transmitting and receiving process of S-CDMA scheme based on Terayon patent and derive bit error probability of S-CDMA and TDMA scheme in the $\varepsilon$-mixture impulse noise model which appropriately reflects impulse noise characteristics of upstream channel by using various parameters. This analysis results are a good match with the simulation results. We also compare Eb/No gain performance of S-CDMA with TDMA in 16, 32, 64, QAM.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.97-97
• /
• 2004

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.6
• /
• pp.1275-1281
• /
• 2011

Many authors studied cooperative games that arise from variants of dominating set games on graphs. In wireless networks, the connected dominating set is used to reduce routing table size and communication cost. In this paper, we introduce a connected dominating set game to model the cost allocation problem arising from a connected dominating set on a given graph and study its core. In addition, we give a polynomial time algorithm for determining the balancedness of the game on a tree, for finding a element of the core.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.795-798
• /
• 2005

In this paper, we analyses of additive crypto-module architecture for a sensor network. Recent research in sensor networks has raised security issues for small embedded devices. Security concerns are motivated by the development of a large number of sensor devices in the field. Limitations in processing power, battery life, communication bandwidth and memoryconstrain devices. A mismatch between wide arithmetic for security and embedded data buscombined with lack of certain operations. Then, we compared the architecture of crypto-module in this paper.