• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.1
• /
• pp.32-38
• /
• 2012

Each sensor node can know its location in several ways, if the node process the information based on its geographical position in sensor networks. In the localization scheme using GPS, there could be nodes that don't know their locations because the scheme requires line of sight to radio wave. Moreover, this scheme is high costly and consumes a lot of power. The localization scheme without GPS uses a sophisticated mathematical algorithm estimating location of sensor nodes that may be inaccurate. AHLoS(Ad Hoc Localization System) is a hybrid scheme using both GPS and location estimation algorithm. In AHLoS, the GPS node, which can receive its location from GPS, broadcasts its location to adjacent normal nodes which are not GPS devices. Normal nodes can estimate their location by using iterative triangulation algorithms if they receive at least three beacons which contain the position informations of neighbor nodes. But, there are some cases that a normal node receives less than two beacons by geographical conditions, network density, movements of nodes in sensor networks. We propose an indirect localization scheme for low-density sensor nodes which are difficult to receive directly at least three beacons from GPS nodes in wireless network.

• Journal of Korea Multimedia Society
• /
• v.12 no.9
• /
• pp.1297-1308
• /
• 2009

The life time of a wireless sensor network composed of numerous sensor nodes depend on ones of its sensor nodes. The energy efficiency operation of nodes, therefore, is one of the crucial factors to design the network. Researches based on the hierarchical network topology have been proposed and evolved in terms of energy efficiency. However, in existing researches, application layer data obtained from sensor nodes are not considered properly to compose cluster, including issue that nodes communicate with their cluster heads in TDMA scheduling. In this paper, we suggest an energy-efficient topology control scheme based on application layer data in wireless sensor networks. By using application layer data, sensor nodes form a section which is defined as the area of adjacent nodes that retain similar characteristics of application environments. These sections are further organized into clusters. We suggest an algorithm for selecting a cluster head as well as a way of scheduling to reduce the number of unnecessary transmissions from each node to its cluster head, which based on the degree and the duration of similarity between the node's data and its head's data in each cluster without seriously damaging the integrity of application data. The results show that the suggested scheme can save the energy of nodes and increase the life time of the entire network.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.535-542
• /
• 2005

This paper proposes an on-demand ad hoc routing protocol, Node Density Based Routing (NDBR), which enhances the routing performance applying a new method to establish alternate patlis. It is important to reserve alternate paths for the route from source to destination in mobile ad hoc networks that are susceptible to failure due to the movement or the power exhaustion of mobile nodes. NDBR aims to establish a route that contains more alternate paths toward the destination by involving intermediate nodes with relatively more adjacent nodes in a possible route, and introduces a new routing criterion called 'node density.' This approach can localize the effects of route failures, and reduce control traffic overhead and route reconfiguration time by enhancing the reachability to the destination node without source-initiated route re-discoveries at route failures. This paper describes the route setup procedure using node density and the route re-configuration procedures employing alternate path information at the intermediate nodes. We show the performance of our routing schemes through a series of simulations using the Network Simulator 2 (ns-2).

• Journal of Digital Convergence
• /
• v.13 no.7
• /
• pp.207-212
• /
• 2015

The sensor network that is component of the Internet of Things require a lot of research to select the best route to send information to the anchor node, to collect a number of environment and cost efficient for communication between the sensor life. On the sensor network in one of the components of IOT's environment, sensor nodes are an extension device with low power low capacity. For routing method for data transmission between the sensor nodes, the connection between the anchor and the node must be accurate with in adjacent areas relatively. Localization CA (Centroid Algorithm) is often used although an error frequently occurs. In this paper, we propose a range-free localization method between sensor nodes based on the Radical Line in order to solve this problem.

• Journal of Korea Multimedia Society
• /
• v.10 no.2
• /
• pp.269-277
• /
• 2007

Network clustering has been proposed to provide that sensor nodes minimize energy and maximize a network lifetime by configuring clusters, Although dynamic clustering brings extra overhead like as head changing, head advertisement, it may diminish the gain in energy consumption to report attribute tasks by using cluster heads. Therefore, this paper proposes a new routing algorithm which configures cluster to reduce the number of messages when establishing paths and reports to the sink by way of cluster heads when responding sens ing tasks. All sensor nodes only broadcast bitmap once and maintain a bitmap table expressed by bits, allowing them to reduce node energy and to prolong the network lifetime. After broadcasting, each node only updates the bitmap without propagation when the adjacent nodes broad cast same query messages, This mechanism makes nodes to have abundant paths. By modifying the query which requests sensing tasks, the size of cluster is designed dynamically, We try to divide cluster by considering the number of nodes. Then, all nodes in a certain cluster must report to the sub- sink node, The proposed routing protocol finds easily an appropriate path to report tasks and reduces the number of required messages for the routing establishment, which sensor nodes minimize energy and maximize a network lifetime.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.6
• /
• pp.2713-2719
• /
• 2012

According to increasing of various location-based services, distributed data stream processing techniques have been widely studied to provide high scalability and availability. In previous researches, in order to balance the load of distributed nodes, the geographic characteristics of spatial data stream are not considered. For this reason, distributed operations for adjacent spatial regions increases the overall system load. We propose a operation allocation scheme considering the characteristics of spatial operations to effectively processing spatial data stream in distributed computing environments. The proposed method presents the efficient share maximizing approach that preferentially distributes spatial operations sharing the common query regions to the same node in order to separate the adjacent spatial operations on overlapped regions.

• Journal of IKEEE
• /
• v.10 no.2 s.19
• /
• pp.123-127
• /
• 2006

An Ad-hoc network which is composed of mobile nodes only should be able to distribute the traffic load evenly to the network so that the network could utilize its resources effectively However, most of researches have been concentrated in channel establishment level, not in channel reestablishment level. In this paper, the existing AODV routing protocol has been modified and upgraded to disperse the traffic load more quickly A node which uses the modified AODV routing protocol proposed in this paper broadcasts a control message to adjacent nodes, which announces congestion around the node. In order to verify the performance improvement of the proposed protocol, simulation study has been carried out by using ns2 simulator.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3393-3412
• /
• 2017

As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.33 no.8
• /
• pp.819-825
• /
• 2009

An open frame structure is fastened by bolt joints for strength and shock attenuation. Therefore the full finite element model of an open frame structure should be properly modeled including bolt joints for strength analysis of the frames and joint assemblies which are operated under multi-loading conditions such as driving, drop, inertia and torsional loads. Then the joints and frames must satisfy the specified allowable strength constraints. Because the full finite element model has a large number of elements to perform strength analysis, a detailed fine bolt analysis seems to be very expensive. Therefore bolts of the full finite element model are approximately modeled by coupling method to constrain degree of freedoms between adjacent nodes. However, the coupling method can exaggerate stress results at the constrained nodes. Thus a detailed bolt analysis and a theoretical/experiential formula of bolts for a worst bolt joint are performed using reaction force applied both bolt and bolt joint. Finally, the results from the two methods are compared and discussed to verify the safety of the open frame structure.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.523-528
• /
• 2008

An open frame structure is fastened by bolt joints for strength and shock attenuation. Therefore the full finite element model of an open frame structure should be properly modeled including bolt joints for strength analysis of the frames and joint assemblies which are operated under multi-loading conditions such as driving, drop, inertia and torsional loads. Then the joints and frames must satisfy the specified allowable strength constraints. Because the full finite element model has a large number of elements to perform strength analysis, a detailed fine bolt analysis seems to be very expensive. Therefore bolts of the full finite element model are approximately modeled by constraints equations to constrain degree of freedoms between adjacent nodes. However, the constraints equation method can exaggerate stress results at the constrained nodes. Thus a detailed bolt analysis and a theoretical/experiential formula of bolts for a worst bolt joint are performed using reaction force applied both bolt and bolt joint. Finally, the results from the two methods are compared and discussed to verify the safety of the open frame structure.