• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1238-1246
• /
• 2000

In a multi-channel network based on wavelength division multiplexing (WDM), an efficient protocol is needed for transmitter and receiver to be tuned to same wavelength during message transmission time. This paper proposes a message scheduling protocol that can efficiently support variable-sized messages, where tunable transceiver has nonzero tuning time. In this protocol, once a node reserves one data channel, it can persistently use the reserved channel till message transmission is finished. Therefore, overhead due to tuning time of the tunable transceiver can be reduced. Moreover, the protocol does not require any global information. Therefore, it can operate independently of the change of the number of nodes, and any new node can join the network at anytime without requiring network initialization. With this protocol, one can avoid data channel and destination conflicts. The protocol is analyzed with a finite population model and the throughput-delay characteristics are investigated as performance measures.

• Journal of IKEEE
• /
• v.15 no.1
• /
• pp.104-112
• /
• 2011

During the ground operation of Korean army, the voice message is mainly used for exchanging informations related to the surveillance and reconnaissance, command and control, and precision strike. However, in order to the battlefield visualization among fighting powers participating in the ground force operation, automatic situational awareness and variable message format (VMF) for command and control are required. For securing core technologies necessary for the battlefield visualization, message standard and message handler are established through several applied researches. Besides, the VMF for equipping a weapon system is in development. In this paper, a study on the Korean variable message format (KVMF), where interoperability of integrated battle management system (BMS) is guaranteed due to performing joint, ground, and combined operations so that the situation awareness and strike system can be automated in almost real time, is presented. From the modeling and simulation (M&S) results of the message processor, delay time is varied in accordance with the number of nodes in unit platoon network, message length, and generation interval of routine messages. Therefore, it is shown that the system performance can be optimized by establishing proper network protocol for each situation.

• The KIPS Transactions:PartC
• /
• v.17C no.5
• /
• pp.433-440
• /
• 2010

Energy efficiency, low latency and scalability for wireless sensor networks are important requirements, especially, the wireless sensor network consist of a large number of sensor nodes should be minimized energy consumption of each node to extend network lifetime with limited battery power. An efficient algorithm and energy management technology for minimizing the energy consumption at each sensor node is also required to improve transfer rate. Thus, this paper propose no-overlap multi-pass protocol provides for sensor data transmission in the wireless sensor network environment. The proposed scheme should minimize network overhead through reduced a sensor data translation use to searched multi-path and added the multi-path in routing table. Proposed routing protocol may minimize the energy consumption at each node, thus prolong the lifetime of the sensor network regardless of where the sink node is located outside or inside the received signal strength range. To verify propriety proposed scheme constructs sensor networks adapt to current model using the real data and evaluate consumption of total energy.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.3
• /
• pp.188-193
• /
• 2011

In this letter, we have derived another exact performance analysis for the OADF(opportunistic adaptive decode-and-forward) relay systems over Rayleigh fading channels. Based on error-events at relay nodes, the received instantaneous SNR(signal-to-noise ratio) is presented and its PDF(probability density function) is expressed as a more tractable form in which the number of summations and the length of each summation are specified. Then, exact average error rate, outage probability, and average channel capacity are obtained as general forms. Simulation results are finally presented to validate that the proposed analytical expressions can be a unified frame work covering all Rayleigh fading channel conditions. Furthermore, it is confirmed that OADF schemes can outperform the other schemes on the average error rate, outage probability, and average channel capacity.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.5
• /
• pp.199-202
• /
• 2013

In the cluster mechanism of the wireless sensor network, the network lifetime is affected by how cluster heads are selected. One of the representative clustering mechanisms, the low-energy adaptive clustering hierarchy (LEACH), selects cluster heads periodically, resulting in high energy consumption in cluster reconstruction. On the other hand, the adaptive clustering algorithm via waiting timer (ACAWT) proposes a non-periodic re-clustering mechanism that reconstructs clusters if the remaining energy level of a cluster head reaches a given threshold. In this paper, we propose a re-clustering mechanism that uses multiple remaining node energy levels and does re-clustering when the remaining energy level of a cluster head reaches one level lower. Also, in determining cluster heads, both of the number of neighbor nodes and the remaining energy level are considered so that cluster heads can be more evenly placed. From the simulations based on the Qualnet simulator, we validate that our proposed mechanism outperforms ACAWT in terms of the network lifetime.

• Journal of Satellite, Information and Communications
• /
• v.10 no.2
• /
• pp.1-9
• /
• 2015

Recently, cognitive radio technology has been spotlighted for the efficient use of limited frequency technology. The most important part of CR is to protect the incumbent user's communications. Therefore, CR user should be sensing the currently using channel and another hopping channel for sudden appearance of the Incumbent User. In this paper, we propose the cooperative channel sensing to protect the IU considering each CR user's remained power and sensing-zone, sense the spectrum bands in a fairly distributed manner and share the results among the users within respective sensing zone. Sensing scheme including inband sensing and outband sensing is utilized. The inband sensing is in charge of current using channel scanning while the outband sensing mainly cares about other channels. The performance results by computer simulations show that our sensing scheduling scheme reduces the number of sensing nodes and saves energy need to channel sensing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6A
• /
• pp.617-625
• /
• 2011

In wireless sensor networks, data dissemination protocols have been proposed for mobile sink groups that are characterized by geographically staying closely and collective movement. They usually exploit flooding technology for mobility supporting and data delivery guarantee. However, it causes the excessive energy consumption of all sensor nodes in the group region due to data delivery participation. Moreover, the costs of the flooding would become higher in proportional to the group region. In this paper, we propose an energy efficient data dissemination scheme that resolves these problems. The virtual infrastructure called a 'pipe' is used as a rendezvous area. A source delivers data to the pipe, from which member sinks in the group retrieve it directly. Simulation results showed that this solution has better performance than existing protocols in terms of energy consumption as it reduces the number of regional flooding and eliminates unnecessary data flooding.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.10
• /
• pp.884-892
• /
• 2014

In this paper, a meta model using neural network substituting for the simulator aerodynamic database is proposed to improve simulation fidelity near the critical flight area and real-time performance. It is shown that the accuracy of the meta model is relatively higher than the existing table lookup methods for arbitrary nonlinear database and the calculation speed is also improved for a specific F-16 maneuver simulation. The increase in the number of hidden nodes in the meta model for better accuracy of database representations causes a delay in function generation due to increased time required for computing exponential functions. In order to make up this drawback, we additionally study the fast exponential function method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.120-122
• /
• 2015

In this paper, we proposed an algorithm of the unnecessary copied message inhibition using dynamic density what is called DDIM(Dynamic Density-based Inhibited Message diffusion) in DTNs(Delay Tolerant Networks). Existing DTN routing algorithms as Epidemic and Spray and Wait have some problems that occur large overhead in dense network due to the thoughtless message diffusion. Our proposed method, the DDIM, determines adjusted number of copied message through dynamic node density that is calculated using node's radio coverage and neighbor nodes in period time to solve message diffusion problem. It decrease overhead without losing message delivery ratio and increased latency through reducing message diffusion. In this paper, we compare delivery ratio, average latency and overhead of proposed algorithm, DDIM, and existing DTN routing algorithm and prove enhanced performance through simulation results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.5
• /
• pp.1149-1160
• /
• 2005

Generally, the network topology design problem, which is difficult to solve with the classical method because it has exponentially increasing complexity with the augmented network size, is characterized as a kind of NP-hard combinatorial optimization problem. The problem of this research is to design the highly reliable network topology considering the connection cost and all-terminal network reliability, which can be defined as the probability that every pair of nodes can communicate with each other. In order to solve the highly reliable network topology design problem minimizing the construction cost subject to network reliability, we proposes an efficient two phase approach to design reliable network topology, i.e., the first phase employs, a genetic algorithm (GA) which uses $Pr\ddot{u}fer$ number for encoding method and backtracking Algorithm for network reliability calculation, to find the spanning tree; the second phase is a greedy method which searches the optimal network topology based on the spanning ree obtained in the first phase, with considering 2-connectivity. finally, we show some experiments to demonstrate the effectiveness and efficiency of our two phase approach.