Motorola Corporation

Monique J Bourgeois

Priscilla L Chen

Edgar Herbert Callaway, Jr

Qicai Shi

Masahiro Maeda

Robert J O'Dea

Vernon Anthony Allen

Yan Huang

Edgar H Callaway

Jian C Huang

Matthew R Perkins

Lance Eric Hester

Neal K Patwari

Chung-Chieh Lee

Jiang Huang

An 'identical beacons' field () is inserted near the beginning of a transmitted beacon () that contains either an integer equal to the number of consecutive identical beacons sent (i.e., identical to the one presently being transmitted) or a repetition bit indicating whether or not the beacon contains changed information when compared to a prior-sent beacon. After sleeping awhile, a node (-) wakes up, receives a first portion of the beacon containing the identical beacons field, and analyzes the identical beacons field. Based on the analysis, the node makes a decision on whether to remain 'awake' for reception of the remaining beacon or to return to sleep.

Method and apparatus for battery life extension for nodes within beaconing networks

A process for merging and using the Mediation Device Protocol with a network layer protocol. Under the merged protocol, each device joining a network enters into two stages: the Set-Up Stage and the Normal Operational Stage. During the Set-Up Stage, the device identifies its neighbors, builds a neighborhood list, obtains a Logical ID, and picks a parent node in the network. After the Set-Up Stage is complete, the device enters the Normal Operational Stage where it will send/receive control and data messages, invite and help new nodes to join the network, recover from broken links or topology changes, and other normal network operations.

Procedures for merging the mediation device protocol with a network layer protocol

A cluster tree network formed by self-organization of a number of nodes. The method of self-organization includes processes for cluster formation, cluster network maintenance, intra-cluster communication. In the cluster formation process, each node discovers if any neighboring node is a cluster head or if any node is already a member of a cluster (thus making it a networked node), and if a cluster head or a networked node is discovered, each node establishes a communication link with the cluster head or the networked node. If no cluster head or networked node is discovered, the node itself becomes a cluster head. The network is maintained by each node periodically broadcasting a HELLO message to neighboring nodes, receiving responses to the HELLO message and updating a neighbor list in accordance with responses to the HELLO message. Multi-cluster networks are also provided using the processes of inter-cluster network formation, inter-cluster network maintenance, and inter-cluster communication. The resulting network has one or more clusters of nodes, each with a cluster head and a number of member nodes, each assigned a node identifier by the cluster head. In a multi-cluster network, a designated device assigns identifies to each cluster head in the network. Border nodes, which are members of at least two clusters, act as routers connecting the clusters and relaying information packets between the clusters.

Protocol and structure for self-organizing network

A network protocol for low-cost, low-power devices coupled to a self-organizing wireless network using a spanning tree backbone architecture is described. In this protocol, physical and logical network construction and maintenance operations, which supports efficient data routing in the network, are performed. The construction phase in conjunction with the maintenance phase insures the self-organizing capability of the network. At the same time, the maintenance operations provide a self-healing mechanism so that the network can recover from node failures and a self-updating mechanism so that the network can expand as more nodes enter the system. Also, the logical backbone hierarchy will facilitate multi-hop communication. The construction of a logical layered spanning tree backbone architecture from an underlying physical topology allows seamless data communication routing between all nodes in the network.

Protocol for self-organizing network using a logical spanning tree backbone

An 'identical beacons' field () is inserted near the beginning of a transmitted beacon () that contains either an integer equal to the number of consecutive identical beacons sent (i.e., identical to the one presently being transmitted) or a repetition bit indicating whether or not the beacon contains changed information when compared to a prior-sent beacon. After sleeping awhile, a node () wakes up, receives a first portion of the beacon containing the identical beacons field, and analyzes the identical beacons field. Based on the analysis, the node makes a decision on whether to remain 'awake' for reception of the remaining beacon or to return to sleep.

A system for locating a number of devices ( ) by measuring signals transmitted between known location devices ( ) and unknown location devices ( ), and signals transmitted between pairs of unknown location devices ( ), entering signal measurements into a graph function that includes a number of first sub-expressions, a number of which include signal measurement prediction sub-expressions, and have extrema when a predicted signal measurement is equal to an actual signal measurement, and optimizing the graph function.

Growing community of inventors

Sunrise, FL, United States of America

Monique J Bourgeois