• Journal of the Korea Society of Computer and Information
• /
• v.25 no.4
• /
• pp.97-103
• /
• 2020

Wireless sensor networks collect and analyze sensing data in a variety of environments without human intervention. The sensor network changes its lifetime depending on routing protocols initially installed. In addition, it is difficult to modify the routing path during operating the network because sensors must consume a lot of energy resource. It is important to measure the network performance through simulation before building the sensor network into the real field. This paper proposes a WSN model for a low-energy adaptive clustering hierarchy protocol using DEVS kernel models. The proposed model is implemented with the sub models (i.e. broadcast model and controlled model) of the kernel model. Experimental results indicate that the broadcast model based WSN model showed lower CPU resource usage and higher message delivery than the broadcast model.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.527-530
• /
• 2010

WSN is composed of a lot of small sensors with the limited hardware resources. In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. Specially, in WSN environment, in which the administrator's intervention is restricted, the self-configuration capability is essential to establish a power-conservative WSN which provides broad sensing coverage and communication coverage. In this paper, we propose a communication coverage-aware cluster head election algorithm for Herearchical WSNs which consists of communication coverage-aware of the Base station is the cluster head node is elected and a clustering.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.61-64
• /
• 2007

MPLS networks architectures have been prevailed as scalable approach to provide quality of service in the Internet. Many researches have been mainly focused on scalability and multi-path calculation scheme for failure restoration. However, the MPLS network have an scalability problem about traffic, and the existing failure restoration methods are wasted resources, and it has the problem that loss of a packet by a lot of delay occurs in too. Therefore in this paper, we propose a H-MPLS (Hierachical-Multiprotocol Label Switching)network for rapidly failure restorations and effective management of network extended. The proposed H-MPLS Network apply LSP multi-path routing algorithm and consists of several MPLS. After comparing the performance among the existing failure restoration methods with various network models, we use NS simulator in order to analyze the performance. Finally, we present an improvement scheme of the efficiency and scalability.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.244-254
• /
• 2006

This paper presents an efficient hybrid technique to compact the trie indexing the huge forward table small enough to be stored into cache for speeding up IP lookup. It combines two techniques, an encoding scheme called bit-map and a controlled-prefix expanding scheme to replace slow memory search with few fast-memory accesses and computations. For compaction, the bit-map represents each index and child pointer with one bit respectively. For example, when one node denotes n bits, the bit-map gives a high compression rate by consumes $2^{n-1}$ bits for $2^n$ index and child link pointers branched out of the node. The controlled-prefix expanding scheme determines the number of address bits represented by all root node of each trie's level. At this time, controlled-prefix scheme use a dynamic programming technique to get a smallest trie memory size with given number of trie's level. This paper proposes standard that can choose suitable trie structure depending on memory size of system and the required IP lookup speed presenting optimal memory size and the lookup speed according to trie level number.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.230-236
• /
• 2007

This paper presents a resource management mechanism for the mesh networking in IEEE 802.15.3 High-rate WPAN. IEEE 802.15 TGS is standardizing the MAC and PHY for mese networking. This task group researches the mechanism that are extension of network coverage without increasing transmit power of receive sensitivity, and studies the enhanced reliability via route redundancy. In this paper we propose the distributed resource management scheme that is fairly using the channel resource in the piconet without centralized piconet coordinator. Each DEV reserves the channel time and broadcasts its information. This scheme has unfairness for later associated DEV because of preoccupation of earlier associated DEVs. This paper presents the method that fairly allocates the channel time in MAC layer. And we evaluate the performance enhancement using simple simulations.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.227-234
• /
• 2002

MPLS which integrates routing of layer 3 and switching of layer 2, enables support for fast forwarding, traffic engineering and virtual private network services. GSMP is open interface protocol between a label switch and a controller, and it provides connection, configuration, event, performance management and synchronization. In the GSMP open interface, the functions of network management can be located either in the controller or in the label switch. To simplify the label switch and enhance the efficiency of resources, we adopt the network management model, in which the SNMP agent is located in the controller and is interworked with the GSMP. We presented the interworking scenrios between the GSMP and the network management of MPLS. We implemented the controller to verify the realization of our adopted network management model, and measured the connection setup delay of the provisioned connection.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.4
• /
• pp.993-999
• /
• 2011

In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. Specially, in WSN environment, in which the administrator's intervention is restricted, the self-configuration capability is essential to establish a power-conservative WSN which provides broad sensing coverage and communication coverage. In this paper, we propose a communication coverage-aware cluster head election algorithm for Herearchical WSNs which consists of communication coverage-aware of the Base station is the cluster head node is elected and a clustering.

• Journal of KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.328-339
• /
• 2007

Conventional topology-based routing protocols are not suitable for inter-vehicular communication, where frequent route updates are necessary due to continuous and abrupt changes in network topology Position-based routing protocols are widely accepted to better serve their purpose in such a scenario as they do not require path discovery or maintenance. However they have to deal with the overhead of the location service and inaccurate position information. This paper proposes the MMFP (Multi-hop MAC Forwarding Protocol) for inter-vehicle communication that relies on reachability information collected from received packets in making a forwarding decision without path discovery. The MMFP is designed as an extension to the IEEE 802.11 MAC layer to ensure accuracy in its time-critical operations. This paper also presents some simulation results that demonstrate the superior performance of the MMFP over AODV in a realistic inter-vehicular communication.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1096-1101
• /
• 2004

By a tremendous expansion of Internet users, there's a number effects that cause the phenomenon of bottlenecked switching packets from routers. In order to tear down this problem, distributed system is applicable to almost every highly performed router systems. The main processor of distributed system, which manages routing table, commands IPC to delivering the forwarding table line processor that eases functionalities of the router. This makes the system having wired-speed forwarding function based on the hardware so that the performance of the network can be enhanced. Therefore, IPC, which assign a part of router, is necessary to exchange data smoothly and the constitution of IPC using Ethernet is widely adapted as a method for saving investment. In this paper, R-IPC mechanism improve the packet-processing rate over 10% through changed from defect of conventional Ethernet IPC, that is, 2 layer processing to TCP/IP or UDP/ IP into 1 layer processing for efficient packet forwarding.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.12
• /
• pp.247-255
• /
• 2011

Most existing clustering protocols have been aimed to provide balancing the residual energy of each node and maximizing life-time of wireless sensor networks. In this paper, we present the adaptive clustering strategy related to sink position for clustering protocols in wireless sensor networks. This protocol allows networks topology to be adaptive to the change of the sink position by using symmetrical clustering strategy that restricts the growth of clusters based on depth of the tree. In addition, it also guarantees each cluster the equal life-time, which may be extended compared with the existing clustering protocols. We evaluated the performance of our clustering scheme comparing to LEACH and EEUC, and observe that our protocol is observed to outperform existing protocols in terms of energy consumption and longevity of the network.