The present invention relates to controlling a radio using a policy. More particularly, the present invention relates to policy-based control of a software-defined radio having policy components.
Networking devices that run according to a policy, or constraints, must conform to the policy or they will not be allowed to transmit within the network. The policy usually controls the devices in order to prevent any collisions with other radio devices or networks. The other networks are known as “non-cooperative” (NC) and could interfere with the radio device. Further, the radio device seeks not to transmit to cause interference, but seeks to avoid it.
Policies, such as those promulgated by the government, are in a language spoken or read by people, such as English or Spanish. Manufacturers or other entities assemble the radio at a location and ship it to a user.
A conventional radio may employ a prevention mode to eliminate security threats implied by policies. Regulators, such as government officials, define fixed requirements for building an application-specific radio device. Manufacturers design products based on their interpretation of the requirements, i.e. policies, and prove to regulators that the built radio satisfies the requirements in order for the radio device to be classified as “certified.”
After all this, a user or operator can purchase a radio device. Although the radio device may be configurable, the configuration options are limited as majority of the features are “locked” prior to the certification process.
Should the user decide to change the application of her radio devices or travel to a location having different policies, the user must take it back to the manufacturer to have the radio modified and re-certified. Otherwise, anyone could modify the software on the radio and security breaches and tampering would result if the radio fell into the wrong hands.
Smart software-defined radio devices (SDRs) offer tremendous performance and operational benefits over current radios. The benefits include the ability to employ dynamic spectrum access procedures, to tailor the system design to a user's unique circumstances and to remotely configure and control networks.
Additionally, a unique aspect of SDRs is their radically different approach from currently established principles of spectrum access. These principles impact many stakeholders. A stakeholder may be any entity, person, company, government agency and the like that have an interest in spectrum availability for a particular band or frequency. For example, users and operators may pool spectra together to improve spectrum access, lease spectrum or use spectrum available to a second market. Actors, such as owners, users and regulators, desire an assurance that the SDRs will not interfere with current spectrum users. Although the actors might be considered the same for any wireless network, a difference with SDRs is that each actor can influence the design, implementation, deployment and performance of a radio.
One drawback to SDRs involves the complexity of their adaptive software. Adaptive software can change its operation mode throughout the life of the device. Verification of all the states of a SDR may be difficult or unfeasible. Further, a SDR may operate in numerous bands during its lifetime. For each band, the software in the SDR may need to emulate different processes, and the processes may need to change and reconfigure dynamically.
These advantages and problems apply to any software-defined device that uses policy-based control. As software becomes more integrated into everyday devices, the control of the device will be driven by the policies and constraints implemented by the software. Instead of hardware changes, modifications and updates may be realized by downloading new policy updates to the device. For example, a software program on a processor may control a coffee maker. A policy constraining the coffee maker could be not heating the water above a certain temperature, such as 100 degrees Celsius, for safety reasons. Thus, the coffee maker will not allow its temperature to rise above that limit. If the limit changes, however, the coffee maker will have to be taken back to the manufacturer or replaced. If the user chooses to not update the limit, then warranties or indemnities may cease to apply for the coffee maker's usage.
The embodiments of the present invention disclose a software-defined device that provides advantages and solutions over conventional devices. The disclosed embodiments implement a policy-based approach that enables the control of devices built by different manufacturers using software controllers. An example of an applicable device is a SDR. Because radio devices operate in bands and locations under various jurisdictions, points of control, different stakeholders, and the like, and because their requirements change dynamically, the disclosed embodiments allow the modification of the radio devices' operation at run-time to follow a variety of policies and requirements.
The disclosed embodiments of the present invention define the foundation for defining policies. The foundation specifies in a computer-understandable language what the device can do and what the device must not do using a semantic policy language, types, rules and instances. Another area defines policy control components on a device enforcing the policies by restricting the device's operational state. Another area defines a framework for securely creating, managing and controlling device policies.
The disclosed embodiments allow for easy configuration of a device having software and other improvements over the current art. By changing policies and their content, a device can adapt any configuration, setting or operational strategy used. The disclosed embodiments may provide improved policy authoring by using a semantic language to create a generic policy abstracting the low-level requirements of specific devices, thus allowing a common policy applicable to multiple devices from multiple manufacturers.
The disclosed embodiments also provide for secure policy enforcement. The policies are enforced on the device by a software component referred to as a controller. Policies exert direct control over the device and impose limits, such as limits on transmitter power and frequencies in the case of a radio device as well as the type of operations the radio device must execute. Policy components also automatically identify stale policies and either request an update or stop the device from operating, e.g. transmitting, under certain conditions, until the policies are updated.
Policy enforcement according to the disclosed embodiments also automatically combines all policies and permits execution of functions if requirements imposed by all applicable policies are met. Policy components also automatically determine sufficient states that satisfy policy enforcement requirements and make the requirements available to the device as additional spectrum opportunities. The controller component of the software may find pre-conditions that must be met for the device to perform a certain action. Thus, in addition to device control, the controller provides an optimization feature to the device.
Thus, a device according to the disclosed embodiments includes policy-based components that are tightly integrated with the controller components on the device. Policy conformance and enforcement components ensure that a device does not violate policies provided by a stakeholder, agency, user or other entity. The policies are encoded in an abstract, semantic language that defines regulatory and other stakeholders' goals and requirements. The device also secures the policy management and distribution mechanisms to prevent malicious users from altering loaded policies or inserting additional policies that lead to harmful results or interference.
The disclosed embodiments address concerns raised by any stakeholder. The disclosed embodiments allow regulators and other points of control to continue controlling a policy-based device, such as where and how they operate. Users, however, of the devices are able to take advantage of the software-defined technology and its dynamic capabilities.
The accompanying drawings, that are included to provide further understanding of the disclosed embodiments, illustrate embodiments of the invention and, together with the description disclosed below, serve to explain the principles of the invention.
Aspects of the invention are disclosed in the accompanying description. Alternate embodiments of the present invention and their equivalents are devised without parting from the spirit or scope of the present invention. It should be noted that like elements disclosed below are indicated by like reference numbers in the drawings.
Device 102 may be any device that includes software components that control functions and operations. The software components include instructions understandable by device 102 to execute the functions and operations. Device 102 preferably is a SDR that transmits and receives signals within network environment 100. The following description discloses embodiments pertaining to a radio for device 102, and using software for determining spectrum access rights within network environment 100. Device 102, however, is not limited to radio devices or devices used for transmitting signals. Using the above coffee maker example, device 102 may be a coffee maker using software components for policy-based control.
Referring back to
Device 102 may receive signals 105 and 107, or transmit signal 103 at the same frequency. A policy embedded within device 102 allows the reception and transmission of the signals. If device 104, for example, switches to another available frequency spectrum, then device 102 may not receive signal 105 if doing so violates the policy. Further, device 102 will not transmit signal 103 if the policy is violated due to the switching of the frequency spectrum available to network environment 100.
Non-cooperative (NC) radio device 110 transmits signal 112 that may interfere with device 102 as it operates within network environment 100. NC radio device 110 is not part of network environment 100. NC radio device 110 should transmit signal 112 on a frequency not within the frequency spectrum available to device 102. If, however, signal 112 does transmit within the spectrum, device 102 may have to select another available frequency spectrum or shut down. NC radio device 110 or other non-cooperative devices may interfere with other operations of device 102 instead of available frequency spectrum.
Referring back to the coffee maker example, device 102 may serve as a coffee maker subject to policies to prevent injury or damage. A policy for device 102 states that heat is not applied when no water is present in a chamber of the coffee maker. A user indicates that coffee should be made. Device 102 sends a command to apply heat to the chamber to boil water. A sensor in the chamber indicates that no water is present. Subsequently, device 102 cancels the heat application command and prevents damage to the coffee maker or an injury to a user.
Thus, a policy associated with device 102 prevents further transmission of signal 103 upon detection of signal 112 from NC radio device 110. If devices 104 and 106 of network environment 100 move operations to another frequency spectrum, then device 102 may resume communications provided that the policy is not violated.
The software components within device 102 help define and apply the policies. The policies, however, change over time or in different locations or conditions for network environment 100. For example, the policy excluding communications with NC radio 110 or the reception of signal 112 may change to be inclusive of NC radio 110. Thus, device 102 must modify its policy to allow reception of signal 112 and the transmission of signal 103 in the presence of NC radio 110. According to the disclosed embodiments, device 102 updates its policies while still operating within network environment 100 without the need for hardware switches or down time to visit a facility.
As part of this process, device 102 interacts with system operation optimizer 114 and system conformance controller 116. Device 102 acts as a cognitive device that makes its own decisions on how to operate within network environment 100. According to the disclosed embodiments, device 102 can find new opportunities or respond to problems faster than non-adaptive devices. Further, device 102 acts a device that can change applications and functions from its present state to other states. In other words, device 102 may modify its functions to perform as another device. The disclosed embodiments are not limited to radio devices, but are applicable to any device that is software-defined and uses policy-based control, such as a router or even a coffee maker. The controls are updated periodically in the device.
As a software-defined device, device 102 dynamically changes its operating parameters and strategies. Stakeholders and regulators still define fixed requirements, but the requirements are for a generic device. A manufacturer designs, produces and proves to the stakeholders and regulators that the device satisfies the requirements to certify the device for use. The device contains software components or modules that allow for the device to be reconfigured dynamically at later times. For example, device 102 may be considered “certified and open” because it can operate in different bands emulating different applications depending on current policies.
Concurrently, stakeholders and regulator also define regulatory policies that are applicable to specific application and are certified for use. Thus, a user acquires an open, certified device from a manufacturer and specifies the type of application for the device by providing the software with appropriate policies. The policies define what the device can do and what the device must not do. Referring back to
Optimizer 114 executes heuristics to optimize device 102 or network environment 100. Optimizer 114 may continuously modify or reconfigure device 102 and its components as needed. Policies and functions are deleted and added as needed. Controller 116 provides a guarantee that device 102 does not violate scope of any policy or regulation imposed on network environment 100, device 102 and the like. Controller 116 assures the user, network operator and other outside or interested parties that optimizer 114 will be held to the policies and regulations. Controller 116 monitors and restricts what optimizer 114 does in executing functions on device 102.
Official policies and regulations for device 102 or network environment 100 are encoded in an abstract computer language, and then loaded to controller 116. Using the encoded policies, controller 116 monitors device 102 and notifies a monitor or network operator if a policy or regulation is violated. The network operator may be a government agency, a stakeholder, a facilitator, and the like. Controller 116 also tells optimizer 114 what states that device 102 is allowed to be in and what needs to happen to arrive at those states.
Controller 116 also guards optimizer 114 to ensure that device 102 does not enter an invalid state per the applicable policies. Thus, controller 116 blocks invalid commands issued by a component within device 102. Moreover, controller 116 can inform optimizer 114 to help in the decision making process for device 102.
From a policy component perspective, optimizer 114 acts as an external module within device 102 that controls hardware components, gathers data, forms strategies to implement functions and provides an interface for transmitting and receiving data and signals. Controller 116 acts as a policy manager for managing local policies and responding to remote commands and a policy conformance reasoner for reasoning over policies and device-provided evidence. Controller 116 interacts with optimizer 114 to determine what opportunities are available to device 102. For example, using device 102 as a radio, controller 116 and optimizer 114 determine spectrum access opportunities. Using this information, optimizer 114 determines and executes applicable system strategies that are needed for signal 103 to conform to the policies.
Optimizer 114 is responsible for providing controller 116 with access to its current state as well as evidential results obtained from other components on device 102, including detectors and data received from other devices, such as devices 104 and 106.
Device 102 receives computer language encoded policy 208 that controls what function can and cannot be executed. Computer language policy 208 corresponds to policy 202 that is written by a stakeholder, regulatory agency, government officials, and the like. Alternatively, policy 202 is user defined, such as a temperature limit for a coffee maker. Policy 202 is written to include rules and directives for device 102. Policy 202 should be written in “plain language,” such as English, Spanish, French, Chinese, Japanese and the like.
Policy authoring tool 204 allows authenticated and authorized stakeholders to create and modify documents pertaining to policy 202. Further, policy authoring tool 204 includes policy analysis and validation tools that analyze the impact of constraints of policy 202 and validate their correctness. Policy authoring tool 204 generates computer language policy 208 by translating policy 202 into a policy language, as disclosed below. Policy authoring tool 204 also helps verify that computer language policy 208 correctly represents the intended meaning of policy 202, which may be open to interpretation.
Computer language policy 208 represents a semantic language for expressing policies and logic used for guiding operation of software-defined devices. The main purpose of using computer language policy 208 is to allow regulators, operators and users to define requirements for controlling operations using a policy-driven evidential approach that are interpretable by machines. Computer language policy 208 defines the concepts for expressing knowledge about device 102. Computer language policy 208 also defines concepts for expressing restrictions on device 102, and defines concepts for combining the restrictions and definitions into rules and restrictions.
Computer language policy 208 provides an interoperable, machine independent language for expressing information that is processed by humans and by machines. Computer language policy 208 comprises ontologies, which defines vocabulary for representing meaning of a subset of domain-dependent terms and the relationships between those terms. Using these ontologies, computer language policy 208 annotates information that is shared and used to infer additional information across heterogeneous domains, applications and platforms.
Additionally, computer language policy 208 also employs concepts from Deontic logic for expressing actions that device 102 can undertake. Computer language policy 208 may implement on two concepts, permissions and prohibitions. Permission defines what device 102 is allowed to do and the constraints that device 102 must satisfy. Prohibition, on the other hand, defines a situation when device 102 is forbidden from taking a specific action.
Policy 202 defines a collection of facts and constraints that can be used for deciding whether a policy is applicable to the current state of device 102. Policy 202, for example, may control access to the spectrum for device 102. Policy 202 also defines whether it allows or denies device 102 use of the spectrum when its conditions are met. Preferably, policy 202 includes three sections. The first section may refer to a meta-definition for allowing a policy component to determine when policy 202 is applicable and how it impacts device 102. The second section may refer to a set of information that policy 202 depends on. The third section may refer to rules and directives for determining when device 102 either meets or violates the requirements of policy 202.
Device 102 may operate over multiple concurrently applicable policies. For example, device 102 may have policies from two regulators, each regulating one spectrum band that device 102 operates in. Moreover, some policies may overlap for same frequency band where device 102 is attempting to transmit. Computer language policy 208, therefore, defines vocabulary for creating meta-level policies. Meta-level policies are used for guiding the operation of access control policies, such as guiding permissive and prohibitive policies. The meta-level vocabulary defines constructs for de-conflicting overlapping policies.
The computer policy language 208 may depend on any de-confliction logic. For example, a default de-confliction rule of computer language policy 208 states that a prohibitive policy overrides a permissive policy. The meta-level vocabulary, however, allows absolute and relative prioritization of policies to be defined, thus overriding the default rule. Computer language policy 208 defines vocabulary for assigning numeric priority levels to policies. Computer language policy 208 also defines vocabulary for relative ordering policies by defining relationships between pairs of policies.
In addition to policies, computer language policy 208 also defines vocabulary for expressing knowledge about states and capabilities of device 102. Using this vocabulary, computer language policy 208 defines, expresses and enters additional information about different devices and their capabilities. The vocabulary include terms for expressing states for each functional aspect of device 102, such as an operational configuration of a transmitter in terms of power and frequency as well as history of collected detections from detectors 290, or time, location, frequency, power, signals and the like.
Computer language policy 208 also defines vocabulary for expressing conditions on the states of radio device and for representing computer-understandable rules. Computer language policy 208 allows one to define policy 202 for controlling spectrum access by specifying the desired states of device 102, collected supporting evidence for decision making and by restricting undesired situations.
Policy administration console 206 allows an operator within network environment 100, for example, to communicate with device 102 and other devices. Each operator may be assigned at least one form of a security object for authenticating its messages. When an operator within network environment 100 desires to send a message 209 to device 102, policy administration console 206 creates a specific command according to a predefined format. Policy administration console 206 sends message 209 to device 102 over a secure link where message 209 is recognized as either a policy command or query, and sent to policy manager 210 for processing.
Each command or reply element of message 209 defines specific commands or responses supported by policy manager 210 located on device 102. An element may include a unique message identifier, timestamp, sender identity and intended recipient identity. For commands, the element also may include a method or process specifying the type and the content of a command. For feedback response from device 102, the element includes a unique message reply identifier, an error or an “ok” element, and an optional data element populated with requested content.
Policy manager 210 acts as a gateway to controller 116 located on radio 102. Policy manager 210 checks message 209 for security by validating authentication and authorization of command issuers and sources. The identity of the issuer, the sender and the destination is included in message 209.
Policy manager 210 verifies the integrity of a command, the authenticity of the sender, the authorization of the sender to issue such a command, authenticity of the receiver and the timeliness of a command for avoiding reply attacks. If policy manager 210 is able to verify that message 209 should be processed, then policy manager 210 checks the type of message in order to either adjust the policy component state or to answer specific policy-related questions.
Policy manager 210 accesses a persistent storage as policy database 212 to receive policies and to load active policies into policy conformance reasoner (PCR) 214. Policy manager 210 also supports multiple policy configuration modes. Each configuration mode represents a set of policies that are applied when the configuration mode is “activated.” Preferably, one mode is activated at a time and the active mode is indicated as “running.” Configuration mode 216 represents the running policy configuration mode in
Thus, policy manager 210 allows operators to add and remove policies, such as policy 202, from any configuration mode. When a configuration mode is not specified, the current running mode is assumed by default. Policy manager 210 also allows operators to switch between modes. When the mode changes, all policies belonging to the previous mode are unloaded and all policies from the new mode are loaded and activated. By switching a mode, policy administrators, stakeholders, and the like can quickly switch between a set of policies for device 102.
Policy manager 210 also allows operators to query the state of each configuration mode. Unless declared otherwise, the current running mode, such as configuration mode 216, is assumed by default. Configuration mode 216 is associated with a set of decisions, complaints, conflicts, and the overall status of policy manager 210 to allow operators to monitor the integrity of their systems, or device 102.
Message 209 may include a command that impacts running configuration mode 216. Either policy 202 may have been added or removed from the mode or another mode may have been activated. Thus, policy manager 210 is responsible for activating the right set of policies inside PCR 214 for controller 116.
PCR 214 acts as a local policy decision unit. PCR 214 parses and validates a policy available to device 102, and checks that the policy conforms to any policy language definitions. PCR 214 also verifies that validity of the policy by examining its meta-description. Once validated, PCR 214 converts the policy into its internal representation. PCR 214 extracts the data defined inside the policy document as well as extracts and optimizes the constraint rules defined by the policies.
PCR 214 orders all active policies based on decreasing importance. This action is desired for reducing the workload for policy conformance reasoner 214 to reach a decision on approving or denying a specific transmission request from device 102 as well as for computing available spectrum access opportunities.
Thus, PCR 214 dynamically merges and de-conflicts policies as they are made available to radio 102. De-confliction actions apply a default rule for breaking ties between permissive and prohibitive policies, numerical priority levels assigned to policies, and relative policy ordering. In the event of one permissive policy and another permissive policy being more important than each other, such as creating a cycle, the default rule guarantees that a prohibitive policy takes precedence over a permissive policy, and avoids potentially harmful interference by denying instead of allowing a request. PCR 214 also computes decisions allowing or denying transmissions based on requests originated from policy enforcer 218.
Policy enforcer 218 periodically evaluates the current state of device 102 and the logical channels employed by optimizer 114. For each channel, policy enforcer 218 maintains a set of pre-approved device states that optimizer 114 matches in order to be permitted to transmit. Alternatively, for each channel, policy enforcer 218 inquires if the current state for that channel would be approved using PCR 214. Policy enforcer 218 maintains the decision caches to limit the amount of work needed from the computation-intensive PCR 214. Policy enforcer 218 pro-actively monitors channels optimizer 114 is attempting to use as well as enforcing that transmissions originating at optimizer 114 fully satisfy policy requirements.
The primary function of policy enforcer 218 is to stop actions whose effects would violate policies. For example, policy enforcer avoids harmful interference by interrupting transmission commands sent to modem 280 on device 102. To enable this function, policy enforcer 218 maintains a set of pre-approved state models based on configuration policies and associated validity time periods. During an adjustable time period, policy enforcer 218 assumes that the pre-approved device state would be approved. The time period can range from zero (0) to several hours.
Components housed in remote controller 302 include policy manager 304, which corresponds to policy manager 210 of
Device 102 still includes PCR 214, as disclosed above. PCR 214 interacts with PCR 308 to ensure that they contain identical information. Remote controller 302 uses device proxy 310 to synchronize reasoner 308 with reasoner 214. Preferably, PCR 214 is updated with the contents of policy conformance reasoner 308 when updates or additions are made to existing policies via policy manager 304.
After a new or modified policy is received in a computer-readable form, policy manager 304 verifies the message containing the instruction and adjusts the policy component state or answers an inquiry. Policy manager 304 provides a persistent storage for policies, but at remote controller 302 instead of device 102.
Another task of policy manager 304 is loading active policies into policy conformance reasoner 308. As disclosed above with regards to
The active policy held by policy conformance reasoner 308 is loaded into PCR 214. Device proxy 310 copies or synchronizes the data in PCR 308 to PCR 214. Preferably, device proxy 310 copies the contents of policy PCR 308 into multiple PCRs 214 on a plurality of devices. Thus, a large number of downloads and resources can be sent to software-defined radio using only remote controller 302.
Using the components of radio 102 of
Step 406 executes by updating existing policies in computer-readable form on the files stored on device 102. Thus, the subject matter of policy 202 modifies an existing policy configuration mode for device 102, adds a new mode or possibly deletes a mode. If device 102 stores a plurality of configuration modes using policy manager 210, then these files are modified by the downloading of computer-readable language policy 208 to device 102.
Step 408 executes by compiling outgoing data into a transmission. Device 102 wants to send a message or signal within network environment 100. Step 410 executes by generating a command to send the transmission. Optimizer 114 attempts to send a transmit command to tuner/modem 280. Optimizer 114 could generate a command to any component on device 102, and is not limited to transmit commands. The command may pertain to any policy-based control of a device.
Step 412 executes by interrupting the command from optimizer 114 by policy enforcer 218. Policy enforcer 218 performs an analysis of the command to determine whether it should be aborted or executed. Step 414 executes by collecting information about the states of device 102. The information may pertain to any aspect of device 102: Step 414 also may collect information about network environment 100 using detectors 290.
Step 414 also compares the current state of device 102, which includes current configuration, capabilities and results, against pre-approved states. Device 102 maintains state information for its components, such as its transmitter, receiver, signal detectors, location detectors, time detectors, owners, certifications and the like. States of a transmitter include frequency, power, bandwidth, throughput quality and the like. States of a receiver includes average power, bandwidth, frequency, signal-to-noise ratio and the like. All of these components and states are evaluated by policy enforcer 218.
Step 416 executes by finding a matching cached decision with policy enforcer 218. A decision to execute the command may have been made previously based on the current state information collected in step 414. If so, then policy enforcer 218 can bypass the evaluation of the states and the corresponding policies to determine whether to abort or execute the command.
Step 418 executes by determining whether the appropriate cached decision was found. If yes, then step 440 is executed using the approving value of the decision. If the cache shows that a previous matching request was approved, then the command is also approved. Otherwise, the command is aborted.
If step 418 is no, then policy enforcer 218 constructs of full petition request and associates the request with the current snapshot of the states of device 102. Thus, step 420 is executed by constructing the petition request. Policy enforcer 218 uses the current snapshot to represent the capabilities, configuration states and evidence for each component present on device 102. Because some data is fairly static, this information may be pre-loaded inside upon start-up or component change. Policy enforcer 218 may choose to not provide static information with each petition request. Policy enforcer 218 sends the petition request to policy conformance reasoner 214.
Step 422 executes by evaluating existing policies in view of the petition request. Policy conformance reasoner 214 evaluates the petition request against the ordered list of policies based on decreasing performance. For each policy stored by policy manager 210, policy conformance reasoner 214 checks the requirement constraints to decide whether the policy is applicable to the petition. If the policy is applicable and if its rules are met, then policy conformance reasoner 214 uses that policy as the decisive one in granting the petition request.
Each rule associated with the policy, such as policy 202, represents a set of logical and computational constraints on any capability, configuration state or evidence collected by device 102. A rule may consider up to several dozen of the state parameters and comparison and computational operations over the state parameters.
Step 424 executes by evaluating the content of rules of the policy found in step 422 in order to generate an approval or denial of the petition request. The policy found by policy conformance reasoner 214 is used to see if the petition should be approved. Because the policy list is ordered by decreasing priority, further analysis of policies is not necessary. Further, no policy with a higher priority can override the decision made by the policy chosen by policy conformance reasoner 214.
If the policy is permissive, then the petition is approved. If the policy is prohibitive and its rule is satisfied, then the petition is denied. In other words, if a policy prohibits a behavior, and the current states of device 102 meets the conditions for the behavior, then policy conformance reasoner 214 will deny the petition. If a policy permits a behavior, and its conditions are met, then the petition is granted to execute the desired function.
Step 426 executes by associating a time period with the petition. The time period is predefined. Step 428 executes by caching the decision by policy enforcer 218. The decision is returned to policy enforcer 218. Policy enforcer 218 caches the decision for the time period of step 426.
Step 440 executes by determining whether to approve the command. This step is performed by looking at the cached decision after the time period has lapsed or reviewing the matching decision found in step 416. Policy enforcer 218 decides whether to let device 102 proceed with the command from optimizer 114. If step 440 is yes, then step 442 executes by executing the command. If step 440 is no, then step 444 executes by aborting the command. Policy enforcer 218 informs device 102 and optimizer 114 of its decision.
For example, device 102 desires to transmit a signal. After preparing, or compiling the data for the signal, device 102 orders optimizer 114 to determine whether the current frequency spectrum is available for signal transmission. Policy enforcer 218 interrupts the command to transmit to determine whether executing the command would violate a regulatory, stakeholder, user or other policy. If a transmission violates a prohibitive policy, then policy conformance reasoner 214 identifies the policy from the list of existing policies. Recent modifications to the policy are reflected by translating the human readable policy into a computer-readable language one.
Information collected by device 102 and detectors 290 provides a snapshot of the current states and conditions used to evaluate whether the policy is violated. Policy conformance reasoner 214 of controller 116 converts the evaluation into an acceptance or denial of the petition. Policy enforcer 218 receives the acceptance or denial, and then acts to execute or abort the command accordingly.
In addition to permitting spectrum access, the policies loaded onto device 102 are used to determine spectrum access opportunities. This feature allows optimizer 114 to recognize automatically newly available channels and requirements that optimizer 114 should meet prior to transmitting on the channels.
Step 502 executes by constructing a request to find spectrum access opportunities. Optimizer 114 prepares an opportunity selection request, which is similar to a transmission petition request disclosed in
Step 506 executes by evaluating existing policies. Policy conformance reasoner 214 evaluates the request against locally available policies to discover missing values of unpopulated constraints, also referred to as parameters, which would render a valid request. For example, a policy includes constraints on transmission frequencies, whereas the request does not list one. Step 508 executes by identifying constraints, or parameters, not included in the request. In other words, policy conformance reasoner 214 identifies any missing parameters regarding the states of device 102, if possible, which are necessary for approving the device state for transmission.
For example, policy conformance reasoner 214 may conclude for the submitted configuration of the request to be approved, the transmission center frequency should be either 5180 MHz or 2310 MHz. As noted above, optimizer 114 did not list a transmission frequency in its request. An evaluated policy lists these constraints on transmission frequency, and the restrictive nature of the constraints needs to be accounted for.
Step 510 executes by populating the constraints with parameter values according to the policy. The constraints are used to fill out the request with potential values so as to provide possible values for transmission frequency that will not violate a policy. Policy conformance reasoner 214 adds the possible frequencies as constraints to the request.
Step 512 executes by determining whether an opportunity or opportunities were found. If yes, then step 514 executes by translating the identified opportunity into a state. In this scenario, policy conformance reasoner 214 provides a list of two “opportunities” for workable transmission frequencies. The identified opportunities are translated into two device states. One state represents a configuration of device 102 with a transmission frequency set to 5180 MHz. The other state represents another configuration with a transmission frequency set to 2310 MHz. The converted device states are returned to optimizer 114.
Step 516 executes by evaluating the opportunity for a favorable condition. Device 102 is provided parameters, such as transmission frequencies, to consider when determining available spectrum. By evaluating the two opportunities, optimizer 114 can conclude that it needs to monitor for non-cooperative signals at either frequency to be allowed to transmit at the frequencies, and adjusts its detector configuration on device 102 accordingly.
If step 512 determines no opportunity was found, then step 520 executes by determining whether to keep searching. Situations arise when policy conformance reasoner 214 fails to find or fully populate an opportunity. Further, if the request does not match any policy or if it violates a policy, then no opportunity is found. A constraint, or parameter, however, may not be bound if there is an unbound, or limitless, set of possible values. For example, while a value may be restricted to a certain range within the United States, it would be very expensive to bind a device's position to be within the continental United States depending on the accuracy of the detector.
Therefore, if step 520 is yes, then step 522 executes by narrowing the request domain. The step 522 may narrow the request by providing additional state parameter values or by selectively providing different capabilities at a time. The process returns to step 502 to retry finding an opportunity. If no, then step 524 executes by aborting the opportunity discovery process. In most cases, policy conformance reasoner 214 will find a spectrum opportunity, but situations will arise when it is unable to do so.
Thus, policy-based control of a device is disclosed that ensures that the device does not violate policies. The policies are encoded in a declarative language and define regulatory and other stakeholder requirements. Because regulators and stakeholders are not able to certify every state of a device, the disclosed embodiments move the certification and policy enforcement processes closer to the software-defined components of the device. A policy component represents an official regulatory proxy agent that enforces operations on behalf of the regulators based on their ever-changing and dynamic rules and requirements.
Policy-based control is not limited to stakeholders or regulators, but also may include operators or users themselves. Operators or users could have an interest to prevent the device from violating a policy they set with the device to ensure product safety and operability. As more and more devices for everyday use incorporate software, controller software components can monitor and enforce the policies used to ensure the safety and operability. The disclosed embodiments can facilitate the use of the software components in the devices that are not radios seeking spectrum access.
For example, referring to the coffee maker scenario disclosed above, the disclosed embodiments can ensure the coffee maker device follows policies. A policy might include limits on temperature applied to water in the coffee maker, such as preventing the water from going over a boiling point so as to not burn someone using the device. Thus, any command given to raise the temperature of the water over 100 degrees Celsius is aborted by the controller software component on the coffee maker. Another policy may limit the amount of coffee made in a given day. If the limit is reached, then the coffee maker may not be operated until cleaned or checked.
If a regulatory agency or commission issues new rules regarding the safety of coffee makers, then a user may download a policy update from an external server onto the coffee maker. One method of downloading the update is storing the update on flash memory that is connected to the coffee maker. The coffee maker could then run a program to look for new policies for its components. The policies would be translated into a language understandable by the software components within the coffee maker.
For example, the updates may lower the maximum temperature allowable for the coffee maker from 100 degrees Celsius to 90 degrees Celsius to better prevent burns and injuries. This “policy” is translated. The coffee maker then downloads the new policy in a readable format and updates its controller components accordingly. The next morning, a user sets the temperature to 95 degrees Celsius and the coffee maker interrupts the heating processing to abort heating to the requested temperature. Alternatively, the coffee maker may stop applying heat to the water when 90 degrees Celsius is reached. The policy of not heating water to above the new limit is enforced.
The above process with the coffee maker is achieved without returning the device to the manufacturer or store. Instead, users may download the updates from a website, or media storage such as a disk. The updates are fast and simpler that returning the entire device for a hardware fix.
It will be apparent to those skilled in the art that various modifications and variations can be made in the disclosed embodiments of the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention covers the modifications and variations of the embodiments disclosed above provided that they come within the scope of any claims and their equivalents.
This application is a continuation of U.S. application Ser. No. 11/783,563, filed Apr. 10, 2007, which claims priority to U.S. Provisional Application No. 60/877,656, filed on Dec. 29, 2006.
This invention was made with Government support under Contract FA8750-05-C-0150 awarded by the Air Force. The Government has certain rights in this invention.
Number | Name | Date | Kind |
---|---|---|---|
3893064 | Nishihara | Jul 1975 | A |
3935572 | Broniwitz | Jan 1976 | A |
4107613 | Queen | Aug 1978 | A |
4119964 | Fletcher | Oct 1978 | A |
4227255 | Carrick | Oct 1980 | A |
4305150 | Richmond | Dec 1981 | A |
4398220 | Satoh | Aug 1983 | A |
4501020 | Wakeman | Feb 1985 | A |
4672657 | Dershowitz | Jun 1987 | A |
4736453 | Schloemer | Apr 1988 | A |
4783780 | Alexis | Nov 1988 | A |
4803703 | DeLuca | Feb 1989 | A |
4878238 | Rash | Oct 1989 | A |
4881271 | Yamauchi | Nov 1989 | A |
4918730 | Schulze | Apr 1990 | A |
4977612 | Wilson | Dec 1990 | A |
5040238 | Comroe | Aug 1991 | A |
5065334 | Taylor | Nov 1991 | A |
5093924 | Toshiyuki | Mar 1992 | A |
5093927 | Shanley | Mar 1992 | A |
5142691 | Freeburg | Aug 1992 | A |
5151747 | Nourrcier | Sep 1992 | A |
5155590 | Beyers, II | Oct 1992 | A |
5162937 | Heidemann | Nov 1992 | A |
5177604 | Martinez | Jan 1993 | A |
5177767 | Kato | Jan 1993 | A |
5177804 | Shimizu | Jan 1993 | A |
5179722 | Gunmar | Jan 1993 | A |
5203012 | Patsiokas | Apr 1993 | A |
5225902 | McMullan, Jr. | Jul 1993 | A |
5239676 | Strawczynski | Aug 1993 | A |
5247701 | Comroe | Sep 1993 | A |
5260974 | Johnson | Nov 1993 | A |
5271036 | Lobert | Dec 1993 | A |
5276906 | Felix | Jan 1994 | A |
5276908 | Koohgoli | Jan 1994 | A |
5325088 | Willard | Jun 1994 | A |
5375123 | Andersson | Dec 1994 | A |
5402523 | Berg | Mar 1995 | A |
5410737 | Jon Es | Apr 1995 | A |
5412658 | Arnold | May 1995 | A |
5422912 | Asser | Jun 1995 | A |
5422930 | McDonald | Jun 1995 | A |
5428819 | Wang | Jun 1995 | A |
5448753 | Ahl | Sep 1995 | A |
5475868 | Duque-Anton | Dec 1995 | A |
5497505 | Koohgoli | Mar 1996 | A |
5502688 | Recchione | Mar 1996 | A |
5511233 | Otten | Apr 1996 | A |
5548809 | Lemson | Aug 1996 | A |
5553081 | Downey | Sep 1996 | A |
5585850 | Schwaller | Dec 1996 | A |
5608727 | Perreault | Mar 1997 | A |
5655217 | Lemson | Aug 1997 | A |
5668747 | Ohashi | Sep 1997 | A |
5748678 | Valentine | May 1998 | A |
5752164 | Jon Es | May 1998 | A |
5794151 | McDonald | Aug 1998 | A |
5822686 | Lundberg | Oct 1998 | A |
5828948 | Almgren | Oct 1998 | A |
5850605 | Souissi | Dec 1998 | A |
5862487 | Fujii | Jan 1999 | A |
5884181 | Arnold | Mar 1999 | A |
5889821 | Arnstein | Mar 1999 | A |
5939887 | Schmidt | Aug 1999 | A |
5943622 | Yamashita | Aug 1999 | A |
5950110 | Hendrickson | Sep 1999 | A |
5960351 | Przelomiec | Sep 1999 | A |
5966351 | Carleton | Oct 1999 | A |
5999561 | Naden | Dec 1999 | A |
6011970 | McCarthy | Jan 2000 | A |
6044090 | Grau | Mar 2000 | A |
6047175 | Trompower | Apr 2000 | A |
6049707 | Buer | Apr 2000 | A |
6049717 | Dufour | Apr 2000 | A |
6141557 | Dipiazza | Oct 2000 | A |
6147553 | Kolanek | Nov 2000 | A |
6154501 | Friedman | Nov 2000 | A |
6157811 | Dent | Dec 2000 | A |
6167811 | Walters | Jan 2001 | B1 |
6178328 | Tang | Jan 2001 | B1 |
6188873 | Wickman | Feb 2001 | B1 |
6208858 | Antonio | Mar 2001 | B1 |
6240274 | Izadpanah | May 2001 | B1 |
6269331 | Alanara | Jul 2001 | B1 |
6295289 | Ionescu | Sep 2001 | B1 |
6304140 | Thron | Oct 2001 | B1 |
6356555 | Rakib | Mar 2002 | B1 |
6380879 | Kober | Apr 2002 | B2 |
6522885 | Tang | Feb 2003 | B1 |
6526264 | Sugar | Feb 2003 | B2 |
6529715 | Kitko | Mar 2003 | B1 |
6570444 | Wright | May 2003 | B2 |
6597301 | Cerra | Jul 2003 | B2 |
6606593 | Jarvinen | Aug 2003 | B1 |
6615040 | Benveniste | Sep 2003 | B1 |
6625111 | Sudo | Sep 2003 | B1 |
6644090 | Gasparini | Nov 2003 | B2 |
6650735 | Burton | Nov 2003 | B2 |
6671503 | Niwamoto | Dec 2003 | B1 |
6675012 | Gray | Jan 2004 | B2 |
6687492 | Sugar | Feb 2004 | B1 |
6690746 | Sills | Feb 2004 | B1 |
6696746 | Farrar | Feb 2004 | B1 |
6697013 | McFarland | Feb 2004 | B2 |
6697436 | Wright | Feb 2004 | B1 |
6700450 | Rogers | Mar 2004 | B2 |
6714605 | Sugar | Mar 2004 | B2 |
6714780 | Antonio | Mar 2004 | B1 |
6728517 | Sugar | Apr 2004 | B2 |
6771957 | Chitrapu | Aug 2004 | B2 |
6785520 | Sugar | Aug 2004 | B2 |
6792268 | Benveniste | Sep 2004 | B1 |
6799020 | Heidmann et al. | Sep 2004 | B1 |
6816832 | Alanara | Nov 2004 | B2 |
6847678 | Berezdivin | Jan 2005 | B2 |
6850735 | Sugar | Feb 2005 | B2 |
6850764 | Patel | Feb 2005 | B1 |
6862456 | Sugar | Mar 2005 | B2 |
6891496 | Husted | May 2005 | B2 |
6904269 | Deshpande et al. | Jun 2005 | B1 |
6915530 | Kauffman | Jul 2005 | B1 |
6941110 | Kloper | Sep 2005 | B2 |
6949717 | Haluschka | Sep 2005 | B2 |
6952563 | Brown | Oct 2005 | B2 |
6959178 | Macedo | Oct 2005 | B2 |
6965762 | Sugar | Nov 2005 | B2 |
6990087 | Rao | Jan 2006 | B2 |
6993440 | Anderson | Jan 2006 | B2 |
7013345 | Brown | Mar 2006 | B1 |
7020451 | Sugar | Mar 2006 | B2 |
7035593 | Miller | Apr 2006 | B2 |
7054625 | Kawasaki | May 2006 | B2 |
7058383 | Sugar | Jun 2006 | B2 |
7089014 | Brown | Aug 2006 | B2 |
7116943 | Sugar | Oct 2006 | B2 |
7224752 | Sugar | May 2007 | B2 |
7227974 | Kamijo | Jun 2007 | B2 |
7254191 | Sugar | Aug 2007 | B2 |
7260156 | Krupezevic | Aug 2007 | B2 |
7269151 | Diener | Sep 2007 | B2 |
7292656 | Kloper | Nov 2007 | B2 |
7313393 | Chitrapu | Dec 2007 | B2 |
7342876 | Bellur | Mar 2008 | B2 |
7424268 | Diener | Sep 2008 | B2 |
7428270 | Dubuc | Sep 2008 | B1 |
7430254 | Anderson | Sep 2008 | B1 |
7457295 | Saunders | Nov 2008 | B2 |
7463952 | Bidou | Dec 2008 | B2 |
7483700 | Buchwald | Jan 2009 | B2 |
7532857 | Simon | May 2009 | B2 |
7564816 | McHenry | Jul 2009 | B2 |
7606335 | Kloper et al. | Oct 2009 | B2 |
7610036 | Teo | Oct 2009 | B2 |
7613148 | Hong | Nov 2009 | B2 |
7616604 | Abdelhamid | Nov 2009 | B2 |
7742764 | Gillig | Jun 2010 | B2 |
7826839 | Nicholas | Nov 2010 | B1 |
8000715 | Melpignano | Aug 2011 | B2 |
8086225 | Lee | Dec 2011 | B2 |
8326313 | McHenry | Dec 2012 | B2 |
20010013834 | Yamazaki | Aug 2001 | A1 |
20010046843 | Alanara | Nov 2001 | A1 |
20020002052 | McHenry | Jan 2002 | A1 |
20020002952 | van der lely | Jan 2002 | A1 |
20020196842 | Onggosanusi | Dec 2002 | A1 |
20030020651 | Crilly | Jan 2003 | A1 |
20030027577 | Brown | Feb 2003 | A1 |
20030081621 | Godfrey | May 2003 | A1 |
20030081628 | Sugar | May 2003 | A1 |
20030099218 | Tillotson | May 2003 | A1 |
20030165187 | Tesfai | Sep 2003 | A1 |
20030181173 | Sugar | Sep 2003 | A1 |
20030181211 | Razavilar | Sep 2003 | A1 |
20030181213 | Sugar et al. | Sep 2003 | A1 |
20030198200 | Diener et al. | Oct 2003 | A1 |
20030203743 | Sugar | Oct 2003 | A1 |
20040002367 | Chanut | Jan 2004 | A1 |
20040005858 | Cervinka | Jan 2004 | A1 |
20040017268 | Rogers | Jan 2004 | A1 |
20040023674 | Miller | Feb 2004 | A1 |
20040028003 | Diener | Feb 2004 | A1 |
20040047324 | Diener | Mar 2004 | A1 |
20040072546 | Sugar | Apr 2004 | A1 |
20040121753 | Sugar | Jun 2004 | A1 |
20040136466 | Tesfai | Jul 2004 | A1 |
20040137915 | Diener | Jul 2004 | A1 |
20040142696 | Saunders | Jul 2004 | A1 |
20040199793 | Wilken | Oct 2004 | A1 |
20040203474 | Miller | Oct 2004 | A1 |
20040203826 | Sugar | Oct 2004 | A1 |
20040219885 | Sugar | Nov 2004 | A1 |
20040233972 | Karaoguz | Nov 2004 | A1 |
20040253963 | Park | Dec 2004 | A1 |
20040259563 | Morton | Dec 2004 | A1 |
20050164648 | Gannholm | Jan 2005 | A1 |
20050070294 | Lyle | Mar 2005 | A1 |
20050119006 | Cave | Jun 2005 | A1 |
20050192011 | Hong | Sep 2005 | A1 |
20050192016 | Zimmermann | Sep 2005 | A1 |
20050213560 | Duvvury | Sep 2005 | A1 |
20050213580 | Mayer | Sep 2005 | A1 |
20050213763 | Owen | Sep 2005 | A1 |
20050270218 | Chiodini | Dec 2005 | A1 |
20060015674 | Murotake | Jan 2006 | A1 |
20060075467 | Sanda | Apr 2006 | A1 |
20060126536 | Patel et al. | Jun 2006 | A1 |
20060153281 | Karlsson | Jul 2006 | A1 |
20060161428 | Fouret | Jul 2006 | A1 |
20060211395 | Inaltho | Sep 2006 | A1 |
20060220944 | Ikeda | Oct 2006 | A1 |
20060234716 | Vesterinen | Oct 2006 | A1 |
20060246836 | Simon | Nov 2006 | A1 |
20060247505 | Siddiqui | Nov 2006 | A1 |
20060267259 | Hatakeyama | Nov 2006 | A1 |
20060270371 | Sugar | Nov 2006 | A1 |
20070004358 | Moorti | Jan 2007 | A1 |
20070008875 | Gerhardt | Jan 2007 | A1 |
20070019603 | Gerhardt | Jan 2007 | A1 |
20070046467 | Chakraborty | Mar 2007 | A1 |
20070047474 | Anderson | Mar 2007 | A1 |
20070047494 | Cordone | Mar 2007 | A1 |
20070053410 | Mahonen | Mar 2007 | A1 |
20070076745 | Manjeshwar | Apr 2007 | A1 |
20070078924 | Hassan | Apr 2007 | A1 |
20070091839 | Abdelhamid | Apr 2007 | A1 |
20070091998 | Woo | Apr 2007 | A1 |
20070100922 | Ashish | May 2007 | A1 |
20070165577 | Baker | Jul 2007 | A1 |
20070165664 | Gerhardt | Jul 2007 | A1 |
20070165695 | Gerhardt | Jul 2007 | A1 |
20070173199 | Sinha | Jul 2007 | A1 |
20070180490 | Renzi | Aug 2007 | A1 |
20070183338 | Singh | Aug 2007 | A1 |
20070217371 | Sinha | Sep 2007 | A1 |
20070248061 | Poston | Oct 2007 | A1 |
20070253394 | Horiguchi | Nov 2007 | A1 |
20070254596 | Corson | Nov 2007 | A1 |
20080010040 | McGehee | Jan 2008 | A1 |
20080014880 | Hyon | Jan 2008 | A1 |
20080022355 | Khosravi | Jan 2008 | A1 |
20080031143 | Ostrosky | Feb 2008 | A1 |
20080069079 | Jacobs | Mar 2008 | A1 |
20080113667 | Seidel | May 2008 | A1 |
20080192864 | Szajnowski | Aug 2008 | A1 |
20080222724 | Ormazabal | Sep 2008 | A1 |
20080228446 | Baraniuk | Sep 2008 | A1 |
20080259859 | Cordeiro | Oct 2008 | A1 |
20080261537 | Chen | Oct 2008 | A1 |
20080267259 | Budampati | Oct 2008 | A1 |
20080284648 | Takada | Nov 2008 | A1 |
20090040986 | Cordeiro | Feb 2009 | A1 |
20090074033 | Kattwinkel | Mar 2009 | A1 |
20090161610 | Kang | Jun 2009 | A1 |
20090190508 | Kattwinkel | Jul 2009 | A1 |
20090252178 | Huttunen | Oct 2009 | A1 |
20100008312 | Viswanath | Jan 2010 | A1 |
20100091701 | Youn et al. | Apr 2010 | A1 |
20100220618 | Kwon | Sep 2010 | A1 |
20100296076 | Jiang | Nov 2010 | A1 |
20100296078 | Forrer | Nov 2010 | A1 |
20110051645 | Hong | Mar 2011 | A1 |
20140119244 | Steer et al. | May 2014 | A1 |
Number | Date | Country |
---|---|---|
1220499 | Jul 2002 | EP |
1571861 | Sep 2005 | EP |
2260879 | Apr 1993 | GB |
2004054280 | Jun 2004 | WO |
WO2004054280 | Jun 2004 | WO |
2006101489 | Sep 2006 | WO |
2007034461 | Mar 2007 | WO |
2007058490 | May 2007 | WO |
WO2007058490 | May 2007 | WO |
2007094604 | Aug 2007 | WO |
2007096819 | Aug 2007 | WO |
WO2007094604 | Aug 2007 | WO |
WO2007096819 | Aug 2007 | WO |
2007108963 | Sep 2007 | WO |
2007108966 | Sep 2007 | WO |
2007109169 | Sep 2007 | WO |
2007109170 | Sep 2007 | WO |
WO2007108963 | Sep 2007 | WO |
WO2007108966 | Sep 2007 | WO |
WO2007109169 | Sep 2007 | WO |
WO2007109170 | Sep 2007 | WO |
Entry |
---|
European Patent Office, European Examination Report in Application No. PCT/US2007/022356, dated Oct. 30, 2013. |
Mahbubani et al., “Dynamic channel allocation in wireless ad-hoc networks” May 10, 2006, pp. 1-12. |
Project: IEEE P802.15 working group for wireless personal area networks (WPANs), Jun. 2007, pp. 1-25. |
International Search Report dated Oct. 6, 2008, issued in corresponding International Application No. PCT/US07/22356, filed Oct. 19, 2007. |
International Search Report dated Feb. 8, 2002, issued in corresponding International Application No. PCT/US01/14853. |
International Search Report dated Mar. 18, 2008, issued in corresponding International Application No. PCT/US07/11414. |
International Search Report dated Sep. 28, 2009, issued in corresponding International Application No. PCT/US08/073194. |
International Search Report dated Feb. 14, 2008, issued in corresponding International Application No. PCT/US07/21940. |
Ditri, Dynamic spectrum access moves to the forefront, 2008. |
McHenry, XG DSA Radio System, New Frontiers in Dynamic Spectrum Access Networks, 2008. |
Perich, Experimental Field Test Results on Feasibility of Declarative Spectrum Management, 3rd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2008. |
Tenhula, Update on XG and Follow-on Programs: Cognitive Radio for Tactical and Public Safety Communications, 2008. |
International Search Report and Written Opinion, dated Oct. 6, 2008, issued in corresponding International Application No. PCT/US07/22356, filed Oct. 19, 2007. |
Texas Instruments, “WL127x Hardware Design Guide,” available at http://processors.wiki.ti.com/index.php/WL127x_Hardware_Design_Guide, Jan. 2010 (last visited Dec. 5, 2016). |
Magdalena Sánchez Mora, “Experiences in the Co-Design of Software and Hardware Elements in a SDR Platform,” Proceedings of the SDR '08 Technical Conference and product Exposition, 2008. |
Ditri et al., “Dynamic spectrum access moves to the forefront,” RFDesign, Apr. 2008. |
McHenry et al, “XG DSA Radio System,” 3rd IEEE Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN 2008), Oct. 2008. pp. 1-11. |
Perich et al, Experimental Field Test Results on Feasibility of Declarative Spectrum Management, 3rd IEEE Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN 2008), Oct. 2008, pp. 1-10. |
Tenhula, Update on XG and Follow-on Programs: Cognitive Radio for Tactical and Public Safety Communications, Jun. 2008. |
Tenhula et al., “Policy-Based Spectrum Access Control for Public Safety Cognitive Radio Systems,” Shared Spectrum Company, 2008. |
Erpek, Location-based Propagation Modeling for Opportunistic Spectrum Access in Wireless Networks, Dec. 7, 2007. |
Perich, Policy-Based Network Management for NeXt Generation Spectrum Access Control, 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN 2007), Apr. 2007, pp. 496-506. |
Seelig, A Description of the Aug. 2006 XG Demonstrations at Fort A.P. Hill, 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN 2007). Apr. 2007, pp. 1-12. |
Shared Spectlum Company, Products, 2007. |
SSC, Shared Spectrum Company to Demonstrate XG Radio Technology at IEEE DySPAN Conference, Apr. 9, 2007. |
Shared Spectrum Company, “Thales Communications and Shared Spectrum Company Team to Add Dynamic Spectrum Access Technology to Military Radios,” Dec. 2007, pp. 1-2. |
Steadman et al, Dynamic Spectrum Sharing Detectors, 2nd IEEE lntemational Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN 2007), Apr. 2007, pp. 276-282. |
Zeng et al, Maximum-Minimum Eigenvalue Detection for Cognitive Radio, IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC'07), Sep. 3, 2007, pp. 1-5. |
McHenry, “Adaptive Spectrum Technology: Findings From the DARPA XG Project,” Shared Spectrum Company, Software Radio Summit, Feb. 23, 2007. |
McHenry et al, XG dynamic spectrum access field test results [Topics in Radio Communications], IEEE Communications Magazine, Jun. 2007, pp. 51-57, v: 45, n: 6. |
McHenry et al, Creation of a Spectrum Sharing Innovation Test-Bed and the President?s Spectrum Policy Initiative Spectrum Sharing Innovation Test-Bed, Jul. 2006. |
SSC, Shared Spectrum Company Successfully Demonstrates neXt Generation (XG) Wireless Communications System, Sep. 18, 2006. |
Tenhula, Shared Spectrum Company Successfully Demonstrates Next Generation (XG) Wireless System, Sep. 20, 2006. |
Anticipated XG VIP Demo Invitees, Jun. 28, 2006. |
Tenhula, Dynamic Spectrum Sharing Bid, Lease and MVNO/MVNE: Spectrum Options for Operators, WCA 2006. Jun. 29, 2006. |
Tenhula,“Secondary Markets and Spectrum Leasing”, UTC Telecom 2006, Tampa, FL, May 23, 2006. |
Zheng et al, Device-centric spectrum management, 2005 First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN 2005), Nov. 8, 2005, pp. 56-65. |
Ackland et al., “High Performance Cognitive Radio Platform with Integrated Physical and Network Layer Capabilities,” Network Centric Cognitive Radio, Jul. 2005, pp. 1-13. |
Leu et al, Ultra sensitive TV detector measurements, 2005 First IEEE International Sympusium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN 2005), Nov. 2005, pp. 30-36. |
McHenry, The probe spectrum access method, 2005 First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Nelworks (DySPAN 2005), Nov. 8, 2005, pp. 346-351. |
Ramanathan and Partridge, Next Generation (XG) Architecture and Protocol Development (XAP), Final Technical Report, Aug. 2005. |
Steenstrup, “Channel Selection among Frequency-Agile Nodes in Multihop Wireless Networks.” Clemson University and Stow Research LLC, 2005, pp. 1-5. |
Zhao et al, Distributed coordination in dynamic spectrum allocation networks, 2005 First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN 2005), Nov. 8, 2005, pp. 259-268. |
McHenry, “Dynamic Spectrum Sharing,” Presentation to IEEE Communcations Society, 2005. |
The International Search Report and Written Opinion, dated Oct. 6, 2008, issued in corresponding International Application No. PCT/US07/22356, filed Oct. 19, 2007. |
Ramanathan et al, Next Generation (XG) Architecture and Protocol Development (XAP), Final Technical Report, Aug. 2005. |
Dynamic Spectrum Sharing, Presentation, Jan. 25, 2005, 75 pages. |
International Search Report and Written Opinion, dated Feb. 8, 2002, issued in corresponding International Application No. PCT/US01/14853. |
International Search Report and Written Opinion, dated Mar. 19, 2008, issued in corresponding International Application No. PCT/US07/11414. |
International Search Report and Written Opinion, dated Sep. 28, 2009, issued in corresponding International Application No. PCT/US08/073194. |
International Search Report and Written Opinion, dated Feb. 14, 2008, issued in corresponding International Application No. PCT/US07/21940. |
Project: IEEE P802.15 working group for wireless personal area Network (WPANs), Jun. 2007, pp. 1-25. |
Supplementary European Search Report in the European Application No. 01 945944 dated Apr. 24, 2009. |
Cabric et al.,“Implementation issues in spectrum sensing for cognitive radios”, Signals Systems and Computers, 2004. Conference record of the 38th Asilomar Conference on Pacific Grove, CA, USA, Nov. 7-10, 2004, NJ, USA, vol. 1, pp. 772-776, sections I-IV, Nov. 7, 2004. |
Ning Han, Sunghwan Shon, Jae Hak Chung, Jae Moung Kim, “Spectral correlation based signal detection method for spectrum sensing in IEEE 802.22 WRAN systems”, Advanced Communication Technology, 2006. ICACT 2006. The 8th International Conference, Piscataway, NJ, USA, vol. 3, ISBN 89-5519-129-4, (Feb. 20, 2006), pp. 1765-1770, URL: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1625936, (May 15, 2009), XP002528460. |
Falconer et al, Frequency Domain Equalization for Single-Carrier Broadband Wireless Systems, IEEE communications Magazine, Apr. 2002, pp. 58-66, v: 40, n: 4. |
Rohde et al.,“RF/Microwave Circuit Design for Wireless Applications”, published by Wiley-Interscience, Mar. 2000, pp. 1-2. |
WIPO,“International Search Report”, for Application No. PCT/US04/17883 filed Jun. 9, 2004, dated Mar. 25, 2005. |
European Patent Office, European Examination Report in Application No. PCT/US2007022356, dated Oct. 30, 2011. |
PCT Office Communication in the PCT application No. PCT/US2008/073193 dated Jun. 2, 2009. |
Han et al, Spectral correlation based signal detection method for spectrum sensing in IEEE 802.22 WRAN systems, The 8th International Conference of Advanced Communication Technology, 2006 (ICACT 2006), Feb. 20, 2006, pp. 1765-1770, v: 3. |
The International Search Report and Written Opinion, dated Mar. 19, 2008, issued in corresponding International Application No. PCT/US07/11414. |
Office Action dated Mar. 27, 2017 as received in EP Application No. 08855797.0. |
Bemthal, J.B.; Brown, T.X.; Hatfield, D.N.; Sicker, D.C.; Tenhula, P.A.; Weiser, P.J., “Trends and Precedents Favoring a Regulatory Embrace of Smart Radio Technologies,” New Frontiers in Dynamic Spectrum Access Networks, 2007. DySPAN 2007. 2nd IEEE International Symposium on, vol., No., pp. 633,648, Apr. 17-20, 2007. |
Marcus, Michael J., “Spectrum Policy for Radio Spectrum Access,” Proceedings of the IEEE , vol. 100, No. Special Centennial Issue, pp. 1685-1691, May 13, 2012. |
Cha-sik Leem; Jaiyong Lee; Hyunduk Kang; Chang-Joo Kim; Moonwon Lee; Sung-chul Kang, “Making the Best out of Spectral Efficiency; Studies on the Introduction of Open-Spectrum Policy,” Cognitive Radio Oriented Wireless Networks and Communications, 2008. CrownCom 2008. 3rd International Conference on, vol., No., pp. 1,4, May 15-17, 2008. |
DeBoer, D.R.; Cruz-Pol, S.L.; Davis, M.M.; Gaier, T.; Feldman, P.; Judge, J.; Kellermann, K.I..; Long, D.G.; Magnani, L.; McKague, D.S.; Pearson, T.J.; Rogers, A.E.E.; Reising, S.C.; Taylor, G.; Thompson, A.R.; van Zee, L., “Radio Frequencies: Policy and Management,” Geoscience and Remote Sensing, IEEE Transactions on, vol. 51, No. 10, pp. 4918-4927. |
Number | Date | Country | |
---|---|---|---|
20150189572 A1 | Jul 2015 | US |
Number | Date | Country | |
---|---|---|---|
60877656 | Dec 2006 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11783563 | Apr 2007 | US |
Child | 14636328 | US |