Motorola Corporation

Motorola Solutions, Inc.

Yang Yu

Loren J Rittle

Michael D Pearce

Ali Saidi

Silviu Chiricescu

Bogdan O Carbunar

Weidong Shi

A method and apparatus for allocating resources to a node in an ad-hoc communication system is provided herein. During operation, nodes of the system will receive resource allocations from their parent node. The resource allocation comprises a portion of available resources that may vary in size. Each node will determine the resource needs for its children nodes only and then dynamically assign resources to them. The resources assigned to the children nodes comprise a portion of the resources assigned to the node by its parent node. Additionally, knowledge as to how the children further allocate resources to their own children is not known by the parent, however, the children nodes must allocate a portion of their resource to their children nodes.

Method and apparatus for resource allocation

Resources are assigned in a network of sensor nodes by a first sensor node of the network detecting an event and collecting data samples for the event, exchanging messages with other sensor nodes of the network that detect the event to form a community of sensor nodes. Based on information exchanged, the total data samples collected for the event is calculated and the community sends a help message to other sensor nodes. The other sensor nodes are assigned to cover the event if the potential marginal gain if they were to cover the event exceeds a threshold. The potential marginal gain comprises the expected change in a utility function that is dependent upon the total data samples collected for the event by the community. The utility function is a concave function of the total data samples and may be dependent upon an importance level of the event.

Method and apparatus for resource assignment in a sensor network

A wireless sensor node can request, responds to requests for, and maintain executable code (), including executable code for which the wireless sensor node is itself tasked with executing. Upon receiving (), however, a request for executable code that the wireless sensor node is not itself tasked with executing, one determines () whether to forward that request. This determination can be based upon any of a variety of decision-making criteria as may pertain to a given application setting (such as whether a different wireless sensor node is, in fact, already responding to this request for executable code, information regarding a number of hops to a known point of executable code injection as may be required to facilitate transport of the executable code from that source to a requesting wireless sensor node, and whether the wireless sensor node itself has locally cached the requested executable code).

Wireless sensor node executable code request facilitation method and apparatus

During operation, each client device will be provided with a list of addresses for all nodes within a network. The addresses for all nodes will be unique to a particular client device such that {address(node), address(node), . . . address(node n)} for a first client does not equal {address(node), address(node), . . . address(node n)} for a second client. Each client's address for a particular node will preferably only be known by the client and a naming server. When sending a message to a destination node, a client device will create a source route consisting of the unique addresses. Because each client's address for a particular node will only be known to itself and the naming server, anyone who intercepts the route will not know what nodes along the route are used for routing the message.

Growing community of inventors

Rolling Meadows, IL, United States of America

Yang Yu