<node id="672245">
  <nid>672245</nid>
  <type>event</type>
  <uid>
    <user id="28475"><![CDATA[28475]]></user>
  </uid>
  <created>1705530801</created>
  <changed>1705531631</changed>
  <title><![CDATA[Ph.D. Dissertation Defense - Kyle Watters]]></title>
  <body><![CDATA[<p><span><span><strong><span>Title</span></strong><em><span>:&nbsp; </span></em><em><span>Minimizing Emissions in Directional and Highly Mobile Cognitive Radio Networks</span></em></span></span></p>

<p><span><span><strong><span>Committee:</span></strong></span></span></p>

<p><span><span><span>Dr. </span><span>Edward Coyle, ECE, Chair</span><span>, Advisor</span></span></span></p>

<p><span><span><span>Dr. </span><span>Douglas Blough, ECE</span></span></span></p>

<p><span><span><span>Dr. </span><span>Mary Ann Weitnauer, ECE</span></span></span></p>

<p><span><span><span>Dr. </span><span>David Chester, L3Harris</span></span></span></p>

<p><span><span><span>Dr. </span><span>Mostafa Ammar, CS</span></span></span></p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Minimizing Emissions in Directional and Highly Mobile Cognitive Radio Networks ]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[<p>The objective of the proposed research is focused on low probability of detection (LPD) applications by minimizing energy transmission and transmission in directions not advantageous to intended receivers based on cognitive networking techniques via multi-hop routing, adaptive power control, and directional antenna command and control loops. The goal is to develop distributed cognitive algorithms operating in cognitive nodes to intelligently maintain throughput and connectivity while accounting for time varying mission requirements. Additional time and location dependencies are considered such as the position of observers. Geographic position data from the network is used to predict changes in the topology and estimate the multi-objective costs of muli-hop paths in the network. An emphasis is placed on fast approximations to ensure real-time implementation. The set of Pareto-optimal paths are found based on the estimated costs, allowing the node to select the best path for any cost function.</p>
]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2024-01-22T08:30:00-05:00]]></value>
      <value2><![CDATA[2024-01-22T10:30:00-05:00]]></value2>
      <rrule><![CDATA[]]></rrule>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_time>
  <field_fee>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_fee>
  <field_extras>
      </field_extras>
  <field_audience>
          <item>
        <value><![CDATA[Public]]></value>
      </item>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_contact>
  <field_location>
    <item>
      <value><![CDATA[Room 461, Van Leer]]></value>
    </item>
  </field_location>
  <field_sidebar>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_sidebar>
  <field_phone>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_phone>
  <field_url>
    <item>
      <url><![CDATA[]]></url>
      <title><![CDATA[]]></title>
            <attributes><![CDATA[]]></attributes>
    </item>
  </field_url>
  <field_email>
    <item>
      <email><![CDATA[]]></email>
    </item>
  </field_email>
  <field_boilerplate>
    <item>
      <nid><![CDATA[]]></nid>
    </item>
  </field_boilerplate>
  <links_related>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>434381</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[ECE Ph.D. Dissertation Defenses]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1788</tid>
        <value><![CDATA[Other/Miscellaneous]]></value>
      </item>
      </field_categories>
  <field_keywords>
          <item>
        <tid>100811</tid>
        <value><![CDATA[Phd Defense]]></value>
      </item>
          <item>
        <tid>1808</tid>
        <value><![CDATA[graduate students]]></value>
      </item>
      </field_keywords>
  <userdata><![CDATA[]]></userdata>
</node>
