Proactive location based routing in a wireless ad-hoc network
    1.
    发明申请
    Proactive location based routing in a wireless ad-hoc network 有权
    在无线自组织网络中主动基于位置的路由

    公开(公告)号:US20060062175A1

    公开(公告)日:2006-03-23

    申请号:US11048410

    申请日:2005-01-31

    IPC分类号: H04Q7/24

    摘要: Disclosed is an improved proactive location based routing protocol for ad-hoc wireless networks. When a source node has a data packet to send to a destination node, the source node calculates an estimated future location of the destination node prior to forwarding a data packet to the destination node. The estimated future location may be based on the last known location, velocity and bearing of the destination node, as well as upon the estimated propagation delay (i.e., the estimated time it will take the data packet to reach the destination node after being transmitted by the source node). The source node routes the data packet by identifying which one of a plurality of its neighbor nodes is closest to the estimated future location of the destination node, and routes the data packet the identified neighbor node as an intermediate node along the route from the source node to the destination node. Further, the frequency of flooding broadcasts is based on the velocity of the network nodes. As the velocity of a network node increases, the rate at which the node broadcasts its location and mobility data also increases. The broadcast frequency of a network node may be dynamically adjusted as its velocity changes.

    摘要翻译: 公开了用于自组织无线网络的改进的基于主动位置的路由协议。 当源节点具有要发送到目的地节点的数据分组时,源节点在将数据分组转发到目的地节点之前计算目的地节点的估计未来位置。 估计的未来位置可以基于目的地节点的最后已知位置,速度和方向,以及估计的传播延迟(即,在数据分组被传送之后到达目的地节点的估计时间 源节点)。 源节点通过识别其多个邻居节点中的哪一个最靠近目的节点的估计未来位置来路由数据分组,并且将该数据分组沿着该源节点沿路由路由该识别的相邻节点作为中间节点 到目标节点。 此外,洪泛广播的频率是基于网络节点的速度。 随着网络节点的速度增加,节点广播其位置和移动性数据的速率也增加。 网络节点的广播频率可以随其速度变化而被动态调整。

    Proactive location based routing in a wireless ad-hoc network
    2.
    发明授权
    Proactive location based routing in a wireless ad-hoc network 有权
    在无线自组织网络中主动基于位置的路由

    公开(公告)号:US08630224B2

    公开(公告)日:2014-01-14

    申请号:US11048410

    申请日:2005-01-31

    IPC分类号: H04W4/00 H04M11/04 H04W24/00

    摘要: Disclosed is an improved proactive location based routing protocol for ad-hoc wireless networks. When a source node has a data packet to send to a destination node, the source node calculates an estimated future location of the destination node prior to forwarding a data packet to the destination node. The estimated future location may be based on the last known location, velocity and bearing of the destination node, as well as upon the estimated propagation delay (i.e., the estimated time it will take the data packet to reach the destination node after being transmitted by the source node). The source node routes the data packet by identifying which one of a plurality of its neighbor nodes is closest to the estimated future location of the destination node, and routes the data packet the identified neighbor node as an intermediate node along the route from the source node to the destination node. Further, the frequency of flooding broadcasts is based on the velocity of the network nodes. As the velocity of a network node increases, the rate at which the node broadcasts its location and mobility data also increases. The broadcast frequency of a network node may be dynamically adjusted as its velocity changes.

    摘要翻译: 公开了用于自组织无线网络的改进的基于主动位置的路由协议。 当源节点具有要发送到目的地节点的数据分组时,源节点在将数据分组转发到目的地节点之前计算目的地节点的估计未来位置。 估计的未来位置可以基于目的地节点的最后已知位置,速度和方向,以及估计的传播延迟(即,在数据分组被传送之后到达目的地节点的估计时间 源节点)。 源节点通过识别其多个邻居节点中的哪一个最靠近目的节点的估计未来位置来路由数据分组,并且将该数据分组沿着该源节点沿路由路由该识别的相邻节点作为中间节点 到目标节点。 此外,洪泛广播的频率是基于网络节点的速度。 随着网络节点的速度增加,节点广播其位置和移动性数据的速率也增加。 网络节点的广播频率可以随其速度变化而被动态调整。

    Distributed request routing
    3.
    发明授权
    Distributed request routing 有权
    分布式请求路由

    公开(公告)号:US07620687B2

    公开(公告)日:2009-11-17

    申请号:US10876983

    申请日:2004-06-25

    IPC分类号: G06F15/16

    CPC分类号: H04L47/10 H04L47/125

    摘要: A plurality of servers for processing client requests forward the requests among themselves to achieve a balanced load. When a server initially receives a client request, it randomly selects another of the plurality of servers, referred to as a first-chance server, and forwards the request to this server. Upon receiving the request, the first-chance server determines if it is overloaded and if not, processes the request. However, if overloaded, the first-chance server compares its load to the load of one or more predetermined next-neighbor servers. If the next-neighbor server(s) are more loaded than the first-chance server, the first-chance server processes the request. Otherwise, the first-chance server forwards the request to the least loaded next-neighbor server. The next-neighbor receiving the request either processes it directly, or alternatively, based on its current load and that of its next-neighbor server(s), forwards the request to another next-neighbor server for processing.

    摘要翻译: 用于处理客户端请求的多个服务器在它们之间转发请求以实现平衡负载。 当服务器最初接收到客户端请求时,它随机选择被称为第一机会服务器的多个服务器中的另一个,并将该请求转发给该服务器。 一旦接收到请求,第一次机会服务器确定它是否过载,如果不是,则处理该请求。 然而,如果超载,则第一机会服务器将其负载与一个或多个预定的下一邻居服务器的负载进行比较。 如果下一个邻居服务器比第一次机会服务器加载更多,那么第一次机会服务器处理该请求。 否则,第一次机会服务器将请求转发到最少加载的下一个邻居服务器。 接收请求的下一个邻居可以直接处理它,或者根据当前的负载和其邻居服务器的负载进行处理,将请求转发到另一个下一个邻居服务器进行处理。

    Distributed request routing
    4.
    发明申请

    公开(公告)号:US20060047751A1

    公开(公告)日:2006-03-02

    申请号:US10876983

    申请日:2004-06-25

    IPC分类号: G06F15/16

    CPC分类号: H04L47/10 H04L47/125

    摘要: A plurality of servers for processing client requests forward the requests among themselves to achieve a balanced load. When a server initially receives a client request, it randomly selects another of the plurality of servers, referred to as a first-chance server, and forwards the request to this server. Upon receiving the request, the first-chance server determines if it is overloaded and if not, processes the request. However, if overloaded, the first-chance server compares its load to the load of one or more predetermined next-neighbor servers. If the next-neighbor server(s) are more loaded than the first-chance server, the first-chance server processes the request. Otherwise, the first-chance server forwards the request to the least loaded next-neighbor server. The next-neighbor receiving the request either processes it directly, or alternatively, based on its current load and that of its next-neighbor server(s), forwards the request to another next-neighbor server for processing.

    Pumping device
    6.
    发明授权

    公开(公告)号:US11313108B2

    公开(公告)日:2022-04-26

    申请号:US17034409

    申请日:2020-09-28

    申请人: Chung-Min Chen

    发明人: Chung-Min Chen

    摘要: A pumping device has a container, an inlet pipe, a float barrel, and a discharging pipe. The container has a box containing water and a first gas, and a pressure gauge and a check valve mounted to the box. The inlet pipe connects to a water supply and has a second section erectly disposed within the box and communicating with an inside of the box. The float barrel is disposed within the box, contains a second gas, and has an opening. The second section is mounted through the opening. The discharging pipe has two opposite ends respectively communicating with a water reservoir and the inside of the box. The first gas has a pressure larger than 1 atm. The second gas has a pressure less than 1 atm. Water enters the float barrel. A water level inside the float barrel is higher than a water level inside the box.

    Asymmetric and asynchronous energy conservation protocol for vehicular networks
    7.
    发明授权
    Asymmetric and asynchronous energy conservation protocol for vehicular networks 有权
    车用网络不对称和异步节能协议

    公开(公告)号:US08428514B2

    公开(公告)日:2013-04-23

    申请号:US12466902

    申请日:2009-05-15

    IPC分类号: H04B7/00

    摘要: An asymmetric and asynchronous energy conservation protocol for vehicular networks is provided. In one aspect, an a-quorum may be defined for one or more members for the one or more members to establish asymmetric links to contact the cluster head. An s-quorum for the cluster head to establish symmetric link between the cluster heads and relays may be defined.

    摘要翻译: 提供了一种用于车辆网络的非对称和异步节能协议。 在一个方面,可以为一个或多个成员的一个或多个成员定义一个仲裁,以建立与簇头接触的非对称链接。 可以定义用于簇头建立簇头和继电器之间的对称链路的s-quorum。

    Water transporting device
    8.
    发明授权
    Water transporting device 失效
    水输送装置

    公开(公告)号:US06167899A

    公开(公告)日:2001-01-02

    申请号:US09349803

    申请日:1999-07-09

    申请人: Chung-Min Chen

    发明人: Chung-Min Chen

    IPC分类号: E03B704

    摘要: A water transporting device has a sealed water tank, a water channel device, and a pressure reduction tank. The water channel device has a lowest water box, a plurality of water boxes, a highest water box, a plurality of chambers between two of the water boxes, and a plurality of connection pipes. Each connection pipe is connected to two of the water boxes. Each connection pipe has a water outlet hole in one of the water boxes. A water inlet tube is connected to the sealed water tank. A water outlet tube is connected to the sealed water tank and the lowest water box. A connection tube is connected to the pressure reduction tank and the highest water box. A water outlet pipe is connected to the pressure reduction tank.

    摘要翻译: 水输送装置具有密封水箱,水通道装置和减压箱。 水路装置具有最低的水箱,多个水箱,最高水箱,两个水箱之间的多个室以及多个连接管。 每个连接管连接到两个水箱。 每个连接管在其中一个水箱中具有出水孔。 进水管连接到密封水箱。 出水管连接到密封水箱和最低水箱。 连接管连接到减压箱和最高水箱。 出水管连接到减压箱。

    Region-based clustering mechanism for channel access in vehicular Ad Hoc networks
    9.
    发明授权
    Region-based clustering mechanism for channel access in vehicular Ad Hoc networks 有权
    基于区域的车载Ad Hoc网络中信道接入聚类机制

    公开(公告)号:US08488545B2

    公开(公告)日:2013-07-16

    申请号:US13110118

    申请日:2011-05-18

    IPC分类号: H04W72/04

    CPC分类号: H04W74/08 H04W72/04 H04W84/18

    摘要: In a Vehicular Ad Hoc Network (VANET) a hybrid method combines SDMA (Space Division Multiple Access) and dynamic TDMA (Time Division Multiple Access) that divides the roadway into regions (whose size is larger than the SDMA unit) where each region is allocated a pool of radio channels based on SDMA and may contain a limited number of vehicles. Vehicles within the same region compete for and access the channels using dynamic TDMA. A channel allocation scheme that maps the pool of channels to the regions such that when a vehicle acquires multiple channels (time slots) in a region, the intervals among the channels are as uniform as possible, thus minimizing the waiting time of the messages to be broadcast by the vehicle, which is critical for safety related applications. This solution is referred to as R-SDMA (Region based SDMA).

    摘要翻译: 在车载Ad Hoc网络(VANET)中,混合方法将SDMA(空分多址)和动态TDMA(时分多路访问)相结合,将道路划分成每个区域被分配的区域(其尺寸大于SDMA单元) 基于SDMA的无线电频道池可能包含有限数量的车辆。 同一区域内的车辆使用动态TDMA竞争和接入频道。 一种信道分配方案,其将信道池映射到区域,使得当车辆在区域中获取多个信道(时隙)时,信道之间的间隔尽可能一致,从而最小化消息的等待时间 由车辆广播,这对于安全相关应用至关重要。 该解决方案称为R-SDMA(基于区域的SDMA)。

    REGION-BASED CLUSTERING MECHANISM FOR CHANNEL ACCESS IN VEHICULAR AD HOC NETWORKS
    10.
    发明申请
    REGION-BASED CLUSTERING MECHANISM FOR CHANNEL ACCESS IN VEHICULAR AD HOC NETWORKS 有权
    基于区域的车辆通道网络中的通道集群机制

    公开(公告)号:US20120120883A1

    公开(公告)日:2012-05-17

    申请号:US13110118

    申请日:2011-05-18

    IPC分类号: H04W72/04 H04W74/08

    CPC分类号: H04W74/08 H04W72/04 H04W84/18

    摘要: In a Vehicular Ad Hoc Network (VANET) a hybrid method combines SDMA (Space Division Multiple Access) and dynamic TDMA (Time Division Multiple Access) that divides the roadway into regions (whose size is larger than the SDMA unit) where each region is allocated a pool of radio channels based on SDMA and may contain a limited number of vehicles. Vehicles within the same region compete for and access the channels using dynamic TDMA. A channel allocation scheme that maps the pool of channels to the regions such that when a vehicle acquires multiple channels (time slots) in a region, the intervals among the channels are as uniform as possible, thus minimizing the waiting time of the messages to be broadcast by the vehicle, which is critical for safety related applications. This solution is referred to as R-SDMA (Region based SDMA).

    摘要翻译: 在车载Ad Hoc网络(VANET)中,混合方法将SDMA(空分多址)和动态TDMA(时分多路访问)相结合,将道路划分成每个区域被分配的区域(其尺寸大于SDMA单元) 基于SDMA的无线电频道池可能包含有限数量的车辆。 同一区域内的车辆使用动态TDMA竞争和接入频道。 一种信道分配方案,其将信道池映射到区域,使得当车辆在区域中获取多个信道(时隙)时,信道之间的间隔尽可能一致,从而最小化消息的等待时间 由车辆广播,这对于安全相关应用至关重要。 该解决方案称为R-SDMA(基于区域的SDMA)。