Neighbor based TDMA slot assignment
First Claim
Patent Images
1. A wireless network comprising:
- a plurality of wireless sensor nodes, wherein each node has a communication radius and a sensing radius, wherein the communication radius defines a distance over which a corresponding node is capable of effectively communicating, wherein the sensing radius defines a distance over which a corresponding node is capable of effectively sensing a condition, and wherein the communication radius of each node should be at least as great as the sensing radius of the corresponding node; and
,an executable mobile agent that moves to a current node in the network, that executes so as to access neighbor information including time slot information relative to one-hop neighbor nodes of the current node, and that executes so as to assign mutually exclusive time slots to only the one-hop neighbor nodes.
4 Assignments
0 Petitions
Accused Products
Abstract
Non-overlapping time slots are allocated to a plurality of nodes in a network by a mobile agent that moves from node to node of the network. At a current node of the network, the mobile agent accesses neighbor information that includes time slot information relative to neighbor nodes of the current node. The neighbor nodes are neighbors of the current node. At the current node of the network, the mobile agent also assigns mutually exclusive time slots for the neighbor nodes.
-
Citations
10 Claims
-
1. A wireless network comprising:
-
a plurality of wireless sensor nodes, wherein each node has a communication radius and a sensing radius, wherein the communication radius defines a distance over which a corresponding node is capable of effectively communicating, wherein the sensing radius defines a distance over which a corresponding node is capable of effectively sensing a condition, and wherein the communication radius of each node should be at least as great as the sensing radius of the corresponding node; and
,an executable mobile agent that moves to a current node in the network, that executes so as to access neighbor information including time slot information relative to one-hop neighbor nodes of the current node, and that executes so as to assign mutually exclusive time slots to only the one-hop neighbor nodes. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
Specification