• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.11
• /
• pp.572-580
• /
• 2007

Wireless sensor networks are sensing, computing and communication infrastructures that allow us to monitor, instrument, observe, and respond to phenomena in the harsh environment. Generally, the wireless sensor networks are composed of many deployed sensor nodes that were designed to be very cost-efficient in terms of production cost. For example, UC Berkeley's MICA motes have only 8-bit CPU, 4KB RAM, and 128KB FLASH memory space. Therefore, sensor operating systems that run on the sensor nodes should be able to operate efficiently in terms of the resource management. In this paper, we present a dynamic threads stack management scheme for space-constrained and multi-threaded sensor operating systems. In this scheme, the necessary stack space of each function is measured on compile-time. Then, the information is used to dynamically allocate and release each function's stack space on run-time. It was implemented in Nano-Qplus sensor operating system. Our experimental results show that the proposed scheme outperforms the existing fixed-size stack allocation mechanism.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1510-1518
• /
• 2006

As a promising technology that enables ubiquitous computing and leads IT(information Technology) industries of next generation, the exciting new field of sensor networks is attracting so much attention and considered to be the one of the hottest research topics these days. From now on, all the each node, forming a network, and even the sensor network itself will interact with the generic network and evolve dynamically according to the change of environment with the perpetual creation and extinction. In this paper, we purpose the dynamic address interworking scheme for interactive networking between sensor network and Internet(IPv6). Proposed scheme is enable to interworking dynamically between sensor network address scheme based on Zigbee and Internet address scheme based on IP. Additionally, we implement the proposed address interworking scheme using Berkeley TinyOS, mica motes, and IP protocol. And, we verify the proposed scheme by the interconnection experimental between wireless sensor networks and Internet based on IPv4/IPv6.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1401-1406
• /
• 2006

Mobile Ad-hoc networks have recently attracted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on various of Ad-hoc in routing, we consider, in this paper, how to efficiently support applications such as variable Goocasting basd on Ad-hoc networks. The goal of a geocasting uotocol is deliver data packets to a group of nodes that are located within a specified geocasting region. Previous research that support geocast nice in mobilie computing based on Ad-hoc have the non-optimization problem of data delivery path, overhead by frequent reconstruction of the geocast tree, and service disruption problem. In this paper, we propose the mobility pattern based geocast technique using variable service range according to the nobility of destination node and resource reservation to solve this problem. The experimental results show that our proposed mechanism has improved performance of Connection & Network Overhead than previous research.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.2
• /
• pp.228-238
• /
• 2003

We believe that existing wire solutions such as HomePNA2.0 using phone lines and HomePlug using power line and wireless solution such as HomeRF are the most promising solutions, because of its cost-effectiveness. However, MAC protocols of these solutions provide only Class of Service(CoS) using priority mechanism like HomePNA and HomePlug or consider only voice among real-time traffics like HomeRF. For these reasons, we perceive the needs of the new MAC protocol which is no new wire solution and provides guaranteed Quality of Service (QoS) for not only voice but also video and audio. In light of this, we present the design and software implementation of a new MAC protocol for Home Networks. Our evaluation results of software implementation verify that proposed MAC protocol can provide low delay, low loss, and low jitter to real-time traffic by reserving bandwidth.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.911-916
• /
• 2016

The nearest-neighbor multihop routing with/without infrastructure support is known to achieve the optimal capacity scaling in a large packet-erasure network in which multiple wireless nodes and relay stations are regularly placed and packets are erased with a certain probability. In this paper, a throughput scaling law is shown for an infrastructure-supported erasure network where wireless nodes are randomly distributed, which is a more feasible scenario. We use an exponential decay model to suitably model an erasure probability. To achieve high throughput in hybrid random erasure networks, the multihop routing via highway using the percolation theory is proposed and the corresponding throughput scaling is derived. As a main result, the proposed percolation highway based routing scheme achieves the same throughput scaling as the nearest-neighbor multihop case in hybrid regular erasure networks. That is, it is shown that no performance loss occurs even when nodes are randomly distributed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.7
• /
• pp.1465-1470
• /
• 2011

In this paper, we propose a new MAC protocol, namely DM-MMAC (Doze Mode Multi-Channel MAC) for ad hoe wireless networks which can utilize multiple channels effectively, thereby enhancing the network throughput considerably. Basically, the IEEE 802.11 specification allows for the use of multiple channels available at the physical layer, but its MAC protocol is designed only for a single channel with the fatal drawback, so called multi-channel hidden terminal problem in multi-channel environments. In this vein, several multi-channel MAC protocols have been proposed, but most of them demonstrate the performance problem that its throughput drastically decreases as the number of mobile hosts residing in a given network increases with small number of available channels. In this work, we tried to improve the performance of multi-channel MAC protocols in terms of network throughput as well as power saving effects by simplifying the channel assignment and channel capturing procedures and reducing the possibility of collisions between mobile hosts.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.1
• /
• pp.153-160
• /
• 2009

A hierarchical network between Mobile-WiMAX and WLAN systems is to make it possible to utilize wireless internet services including time sensitive applications such as VoIP, VOD, visual telephony etc. During the process of vertical handoff decision from Mobile-WiMAX to WLAN hotspot, vertical handoff delay causes user dissatisfaction because it doesn't provide the seamless wireless internet service. We make use of type of service (ToS) parameters in IEEE 802.16e specification as the criterion parameter of vertical handoff decision process in hierarchical Mobile-WiMAX/WLAN networks. In this paper, we propose the process of vertical handoff decision for seamless wireless internet service which is sensitive to time delay. If type of service is time sensitive application, the decision of vertical handoff is withdrawn until the service is terminated. In focus on user satisfaction, if the proposed traffic management strategy in hierarchical Mobile-WiMAX/WLAN networks is used, user will utilize seamless wireless internet services including time sensitive applications.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.2
• /
• pp.495-502
• /
• 2013

In the mobile Ad hoc Network(MANET), improving technique for management and control of topology is recognized as an important part of the next generation network. In this paper, we proposed an efficient node life time management of ATICC(Adaptive Time Interval Clustering Control) in Ad-hoc Networks. Ad-hoc Network is a self-configuration network or wireless multi-hop network based on inference topology. This is a method of path routing management node for increasing the network life time through the periodical route alternation. The proposed ATICC algorithm is time interval control technique depended on the use of the battery energy while node management considering the attribute of node and network routing. This can reduce the network traffic of nodes consume energy cost effectively. As a result, it could be improving the network life time by using timing control method in ad-hoc networks.

• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.23-28
• /
• 2006

In this paper, a power-aware query processing using optimized distributed R-tree in a sensor network is proposed. The proposed technique is a new approach for processing range queries that uses spatial indexing. Range queries are most often encountered under sensor networks for computing aggregation values. The previous work just addressed the importance but didn't provide any efficient technique for processing range queries. A query processing scheme is thus designed for efficiently processing them. Each node in the sensor network has the MBR of the region where its children nodes and the node itself are located. The range query is evaluated over the region which intersects the geographic location of sensors. It ensures the maximum power savings by avoiding the communication of nodes not participating over the evaluation of the query.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.5
• /
• pp.209-216
• /
• 2013

In traditional social network analysis, the betweenness centrality measure has been heavily used to identify the relative importance of nodes in terms of message delivery. Since the time complexity to calculate the betweenness centrality is very high, however, it is difficult to get it of each node in large-scale social network where there are so many nodes and edges. In this paper, we define a new type of network, called the expanded ego network, which is built only with each node's local information, i.e., neighbor information of the node's neighbor nodes, and also define a new measure, called the expended ego betweenness centrality. Through the intensive experiment with Barab$\acute{a}$si-Albert network model to generate the scale-free networks which most social networks have as their embedded feature, we also show that the nodes' importance rank based on the expanded ego betweenness centrality has high similarity with that based on the traditional betweenness centrality.