• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.3
• /
• pp.587-595
• /
• 2015

A by-pass path in wireless sensor networks is the alternative path which be able to forward data when a routing path is being broken. One reason of depleting energy is occurred by the path. The method for solving prior to addressed the problem is proposed. However, this method may deplete radio resource. The best path has advantage that network lifetime of sensor nodes is prolonged; on the contrary, in order to maintain the best path it have to share their information between the entire nodes. In this paper, we propose the best path searching algorithm in the distributed three dimensional sensor networks. Through the neighboring informations sharing in the proposed method, the proposed algorithm can decide the best k-path as well as the extension of network lifetime.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1931-1938
• /
• 2012

A by-pass path in wireless sensor networks is the alternative path which be able to forward data when a routing path is being broken. One reason of depleting energy is occurred by the path. The method for solving prior to addressed the problem is proposed. However, this method may deplete radio resource. The best path has advantage that network lifetime of sensor nodes is prolonged; on the contrary, in order to maintain the best path it have to share their information between the entire nodes. In this paper, we propose the best path searching algorithm in the distributed three dimensional sensor networks. Through the neighboring informations sharing in the proposed method, the proposed algorithm can decide the best k-path as well as the extension of network lifetime.

• Journal of Korean Society of Transportation
• /
• v.18 no.5
• /
• pp.99-107
• /
• 2000

Path-based assignment(PBA) is valuable to dynamic traffic control and routing in integrated ITS framework. As one of widely studied PBA a1gorithms, Gradient Projection(GP) a1gorithm typically fields rapid convergence to a neighborhood of an optimal solution. But once it comes near a solution, it tends to slow down. To overcome this problem, we develop more efficient path-based assignment algorithm by combining Conjugate Gradient method with GP algorithm. It determines more accurate moving direction near a solution in order to gain a significant advantage in speed of convergence. Also this algorithm is applied to the Sioux-Falls network and verified its efficiency. Then we demonstrate that this type of method is very useful in improving speed of convergence in the case of user equilibrium problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.3
• /
• pp.1204-1227
• /
• 2020

The tradeoff between energy conservation and traffic balancing is a dilemma problem in Wireless Sensor Networks (WSNs). By analyzing the intrinsic relationship between cluster properties and long distance transmission energy consumption, we characterize three node sets of the cluster as a theoretical foundation to enhance high performance of WSNs, and propose optimal solutions by introducing rendezvous and Mobile Elements (MEs) to optimize energy consumption for prolonging the lifetime of WSNs. First, we exploit an approximate method based on the transmission distance from the different node to an ME to select suboptimal Rendezvous Point (RP) on the trajectory for ME to collect data. Then, we define data transmission routing sequence and model rendezvous planning for the cluster. In order to achieve optimization of energy consumption, we specifically apply the economic theory called Diminishing Marginal Utility Rule (DMUR) and create the utility function with regard to energy to develop an adaptive energy consumption optimization framework to achieve energy efficiency for data collection. At last, Rendezvous Transmission Algorithm (RTA) is proposed to better tradeoff between energy conservation and traffic balancing. Furthermore, via collaborations among multiple MEs, we design Two-Orbit Back-Propagation Algorithm (TOBPA) which concurrently handles load imbalance phenomenon to improve the efficiency of data collection. The simulation results show that our solutions can improve energy efficiency of the whole network and reduce the energy consumption of sensor nodes, which in turn prolong the lifetime of WSNs.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.3
• /
• pp.25-33
• /
• 2007

The local governments of major cities in Korea are giving focus on public transportation to reduce congestion and improve accessibility in city areas. In this regards, the proper measurement of accessibility is now a key policy requirement for reorganizing the public transport network. Public transport routing problems, however, are considered to be highly complicated since a multi-mode travel generates different combinations of accessibility. While most of the previous research efforts on measuring transport accessibility are found at zone-levels, an alternative approach at a finer scale such as bus links and stops is presented in this study. We proposes a method to compute the optimal route choice of origin-destination pairs and measure the accessibility of the chosen modes combination based on topological configuration. The genetic algorithm is used for the computation of the journey paths, whereas the space syntax theory is used for the accessibility. This study used node-link data in GIS instead of axial lines which are manually drawn in space syntax. The resulting accessibilities of bus stops are calibrated by O-D survey data and the proposed process is tested on a CBD of Seoul.

• Journal of Korea Multimedia Society
• /
• v.6 no.6
• /
• pp.1034-1045
• /
• 2003

In this paper, we study a multicast transport technique for multimedia services of mobile hosts in wireless network environments. To reduce packet loss during hand-off, we propose a Pre-join scheme in overlapped area and a Buffering scheme in crossover routers. To support seamless service in real time multimedia application, these scheme use an optimal path routing which was provided in remote subscription scheme and a prediction scheme of host movements which was considered overlapped area. To evaluate the peformance of our scheme, we compare Bi-direction tunneling of mobile If, Remote subscription, and MoM by using NS-2. As a result, our scheme shows better performance in network overhead, packet loss and bandwidth's use than other schemes.

• 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.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.310-317
• /
• 2005

In opposition to conventional networks, mobile ad hoc networks usually do not offer trust about nodes or online access through certificate authorities or centralized servers. But, nodes in those systems need process that can search path as well as trust each other to exchange data in safety For these reasons, traditional security measures that require online trusted authorities or certificate storages are not well-suited for securing ad hoc networks. In this paper, I propose a secure and effective method to search the optimized path using profitable flooding techniques on certificate chains in MANETS(Mobile Ad hoc NETworks). This system includes not only using routing protocols that are generally broadcasting packets but also finding nodes securely and verifing the process through tiust relationships between nodes that are searched.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.2
• /
• pp.155-162
• /
• 2010

To ensure accurate measurements of wireless network performance, it should be collected real-time data which are transmitted between a large number of nodes in the actual network environment. Therefore, it is necessary to develop simulation tool for finding optimal network system design method such as media access control, routing technique, ad-hoc algorithm of node deployment while overcoming spatial and temporal constraints. Our research attempts to provide an improved architecture and design method of simulation tool for wireless network is an application of multi-threading technique in these issues. We finally show that usability of the proposed simulator by comparing results derived from same test environment in the wireless LAN model of our simulator and widely used network simulation package, NS-2.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7B
• /
• pp.677-685
• /
• 2009

There are a number of studies that propose transmission power control algorithms in wireless sensor networks. However, these algorithms have a lot of overhead in the initialization phase since a number of packets have to be transmitted to determine the optimal transmission power level. This paper proposes the transmission power control technique considering the shortest-path to minimize the hop-count without the occurrence of any power control messages. We applied the proposed technique on tree-based network component implemented on TinyOS. And we evaluated the performance including transmission energy and average network depth with 21 motes. Compared to before, the proposed technique reduces about 24.7% of the average electric current on transmitting. As a result of considering the shortest-path, the hop-count considering the shortest-path was about 41% less than a normal network.