• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1113-1135
• /
• 2018

Existing trust evaluation models for wireless sensor networks can accurately and objectively evaluate trust value of nodes, but the nodes' energy saving problem was ignored. Especially when there are a few malicious nodes in a network, the overall trust value calculation for all nodes would waste lots of energy. Beside that, the network failure caused by nodes death was also not considered. In this paper, we proposed a method for avoiding energy hole which applied trust evaluation models and a trust evaluation method based on information entropy, so as to achieve the purpose of improving nodes utilization. Simulation results show that the proposed method can effectively improve nodes utilization, and it has reasonable detection rate and lower false alert rate compared to other classical methods.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.72-75
• /
• 2004

In this paper, the task assignment strategy considering communication delay and the priority of distributed tasks is proposed for the real-time network system in order to maximize the utilization of the system. For the task assignment strategy, the relationship among priority of tasks in network nodes, the calculation time of each task, and the end-to-end response time including the network delay is formulated firstly. Then, the task assignment strategy using the genetic algorithm is proposed to optimize the utilization of the system considering the LCM(Least Common Multiple) period. The effectiveness of proposed strategy is proven by the simulation for estimating the performance such as the utilization and the response time of the system in case of changing the number of tasks and the number of network nodes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.522-541
• /
• 2016

Network virtualization provides an effective way to overcome the Internet ossification problem. As one of the main challenges in network virtualization, virtual network embedding refers to mapping multiple virtual networks onto a shared substrate network. However, existing heuristic embedding algorithms evaluate the embedding potential of the nodes simply by the product of different resource attributes, which would result in an unbalanced embedding. Furthermore, ignoring the hops of substrate paths that the virtual links would be mapped onto may restrict the ability of the substrate network to accept additional virtual network requests, and lead to low utilization rate of resource. In this paper, we introduce and extend five node attributes that quantify the embedding potential of the nodes from both the local and global views, and adopt the technique for order preference by similarity ideal solution (TOPSIS) to rank the nodes, aiming at balancing different node attributes to increase the utilization rate of resource. Moreover, we propose a novel two-stage virtual network embedding algorithm, which maps the virtual nodes onto the substrate nodes according to the node ranks, and adopts a shortest path-based algorithm to map the virtual links. Simulation results show that the new algorithm significantly increases the long-term average revenue, the long-term revenue to cost ratio and the acceptance ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.12
• /
• pp.3071-3095
• /
• 2013

Configuring optimization of wireless sensor networks, which can improve the network performance such as utilization efficiency and network lifetime with minimal energy, has received considerable attention in recent years. In this paper, a cross layer optimal approach is proposed for multi-source linear network and grid network under Rayleigh block-fading channels, which not only achieves an optimal utility but also guarantees the end-to-end reliability. Specifically, in this paper, we first strictly present the optimization method for optimal nodal number $N^*$, nodal placement $d^*$ and nodal transmission structure $p^*$ under constraints of minimum total energy consumption and minimum unit data transmitting energy consumption. Then, based on the facts that nodal energy consumption is higher for those nodes near the sink and those nodes far from the sink may have remaining energy, a cross layer optimal design is proposed to achieve balanced network energy consumption. The design adopts lower reliability requirement and shorter transmission distance for nodes near the sink, and adopts higher reliability requirement and farther transmission distance for nodes far from the sink, the solvability conditions is given as well. In the end, both the theoretical analysis and experimental results for performance evaluation show that the optimal design indeed can improve the network lifetime by 20-50%, network utility by 20% and guarantee desire level of reliability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.3
• /
• pp.562-565
• /
• 2017

In this letter, we consider a 7-step transmission procedure of a large number of machine nodes when they simultaneously request random access to transmit uplink data. We model the radio resource utilization of LTE systems, and analyze the overloaded resources. From the simulation results, we show that the resource of PDCCH becomes significantly overloaded as the number of machine nodes increases in a cell. To alleviate the overload of PDCCH, we allocate radio resource of PDSCH to PDCCH. The result shows that the resource utilization of PDCCH is improved.

• Journal of the Korea Society for Simulation
• /
• v.14 no.3
• /
• pp.33-42
• /
• 2005

One of the imminent problems to be solved within wireless sensor network is to balance out energy dissipation among deployed sensor nodes. In this paper, we present a transmission relay method of communications between BS (Base Station) and CHs (Cluster Heads) for balancing the energy consumption and extending the average lifetime of sensor nodes by the fuzzy logic application. The proposed method is designed based on LEACH protocol. The area deployed by sensor nodes is divided into two groups based on distance from BS to the nodes. RCH (Relay Cluster Head) relays transmissions from CH to BS if the CH is in the area far away from BS in order to reduce the energy consumption. RCH decides whether to relay the transmissions based on the threshold distance value that is obtained as a output of fuzzy logic system, Our simulation result shows that the application of fuzzy logic provides the better balancing of energy depletion and prolonged lifetime of the nodes.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.4
• /
• pp.121-127
• /
• 2011

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. Because super-nodes can share advertisements, we can guarantee physical locality utilization between a requestor and a target during any discovery process. To overcome a node failure, we propose a simple recovery mechanism. The simulation results demonstrate that MLH-Net can decrease discovery routing hops by 15% compared with JXTA and 66% compared with Chord.

• Journal of Information Processing Systems
• /
• v.17 no.6
• /
• pp.1097-1114
• /
• 2021

The primary objective of this work was to discover a solution for the survival of people in an emergency flood. The geographical information was obtained from remote sensing techniques. Through helpline numbers, people who are in need request support. Although, it cannot be ensured that all the people will acquire the facility. A proper link is required to communicate with people who are at risk in affected areas. Mobile sensor networks with field-programmable gate array (FPGA) self-configurable radios were deployed in damaged areas for communication. Ad-hoc networks do not have a centralized structure. All the mobile nodes deploy a temporary structure and they act as a base station. The mobile nodes are involved in searching the spectrum for channel utilization for better communication. FPGA-based techniques ensure seamless communication for the survivors. Timely help will increase the survival rate. The received signal strength is a vital factor for communication. Cognitive radio ensures channel utilization in an effective manner which results in better signal strength reception. Frequency band selection was carried out with the help of the GRA-MADM method. In this study, an analysis of signal strength for different mobile sensor nodes was performed. FPGA-based implementation showed enhanced outcomes compared to software-based algorithms.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.2
• /
• pp.134-144
• /
• 1996

In this paper, we propose a new access method, called the HG-tree, to support indexing and retrieval by image content in large image databases. Image content is represented by a point in a multidimensional feature space. The types of queries considered are the range query and the nearest-neighbor query, both in a multidimensional space. Our goals are twofold: increasing the storage utilization and decreasing the area covered by the directory regions of the index tree. The high storage utilization and the small directory area reduce the number of nodes that have to be touched during the query processing. The first goal is achieved by absorbing splitting if possible, and when splitting is necessary, converting two nodes to three. The second goal is achieved by maintaining the area occupied by the directory region minimally on the directory nodes. We note that there is a trade-off between the two design goals, but the HG-tree is so flexible that it can control the trade-off. We present the design of our access method and associated algorithms. In addition, we report the results of a series of tests, comparing the proposed access method with the buddy-tree, which is one of the most successful point access methods for a multidimensional space. The results show the superiority of our method.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.320-335
• /
• 2003

Location-Based Services(LBS) give rise to location-based queries of which results depend on the locations of moving objects. One of important applications of LBS is to examine tracks of continuously moving objects. Moving objects databases need to provide 3-dimensional indexing for efficiently processing range queries on the movement of continuously changing positions. An extension of the 2-dimensional R-tree to include time dimension shows low space utilization and poor search performance, because of high overlap of index nodes and their dead space. To solve these problems, we propose a new R-tree based indexing technique, namely TR-tree. To increase storage utilization, we assign more entries to the past node by using the unbalanced splitting policy. If two nodes are highly overlapped, these nodes are forcibly merged. It is the forced merging policy that reduces the dead space and the overlap of nodes. Since big line segments can also affect the overlap of index nodes to be increased, big line segments should be clipped by the clipping policy when splitting overfull nodes. The TR-tree outperforms the 3DR-tree and TB-tree in all experiments. Particularly, the storage utilization of the TR-tree is higher than the R-tree and R*-tree.