Patents by Inventor Tatsuya Soneda
Tatsuya Soneda has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9912779Abstract: A selection device is selected from a first group in a first cluster. The node devices of the first group can communicate with a node device in a second cluster adjacent to the first cluster. The selection device performs transmission and reception of a report frame that reports an identifier of a node device included in the first group. The selection device selects from the first group a first relay device that relays a relay frame used for a communication between a node device in the first cluster and a node device in the second cluster. The first relay device determines anode device adjacent to the first relay device to be a second relay device that relays the relay frame to a node device in the second cluster.Type: GrantFiled: August 7, 2015Date of Patent: March 6, 2018Assignee: FUJITSU LIMITEDInventors: Tatsuya Soneda, Tetsu Yamamoto, Norihito Nishimoto, Tadashige Iwao
-
Patent number: 9699590Abstract: A wireless communication apparatus stores therein, in an associated manner, each piece of path information on a plurality of destinations and a use frequency of data communication that is performed by using the path information. When the wireless communication apparatus receives data whose send source is a first destination, the wireless communication apparatus specifies, on the basis of the use frequency, path information that is less frequently used from among the pieces of the stored path information. The wireless communication apparatus updates the specified path information to path information whose destination is the first destination.Type: GrantFiled: June 30, 2014Date of Patent: July 4, 2017Assignee: FUJITSU LIMITEDInventors: Yuichi Inao, Tatsuya Soneda, Makoto Kawatoko, Hidefumi Takaoka, Kenji Yamada
-
Patent number: 9648540Abstract: A node device includes: a communication unit to transmit a data frame containing frequency information and receive the data frame; a storage unit to store a table in which frame identification information and the frequency information are associated; and a control unit to: determine whether a destination of the received data frame is its own node device; determine whether the frame identification information of the received data frame is registered in the table; determine whether the number of transmission times is less than or equal to the number of transmission times corresponding to the frame identification information registered in the table; update the frequency information corresponding to the frame identification information registered in the table with the frequency information of the received data frame; and increase the number of transmission times, wherein the communication unit transmits the data frame for which the number of transmission times is increased.Type: GrantFiled: November 7, 2014Date of Patent: May 9, 2017Assignee: FUJITSU LIMITEDInventors: Kenji Maeda, Satoshi Esaka, Yoshiyuki Jufuku, Tatsuya Soneda, Kiyoshi Nakagawa, Taiji Kondo
-
Patent number: 9647931Abstract: A system includes first and second apparatuses configured to communicate with a server apparatus; and a third apparatus configured to transmit data to the first apparatus and record number of transfer of the data in the system, the data including information on a destination of the data and the number of transfer, wherein the first apparatus is configured to set the destination to the second apparatus and update the number of transfer, when receiving the data and not being allowed to communicate with the server apparatus, and transmit an updated data including information on the set destination and the updated number of transfer, to the third apparatus, and the third apparatus is configured to transmit the updated data to the second apparatus based on the set destination when the updated number of transfer is equal to or smaller than the recorded number of transfer when receiving the updated data.Type: GrantFiled: November 3, 2014Date of Patent: May 9, 2017Assignee: FUJITSU LIMITEDInventors: Satoshi Kuroki, Tatsuya Soneda, Hideki Nagino, Taiji Kondo
-
Patent number: 9614817Abstract: An apparatus includes a memory; and a processor coupled to the memory and configured to generate a first common key whose key value varies based on a first elapsed time when a notification of the first elapsed time after a start-up of another apparatus to which a data frame to be encrypted is to be transmitted has been made, generate a second common key whose key value varies based on a second elapsed time after a start-up of the apparatus when a notification of the first elapsed time has not been made, and encrypt the data frame by any one of the first common key and the second common key as a common key and transmit the encrypted data frame to the another apparatus.Type: GrantFiled: November 13, 2014Date of Patent: April 4, 2017Assignee: FUJITSU LIMITEDInventors: Nobuyasu Tabata, Koki Mie, Katsuhiko Yamatsu, Tatsuya Soneda, Taiji Kondo
-
Patent number: 9602386Abstract: First node stores completion information on second node that is adjacent to the first node, the completion information indicating whether or not a route between a target destination and the second node has been constructed using an address with a specified size; acquire a first address with the specified size that specifies the first node, and transmits to adjacent nodes the completion information on the first node indicating that the route between the target destination and the first node has been constructed using an address with a specified size, when the completion information on the second node has indicated that the route between the target destination and the second node has been constructed using the address with the specified size and when the first address has been acquired; and transmits a data frame by using the first address, when the completion information on the first node is transmitted.Type: GrantFiled: November 3, 2014Date of Patent: March 21, 2017Assignee: FUJITSU LIMITEDInventors: Yayoi Nomura, Kazuaki Sumi, Yasuhiro Kurogi, Takayuki Okamasu, Tatsuya Soneda, Taiji Kondo
-
Patent number: 9485705Abstract: A node transmits data based on a routing information table when receiving the data. The node determines whether a second candidate neighboring node of which flag information is true and to which the data has not yet been transmitted is present when the data transmission to a first candidate neighboring node fails. The node aborts retransmission of the data when no second candidate neighboring node of which the flag information is true and to which the data has not yet been transmitted is present.Type: GrantFiled: April 18, 2014Date of Patent: November 1, 2016Assignee: FUJITSU LIMITEDInventors: Tatsuya Soneda, Koki Mie, Katsuhiko Yamatsu, Yuji Higashihara
-
Patent number: 9450830Abstract: A node apparatus includes a TTL memory configured to store a TTL value for a first node apparatus in the cluster; a receiving unit configured to receive a first Hello packet including a first sequence number and a second Hello packet including a second sequence number that is incremented when the node apparatus transmits a Hello packet; a sequence number judging unit configured to judge whether a first sequence number and a second sequence number match each other; a TTL decrementing unit configured to perform a process to decrement the TTL value stored in the TTL memory, when the first sequence number and the second sequence number are identical according to a judgment; and a cluster information updating unit configured to separate the first node apparatus from the cluster, when the TTL value for the first node apparatus becomes equal to or smaller than a prescribed value.Type: GrantFiled: October 6, 2014Date of Patent: September 20, 2016Assignee: FUJITSU LIMITEDInventors: Tatsuya Soneda, Tetsu Yamamoto, Norihito Nishimoto, Tadashige Iwao
-
Patent number: 9450831Abstract: A node apparatus in a network including a plurality of node apparatuses includes: a cluster information memory configured to store apparatus identification information of node apparatus included in a first cluster including the node apparatus; a merge cluster node number determination unit configured to obtain the number of node apparatuses included in the second cluster based on information included in the hello packet upon receipt of a hello packet from one of adjacent node apparatuses included in a second cluster, and to determine whether a sum of the number of node apparatuses included in the first cluster and that of node apparatuses included in the second cluster is equal to or smaller than a maximum number of cluster nodes; and a cluster merge processing unit configured to merge the second cluster with the first cluster based on a result of the determination.Type: GrantFiled: October 6, 2014Date of Patent: September 20, 2016Assignee: FUJITSU LIMITEDInventors: Tatsuya Soneda, Tetsu Yamamoto, Norihito Nishimoto, Tadashige Iwao
-
Patent number: 9439128Abstract: A node device includes a transmitter, processor, and a receiver. The receiver receives a packet from an adjacent node device. The processor generates a cluster list and a first hello packet. The cluster list records device identification information of a node device included in a cluster. The cluster is a group of node devices for which route information is stored. The first hello packet reports the route information with cluster identification information of the cluster. The transmitter broadcasts the first hello packet. Upon receipt of, from a free-node device that does not belong to a cluster, a second hello packet that includes information that associates the cluster identification information with device identification information of the free-node device, the processor adds the device identification information of the free-node device to the cluster list until a number of node devices recorded in the cluster list reaches a threshold.Type: GrantFiled: April 7, 2014Date of Patent: September 6, 2016Assignee: FUJITSU LIMITEDInventors: Tatsuya Soneda, Tadashige Iwao, Tetsu Yamamoto, Norihito Nishimoto
-
Patent number: 9420517Abstract: A network includes node devices each storing a table that manages paths to plural gateway devices for connecting to another network. A node device generates a hello frame for specifying a main gateway device of the node device at a predetermined timing, and transmits the hello frame to adjacent node devices. The node device, upon receiving a hello frame from an adjacent node device operating as a first hop destination of a data frame destined for the main gateway device, determines whether quality of a path to the main gateway device is lowest among paths to the plural gateway devices, based on path quality information included in the hello frame. When the quality of a path to the main gateway device is lowest, the node device changes the main gateway device to a gateway device that is registered in the table and specified by information included in the hello frame.Type: GrantFiled: November 4, 2014Date of Patent: August 16, 2016Assignee: FUJITSU LIMITEDInventors: Norihito Nishimoto, Kensuke Kubo, Tatsuya Soneda, Yuichi Inao, Taiji Kondo
-
Publication number: 20150350374Abstract: A selection device is selected from a first group in a first cluster. The node devices of the first group can communicate with a node device in a second cluster adjacent to the first cluster. The selection device performs transmission and reception of a report frame that reports an identifier of a node device included in the first group. The selection device selects from the first group a first relay device that relays a relay frame used for a communication between a node device in the first cluster and a node device in the second cluster. The first relay device determines anode device adjacent to the first relay device to be a second relay device that relays the relay frame to a node device in the second cluster.Type: ApplicationFiled: August 7, 2015Publication date: December 3, 2015Inventors: Tatsuya Soneda, Tetsu Yamamoto, NORIHITO NISHIMOTO, Tadashige IWAO
-
Publication number: 20150215199Abstract: If destination information on a packet is not present in a routing table, a network device broadcasts, to adjacent nodes, a path request packet in which destination information on a packet is set. When the network device receives a path response packet associated with the path request packet from another node, the network device sends the packet after setting a send source node of the path response packet to the transfer destination. Furthermore, if the network device does not receive the path response packet, the network device sends, by using flooding, a packet in which the destination information on the packet is set.Type: ApplicationFiled: April 13, 2015Publication date: July 30, 2015Inventors: Kenji Yamada, Yuichi Inao, Tatsuya Soneda
-
Publication number: 20150139030Abstract: First node stores completion information on second node that is adjacent to the first node, the completion information indicating whether or not a route between a target destination and the second node has been constructed using an address with a specified size; acquire a first address with the specified size that specifies the first node, and transmits to adjacent nodes the completion information on the first node indicating that the route between the target destination and the first node has been constructed using an address with a specified size, when the completion information on the second node has indicated that the route between the target destination and the second node has been constructed using the address with the specified size and when the first address has been acquired; and transmits a data frame by using the first address, when the completion information on the first node is transmitted.Type: ApplicationFiled: November 3, 2014Publication date: May 21, 2015Inventors: Yayoi Nomura, Kazuaki SUMI, Yasuhiro Kurogi, TAKAYUKI OKAMASU, Tatsuya Soneda, Taiji Kondo
-
Publication number: 20150143104Abstract: An apparatus includes a memory; and a processor coupled to the memory and configured to generate a first common key whose key value varies based on a first elapsed time when a notification of the first elapsed time after a start-up of another apparatus to which a data frame to be encrypted is to be transmitted has been made, generate a second common key whose key value varies based on a second elapsed time after a start-up of the apparatus when a notification of the first elapsed time has not been made, and encrypt the data frame by any one of the first common key and the second common key as a common key and transmit the encrypted data frame to the another apparatus.Type: ApplicationFiled: November 13, 2014Publication date: May 21, 2015Applicant: FUJITSU LIMITEDInventors: Nobuyasu TABATA, Koki Mie, Katsuhiko Yamatsu, Tatsuya Soneda, Taiji Kondo
-
Publication number: 20150139237Abstract: A node device includes: a communication unit to transmit a data frame containing frequency information and receive the data frame; a storage unit to store a table in which frame identification information and the frequency information are associated; and a control unit to: determine whether a destination of the received data frame is its own node device; determine whether the frame identification information of the received data frame is registered in the table; determine whether the number of transmission times is less than or equal to the number of transmission times corresponding to the frame identification information registered in the table; update the frequency information corresponding to the frame identification information registered in the table with the frequency information of the received data frame; and increase the number of transmission times, wherein the communication unit transmits the data frame for which the number of transmission times is increased.Type: ApplicationFiled: November 7, 2014Publication date: May 21, 2015Applicant: FUJITSU LIMITEDInventors: Kenji MAEDA, Satoshi Esaka, Yoshiyuki Jufuku, Tatsuya Soneda, Kiyoshi Nakagawa, Taiji Kondo
-
Publication number: 20150134786Abstract: A system includes first and second apparatuses configured to communicate with a server apparatus; and a third apparatus configured to transmit data to the first apparatus and record number of transfer of the data in the system, the data including information on a destination of the data and the number of transfer, wherein the first apparatus is configured to set the destination to the second apparatus and update the number of transfer, when receiving the data and not being allowed to communicate with the server apparatus, and transmit an updated data including information on the set destination and the updated number of transfer, to the third apparatus, and the third apparatus is configured to transmit the updated data to the second apparatus based on the set destination when the updated number of transfer is equal to or smaller than the recorded number of transfer when receiving the updated data.Type: ApplicationFiled: November 3, 2014Publication date: May 14, 2015Inventors: Satoshi Kuroki, Tatsuya Soneda, Hideki Nagino, Taiji Kondo
-
Publication number: 20150131480Abstract: A network includes node devices each storing a table that manages paths to plural gateway devices for connecting to another network. A node device generates a hello frame for specifying a main gateway device of the node device at a predetermined timing, and transmits the hello frame to adjacent node devices. The node device, upon receiving a hello frame from an adjacent node device operating as a first hop destination of a data frame destined for the main gateway device, determines whether quality of a path to the main gateway device is lowest among paths to the plural gateway devices, based on path quality information included in the hello frame. When the quality of a path to the main gateway device is lowest, the node device changes the main gateway device to a gateway device that is registered in the table and specified by information included in the hello frame.Type: ApplicationFiled: November 4, 2014Publication date: May 14, 2015Applicant: FUJITSU LIMITEDInventors: Norihito Nishimoto, Kensuke Kubo, Tatsuya Soneda, Yuichi Inao, Taiji Kondo
-
Publication number: 20150023213Abstract: A node apparatus includes a TTL memory configured to store a TTL value for a first node apparatus in the cluster; a receiving unit configured to receive a first Hello packet including a first sequence number and a second Hello packet including a second sequence number that is incremented when the node apparatus transmits a Hello packet; a sequence number judging unit configured to judge whether a first sequence number and a second sequence number match each other; a TTL decrementing unit configured to perform a process to decrement the TTL value stored in the TTL memory, when the first sequence number and the second sequence number are identical according to a judgment; and a cluster information updating unit configured to separate the first node apparatus from the cluster, when the TTL value for the first node apparatus becomes equal to or smaller than a prescribed value.Type: ApplicationFiled: October 6, 2014Publication date: January 22, 2015Applicant: FUJITSU LIMITEDInventors: Tatsuya SONEDA, Tetsu YAMAMOTO, Norihito NISHIMOTO, Tadashige IWAO
-
Publication number: 20150023214Abstract: A node apparatus in a network including a plurality of node apparatuses includes: a cluster information memory configured to store apparatus identification information of node apparatus included in a first cluster including the node apparatus; a merge cluster node number determination unit configured to obtain the number of node apparatuses included in the second cluster based on information included in the hello packet upon receipt of a hello packet from one of adjacent node apparatuses included in a second cluster, and to determine whether a sum of the number of node apparatuses included in the first cluster and that of node apparatuses included in the second cluster is equal to or smaller than a maximum number of cluster nodes; and a cluster merge processing unit configured to merge the second cluster with the first cluster based on a result of the determination.Type: ApplicationFiled: October 6, 2014Publication date: January 22, 2015Applicant: FUJITSU LIMITEDInventors: Tatsuya SONEDA, Tetsu YAMAMOTO, Norihito NISHIMOTO, Tadashige IWAO