• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2533-2540
• /
• 2013

In multihop cellular network environments, the mobility of nodes is a major obstacle to find a reliable routing path between a mobile node (MN) and the access node (AN). Therefore, in this paper, we propose a fast and reliable neighbor discovery protocol that enables the fast and reliable neighbor discovery by considering the node mobility in the multihop cellular network. The proposed neighbor discovery protocol inhibits the transmission of unnecessary control messages to quickly find a suitable neighbor node (NN) and performs a priority-based access control to transmit control messages without collision in the order of NN desirable to be selected. Simulation results show that the proposed neighbor discovery protocol can discover the NNs faster than the conventional scheme and select a more reliable relay node although the number of neighbor nodes increases and the node mobility increases.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.205-212
• /
• 2007

The ubiquitous sensor network consists of micro sensors with wireless communication capabilities. Compared to wired communication, wireless communication is more subject to eavesdropping as well as data variation and manipulation. Accordingly, there must be efforts to secure the information delivered over the sensor network. Providing security to the sensor network, however, requires additional energy consumption, which is an important issue since energy transformation is difficult to implement in a sensor network. This paper proposes a routing mechanism based on the energy-efficient cluster that features security functions capable of safely processing the data acquired from the sensor network. The proposed algorithm reduces energy consumption by fixing the clusters formed at the initial stage and using the pre-distribution scheme so that the cluster and node keys generated and exchanged at the initial stage are not re-generated or re-exchanged. Simulation experiments confirmed that the proposed approach reduces energy consumption compared to implementing security measures to the conventional cluster-based routing mechanism.

• Journal of the Korea Society for Simulation
• /
• v.16 no.2
• /
• pp.55-64
• /
• 2007

The sensor nodes on the sensor network transmit the reply for the queries of ADV(Advertisement) message from sink node, and the sink node presents the received information to users. To find the relevant sensor nodes, routing algorithms disseminates ADV messages to the whole network. Thus not only the relevant sensor nodes but also the irrelevant ones consume considerable amount of energy. To alleviate such kind of energy consumption, this thesis proposes a new routing algorithm and coins it Directed Messaging. It propagates ADV message only to the limited direction and changes the direction until the requested sensor node is found. In this way, Directed Messaging reduces unnecessary energy consumption and enhance the efficiency of the networks. Performance of the Directed Messaging algorithm is evaluated through simulation and compared with Directed Diffusion algorithm. Simulation results show that it has better performance than Directed Diffusion.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.32 no.2B
• /
• pp.93-101
• /
• 2012

HEC-ResSim, reservoir operation model, is applied to Seomjin river dam in order to establish a rational method for water supply and flood control by dam operation. In order to minimize downstream flood damage for Seomjin river basin and adjacent regions, reservoir routing is applied to several frequency flood events within the framework of rainy seasonal operation rule and then the characteristics change of hydrological behavior for the downstream of study area is investigated in depth. Its quantitative efficiency and estimation method is evaluated on the basis of the adjustment scheme of conservation water surface elevation for flood control and water secure; reservoir routing considering preliminary release and variable restricted water level; and its effect to water supply; and downstream flood-duration analysis.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.6
• /
• pp.571-576
• /
• 2013

Despite the development of the Internet, both in terms of technology and coverage, there are still remote areas and scenarios where connectivity is very difficult to achieve. Pocket Switched Network is a network paradigm that takes the advantage of human mobility to disseminate data. Factors such as mobility of nodes, link failures, discharged batteries, are among the challenges that may compromise connectivity in these networks. This paper presents a performance analysis of existing routing schemes for PSN in terms of delivery probability, overhead ratio, average latency and average residual energy when the number of nodes is increased. We seek to identify a scheme that maximizes data delivery while minimizing communication overhead and thus extending the network lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.144-153
• /
• 2010

Flooding based routing protocols are usually used to disseminate information in wireless sensor networks. Those approaches, however, require message retransmissions to all nodes and induce huge collision rate and high energy consumption. In this paper, HoGoP (Hop based Gossiping Protocol) in which all nodes consider the number of hops from sink node to them, and decide own gossiping probabilities, is introduced. A node can decide its gossiping probability according to the required average reception percentage and the number of parent nodes which is counted with the difference between its hop and neighbors' ones. Therefore the decision of gossiping probability for network topology is adaptive and this approach achieves higher message reception percentage with low message retransmission than the flooding scheme. Through simulation, we compare the proposed protocol with some previous ones and evaluate its performance in terms of average reception percentage, average forwarding percentage, and forwarding efficiency. In addition, average reception percentage is analyzed according to the application requirement.

• Journal of Digital Contents Society
• /
• v.14 no.1
• /
• pp.89-95
• /
• 2013

Many peer-to-peer (p2p) systems have been studied in distributed, ubiquitous computing environments. Distributed hash table (DHT)-based p2p systems can improve load-balancing even though locality utilization and user mobility are not guaranteed. We propose a mobile locality-based hierarchical p2p overlay network (MLH-Net) to address locality problems without any other services. MLH-Net utilizes mobility features in a mobile environment. MLH-Net is constructed as two layers, an upper layer formed with super-nodes and a lower layer formed with normal-nodes. The simulation results demonstrate that MLH-Net can decrease discovery routing hops by 13% compared with JXTA and 69% compared with Chord. It can decrease the discovery routing distance by 17% compared with JXTA and 83% compared with Chord depending on the environment.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.6
• /
• pp.81-92
• /
• 2014

In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1147-1158
• /
• 2006

Clustering algorithm is an essential element to implement a hierarchical routing protocol, especially for a large-scale wireless sensor network. In this paper, we propose a new type of energy-efficient clustering algorithm, which maximizes the physical distance between cluster head and gateway by a neighbor node discovery mechanism. Furthermore, a slave/master patching scheme is introduced as a useful means of further improving the energy-efficiency. It has been shown that the number of cluster heads can be reduced by as many as 21% as compared with the existing clustering algorithms.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.184-197
• /
• 2015

This paper builds on a recent method, chain routing with even energy consumption (CREEC), for designing a wireless sensor network with chain topology and for scheduling the communication to ensure even average energy consumption in the network. In here a new suboptimal design is proposed and compared with the CREEC design. The chain topology in CREEC is reconfigured after each group of n converge-casts with the goal of making the energy consumption along the new paths between the nodes in the chain as even as possible. The new method described in this paper designs a single near-optimal Hamiltonian circuit, used to obtain multiple chains having only the terminal nodes different at different converge-casts. The advantage of the new scheme is that for the whole life of the network most of the communication takes place between same pairs of nodes, therefore keeping topology reconfigurations at a minimum. The optimal scheduling of the communication between the network and base station in order to maximize network lifetime, given the chosen minimum length circuit, becomes a simple linear programming problem which needs to be solved only once, at the initialization stage. The maximum lifetime obtained when using any combination of chains is shown to be upper bounded by the solution of a suitable linear programming problem. The upper bounds show that the proposed method provides near-optimal solutions for several wireless sensor network parameter sets.