• Journal of Information Processing Systems
• /
• 제12권1호
• /
• pp.57-72
• /
• 2016

To provide effective communication in the wireless mesh network (WMN), several algorithms have been proposed. Since the possibilities of numerous failures always exist during communication, resiliency has been proven to be an important aspect for WMN to recover from these failures. In general, resiliency is the diligence of the reliability and availability in network. Several types of resiliency based routing algorithms have been proposed (i.e., Resilient Multicast, ROMER, etc.). Resilient Multicast establishes a two-node disjoint path and ROMER uses a credit-based approach to provide resiliency in the network. However, these proposed approaches have some disadvantages in terms of network throughput and network congestion. Previously, the buffer based routing (BBR) approach has been proposed to overcome these disadvantages. We proved earlier that BBR is more efficient in regards to w.r.t throughput, network performance, and reliability. In this paper, we consider the node/link failure issues and analogous performance of BBR. For these items we have proposed a resilient packet transmission (RPT) algorithm as a remedy for BBR during these types of failures. We also share the comparative performance analysis of previous approaches as compared to our proposed approach. Network throughput, network congestion, and resiliency against node/link failure are particular performance metrics that are examined over different sized WMNs.

• ETRI Journal
• /
• 제39권2호
• /
• pp.275-283
• /
• 2017

A green technology for reducing energy consumption has become a critical factor in ICT industries. However, for the telecommunications sector in particular, most network elements are not usually optimized for power efficiency. Here, we propose a novel energy-efficient packet switching method for use in an IP network for reducing unnecessary energy consumption. As a green networking approach, we first classify the network nodes into either header or member nodes. The member nodes then put the routing-related module at layer 3 to sleep under the assumption that the layer in the OSI model can operate independently. The entire set of network nodes is then partitioned into clusters consisting of one header node and multiple member nodes. Then, only the header node in a cluster conducts IP routing and its member nodes conduct packet switching using a specially designed identifier, a tag. To investigate the impact of the proposed scheme, we conducted a number of simulations using well-known real network topologies and achieved a more energy- efficient performance than that achieved in previous studies.

• Journal of KIISE:Information Networking
• /
• 제41권4호
• /
• pp.186-191
• /
• 2014

Previous work only focuses on a maximization of network coding opportunity since it can reduce the number of packets in network system. However, it can make congestion in a relay node as each source node may transmit each packet with the maximum transmission rate based on the channel qualities. Therefore, in this paper, we propose CmNC (Congestion minimized Network Coding over unreliable wireless links) performing opportunistic network coding to guarantee the network coding gain with the consideration of the congestion and channel qualities. The relay node selects the best network code set based on the objective function for reducing the packet loss and congestion via a dynamic programming. With Qualnet simulations, we show CmNC is better up to 20% than the previous work.

• Journal of Communications and Networks
• /
• 제11권3호
• /
• pp.248-260
• /
• 2009

To connect a mobile ad hoc network (MANET) with an IP network and to carryout communication, ad hoc network node needs to be configured with unique IP adress. Dynamic host configuration protocol (DHCP) server autoconfigure nodes in wired networks. However, this cannot be applied to ad hoc network without introducing some changes in auto configuration mechanism, due to intrinsic properties (i.e., multi-hop, dynamic, and distributed nature) of the network. In this paper, we propose a scalable autoconfiguration scheme for MANETs with hierarchical topology consisting of leader and member nodes, by considering the global Internet connectivity with minimum overhead. In our proposed scheme, a joining node selects one of the pre-configured nodes for its duplicate address detection (DAD) operation. We reduce overhead and make our scheme scalable by eliminating the broadcast of DAD messages in the network. We also propose the group leader election algorithm, which takes into account the resources, density, and position information of a node to select a new leader. Our simulation results show that our proposed scheme is effective to reduce the overhead and is scalable. Also, it is shown that the proposed scheme provides an efficient method to heal the network after partitioning and merging by enhancing the role of bordering nodes in the group.

• Journal of the Institute of Electronics and Information Engineers
• /
• 제49권12호
• /
• pp.56-63
• /
• 2012

The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. Mobile sink node distribute energy consumption therefore network life time was increased than fixed sink node. The energy efficient is important matter in wireless body area network because energy resource was limited on sensor node. In this paper we proposed cluster topology algorithm for efficient data transmission in wireless body area network based mobile sink. The proposed algorithm show good performance under the advantage of grid routing protocol and TDMA scheduling that minimized overlap area on cluster and reduced amount of data on cluster header in error prone wireless sensor network based on mobile sink.

• Journal of Korea Spatial Information System Society
• /
• 제9권3호
• /
• pp.35-50
• /
• 2007

In a data centric sensor network, a sensor node to store data is determined by the measured data value of each sensor node. Therefore, if the same data occur frequently, the energy of the sensor node to store the data is exhausted quickly due to the concentration of loads. And if the sensor network is extended, the communication cost for storing data and processing queries is increased, since the length of the routing path for them is usually in the distance. However, the existing researches that generally focus on the efficient management of data storing can not solve these problems efficiently. In this paper, we propose a NUNS(Non-Uniform Network Split) method that can distribute loads of sensor nodes and decrease the communication cost caused by the sensor network extension. By dividing the sensor network into non-uniform partitions that have the minimum difference in the number of sensor nodes and the splitted area size and storing the data which is occurred in a partition at the sensor nodes within the partition, the NUNS can distribute loads of sensor nodes and decrease the communication cost efficiently. In addition, by dividing each partition into non-uniform zones that have the minimum difference in the splitted area size as many as the number of the sensor nodes in the partition and allocating each of them as the processing area of each sensor node, the NUNS can protect a specific sensor node from the load concentration and decrease the unnecessary routing cost.

• Journal of KIISE:Information Networking
• /
• 제32권1호
• /
• pp.100-109
• /
• 2005

A Mobile Ad-Hoc Network (MANET) supports a multi-hop wireless network without any prepared base station (BS). The MANET is capable of building a mobile network automatically without any help from DHCP servers for address allocation or routers to forward or route messages. Many routing protocols have been proposed for the MANET, but these specify the most optimized or shortest path from a source to a destination, and they assume that nodes are pre-configured before communication. To make up for this, address allocation algorithms, such as MANETConf [1] and prophet address allocation algorithm [2], have been proposed. Especially, MANETConf proposes address allocation algorithm with duplication address check. In this paper, we present a dynamic node configuration protocol based on 2-tierd hierarchical network architecture for mobile ad-hoc network, modified from [1]. Especially, it reduces the number of broadcast message exchange between nodes when a new node somes into a network, which lessens network overhead, remarkably. This protocol is based on two-tired structure, and it ensures address allocation with simple duplication address defection mechanism.

• The Journal of Engineering Research
• /
• 제8권1호
• /
• pp.97-106
• /
• 2006

Chord system, structured P2P system based on distributed hashed table, didn't consider the mobility of mobile device. Mobility of mobile node may cause performance falloff of both mobile node and P2P network. Not only Chord system but also the greater part of P2P system didn't consider the mobility of mobile node. Recently it is researched on mobility in P2P system. In this paper, it proposed the method of the supporting mobility in chord system. Mobile node joins to the P2P network through the stationary node meaning the parents node. Mobile node require or offer the service for the parents node.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국제학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.109-114
• /
• 1993

It is well known that neural networks can be used to diagnose multiple faults to some limited extent. In this work we present a Multiple Fault Diagnosis Method (MFDM) via neural network which can effectively diagnose multiple faults. To diagnose multiple fault, the proposed method finds the maximum value in the output nodes of the neural network and decreases the node value by changing the hidden node values. This method can find the other faults by computing again with the changed hidden node values. The effectiveness of this method is explored through a neural-network-based fault diagnosis case study of a fluidized catalytic cracking unit (FCCU).

• Journal of Contemporary Eastern Asia
• /
• 제14권2호
• /
• pp.87-96
• /
• 2015

Social media comprises a vast and consequential landscape that has been poorly mapped and understood. Hundreds of millions of people have eagerly moved many of the conversations and discussions that compose civil society into these services and platforms. There is a need to document and analyze these social spaces for many academic and commercial purposes. The Social Media Research Foundation has engaged a strategy to cultivate better research into the structure and dynamics of social media. The foundation is dedicated to the creation of open tools, open data, and open scholarship related to social media. It has implemented a free and open network collection, analysis, and visualization tool called NodeXL to facilitate social media network research. Using NodeXL a group of researchers has collectively authored a publicly available archive, called the NodeXL Graph Gallery, composed of network data sets and visualizations from users around the world. This site has enabled the aggregation of tens of thousands of network datasets and images. Use of the archive has led to scholarly research results that are based on the wide range and scope of social media data sets available.