Methods for optimal multi-channel assignments in vehicular ad-hoc networks
    51.
    发明授权
    Methods for optimal multi-channel assignments in vehicular ad-hoc networks 有权
    车载ad-hoc网络中最优多频道分配的方法

    公开(公告)号:US08116269B2

    公开(公告)日:2012-02-14

    申请号:US11800849

    申请日:2007-05-08

    IPC分类号: H04W4/00

    摘要: A communications path is established among an ordered sequence of moving nodes, representing vehicles. Available channels may differ from one node to the next node and a node cannot use the same channel for both receiving and transmitting information. Three methods are described that provide an optimal sequence of channel assignments between the nodes. A sequence of channel assignments is called optimal if it establishes a communications path from the first node in the sequence to the last node in the sequence, or, if such a path does not exist, from the first node to the farthest node possible in the sequence. The first method uses a depth-first search starting from the first node in the sequence. The second method uses a “look ahead” scheme in the depth-first search method. The third method requires only a single pass through the sequence of nodes by identifying optimal channel assignments in subsequences of nodes without a need for backtracking.

    摘要翻译: 在运动节点的有序序列之间建立通信路径,代表车辆。 可用的通道可能因一个节点而不同于下一个节点,并且节点不能对接收和发送信息使用相同的信道。 描述了提供节点之间的信道分配的最佳序列的三种方法。 如果信道分配的序列建立了从序列中的第一个节点到序列中的最后一个节点的通信路径,或者如果这样的路径不存在,则从第一个节点到最远的节点 序列。 第一种方法使用从序列中的第一个节点开始的深度优先搜索。 第二种方法在深度优先搜索方法中使用“前瞻”方案。 第三种方法只需要通过节点序列中的最佳信道分配,而不需要回溯,就可以顺利通过节点序列。

    Distributed Method for Minimum Delay Multi-Hop Data Delivery in Vehicular Networks
    52.
    发明申请
    Distributed Method for Minimum Delay Multi-Hop Data Delivery in Vehicular Networks 有权
    车载网络中最小延迟多跳数据传送的分布式方法

    公开(公告)号:US20090238187A1

    公开(公告)日:2009-09-24

    申请号:US12408221

    申请日:2009-03-20

    IPC分类号: H04L12/56

    摘要: An inventive method for data delivery in a multi-hop vehicular network with multiple vehicles and intersections is presented. The method comprises, at each source vehicle, initiating packet flow, labeling packets with destination coordinates and a current location, and forwarding the packet flow, and at each intersection, selecting a header vehicle, computing a backlog indicator and listening for broadcasts with a matrix and delay information, updating the matrix in accordance with the backlog indicator if the matrix is present, otherwise initializing the matrix, forwarding the packet flow, and broadcasting the matrix from the header vehicle. In one embodiment, selection of the header vehicle is performed based on random countdown and vehicle ID. The method converges to the optimal (lowest latency) state irrespective of the initial starting point of the network and continues to tend towards the optimal state even as the network conditions alter.

    摘要翻译: 提出了一种在多车辆和交叉路口的多跳车辆网络中进行数据传输的创新方法。 该方法包括:在每个源车辆处,发起分组流,标记具有目的地坐标和当前位置的分组,以及转发分组流,并且在每个交叉路口选择一个头部车辆,计算积压指示符并用矩阵收听广播 和延迟信息,如果矩阵存在,则根据积压指示符更新矩阵,否则初始化矩阵,转发分组流,以及从头部车辆广播矩阵。 在一个实施例中,基于随机倒计时和车辆ID执行头部车辆的选择。 该方法收敛到最优(最低等待时间)状态,而与网络的起始起始点无关,并且即使网络条件发生变化,也继续趋向于最佳状态。

    Group-header based method to organize local peer group of vehicles for inter-vehicle communication
    54.
    发明申请
    Group-header based method to organize local peer group of vehicles for inter-vehicle communication 有权
    以组头为基础的方法组织本地对等车辆进行车间通信

    公开(公告)号:US20070115868A1

    公开(公告)日:2007-05-24

    申请号:US11285593

    申请日:2005-11-22

    摘要: A method for establishing and maintaining the network and a corresponding ad-hoc moving-device to moving-device network having a plurality of moving-devices grouped into a Local Peer Group (LPG) is disclosed. A group header node (GH) is selected from the plurality of moving wireless devices in the LPG. The GH controls and manages the LPG by broadcasting a plurality of control messages, including a heartbeat message at a fixed interval. The LPG also includes at least one group node (GN). The at least one GN can communicate with the GH via a network link created between the at least one GN and the GH. The GNs join the LPG via the GH. If there is more then one GH in an LPG, header resolution occurs to select only one GH.

    摘要翻译: 公开了一种用于建立和维护网络的方法以及具有分组为本地对等组(LPG)的多个移动设备的移动设备网络的相应的自组织移动设备。 从LPG中的多个移动无线设备中选择组头节点(GH)。 GH通过以固定的间隔广播包括心跳消息的多个控制消息来控制和管理LPG。 LPG还包括至少一个组节点(GN)。 至少一个GN可以通过在至少一个GN和GH之间创建的网络链路与GH通信。 GN通过GH加入LPG。 如果LPG中存在多于一个GH,则会发生标题分辨率,以仅选择一个GH。

    Transparent service adaptation in heterogeneous environments
    56.
    发明授权
    Transparent service adaptation in heterogeneous environments 有权
    异构环境中的透明服务适配

    公开(公告)号:US08527611B2

    公开(公告)日:2013-09-03

    申请号:US11135169

    申请日:2005-05-23

    IPC分类号: G06F15/177

    摘要: A method of tailoring data streams transmitted to networked user devices is disclosed in which environment information associated with each device is stored at an agent located on those devices. This environment information may include information related to the hardware, interface and application capabilities of the particular device. In another embodiment, this environment information is transmitted and stored at an agent at a local network gateway. And in another embodiment, the environment information is then stored at a mirror agent located in a backbone network of a service provider. By referring to this environment information, a service provider can tailor the transmission of data streams, such as multimedia streams, to a device based on the capabilities of the device and the associated network.

    摘要翻译: 公开了一种调整发送到网络用户设备的数据流的方法,其中与每个设备相关联的环境信息被存储在位于那些设备上的代理处。 该环境信息可以包括与特定设备的硬件,接口和应用能力相关的信息。 在另一个实施例中,该环境信息被传送并存储在本地网络网关的代理处。 而在另一个实施例中,环境信息然后被存储在位于服务提供商的骨干网络中的镜像代理。 通过参考该环境信息,服务提供商可以基于设备和相关网络的能力,将数据流(例如多媒体流)的传输定制到设备。

    Full-duplex wireless communication using a single transmitter
    57.
    发明授权
    Full-duplex wireless communication using a single transmitter 有权
    使用单个发射机的全双工无线通信

    公开(公告)号:US08199683B2

    公开(公告)日:2012-06-12

    申请号:US12700123

    申请日:2010-02-04

    IPC分类号: H04B7/005

    摘要: A system for fall-duplex communication using a single transmitter is presented. The system comprises a base station with a signal and data processor, peripheral detectors each placed at a distance from the transmitting antenna, and a mobile device having at least a dipole antenna having a switch and a loop antenna having a switch, wherein the sending device modulates the shorting state, i.e., the electromagnetic configuration, of the wire and coil antennas using the switches, the modulating resulting in alteration in load at the base station. This alteration can be calculated based on input from the transmitting antenna and the detectors, each input having time coding. The input from the transmitting antenna can be magnitude of propagated signal and the input from each detector can comprise a quantified signal level and the quantified signal level time-delayed by propagation time. The detectors can be peripheral signal level detecting antennas.

    摘要翻译: 提出了一种使用单个发射机进行全双工通信的系统。 该系统包括具有信号和数据处理器的基站,每个远离发送天线的外围检测器,以及至少具有开关的偶极子天线和具有开关的环形天线的移动设备,其中发送设备 使用开关调制线圈和线圈天线的短路状态,即电磁配置,调制导致基站的负载发生变化。 可以基于来自发射天线和检测器的输入来计算该改变,每个输入具有时间编码。 来自发射天线的输入可以是传播信号的幅度,并且来自每个检测器的输入可以包括量化的信号电平和由传播时间延迟的量化的信号电平。 检测器可以是外围信号电平检测天线。

    DISTRIBUTED TRAFFIC NAVIGATION USING VEHICULAR COMMUNICATION
    58.
    发明申请
    DISTRIBUTED TRAFFIC NAVIGATION USING VEHICULAR COMMUNICATION 有权
    使用车辆通信的分布式交通导航

    公开(公告)号:US20110035146A1

    公开(公告)日:2011-02-10

    申请号:US12646277

    申请日:2009-12-23

    IPC分类号: G01C21/36

    摘要: A method for distributed traffic navigation in a vehicular network is presented. At each vehicle entering the network, information associated with the vehicular network is acquired and stored, and destination addresses are broadcasted as route requests. At each vehicle in the network, the stored information is updated through vehicle to vehicle communication. At each junction, a header vehicle is selected for listening for broadcasts to determine the presence of a matrix. If the matrix is not present, the matrix is initialized based on the stored information of the header vehicle. The header vehicle further estimates travel time on the road segments based on the matrix, calculates a backlog indicator based on the segment travel time and the route requests. The header vehicle further updates the matrix and generates a route based on the matrix. The matrix is broadcasted from the header vehicle.

    摘要翻译: 提出了一种车载网络中分布式业务导航的方法。 在进入网络的每个车辆,获取并存储与车辆网络相关的信息,并且将目的地地址作为路由请求广播。 在网络中的每个车辆上,存储的信息通过车辆到车辆通信被更新。 在每个连接处,选择头部车辆用于监听广播以确定矩阵的存在。 如果矩阵不存在,则基于头部车辆的存储信息来初始化矩阵。 标题车辆还基于矩阵估计路段上的行驶时间,基于段行进时间和路线请求计算积压指示符。 头部车辆进一步更新矩阵并基于矩阵生成路线。 矩阵从头部车辆广播。

    Inter-Local Peer Group (LPG) Routing Method
    59.
    发明申请
    Inter-Local Peer Group (LPG) Routing Method 有权
    本地对等组(LPG)路由方法

    公开(公告)号:US20090285213A1

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

    申请号:US12120690

    申请日:2008-05-15

    IPC分类号: H04L12/56 H04Q7/24

    摘要: An on-demand method of routing data between a plurality of local peer groups (LPG). Each LPG includes a plurality of moving nodes. The method comprises transmitting a route request message from a source node, relaying the route request message to a native boundary node; forwarding the route request message to a foreign boundary node, determining if the destination node is within an LPG for the foreign boundary node; relaying the route request message to another boundary node if the destination node is not within the LPG, relaying the route request message to the destination node if the destination node is within the LPG, receiving the routing request message at the destination node, transmitting a routing response to the source node, relaying the routing response to the source node through a path discovered by the route request, receiving the routing response at the source node, and transmitting the data, upon receipt of the routing response.

    摘要翻译: 在多个本地对等体组(LPG)之间路由数据的按需方法。 每个LPG包括多个移动节点。 该方法包括从源节点发送路由请求消息,将路由请求消息中继到本地边界节点; 将所述路由请求消息转发到外部边界节点,确定所述目的地节点是否在所述外部边界节点的LPG内; 如果目的地节点不在LPG内,则将路由请求消息中继到另一边界节点,如果目的地节点在LPG内,则将路由请求消息中继到目的节点,在目的地节点处接收路由请求消息,发送路由 响应于源节点,通过路由请求发现的路径将路由响应中继到源节点,在源节点接收路由响应,并在接收到路由响应时发送数据。

    Estimator for end-to-end throughput of wireless networks
    60.
    发明申请
    Estimator for end-to-end throughput of wireless networks 审中-公开
    无线网络端到端吞吐量估算器

    公开(公告)号:US20090052320A1

    公开(公告)日:2009-02-26

    申请号:US12288461

    申请日:2008-10-21

    IPC分类号: H04L12/26

    摘要: The present invention presents an architecture to dynamically measure and estimate the throughput perceived by a user during a connection in real-time in a wireless network system. The architecture system design of the present invention allows for information gathering independent of the mathematical models used and takes into account security settings in the network hosts. The present invention also sets forth a number of throughput estimators (TEs) that can be used within the architecture to gather the information needed to carry out the throughput estimation calculations. The throughput estimations can then be used for download rate control, QoS, load balancing, etc. The present invention also provides algorithms to calculate the real-time throughput experienced by a user flow.

    摘要翻译: 本发明提出了一种用于在无线网络系统中实时地连接期间动态地测量和估计用户感知的吞吐量的架构。 本发明的架构系统设计允许独立于所使用的数学模型的信息收集,并考虑网络主机中的安全设置。 本发明还提出了可以在架构内使用的多个吞吐量估计器(TE)来收集执行吞吐量估计计算所需的信息。 吞吐量估计可以用于下载速率控制,QoS,负载均衡等。本发明还提供了用于计算用户流量所经历的实时吞吐量的算法。