会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Wireless communication apparatus
    • 无线通信装置
    • US08483117B2
    • 2013-07-09
    • US12801419
    • 2010-06-08
    • Yuki KuboKentarou YanagiharaHiroshi NishimuraMasanori Nozaki
    • Yuki KuboKentarou YanagiharaHiroshi NishimuraMasanori Nozaki
    • H04J3/08
    • H04W40/30H04L45/34
    • A packet is transmitted from a source node to a destination node via a relay path in a multi-hop network. The packet is transmitted by cache routing or source routing, depending on the presence or absence of information identifying the destination node in a history table maintained at the source node. In source routing, relay path information is included in the packet. In cache routing, relay nodes obtain routing information from entries in their own cache routing tables. Each entry indicates only the destination node and the next relay node, and each cache routing table has a limited size. When a series of packets are transmitted to the second node, cache routing can be used for all but the first packet, thereby reducing packet overhead.
    • 经由多跳网络中的中继路径,从源节点向目的地节点发送分组。 该数据包是通过高速缓存路由或源路由发送的,具体取决于在源节点上维护的历史表中是否存在标识目标节点的信息。 在源路由中,包中包含中继路径信息。 在缓存路​​由中,中继节点从自己的缓存路由表中的条目获取路由信息。 每个条目仅指示目的地节点和下一个中继节点,并且每个高速缓存路由表具有有限的大小。 当一系列数据包被发送到第二个节点时,除了第一个数据包之外,高速缓存路由可以被用于所有数据包,从而减少数据包开销。
    • 3. 发明申请
    • Wireless communication system and nodes
    • 无线通信系统和节点
    • US20110235504A1
    • 2011-09-29
    • US12926886
    • 2010-12-15
    • Masanori NozakiKentarou YanagiharaHiroshi NishimuraYuki Kubo
    • Masanori NozakiKentarou YanagiharaHiroshi NishimuraYuki Kubo
    • H04W24/00H04W40/00
    • H04W40/30H04L45/04H04W28/06H04W88/04
    • A wireless communication system includes a first node, multiple second nodes, and multiple third nodes that communicate with the first node through the second nodes. The second and third nodes transmit control information to their neighboring third nodes, which calculate link costs from the reception status of the control information. The control information transmitted by each node includes a path cost indicating the cost of a path between the transmitting node and the first node. From the path costs in received control information, each third node selects a second node through which to communicate with the first node, and selects a parent node as the destination of the first hop on the path through the selected second node to the first node. Routing is thereby accomplished autonomously without having the second nodes flood the system with routing requests.
    • 无线通信系统包括通过第二节点与第一节点通信的第一节点,多个第二节点和多个第三节点。 第二节点和第三节点将控制信息发送到其相邻的第三节点,其根据控制信息的接收状态计算链路成本。 由每个节点发送的控制信息包括指示发送节点和第一节点之间的路径的开销的路径开销。 从所接收的控制信息的路径成本中,每个第三节点选择通过其与第一节点通信的第二节点,并且通过所选择的第二节点选择父节点作为通过所选择的第二节点到第一节点的路径上的第一跳的目的地。 从而自动完成路由,而不需要第二个节点将路由请求泛滥。
    • 5. 发明申请
    • Wireless communication apparatus
    • 无线通信装置
    • US20110051652A1
    • 2011-03-03
    • US12801419
    • 2010-06-08
    • Yuki KuboKentarou YanagiharaHiroshi NishimuraMasanori Nozaki
    • Yuki KuboKentarou YanagiharaHiroshi NishimuraMasanori Nozaki
    • H04W40/00H04L12/56
    • H04W40/30H04L45/34
    • A packet is transmitted from a source node to a destination node via a relay path in a multi-hop network. The packet is transmitted by cache routing or source routing, depending on the presence or absence of information identifying the destination node in a history table maintained at the source node. In source routing, relay path information is included in the packet. In cache routing, relay nodes obtain routing information from entries in their own cache routing tables. Each entry indicates only the destination node and the next relay node, and each cache routing table has a limited size. When a series of packets are transmitted to the second node, cache routing can be used for all but the first packet, thereby reducing packet overhead.
    • 经由多跳网络中的中继路径,从源节点向目的地节点发送分组。 该数据包是通过高速缓存路由或源路由发送的,这取决于在源节点上维护的历史表中是否存在识别目标节点的信息。 在源路由中,包中包含中继路径信息。 在缓存路​​由中,中继节点从自己的缓存路由表中的条目获取路由信息。 每个条目仅指示目的地节点和下一个中继节点,并且每个高速缓存路由表具有有限的大小。 当一系列数据包被发送到第二个节点时,除了第一个数据包之外,高速缓存路由可以被用于所有数据包,从而减少数据包开销。
    • 7. 发明授权
    • Wireless network and terminal, and network configuration method and device
    • 无线网络和终端,以及网络配置方法和设备
    • US08804599B2
    • 2014-08-12
    • US13187029
    • 2011-07-20
    • Kentarou YanagiharaHiroshi NishimuraYuki KuboMasanori Nozaki
    • Kentarou YanagiharaHiroshi NishimuraYuki KuboMasanori Nozaki
    • H04B7/14
    • H04W84/18H04W88/04Y02D70/00
    • A tree topology in a multi-hop wireless network is configured by having each node other than the root node select a parent node within direct communication range, thereby becoming a child node of the selected parent node. Neighboring nodes provide selection values such as routing costs and local structural information indicating the existing topology in their vicinities, including parent-child relationships. The selection of the parent node is based on the received selection values, but the local structural information is used to bias the selection in favor of neighboring nodes with at least one other child node. This selection strategy reduces the number of parent nodes in the network and enables more nodes to operate as end nodes, which can then conserve power by carrying out sleep control.
    • 通过使除根节点之外的每个节点在直接通信范围内选择父节点,从而成为所选父节点的子节点,来配置多跳无线网络中的树形拓扑。 相邻节点提供选择值,例如路由成本和指示其附近的现有拓扑的局部结构信息,包括父子关系。 父节点的选择基于接收到的选择值,但是本地结构信息用于利用至少一个其他子节点偏好选择以利于相邻节点。 该选择策略减少网络中的父节点数量,并使更多的节点作为终端节点运行,从而可以通过执行睡眠控制来节省电力。
    • 8. 发明授权
    • Wireless communication system and nodes
    • 无线通信系统和节点
    • US08493841B2
    • 2013-07-23
    • US12926886
    • 2010-12-15
    • Masanori NozakiKentarou YanagiharaHiroshi NishimuraYuki Kubo
    • Masanori NozakiKentarou YanagiharaHiroshi NishimuraYuki Kubo
    • G01R31/00
    • H04W40/30H04L45/04H04W28/06H04W88/04
    • A wireless communication system includes a first node, multiple second nodes, and multiple third nodes that communicate with the first node through the second nodes. The second and third nodes transmit control information to their neighboring third nodes, which calculate link costs from the reception status of the control information. The control information transmitted by each node includes a path cost indicating the cost of a path between the transmitting node and the first node. From the path costs in received control information, each third node selects a second node through which to communicate with the first node, and selects a parent node as the destination of the first hop on the path through the selected second node to the first node. Routing is thereby accomplished autonomously without having the second nodes flood the system with routing requests.
    • 无线通信系统包括通过第二节点与第一节点通信的第一节点,多个第二节点和多个第三节点。 第二节点和第三节点将控制信息发送到其相邻的第三节点,其根据控制信息的接收状态计算链路成本。 由每个节点发送的控制信息包括指示发送节点和第一节点之间的路径的开销的路径开销。 从所接收的控制信息的路径成本中,每个第三节点选择通过其与第一节点通信的第二节点,并且通过所选择的第二节点选择父节点作为通过所选择的第二节点到第一节点的路径上的第一跳的目的地。 从而自动完成路由,而不需要第二个节点将路由请求泛滥。