• The Journal of the Korea Contents Association
• /
• v.8 no.7
• /
• pp.43-52
• /
• 2008

The AODV routing algorithm in a mobile ad-hoc networks broadcasts RREQ packet to find a route from a source to a destination. An attacker node may intercept a RREQ packet and attack by falsifying a field in that packet. In this paper, we propose a simply modified method which can protect a routing table from an attack to falsify the hop count field in the RREQ packet. When establishing a connection between a source and a destination, we update routing table of each node on the connection based on minimum delay instead of minimum hop count. By doing this, we can protect routing table from an attack to falsify a hop count Our simulation is implemented in Network Simulator(NS-2). We analyze how an attacker affects the mobile ad-hoc networks. The result of the simulation shows that the proposed mechanism transfers a data securely.

• Journal of the Korea Society for Simulation
• /
• v.15 no.3
• /
• pp.87-91
• /
• 2006

With the growth of the internet, the number of wireless internet users has increased continuously up to date. However, mobile communications could not support high speed transmission rate with cheap communication fee and wireless LAN has problems in providing terminal mobility and wide area connectivity, respectively. So the WMAN standard has been newly designed to make up for these limits. The initial 802.16 specification effectively offers a solution for providing fixed users with high speed wireless communication but it does not offer terminal mobility. So the 802.16d and 802.16e have been developed as the next generation solution that can support various PHY layer (SC, SCa, OFDM, OFDMA) and offer the terminal mobility. In this paper, we propose an effective uplink scheduling algorithm for VoIP with using UGS, and we show that our proposed algorithm is superior in view of average delay and management of uplink bandwidth to conventional rtPS algorithm and the scheme in reference, with using NS-2 network simulator.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1654-1662
• /
• 2006

An ad hoc network is multi-hop network composed of radio links. and the transmission quality of a radio link is more unstable than that of a wired circuit. Packet loss thus occurs frequently in an ad hoc network, and the consequent connection failure results in a severe deterioration of TCP performance. TCP performance also deteriorates because of the collision of data packets and ACK packets in the radio channel. In this paper we study to improve the performance of the Mobile Ad-hoc network by using Delayed ACK algorithm with our proposed ODA(Ordering-Delayed ACK) method. The proposed ODA algorithm increases the number of the data packets orderly at the receiver side which is going to be applied for the Mobile Ad-hoc network. We accomplished a computer simulation using NS-2. From the simulation results, we find the proposed ODA algorithm obviously enlarge the channel capacity and improve the network performance at the situation of multi-hop of ad-hoc network than the existing Delayed ACK algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1A
• /
• pp.31-36
• /
• 2004

In this paper, we proposed the new structure of the Rake Finger using Walsh Switch, the shared accumulator, and the pipeline-FWHT algorithm for reducing the signal processing complexity resulting from the increase of the number of data correlator. The function simulation of the proposed architecture is performed by Synopsys tool and the timing simulation is performed by Compass tool. The number of computational operation in the proposed data correlators is 160 additions and the conventional ones is 512 additions when the number of walsh code N=4. As a result, it is reduced about 3.2 times other than the number of computational operation of the conventional ones. Also, the result shows that the data processing time of the proposed Rake Finger architecture is 90,496[ns] and the conventional ones is 110,696[ns]. It is $18.3\%$ faster than the data processing time of the conventional Rake Finger architecture.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.3
• /
• pp.22-33
• /
• 2014

As a standard of WMNs, IEEE 802.11s supports two kinds of MAC algorithm: a mandatory EDCA used by IEEE 802.11e and an optional MCCA. While EDCA classifies traffic according to four Access Categories (AC) and offer differentiated service using a classified priority, MCCA can guarantee the specific bandwidth of users with a TDMA-style bandwidth reservation scheme between mesh routers. In case that a flow is VBR traffic of a multimedia application, MCCA has disadvantage that the reserved bandwidth does not be used entirely, though it guarantees required bandwidth of users and fairness using bandwidth reservation with neighbors' node. In this paper, we showed a problem that is wastes the reserved bandwidth when MCCA is enabled and proposed a new scheduling algorithm to prevent waste of bandwidth and to improve network utilization effectively, named Resource Sharing Round Robin (RSRR) scheduling. Finally we showed simulation results that performance of a proposed RSRR is better than the legacy MCCA through NS-2 simulation.

• Korean Journal of Optics and Photonics
• /
• v.5 no.3
• /
• pp.386-393
• /
• 1994

We have investigated output characteristics of XeCI excimer laser excited by transeverse electronbeam. We used e-beam output of 880 kV, 21 kA (70 ns, FWHM) and controlled current density of e-beam by pulsed magnetic coil (4.7 kG) which was fabricated around an e-beam diode (A-K gap is 21 mm) and laser chamber. We have obtained 35 J (4 atm) of e-beam deposition energy injected into laser media. The deposition energy was converted from an exposure area of Radcolor film and rising pressure of gas media which is measured by pressure jump method. The excited volume of $320cm^{3}$ was calculated. The maximum efficiency of 1.7% was obtained with the mixing ratio of HCllXe/Ar==0.2/ 6.3/93.5% and total pressure of 3 atm. Also laser output energy and specific energy were obtained 0.52 J and 1.7 J/I, respectively. For the analysis of experimental results we have developed computer simulation code. From the good agreements with the results of experiment and simulation we could theoretically explain the XeCI* formation channel. relaxation channel, and absorption channel of 308 nm.308 nm.

• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.280-288
• /
• 2004

In Ad Hoc Networks, a connection breaks due to the irregular movement of mobile nodes and the inherent characteristics of the wireless medium such as the interference and the multi-path fading. AODV, a typical on-demand routing protocol in Ad Hoc networks, uses the local repair mechanism to cope with the connection breaks. This paper proposes an efficient route maintenance scheme for AODV, named as AODV-ERM, by utilizing hello messages. The proposed AODV-ERM scheme can recover some link breaks efficiently without relying on the expensive local repair process, thereby reducing the repair time. To show the effectiveness of the proposed scheme, we performed extensive simulation with NS2. The simulation results show that the proposed scheme can reduce the repair time effectively and thus, increase the overall packet delivery ratio.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1565-1570
• /
• 2014

In networking communication, nodes and base station send data to each nodes and destination nodes. In this perspective, it is very important to determine the direction in which data sent to each nodes or destination nodes. Ad-hoc routing protocol is a standard routing protocol that determines how the packets sent to destination. Ad-hoc routing protocol includes protocols such as Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR). In our efficient proposed protocol based on small end-to-end sequence numbers, route direction can be changed properly with the assistance of helper nodes. In this paper, we focus on the simulation analysis of proposed protocol and comparison with other routing protocol models such as AODV and DSR. We simulated using Network Simulator (NS-2) by parameters such as simulation time, number of nodes and packet size based on our metrics (packet delivery fraction, routing load, data throughput). Our proposed protocol based on small end-to-end sequence numbers shows better performance and superior to other two protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1305-1313
• /
• 2010

Last few years, wireless personal area network (WPAN) has been widely researched for various healthcare applications. Due to restriction of device hardware (e.g., energy and memory), we need to design a highly-versatile MAC layer protocol for WBAN (Wireless Body Area Network). In addition, when an emergency occurs to a patient, a priority mechanism is necessitated for a urgent message to get through to the final destination. This paper presents a priority mechanism referred to as hybrid priority MAC for WBAN. Through extensive simulation, we show the proposed MAC protocol can minimize the average packet latency for urgent data. Thus, when patients have an emergency situation, our MAC allows adequate assistance time and medical treatment for patients. The simulation based on NS-2 shows that our Hybrid Priority MAC has the good performance and usability.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.8
• /
• pp.1493-1499
• /
• 2007

Real-time applications in a wireless sensor network environment require real-time transmissions from sensing nodes to sink nodes. Existing congestion control mechanisms have treated congestion problems in sensor networks, but they only adjust the reporting frequency or the sending rate in intermediate nodes. They were not suitable for real-time applications from the transmission delays point of view. In this paper, we suggest a new mechanism that can reduce the transmission delay and can increase the throughput for real-time applications in sensor network. This mechanism classifies data on the real-time characteristics, processes the data maintaining the real-time characteristics prior to the other data such as the non real-time data or the data lost the real-time characteristics. A modified frame format is also proposed in order to apply the mechanism to IEEE 802.15.4 MAC layer. The simulation based on ns-2 is accomplished in order to verify the performance of the suggested scheme from transmission delay and throughput standpoints. The simulation results show that the proposed algorithm has a better performance specifically when It applies to the real-time applications in sensor networks.