• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.2
• /
• pp.410-415
• /
• 2007

Recent advances in sensor network technology have open up challenges for its effective routing. Routing protocol receives most of the attention because routing protocols might differ depending on the application and network architecture. In the rapidly changing environment and dynamic nature of network formation efficient routing and energy consumption are very crucial. Sensor networks differ from the traditional networks in terms of energy consumption. Thus, data-centric technologies should be used to perform routing to yield an energy-efficient dissemination. By exploiting the advantages of both ant colony optimization techniques in network routing and the ability of data centric muting to organize data for delivery, our approach will cover features for building an efficient autonomous sensor network.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.2
• /
• pp.81-94
• /
• 1999

ATM network design procedure is different from the current circuit or packet networks design procedure because of the variety of the offered services and the variability of requested bandwidth for each connection of ATM network. A number of optimization models for the link dimensioning of ATM network design have been proposed in the literature. However, most of the literature did not consider the modularity of resources allocated to a transmission path and the non-bifurcation of a VP link over the more than one TP, which are standardized in recent ITU-T Recommendations. In thIs paper, we propose a mathematical model for link dimensioning of ATM networks, based on the network synthesis method and a generalized bin-packing problem. The suggested model satisfies the constraints mentioned in the ITU-T Recommendations. We also propose efficient and practical algorithms for the suggested model. Computational experiment shows that the suggested algorithm gives efficient solutions even for moderate and large-sized networks within reasonable time.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.136-141
• /
• 2007

The frequency accuracy and phase alignment is necessary for ensuring the quality of service (QoS) for applications such as voice, real-time video, wireless hand-off, and data over a converged access medium at the telecom network. As telecom networks evolve from circuit to packet switching, proper synchronization algorithm should be meditated for IP networks to achieve performance quality comparable to that of legacy circuit-switched networks. The Time of Packet (ToP) specified in IEEE 1588 is able to synchronize distributed clocks with an accuracy of less than one microsecond in packet networks. But, The ToP can be affected by impairments of a network such as packet delay variation. This paper proposes the efficient method to minimize the expectable delay variation when ToP synchronizes the distributed clocks. The simulation results are presented to demonstrate the improved performance case when the efficient ToP transmit algorithm is applied.

• Journal of Information Processing Systems
• /
• v.14 no.2
• /
• pp.396-417
• /
• 2018

GR-tree and query aggregation techniques have been proposed for spatial query processing in conventional spatial query processing for wireless sensor networks. Although these spatial query processing techniques consider spatial query optimization, time query optimization is not taken into consideration. The index reorganization cost and communication cost for the parent sensor nodes increase the energy consumption that is required to ensure the most efficient operation in the wireless sensor node. This paper proposes itinerary-based R-tree (IR-tree) for more efficient spatial-temporal query processing in wireless sensor networks. This paper analyzes the performance of previous studies and IR-tree, which are the conventional spatial query processing techniques, with regard to the accuracy, energy consumption, and query processing time of the query results using the wireless sensor data with Uniform, Gauss, and Skew distributions. This paper proves the superiority of the proposed IR-tree-based space-time indexing.

• Journal of Information Processing Systems
• /
• v.6 no.3
• /
• pp.295-306
• /
• 2010

Network lifetime is a critical issue in Wireless Sensor Networks (WSNs). In which, a large number of sensor nodes communicate together to perform a predetermined sensing task. In such networks, the network life time depends mainly on the lifetime of the sensor nodes constituting the network. Therefore, it is essential to balance the energy consumption among all sensor nodes to ensure the network connectivity. In this paper, we propose an energy-efficient data routing protocol for wireless sensor networks. Contrary to the protocol proposed in [6], that always selects the path with minimum hop count to the base station, our proposed routing protocol may choose a longer path that will provide better distribution of the energy consumption among the sensor nodes. Simulation results indicate clearly that compared to the routing protocol proposed in [6], our proposed protocol evenly distributes the energy consumption among the network nodes thus maximizing the network life time.

• Journal of the Korea Society for Simulation
• /
• v.14 no.4
• /
• pp.95-106
• /
• 2005

Recent advances in wireless sensor networks have led to many routing protocols designed for energy-efficiency in wireless sensor networks. Despite that many routing protocols have been proposed in wireless sensor networks, a single routing protocol cannot be energy-efficient if the environment of the sensor network varies. This paper presents a fuzzy logic based Adaptive Routing (FAR) algorithm that provides energy-efficiency by dynamically changing protocols installed at the sensor nodes. The algorithm changes protocols based on the output of the fuzzy logic which is the fitness level of the protocols for the environment. A simulation is performed to show the usefulness of the proposed algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1237-1255
• /
• 2014

In wireless sensor networks (WSNs), hierarchical clustering is an efficient approach for lower energy consumption and extended network lifetime. In cluster-based multi-hop communications, a cluster head (CH) closer to the sink is loaded heavier than those CHs farther away from the sink. In order to balance the energy consumption among CHs, we development a novel cluster-based routing protocol for corona-structured wireless sensor networks. Based on the relaying traffic of each CH conveys, adequate radius for each corona can be determined through nearly balanced energy depletion analysis, which leads to balanced energy consumption among CHs. Simulation results demonstrate that our clustering approach effectively improves the network lifetime, residual energy and reduces the number of CH rotations in comparison with the MLCRA protocols.

• Journal of Semiconductor Engineering
• /
• v.1 no.1
• /
• pp.31-37
• /
• 2020

We present an approximate DRAM architecture for energy-efficient deep learning. Our key premise is that by bounding memory errors to non-critical information, we can significantly reduce DRAM refresh energy without compromising recognition accuracy of deep neural networks. To validate the key premise, we make extensive Monte-Carlo simulations for several well-known convolutional neural networks such as LeNet, ConvNet and AlexNet with the input of MINIST, CIFAR-10, and ImageNet, respectively. We assume that the highest-order 8-bits (in single precision) and 4-bits (in half precision) are protected from retention errors under the proposed architecture and then, randomly inject bit-errors to unprotected bits with various bit-error-rates. Here, recognition accuracies of the above convolutional neural networks are successfully maintained up to the 10^-5-order bit-error-rate. We simulate DRAM energy during inference of the above convolutional neural networks, where the proposed architecture shows the possibility of considerable energy saving up to 10 ~ 37.5% of total DRAM energy.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.63-74
• /
• 2012

Multicast data communication is an efficient communication scheme, especially inmulti-hop ad hoc networks where the media access control (MAC) layer is based on one-hop broadcast from one source to multiple receivers. Compared to unicast, multicast over a wireless channel should be able to deal with varying channel conditions of multiple users and user mobility to provide good quality to all users. IEEE 802.11 does not support reliable multicast owing to its inability to exchange request-to-send/clear-to-send and acknowledgement packets with multiple recipients. Thus, several MAC layer protocols have been proposed to provide reliable multicast. However, additional overhead is introduced, as a result, which degrades the system performance. In this paper, we propose an efficient wireless multicast MAC protocol with small control overhead required for reliable multicast in multi-hop wireless ad hoc networks. We present analytical formulations of the system throughput and delay associated with the overhead.

• Journal of information and communication convergence engineering
• /
• v.11 no.3
• /
• pp.173-178
• /
• 2013

To discover objects of interest in unstructured peer-to-peer networks, the peers rely on flooding query messages which create incredible network traffic. This article evaluates the performance of an unstructured Gnutella-like protocol over mobile ad-hoc networks and proposes modifications to improve its performance. This paper offers an enhanced mechanism for an unstructured Gnutella-like network with improved peer features to better meet the mobility requirement of ad-hoc networks. The proposed system introduces a novel caching optimization technique and enhanced ultrapeer selection scheme to make communication more efficient between peers and ultrapeers. The paper also describes an enhanced query mechanism for efficient searching by applying multiple walker random walks with a jump and replication technique. According to the simulation results, the proposed system yields better performance than Gnutella, XL-Gnutella, and random walk in terms of the query success rate, query response time, network load, and overhead.