Samsung Electronics Co., Ltd.

The City University of New York

Intel Corporation

Motorola Corporation

Nxp B.v.

Mitsubishi Electric Research Laboratories, Inc.

Xuhui Hu

Yong Liu

Myung-Jong Lee

Myung Jong Lee

Philip Orlik

Edgar Herbert Callaway, Jr

Zafer Sahinoglu

Lakshman Krishnamurthy

Ralph Michael Kling

Jasmeet Chhabra

Ji-Hoon Lee

Vernon Anthony Allen

Chunhui Zhu

Jong-hun Park

Lance Eric Hester

Jin Young Yang

Phil A Jamieson

Eun Il Seo

Phil Rudland

Zachary Smith

A method and apparatus is provided for setting multiple paths between wireless nodes of an ad-hoc network including a source node, a relay node and a destination node that receives a message from the source node via the relay node. The multi-path setting method and apparatus includes receiving previous hop address information, and determining whether a wireless node that receives the previous hop address information is included in an insulating region, based on the previous hop address information.

Apparatus and method for setting multi-path

A data routing method and system, the data routing method including: locating a destination node using a destination locating packet; establishing a preliminary route including anchor nodes based on a route where the destination locating packet is transmitted to the destination node; determining a link cost between neighbor nodes of each of the anchor nodes, and also between the anchor nodes and the neighbor nodes of each of the anchor nodes; generating minimum cost information with respect to a route consuming a minimum cost from the destination node to a source node using the link cost; and forming a data route from the destination node to the source node using the minimum cost information.

Data routing method and apparatus

The disclosure is a routing method for data in a personal area network. The personal area network includes a plurality of nodes. The method includes receiving a frame at a node, determining whether the node contains a routing table entry for the frame destination, and when the node contains a routing table entry, determining a route for the frame based on a first routing protocol. The method further includes, when the node does not contain a routing table entry for the frame destination, determining whether a route should be discovered for the frame destination, and when a route should not be discovered, determining a route for the frame based on a second routing protocol.

Methods and apparatuses for routing data in a personal area network

A routing method comprising receiving a first packet, the first packet being broadcast for discovery of a route. A first backoff of the first packet is calculated based on a route cost of the first packet. The first packet is rebroadcast if a second packet is not received within the first backoff, the second packet being a duplicate of the first packet. A second backoff of the second packet is calculated based on a route cost of the second packet if the second packet is received within the first backoff. One of the first and the second packets is rebroadcast as a result of comparing the first backoff and the second backoff.

Cost-based routing using backoff scheme

Growing community of inventors

New York, NY, United States of America

Xuhui Hu