The Experts below are selected from a list of 9189 Experts worldwide ranked by ideXlab platform
Iwao Sasase - One of the best experts on this subject based on the ideXlab platform.
-
secure parent Node selection scheme in route construction to exclude attacking Nodes from rpl network
Asia-Pacific Conference on Communications, 2015Co-Authors: Kenji Iuchi, Takumi Matsunaga, Kentaroh Toyoda, Iwao SasaseAbstract:The IPv6 Routing Protocol for Low-power and Lossy networks (RPL) is a standard routing protocol to realize the Internet of Things (IoT). Since RPL is a tree-based topology network, an attacking Node may falsely claim its rank towards neighbor Nodes in order to be chosen as a parent of them and to collect more packets to tamper. In this paper, we propose a secure parent selection scheme so that each Child Node can select a legitimate Node as its parent. In the proposed scheme, each Node chooses a parent after excluding the best candidate if multiple parent candidates exist. Our scheme utilizes the fact that an attacking Node claims falsely a lower rank than that of a legitimate Nodes. We show that attacking Nodes have no merits to claim lower ranks than true ones in a secure parent Node selection scheme. By the computer simulation, we show that the proposed scheme reduces the total number of Child Nodes attached to attacking Nodes in comparison with the conventional RPL scheme.
-
APCC - Secure parent Node selection scheme in route construction to exclude attacking Nodes from RPL network
2015 21st Asia-Pacific Conference on Communications (APCC), 2015Co-Authors: Kenji Iuchi, Takumi Matsunaga, Kentaroh Toyoda, Iwao SasaseAbstract:The IPv6 Routing Protocol for Low-power and Lossy networks (RPL) is a standard routing protocol to realize the Internet of Things (IoT). Since RPL is a tree-based topology network, an attacking Node may falsely claim its rank towards neighbor Nodes in order to be chosen as a parent of them and to collect more packets to tamper. In this paper, we propose a secure parent selection scheme so that each Child Node can select a legitimate Node as its parent. In the proposed scheme, each Node chooses a parent after excluding the best candidate if multiple parent candidates exist. Our scheme utilizes the fact that an attacking Node claims falsely a lower rank than that of a legitimate Nodes. We show that attacking Nodes have no merits to claim lower ranks than true ones in a secure parent Node selection scheme. By the computer simulation, we show that the proposed scheme reduces the total number of Child Nodes attached to attacking Nodes in comparison with the conventional RPL scheme.
Sae-young Chung - One of the best experts on this subject based on the ideXlab platform.
-
Capacity of a Class of Multicast Tree Networks
arXiv: Information Theory, 2010Co-Authors: Si-hyeon Lee, Sae-young ChungAbstract:In this paper, we characterize the capacity of a new class of single-source multicast discrete memoryless relay networks having a tree topology in which the root Node is the source and each parent Node in the graph has at most one noisy Child Node and any number of noiseless Child Nodes. This class of multicast tree networks includes the class of diamond networks studied by Kang and Ulukus as a special case, where they showed that the capacity can be strictly lower than the cut-set bound. For achievablity, a novel coding scheme is constructed where each noisy relay employs a combination of decode-and-forward (DF) and compress-and-forward (CF) and each noiseless relay performs a random binning such that codebook constructions and relay operations are independent for each Node and do not depend on the network topology. For converse, a new technique of iteratively manipulating inequalities exploiting the tree topology is used.
-
ISIT - Capacity of a class of tree networks
2010 IEEE International Symposium on Information Theory, 2010Co-Authors: Si-hyeon Lee, Sae-young ChungAbstract:In this paper, we characterize the capacity of a class of single-source single-destination discrete memoryless relay networks with an arbitrary number of Nodes. In this class, the network is assumed to have a tree topology where the root Node is the source, each parent Node in the graph has at most one noisy Child Node and any number of noiseless Child Nodes, and the set of leaf Nodes is the destination. A combination of decode-and-forward (DF) and compress-and-forward (CF) at noisy relay Nodes is shown to be optimal. Our result is the first to show that the combination of DF and CF is capacity achieving for a non-trivial class of noisy networks with an arbitrary number of Nodes.
-
Capacity of a class of multicast tree networks
2010 48th Annual Allerton Conference on Communication Control and Computing (Allerton), 2010Co-Authors: Si-hyeon Lee, Sae-young ChungAbstract:We consider a class of single-source multicast discrete memoryless tree networks in which the root Node is the source, each parent Node in the graph has at most one noisy Child Node and any number of noiseless Child Nodes, and subsets of leaf Nodes are destinations. For this class of multicast tree networks, lower and upper bounds on the capacity are presented and these two bounds are shown to meet when each set of Nodes forming a destination is included in a disjoint subtree. Our result generalizes our previous work on the single-destination case, in which a combination of decode-forward (DF) and compress-forward (CF) at noisy relays is shown to be optimal. For generalization to multicast, we develop a robust coding scheme where codebook constructions and relay operations are independent for each Node and do not depend on the network topology.
Kenji Iuchi - One of the best experts on this subject based on the ideXlab platform.
-
secure parent Node selection scheme in route construction to exclude attacking Nodes from rpl network
Asia-Pacific Conference on Communications, 2015Co-Authors: Kenji Iuchi, Takumi Matsunaga, Kentaroh Toyoda, Iwao SasaseAbstract:The IPv6 Routing Protocol for Low-power and Lossy networks (RPL) is a standard routing protocol to realize the Internet of Things (IoT). Since RPL is a tree-based topology network, an attacking Node may falsely claim its rank towards neighbor Nodes in order to be chosen as a parent of them and to collect more packets to tamper. In this paper, we propose a secure parent selection scheme so that each Child Node can select a legitimate Node as its parent. In the proposed scheme, each Node chooses a parent after excluding the best candidate if multiple parent candidates exist. Our scheme utilizes the fact that an attacking Node claims falsely a lower rank than that of a legitimate Nodes. We show that attacking Nodes have no merits to claim lower ranks than true ones in a secure parent Node selection scheme. By the computer simulation, we show that the proposed scheme reduces the total number of Child Nodes attached to attacking Nodes in comparison with the conventional RPL scheme.
-
APCC - Secure parent Node selection scheme in route construction to exclude attacking Nodes from RPL network
2015 21st Asia-Pacific Conference on Communications (APCC), 2015Co-Authors: Kenji Iuchi, Takumi Matsunaga, Kentaroh Toyoda, Iwao SasaseAbstract:The IPv6 Routing Protocol for Low-power and Lossy networks (RPL) is a standard routing protocol to realize the Internet of Things (IoT). Since RPL is a tree-based topology network, an attacking Node may falsely claim its rank towards neighbor Nodes in order to be chosen as a parent of them and to collect more packets to tamper. In this paper, we propose a secure parent selection scheme so that each Child Node can select a legitimate Node as its parent. In the proposed scheme, each Node chooses a parent after excluding the best candidate if multiple parent candidates exist. Our scheme utilizes the fact that an attacking Node claims falsely a lower rank than that of a legitimate Nodes. We show that attacking Nodes have no merits to claim lower ranks than true ones in a secure parent Node selection scheme. By the computer simulation, we show that the proposed scheme reduces the total number of Child Nodes attached to attacking Nodes in comparison with the conventional RPL scheme.
Si-hyeon Lee - One of the best experts on this subject based on the ideXlab platform.
-
Capacity of a Class of Multicast Tree Networks
arXiv: Information Theory, 2010Co-Authors: Si-hyeon Lee, Sae-young ChungAbstract:In this paper, we characterize the capacity of a new class of single-source multicast discrete memoryless relay networks having a tree topology in which the root Node is the source and each parent Node in the graph has at most one noisy Child Node and any number of noiseless Child Nodes. This class of multicast tree networks includes the class of diamond networks studied by Kang and Ulukus as a special case, where they showed that the capacity can be strictly lower than the cut-set bound. For achievablity, a novel coding scheme is constructed where each noisy relay employs a combination of decode-and-forward (DF) and compress-and-forward (CF) and each noiseless relay performs a random binning such that codebook constructions and relay operations are independent for each Node and do not depend on the network topology. For converse, a new technique of iteratively manipulating inequalities exploiting the tree topology is used.
-
ISIT - Capacity of a class of tree networks
2010 IEEE International Symposium on Information Theory, 2010Co-Authors: Si-hyeon Lee, Sae-young ChungAbstract:In this paper, we characterize the capacity of a class of single-source single-destination discrete memoryless relay networks with an arbitrary number of Nodes. In this class, the network is assumed to have a tree topology where the root Node is the source, each parent Node in the graph has at most one noisy Child Node and any number of noiseless Child Nodes, and the set of leaf Nodes is the destination. A combination of decode-and-forward (DF) and compress-and-forward (CF) at noisy relay Nodes is shown to be optimal. Our result is the first to show that the combination of DF and CF is capacity achieving for a non-trivial class of noisy networks with an arbitrary number of Nodes.
-
Capacity of a class of multicast tree networks
2010 48th Annual Allerton Conference on Communication Control and Computing (Allerton), 2010Co-Authors: Si-hyeon Lee, Sae-young ChungAbstract:We consider a class of single-source multicast discrete memoryless tree networks in which the root Node is the source, each parent Node in the graph has at most one noisy Child Node and any number of noiseless Child Nodes, and subsets of leaf Nodes are destinations. For this class of multicast tree networks, lower and upper bounds on the capacity are presented and these two bounds are shown to meet when each set of Nodes forming a destination is included in a disjoint subtree. Our result generalizes our previous work on the single-destination case, in which a combination of decode-forward (DF) and compress-forward (CF) at noisy relays is shown to be optimal. For generalization to multicast, we develop a robust coding scheme where codebook constructions and relay operations are independent for each Node and do not depend on the network topology.
Makoto Takizawa - One of the best experts on this subject based on the ideXlab platform.
-
BWCCA - Data Exchange Algorithm at Aggregate Level in the TWTBFC Model
Lecture Notes in Networks and Systems, 2019Co-Authors: Yinzhe Guo, Shigenari Nakamura, Tomoya Enokido, Ryuji Oma, Makoto TakizawaAbstract:In the TBFC (Tree-Based Fog Computing) and TWTBFC (Two-Way TBFC) models the electric energy consumed by fog Nodes and servers can be reduced in the fog computing (FC) model. Here, fog Nodes are hierarchically structured in a height-balanced tree, where a root Node is a cloud of servers, leaf Nodes are edge Nodes which communicate with devices, and each Node receives data from Child Nodes and sends the processed data to a parent Node. In the TWTBFC model, Nodes send processed data to not only a parent Node but also each Child Node. In order to reduce the network traffic in the TWTBFC model, only aggregate Nodes at some level collect the output data of every other aggregate Node, i.e. aggregate data. Since only target actuators are to be activated, the aggregate data has to be only delivered to target actuators. Nodes whose descendant actuators are target ones are relay Nodes. On receipt of aggregate data, only relay Nodes forward the aggregate data to the Child Nodes. We evaluate the new TWTBFC model in terms of energy consumption of Nodes and number of messages transmitted to deliver aggregate data to edge Nodes.
-
NBiS - Evaluation of Data and Subprocess Transmission Strategies in the Tree-Based Fog Computing Model.
Advances in Networked-based Information Systems, 2019Co-Authors: Ryuji Oma, Shigenari Nakamura, Tomoya Enokido, Dilawaer Duolikun, Makoto TakizawaAbstract:In order to increase the performance of the IoT (Internet of Things), the fog computing model is proposed. Here, subprocesses of an application process to handle sensor data are performed on fog Nodes in addition to servers. In the TBFC (Tree-Based Fog Computing) model proposed in our previous studies, an application process to handle sensor data is assumed to be a sequence of subprocesses, i.e. linear model. At each level of a TBFC tree, a same subprocess is performed on every Node. In this paper, we consider a more general model, GTBFC (General TBFC) model of the IoT where subprocesses of an application process are structured in a tree. Each subprocess in the process tree is performed on fog Nodes which are at a same level in the GTBFC tree. Each leaf subprocess is performed on edge Nodes which communicate with sensor and actuator devices. We also proposed MEG (Minimum Energy in the GTBFC tree) and SMPRG (Selecting Multiple Parents for Recovery in the GTBFC tree) algorithms to select a new parent Node for a Child Node of a faulty Node in the GTBFC tree. In the evaluation, we show the energy consumption of Nodes in the SMPRG algorithm as 21\(\%\) and 31\(\%\) smaller than the MEG and RD (Random) algorithms.
-
INCoS - Data and Subprocess Transmission on the Edge Node of TWTBFC Model
Advances in Intelligent Networking and Collaborative Systems, 2019Co-Authors: Yinzhe Guo, Shigenari Nakamura, Tomoya Enokido, Ryuji Oma, Dilawaer Duolikun, Makoto TakizawaAbstract:In our previous studies, the TBFC (Tree-Based Fog Computing) model is proposed to reduce the electric energy consumed by fog Nodes and servers in the fog computing model. Here, fog Nodes are hierarchically structured in a height-balanced tree, where a root Node is a cloud of servers and leaf Nodes are edge Nodes which communicate with devices. Each Node receives data from Child Nodes and sends the processed data to a parent Node. In the TWTBFC (Two-Way TBFC) model, is Nodes send processed data not only to a parent Node but also to each Child Node. Then, edge Nodes make a decision on actions of their Child actuators. However, in addition to messages to be delivered to servers, more number of messages are transmitted to edge Nodes. In this paper, in order to reduce the number of messages which each fog Node sends to the Child Nodes, each Node only at some level of the tree collect output data of the other Nodes of the same level. The Nodes are referred to as aggregate Nodes. Then, each aggregate Node sends the collected data to the descendant edge Nodes. Each edge Node makes a decision or actions and send actions to the Child actuators by using the data.
-
AINA Workshops - Protocols for Energy-Efficiently Broadcasting Messages in Wireless Networks
2016 30th International Conference on Advanced Information Networking and Applications Workshops (WAINA), 2016Co-Authors: Miyu Sugino, Shigenari Nakamura, Tomoya Enokido, Makoto TakizawaAbstract:In order to realize the cooperation of a group of Nodes, messages have to be deleted to all the Nodes. In addition to reliably and efficiently delivering messages, the electric energy consumed by Nodes has to be reduced. In this paper, we discuss an energy-efficient broadcast protocol in wireless networks so that the total electric energy consumed by Nodes can be reduced. In our previous studies, types of broadcast protocols, EEB and EEB2 protocols are proposed. Here, each Node first selects first-neighbour Nodes as Child Nodes. In the EEB protocol, a farthest Child Node is truncated until there is no other Child Node which can energy-efficiently forward messages to the Node. A parent Node consumes more electric energy to send messages to farther Child Nodes. Hence, a farthest Child Node is truncated if the distance from the parent Node is longer in the EEB2 protocol. In this paper, we newly propose an augmented energy-efficient broadcast (AEEB) protocol. In the EEB and EEB2 protocols, a Child Node is selected for a parent Node. On the other hand, one parent Node is selected among possible parent Nodes of each Child Node, which is nearest to the Child Node in the AEEB protocol. We evaluate the AEEB protocol and show the total electric energy consumed by Nodes can be reduced.
-
NBiS - Energy-Efficient Broadcast Protocols in Wireless Network
2015 18th International Conference on Network-Based Information Systems, 2015Co-Authors: Miyu Sugino, Shigenari Nakamura, Tomoya Enokido, Makoto TakizawaAbstract:It is significant to deliver messages to every Node in a group to realize the cooperation of the Nodes in wireless networks. In order to reduce the number of messages in the flooding protocols, the multi-point relay (MPR) protocols are discussed where only relay Nodes forward messages and the other leaf Nodes do not forward messages. In this paper, we discuss broadcast protocols where the total electric energy consumed by Nodes to deliver messages to every Node can be reduced. We newly propose energy-efficient broadcast (EEB) protocol, modified EEB (EEB2) protocol, and augmented EEB (AEEB) protocol. In the EEB protocol, a first-neighbour Node to which another first-neighbour Node cannot more energy-efficiently deliver messages is selected as a Child Node of a relay Node. In the EEB2 protocol, Child Nodes are first selected for a relay Node in the same way as the EEB protocol. In addition, a farthest Child Node steps down to a lower level to reduce the electric energy of the relay Nodes. In the AEEB protocol, for each uncovered Node pi which is a first-neighbour Node of the Nodes of level l, a Node pj of the level l is selected as a parent Node of the Node pi if the electric energy consumed by the Node pj to deliver a message to the Node pi is the smallest. We evaluate the EEB and EEB2 protocols and show the total electric energy consumed by Nodes can be reduced.