• Journal of the Korea Society for Simulation
• /
• v.19 no.4
• /
• pp.43-50
• /
• 2010

Recently, the Internet telephony has been used rather than the traditional telephony by many Internet users, with low cost. Session Initiation Protocol(SIP) is the standard of application layer protocol for establishment and disconnection of the session for Internet telephony. SIP mainly runs over the UDP for transport. So in case of the loss of the INVITE request message, the message is retransmitted by an appropriate timer for reliable transmission of the UDP message. Though the retransmission is useful for ensuring the reliability of SIP messages sent by the users, it may cause the overload traffic in the SIP proxy server. The overload in SIP proxy servers results in the loss of many input messages. This paper presents a non-linear overload control algorithm to resolve the overload condition of the server. we simulate our proposed algorithm using the network simulator ns-2. The simulation results show that the throughput of the server with the proposed algorithm have been improved about 12% compared to the existing linear control algorithm.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.7
• /
• pp.743-747
• /
• 2008

Hierarchical overlay of heterogeneous wireless cells is considered as a promising architecture for next-generation wireless networks. This paper considers a special form of such architecture, WWAN/WLAN two-hop wireless relay networks. We first describe an undesirable scheduling phenomenon that the conventional proportional fair algorithm can cause in such networks. We, then, propose an enhanced proportional fair scheduling to remedy this problem. We demonstrate the performance of the proposed scheme via a simulation of UMTS/WLAN networks using NS-2.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.11
• /
• pp.205-210
• /
• 2012

This paper investigated the performance of QoS management using variations of RED parameters in Differentiated Service. Differentiated Service separates packets from a specific traffic by using QoS parameters such as CIR or PIR. A code point is used to mark each packet which is enqueued into each virtual queue. Different RED parameters are configured for virtual queues according to each code point. As the code point value increases, the RED parameters become harsher. To show QoS Management using variations of RED parameters, this paper used the policy model of time sliding window with 2 color marking (TSW2CM). Simulation results using NS-2 showed that the QoS management of a differentiated service can be obtained from using variations of RED parameters.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.2B
• /
• pp.76-81
• /
• 2008

LEACH (Low Energy Adaptive Clustering Hierarchy) has been proposed as a routing protocol with a hierarchical structure, in order to achieve the energy efficiency that is of primary importance in the wireless sensor networks. A wireless sensor network adopting LEACH is composed of a few clusters, each of which consists of member nodes that sense the data, and head nodes that deliver the collected data from member nodes to a sink node that is connected to a backbone network. A head node in a cluster allocates TDMA slots to its member nodes without taking into account whether they have data to transmit or not, thus resulting in inefficiency of energy usage of head node that remains in active mode during the entire round time. This motivates us to propose a scheme to improve the energy efficiency of LEACH, by assigning TDMA slots only to those member nodes who have data to send. As a result, the head node can remain sleep during the period of no data transmission from member nodes, leading to the substantial energy saving. By using the ns-2 simulator, we evaluate the performance of the proposed scheme in comparison with the original LEACH. Experimental results validate our scheme, showing a better performance than original LEACH in terms of the number of outliving nodes and the quantity of energy consumption as time evolves.

• The KIPS Transactions:PartC
• /
• v.18C no.2
• /
• pp.119-126
• /
• 2011

In wireless sensor networks Time synchronization used to be performed after routing tree is constructed. It results in increasing the number of packets and energy consumption. In this paper, we propose a time synchronization algorithm combined with flooding routing tree construction algorithm, which applies LTS (Lightweight Time Synchronization) information packed into the forwarding and backward routing packets. Furthermore, the proposed algorithm compensates the time error due to clock drift using the round time with fixed period. We prove that the proposed algorithm could synchronize the time of among sensor nodes more accurately compared to TSRA (Time Synchronization Routing Algorithm) using NS2 simulation tool.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.130-134
• /
• 2007

DCF(Distributed Coordination Function) of IEEE 802.11 WLAN(Wireless Local Area Network) MAC Layer apply to CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance) for solution of collision when the station try to access at the same time. But DCF happens falling performance as increasing a number of stations. In this paper, we suggest algorithm that improved performance in congestion. And we compare DCF, DCF+ and proposed algorithm respect to saturation throughput, delay, collision rate and drop rate using NS2(Network Simulator 2) simulation tool.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.8
• /
• pp.499-509
• /
• 2014

In this paper, we propose that a FDL(Freeze DeadLine) Algorithm to solve handover problems in heterogeneous wireless networks. Many previous studies concentrated on low level layer to solve handover problems. In this paper, however, we concentrate on high level handover problems such as network layer and transport layer. We analyze handover's problems of transport layer in Heterogeneous wireless network, propose the FLD algorithm for better performance than others studies. The Proposed method is analyzed by theoretical frames and we verify that the propose method using the NS-2(Network Simulation - 2).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.10
• /
• pp.817-823
• /
• 2013

This paper examined the performance of differentiated services applied to each different traffic. For this purpose, we used three traffics which have a different quality of service and generate packets from a specific source to destination. To allocate a proper code point according to QoS, a common policy which is the simple policy model of time sliding window with 3 color marking (TSW3CM) was established to each traffic. To evaluate the performance, we investigate and compare code points to each traffic. Simulation results using NS-2 showed that the code points 10, 11, and 12 can be differently allocated to each traffic according to its sending rates 1Mbps, 2.5Mbps, and 4Mbps.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2293-2300
• /
• 2008

In ad-hoc sensor network, AODV routing information is disclosed to other nodes because AODV protocol doesn't have any security mechanisms. The problem of AODV is that an attacker can falsify the routing information in RREQ packet. If an attacker broadcasts the falsified packet, other nodes will update routing table based on the falsified one so that the path passing through the attacker itself can be considered as a shortest path. In this paper, we design the routing-information-spoofing attack such as falsifying source sequence number and hop count fields in RREQ packet. And we suggest an efficient scheme for detecting the attackers and isolating those nodes from the network without extra security modules. The proposed scheme doesn't employ cryptographic algorithm and authentication to reduce network overhead. We used NS-2 simulation to evaluate the network performance. And we analyzed the simulation results on three cases such as an existing normal AODV, AODV under the attack and proposed AODV. Simulation results using NS2 show that the AODV using proposed scheme can protect the routing-information-spoofing attack and the total n umber of received packets for destination node is almost same as the existing norm at AODV.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.3
• /
• pp.193-198
• /
• 2016

Lane change is an important issue in microscopic traffic flow simulations and active safety. Overtaking and changing lanes are dangerous driving maneuvers. This approach presents a lane-changing system based on speed and a minimum gap between vehicles in a vehicular ad hoc network (VANET). This paper proposes a solution to ensure the safety of drivers while changing lanes on highways. Efficient routing protocols could play a crucial role in VANET applications, safeguarding both drivers and passengers, and thus, maintaining a safe on-road environment. This paper focuses on the development of an intelligent transportation system that provides timely, reliable information to drivers and the concerned authorities. A test bed is created for the techniques used in the proposed system, where analysis takes place in an on-board embedded system designed for vehicle navigation. The designed system was tested on a four-lane road in Neemrana, India. Successful simulations were conducted with real-time network parameters to maximize quality of service and performance using Simulation of Urban Mobility and Network Simulator 2 (NS-2). The system implementation, together with the findings, is presented in this paper. Illustrating the approach are results from simulation using NS-2.