• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3834-3857
• /
• 2021

The design of cluster-based routing protocols is necessary for Wireless Sensor Networks (WSN). But, due to the lack of features, the traditional methods face issues, especially on unbalanced energy consumption of routing protocol. This work focuses on enhancing the security and energy efficiency of the system by proposing Energy Efficient Based Secure Routing Protocol (EESRP) which integrates trust management, optimization algorithm and key management. Initially, the locations of the deployed nodes are calculated along with their trust values. Here, packet transfer is maintained securely by compiling a Digital Signature Algorithm (DSA) and Elliptic Curve Cryptography (ECC) approach. Finally, trust, key, location and energy parameters are incorporated in Particle Swarm Optimization (PSO) and meta-heuristic based Harmony Search (HS) method to find the secure shortest path. Our results show that the energy consumption of the proposed approach is 1.06mJ during the transmission mode, and 8.69 mJ during the receive mode which is lower than the existing approaches. The average throughput and the average PDR for the attacks are also high with 72 and 62.5 respectively. The significance of the research is its ability to improve the performance metrics of existing work by combining the advantages of different approaches. After simulating the model, the results have been validated with conventional methods with respect to the number of live nodes, energy efficiency, network lifetime, packet loss rate, scalability, and energy consumption of routing protocol.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.257-260
• /
• 1998

In this paper, we describe an IMT-2000 system architecture, a protocol stack, and basic MAP scenarios(e.g., registration, call delivery) based on the IS-41 and IS-41 and IS-751. This paper focuses on the MAP scenarios to support the IMSI which is defined for the global roaming between GSM and IS-41 Networks through the Family of System approach. This paper also deals with the design of the MAP protocol stack transported over the ATM networks and introduces the software structure of MAP in IMT-2000 MSC.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.358-365
• /
• 2010

We develop a low complexity cooperative diversity protocol for low energy adaptive clustering hierarchy (LEACH) based wireless sensor networks. A cross layer approach is used to obtain spatial diversity in the physical layer. In this paper, a simple modification in clustering algorithm of the LEACH protocol is proposed to exploit virtual multiple-input multiple-output (MIMO) based user cooperation. In lieu of selecting a single cluster-head at network layer, we proposed M cluster-heads in each cluster to obtain a diversity order of M in long distance communication. Due to the broadcast nature of wireless transmission, cluster-heads are able to receive data from sensor nodes at the same time. This fact ensures the synchronization required to implement a virtual MIMO based space time block code (STBC) in cluster-head to sink node transmission. An analytical method to evaluate the energy consumption based on BER curve is presented. Analysis and simulation results show that proposed cooperative LEACH protocol can save a huge amount of energy over LEACH protocol with same data rate, bit error rate, delay and bandwidth requirements. Moreover, this proposal can achieve higher order diversity with improved spectral efficiency compared to other virtual MIMO based protocols.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.767-770
• /
• 2015

With the deployment of web-based educational game over the internet, the user's registration becomes a critical element. The user is authenticated by the system using username, password, and unique code. However, it cannot be handled properly because the data is transmitted through insecure channel on the network. Hence, security requirement is needed to avoid identity leakage from malicious user. In this paper, we propose a secure communication approach using SSL protocol for an online game. We also describe the security requirements for our approach. In future work, we intend to configure and implement the SSL protocol by enabling HTTPS in web-based online game.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10B
• /
• pp.866-871
• /
• 2006

This paper presents the design of a reservation-based MAC protocol to support multimedia traffic over mobile ad-hoc networks and evaluates its performance. Our MAC protocol is based on a hierarchical approach consisting of two sub-layers. The lower sub-layer of the MAC protocol with reservation provides a fundamental access method using CSMA/CA in order to support asynchronous data traffic over mobile ad-hoc networks. The upper sub-layer supports real-time periodic data by making a slot reservation before transmitting actual data. The proposed protocol has been validated through simulations using ns-2. The results show that the proposed MAC protocol can offer higher throughput and lower delay than standard implementations of the IEEE 802.11.

• International Journal of Internet, Broadcasting and Communication
• /
• v.7 no.1
• /
• pp.62-65
• /
• 2015

Wireless Sensor Network consists of several sensor nodes, these nodes loss some of their energy after the process of communication. So an energy efficient approach is required to improve the life of the network. In case of broadcast network, LEACH protocol uses an aggregative approach by creating cluster of nodes. Now the major concern is to built such clusters over WSN in an optimized way. This work presents the improvement over LEACH protocol. Hence we have different work environments where the network is having different capacities. The proposed work shows how the life time of the network will improve when the number of nodes varies within the network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3338-3351
• /
• 2012

There is an intuitive connection between signcryption and key agreement. Such a connector may lead to a novel way to construct authenticated and efficient group key agreement protocols. In this paper, we present a primary approach for constructing an authenticated group key agreement protocol from signcryption. This approach introduces desired properties to group key agreement. What this means is that the signcryption gives assurance to a sender that the key is available only to the recipient, and assurance to the recipient that the key indeed comes from the sender. Following the generic construction, we instantiate a distributed two-round group key agreement protocol based on signcryption scheme given by Dent [8]. We also show that this concrete protocol is secure in the outsider unforgeability notion and the outsider confidentiality notion assuming hardness of the Gap Diffie-Hellman problem.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.9
• /
• pp.17-28
• /
• 2004

Since the Internet has grown into a large communication infrastructure, the network management system to systematically manage the large number of network components has become an essential part of the Internet. The rapid growth of network size has brought into question the scalability of the existing centralized model, such as SNMP (Simple Network Management Protocol) and CMIP (Common Management Information Protocol). Thus, for efficient network management, researches about mobile agent have also been performed recently. This paper presents analytical models of centralized approach based on SNMP protocol, distributed approach based on mobile agent, and mixed mode to make up for shortcomings of SNMP and mobile agent. We compare the performance of these analytical models based on network management response time. Experiment results show that performance of mobile agent and the mixed mode is less sensitive to the delay in WAN network environment. However, SNMP is more efficient for the simple network environment like LAN.

• The KIPS Transactions:PartA
• /
• v.16A no.3
• /
• pp.189-198
• /
• 2009

The traditional interrupt-based protocol processing at end hosts has two priority-inversion problems. First, low-priority packets may interrupt and delay high-priority process executionssince interrupts have the highest priority in most operating systems. Second, low-priority packet may delay high priority packets when they arrive almost simultaneously since interrupt processing is performed in a FCFS (first come, first served) order. These problems can be solved by a priority-based protocol processing policy and implementation. However, general priority-based schemes commonly have the problem of starvation and cannot support the each network flow requiring the mutually exclusive QoS since the packets are processed in the FCFS order. Therefore, the priority-based schemes are not appropriate for different QoS-demanding applications. In this paper, we present a bottom-half-based approach that relies on priority- and budget-based processing. The proposed approach allows us to solve both the starvation and priority-inversion problems, and further enables effective QoS isolation between different network connections. This feature also enables bounding the protocol processing time at an end host. We finally show through experiments that the proposed approach achieves QoS isolation and control.

• Journal of Internet Computing and Services
• /
• v.9 no.2
• /
• pp.61-68
• /
• 2008

Authentication for inter-NEMO rooming is on important issue for achieving the seamless mobile networking. In this proposal, the technical challenge lies in the fact that a visited network does not initially have the authentication credentials of a roaming mobile router. This paper proposes an efficient approach for providing AAA service in NEMO environment. This approach uses localized authentication based on the roaming agreement between ISPs. A public key certificate structure is proposed, tailored to the business model of wireless internet Service Providers (ISPs). In this approach, the mutual authentication between a visited network and a roaming user can be performed locally without any control with user's home network. In conclusion, our protocol shown that communication delay can be reduced by overuse 45% overhead in communication delay than the previous AAA approach.