• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.84-93
• /
• 2009

This paper focuses on message complexity performance analysis of mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs) in reference to link errors generated by mobile wireless nodes. An enhancement was made using a proposed retransmission limit, S, to be computed for error recovery (based on the link error probability), to measure message complexity of AAPs in reference to the link error probability, $P_e$. The control procedures for the retransmission limit have been included for each of the AAPs. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating on limited portable energy. O-notation has been applied to analyze the upper bound of the number of messages generated by a MANET group of nodes. The AAPs investigated in this paper are strong duplicate address detection (DAD), weak DAD with proactive routing protocol (WDP), weak DAD with on-demand routing protocol (WDO), and MANETConf. Each AAP reacts different to link errors, as each AAP has different operational procedures. The required number of broadcasting, unicasting, relaying, and received messages of the nodes participating in a single-node joining procedure is investigated to asymptotically calculate the message complexity of each AAP. Computer simulation was conducted and the results have been analyzed to verify the theoretical message complexity bounds derived. The message complexity of WDP was lowest, closely followed byWDO, based on the simulation results and analysis of the message complexity under nominal situations. The message complexity of MANETConf was higher than WDO, and strong DAD resulted to be most complex among the four AAPs.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.1
• /
• pp.77-84
• /
• 2014

In this paper, we propose the hierarchical network synchronization scheme that is backward compatible for the existing commercial system, efficient for total system performance, and whose hardware modification is minimized. This system performance is, the relationship among bandwidth efficiency, complexity and MODEM performance, and superiority of network system applicability. The proposed structure can remedy the high hardware complexity and the lower accuracy of network sychronization that the existing satellite communication terminal system in the star network based on TDM/MF-TDMA of DVB-S2/RCS standards has. Besides, It has high efficiency in view of cost and system performance if the system designed for satellite broadcast requires system upgrade. In the body section, its hardware complexity and system performance of the proposed algorithm is analysed theoretically and treated with the related parameters(symbol rate, spreading factor, etc.) and the BER performance of control channel through the computer simulation for its verification that it can be applied for communications system.

• Proceedings of the KIPE Conference
• /
• 2000.07a
• /
• pp.464-467
• /
• 2000

In this paper we introduce the network based multi-motors control system using CAN(Controller Area Network) The traditional multi-motors control system has many problems in the view of reliability and economy because of the amount and complexity of wiring noise and maintenance problems etc, These problems are serious especially when the motor controllers are separated widely CAN is generally applied in car networking in order to reduce the complexity of the related wiring harnesses. These traditional CAN application techniques are modified to achieve the real time communication for the multi-motor control system. And also the position synchronization technique is developed and the proposed methods are verified experimentally.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1609-1615
• /
• 2006

Overlay multicast technique is an effective way as an alternative to IP multicast. Traditional IP multicast is not widely deployed because of the complexity of IP multicast technology and lack of application. But overlay multicast can be easily deployed by effectively reducing complexity of network routers. Because overlay multicast resides on top of densely connected IP network, In case of multimedia streaming service over overlay multicast tree, real-time data is sensitive to end-to-end delay. Therefore, moderate algorithm's development to this network environment is very important. In this paper, we are interested in minimizing maximum end-to-end delay in overlay multicast tree. The problem is formulated as a degree-bounded minimum delay spanning tree, which is a problem well-known as NP-hard. We develop tabu search heuristic with intensification and diversification strategies. Robust experimental results show that is comparable to the optimal solution and applicable in real time

• ETRI Journal
• /
• v.31 no.3
• /
• pp.327-329
• /
• 2009

In a network, broadcasting is the dissemination of a message from a source node holding a message to all the remaining nodes through a call. This letter proposes a one-to-all broadcasting algorithm in the Petersen-torus network PT(n, n) for the single-link-available and multiple-link-available models. A PT(n, n) is a regular network whose degree is 4 and number of nodes is $10n^2$, where the Petersen graph is set as a basic module, and the basic module is connected in the form of a torus. A broadcasting algorithm is developed using a divide-and-conquer technique, and the time complexity of the proposed algorithm approximates n+4, the diameter of PT(n, n), which is the lower bound of the time complexity of broadcasting.

• ETRI Journal
• /
• v.32 no.4
• /
• pp.622-625
• /
• 2010

In this letter, we assess the scalability of a path computation flooding (PCF) approach to compute optimal end-to-end inter-domain paths in a path computation element-based multi-domain network. PCF yields a drastically reduced network blocking probability compared to a blind per-domain path computation but introduces significant network control overhead and path computation complexity. In view of this, we introduce and compare an alternative low overhead PCF (LoPCF) solution. From the obtained results, LoPCF leads to similar blocking probabilities to PCF while exhibiting around 50% path computation complexity and network control overhead reduction.

• Speech Sciences
• /
• v.11 no.4
• /
• pp.89-97
• /
• 2004

In this paper, an improved network echo canceller is proposed. The proposed echo canceller is based on the LTJ(lattice transversal joint) adaptive filter which uses informations from the speech decoder. In the proposed implementation method of the network echo canceller, the filer coefficients of the transversal filter part in the LTJ adaptive filter is updated every other sample instead of every sample. So its complexity can be lower than that of the transversal filter. And the echo cancellation rate can be improved by residual echo cancellation using the lattice predictor whose order is less than 10. Computational complexity of the proposed echo canceller is lower than that of the transversal filter but the convergence speed is faster than that of the transversal filter. The performance improvement of the proposed echo canceller was verified by the experiments using the real speech signal and speech coder.

• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.384-395
• /
• 2008

Random network coding can be viewed as a single block code applied to all source packets. To manage the concomitant high coding complexity, source packets can be partitioned into generations; block coding is then performed on each set. To reach a better performance-complexity tradeoff, we propose a novel concatenated network code which mixes generations while retaining the desirable properties of generation-based coding. Focusing on the code's erasure performance, we show that the probability of successfully decoding a generation on erasure channels can increase substantially for any erasure rate. Using both analysis (for small networks) and simulations (for larger networks), we show how the code's parameters can be tuned to extract best performance. As a result, the probability of failing to decode a generation is reduced by nearly one order of magnitude.

• The Journal of Information Systems
• /
• v.18 no.3
• /
• pp.47-70
• /
• 2009

Social network is one of the representative analytical method of the complexity theory and this research analyzed various and unique strategic alliance model of e-business domain using social network technique. A lot of small and medium firms of e-business field had developed many useful type of strategic alliances for the firms tried to maximize the effect of advertisement, marketing and to make up for their weak points and to compete with huge company with capital strength long before. But it is too rare to analyze the structure of the firm networks and to study the evolution and extension of business model considered the role of each company in the network. Social network analysis helps each firm's network easily visualized and completely modelized. Additionally, this paper cries to analyze the relationship between the role of hub and broke in the firm networks for strategic alliance, and financial performance. We demonstrate the firm with finer business model to the business environment can make higher financial performance. This implies that the firm that can create new finer business model, will lead the network of e-business firms and evolve the industry of e-business.

• Management Science and Financial Engineering
• /
• v.20 no.2
• /
• pp.7-12
• /
• 2014

Content Delivery Network (CDN) has evolved to overcome a network bottleneck and improve user perceived Quality of Service (QoS). A CDN replicates contents from the origin server to replica servers to reduce the overload of the origin server. CDN providers would try to achieve an acceptable performance at the least cost including the storage space or processing power. In this paper, we introduce a new optimization model for the CDN design problem considering the user perceived QoS and single path (non-bifurcated) routing constraints and analyze the computational complexity for some special cases.