Application-layer multicast for mobile users in diverse networks
    82.
    发明授权
    Application-layer multicast for mobile users in diverse networks 有权
    移动用户在不同网络中的应用层组播

    公开(公告)号:US07546082B2

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

    申请号:US10791603

    申请日:2004-03-02

    IPC分类号: H04H20/74 H04M3/42

    CPC分类号: H04W76/40

    摘要: As multicast services become prevalent, it is important to find viable solutions for multicasting to mobile nodes. This problem is complicated by the necessity to support multicast services over existing backbone and access networks that may have varying network and/or link layer multicasting capabilities. While most work on supporting multicast services focuses on the IP layer solution, the present invention presents an application-layer approach for providing multicast services to mobile users traversing networks with diverse multicast capabilities. The present invention places multicast proxies in the backbone and access networks to support several multicast-related functions at the application layer including the creation of virtual networks for dynamically tunneling through non-multicast-capable networks.

    摘要翻译: 随着组播业务的普及,重要的是为移动节点寻找可行的组播方案。 由于必须通过可能具有变化的网络和/或链路层多播能力的现有骨干网和接入网来支持多播服务,所以这个问题是复杂的。 尽管大多数支持组播服务的工作都集中在IP层解决方案上,但是本发明提出了一种应用层方法,用于向遍历具有不同组播能力的网络的移动用户提供多播服务。 本发明将组播代理放置在骨干网和接入网中,以在应用层支持若干组播相关功能,包括创建虚拟网络,以便通过非多播能力的网络动态隧道化。

    Framework for hybrid ad-hoc networks
    83.
    发明申请
    Framework for hybrid ad-hoc networks 有权
    混合自组织网络框架

    公开(公告)号:US20070115895A1

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

    申请号:US11282509

    申请日:2005-11-18

    IPC分类号: H04Q7/24

    摘要: A hybrid mobile ad-hoc network and a method of operating the same, including a mobile network node and a plurality of static network nodes randomly distributed over a coverage area with a predetermined density. The static network nodes form a static infrastructure backbone of the hybrid mobile ad-hoc network. Position information of the static network nodes, either through position awareness or triangulation with reference to other static nodes enhances the network function. The method tracks mobile node position with a minimum of overhead because of the fixed infrastructure of static nodes. The infrastructure can self-heal by placing excess static nodes in a hibernating state, and activating those in response to the failure of a nearby static node.

    摘要翻译: 一种混合移动自组织网络及其操作方法,包括移动网络节点和随机分布在具有预定密度的覆盖区域上的多个静态网络节点。 静态网络节点形成混合移动自组织网络的静态基础设施骨干网。 静态网络节点的位置信息可以通过位置识别或三角测量参考其他静态节点来增强网络功能。 由于静态节点的固定基础设施,该方法以最小的开销跟踪移动节点的位置。 通过将多余的静态节点置于休眠状态,并且根据附近的静态节点的故障激活这些静态节点,基础设施可以自我修复。

    Method, system and apparatus for location-aware content push service and location-based dynamic attachment
    84.
    发明申请
    Method, system and apparatus for location-aware content push service and location-based dynamic attachment 审中-公开
    用于位置感知内容推送服务和基于位置的动态附件的方法,系统和装置

    公开(公告)号:US20060206610A1

    公开(公告)日:2006-09-14

    申请号:US11076485

    申请日:2005-03-09

    摘要: A method and system for providing location-aware and location-based content services. The system preferably comprises an overlay service network that includes a plurality of information gateway servers. A mobile client uses the servers in the overlay service network to request and receive information. The particular server used by the mobile client is selected based on the geo-location of the mobile client. The method comprises partitioning a geographic area into a plurality of sub-areas and associating resources to the sub-areas based on the location of mobile units within a sub-area.

    摘要翻译: 一种用于提供位置感知和基于位置的内容服务的方法和系统。 该系统优选地包括包括多个信息网关服务器的覆盖服务网络。 移动客户端使用覆盖服务网络中的服务器来请求和接收信息。 移动客户端使用的特定服务器是根据移动客户端的地理位置来选择的。 该方法包括基于子区域内的移动单元的位置将地理区域划分成多个子区域并将资源与子区域相关联。

    Proactive location based routing in a wireless ad-hoc network
    85.
    发明申请
    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.

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

    Distributed request routing
    86.
    发明申请

    公开(公告)号: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.