• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.113-115
• /
• 2015

In this paper, we proposed an algorithm based on movement prediction using rate of change of the attribute information of nodes what is called WRC(Weighted Rate Control) in delay tolerant networks(DTNs). Existing DTN routing algorithms based on movement prediction communicate by selecting relay nodes increasing connectivity with destination node. Thus, because the mobile nodes are in flux, the prediction algorithms that do not reflect the newest attribute information of node decrease reliability. In this paper, proposed algorithm approximate speed and direction of attribute information of node and analysis rate of change of attribute information of node. Then, it predict movement path of node using proposed weight. As the result, proposed algorithm show that network overhead and transmission delay time decreased by predicting movement path of node.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.5
• /
• pp.1125-1130
• /
• 2015

In this paper, a method to identify components per unit task system is expressed with node, module, and interface. We define security subject per unit task system and explain node, module, and interface per component. According to the defined security standard in design phase, we also perform to design and elaborate security attributes for node and module as identified security subjects in their defined tables. And then we describe the composition standard for security attribute design with some examples, after classifying it into security subject, access subject, access control area, identification or verification area, and encryption.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.623-624
• /
• 2008

Overlay Multicast Routing Algorithm operates flexibly according to the various limited condition and environment of the MANET. Because of this Algorithm have maintenance and transmission of the network to use virtual Overlay ID. This paper proposes the method to give node ID considering attribute of node. If it uses ID considering attribute of node, it will improve routing speed.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.4
• /
• pp.95-102
• /
• 2007

Recently, a lot of researchers focus on the sensor middleware that hide the complexity of application developments and provide the abstraction of functions to upper application layer. Although there we several factors to design sensor middleware, the attribute-based naming is considered to be an essential factor among them. However, most existing researches were not designed to reflect the characteristics of sensor networks and have the limitation of attribute-based query extension. This study adopts the concept of Virtual Counterpart to suggest the structure there attribute-based naming is supported by virtual sensor nodes of the middleware on the sink node. Unlike traditional data-centric middleware in which individual sensor nodes process attribute-based query, virtual sensor nodes mapped to physical sensor nodes are running on the middleware of the sink node and process attribute-based query as a proxy of the physical sensor. This approach enables attribute-based naming independent of physical infrastructure and easy extensibility.

• 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.10 no.11
• /
• pp.5229-5252
• /
• 2016

With proliferation of diverse network access technologies, users demands are also increasing and service providers are offering a Quality of Service (QoS) to satisfy their customers. In roaming, a mobile node (MN) traverses number of available networks in the heterogeneous wireless networks environment and a single operator is not capable to fulfill the demands of user. It is crucial task for MN for selecting a best network from the list of networks at any time anywhere. A MN undergoes a network selection situation frequently when it is becoming away from the home network. Multiple Attribute Group Decision (MAGD) method will be one of the best ways for selecting target network in heterogeneous wireless networks (4G). MAGD network selection process is predominantly dependent on two steps, i.e., attribute weight, decision maker's (DM's) weight and aggregation of opinion of DMs. This paper proposes Multi-Attribute Intuitionistic Fuzzy Group Decision Method (MAIFGDM) using TOPSIS for the selection of the suitable candidate network. It is scalable and is able to handle any number of networks with large set of attributes. This is a method of lower complexity and is useful for real time applications. It gives more accurate result because it uses Intuitionistic Fuzzy Sets (IFS) with an additional parameter intuitionistic fuzzy index or hesitant degree. MAIFGDM is simulated in MATLAB for its evaluation. A comparative study of MAIFDGM is also made with TOPSIS and Fuzzy-TOPSIS in respect to decision delay. It is observed that MAIFDGM have low values of decision time in comparison to TOPSIS and Fuzzy-TOPSIS methods.

• Spatial Information Research
• /
• v.2 no.2
• /
• pp.147-163
• /
• 1994

This paper presents three methods of generating the transportation network data out of the topological geographic database in the hope that the conversion of the geographic database file containing the topology to the conventional node-link type trans¬portation network file may facilitate the integration between transportation planning mod¬els and GIS by alleviating the inherent problems of both computing environments. One way of the proposed conversion method is to use the conversion software that allows the bi-directional conversion between the UTPS (Urban Transportation Planning System) type transportation planning model and GIS. The other two methods of data structure conversion approach directly transform the GIS's user-level topology into the transportation network data topology, and have been introduced with codes programmed with FORTRAN and AML (Arc Macro Language) of ARC/INFO. If used successfully, any approach would not only improve the efficiency of transportation planning process and the associated decision-making activities in it, but enhance the productivity of trans¬portation planning agencies.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.5
• /
• pp.83-91
• /
• 2008

IISO/IEC 9594-8 defines the public key framework and attribute certificate framework. Attribute certificate framework deals with privilege management infrastructure(PMI). In PMI, for privilege management using attribute certificates, role assignment certificates and role specification certificates are used to assign and specify privileges independently. Role specification certificates includes privilege specifications and the details far privilege management of network environments. Privilege management of unreliable network environment tries to enhance the reliability and efficiency of privilege information transmission forwarding over unreliable routes in the presence of potentially faulty nodes and edges. Each node forms a role specification tree based on role specification relationship data collected from the network. In this paper privilege management cost with the role specification certificates tree structure is evaluated trying to reduce the overhead incurred by role creation and modification of privileges. The multicasting of packets are used for scalability. We establish management cost model taking into account the packet loss and node reliability which continuously join and leave for network. We present quantitative results which demonstrate the effectiveness of the proposed privilege management scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.1
• /
• pp.5-24
• /
• 2010

Data fusion is an attractive technology because it allows various trade-offs related to performance metrics, e.g., energy, latency, accuracy, fault-tolerance and security in wireless sensor networks (WSNs). Under a complicated environment, each sensor node must be equipped with more than one type of sensor module to monitor multi-targets, so that the complexity for the fusion process is increased due to the existence of various physical attributes. In this paper, we first investigate the process and performance of multi-attribute fusion in data gathering of WSNs, and then propose a self-adaptive threshold method to balance the different change rates of each attributive data. Furthermore, we present a method to measure the energy-conservation efficiency of multi-attribute fusion. Based on our proposed methods, we design a novel energy equilibrium routing method for WSNs, viz., multi-attribute fusion tree (MAFT). Simulation results demonstrate that MAFT achieves very good performance in terms of the network lifetime.

• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.862-865
• /
• 2018

The proposed scheme minimizes the Idle time under the residual energy of the sensor node to adjust the Sleep-Wakeup period and minimize unnecessary energy consumption. It is The proposed scheme minimizes the Idle time under the residual energy of the sensor node to adjust the Sleep-Wakeup period and minimize unnecessary energy consumption. It is an important process to control the Application Packet Framework including the PHY and the MAC layer at each node's Idle time with the Idle time mechanism state before the proposed function is executed. The Current Control Level of the Report Attribute is fixed at one sending / receiving node where power consumption can occur, by changing Sleep-Wakeup time, the low power consumption efficiency was improved while satisfying the transmission requirement of the given delay time constraint.