NOTICE: As of September 18, 2023, login to calendar.vt.edu was disabled. Calendar admins will no longer be able to add new events or modify existing events.
If you need assistance with an existing event on calendar, please contact us: https://webapps.es.vt.edu/support/.

 Event Calendar
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
   Day      Week     Month  
1 1 1 1 1
 
1 1 1 1 1 1 1 1 1 1 1 1
   Search      Update  
1 1 1


Friday, January 27, 2012
 

Apr 2024
  S M T W T F S
W13 31 1 2 3 4 5 6
W14 7 8 9 10 11 12 13
W15 14 15 16 17 18 19 20
W16 21 22 23 24 25 26 27
W17 28 29 30 1 2 3 4


Today is:
Sat, Apr 20, 2024


Subscribe & download

Filter events


11:15am
to
12:15pm
  Practical Resource Assignment in Dynamic Wireless Networks  
(Seminar/Conference)

The speaker is Prof. Allen MacKenzie from the Dept. of Electrical and Computer Engineering at Virginia Tech. The abstract of his talk is as follows: Efforts to create modern wireless networks have occasionally suffered from approaches that seeks to replace static resource allocation schemes with fully dynamic schemes, failing to adequately compensate for the benefits associated with stable, predictable resource allocation, such as reduced communication overhead and computational complexity. In this talk, I describe ongoing research on channel assignment in multihop, multitransceiver wireless networks that demonstrates that many of the advantages of dynamic assignment are available via a hybrid approach that builds a static network topology and then enhances it dynamically in response to network traffic. Then, I will briefly describe future work that seeks to apply a broadly similar approach to spectrum assignment. In the first portion of the talk, I describe a proposed channel assignment scheme for cognitive radio networks that balances the need for topology adaptation to maximize flow rate and the need for a stable baseline topology to support network connectivity. We focus on networks in which nodes are equipped with multiple radios or transceivers, each of which can be assigned to a channel. First, we assign channels independently of traffic, to achieve basic network connectivity and support light loads such as control traffic, and, second, we dynamically assign channels to the remaining transceivers in response to traffic demand. We formulate the problem as a two-stage mixed integer linear program (MILP) and show that with this two-stage approach we can achieve performance comparable to a fully dynamic channel assignment scheme while preserving a static, connected topology. I describe ongoing work to implement this strategy via distributed channel assignment algorithms. In the second portion of the talk, I will describe a similar problem faced in the realm of spectrum assignment. Classical, static approaches to spectrum allocation are extremely inefficient, but provide a stable environment for wireless systems. Dynamic spectrum access (DSA) has been a popular research topic in the last five years, but deployment of DSA systems has been slowed by difficult technical challenges at multiple layers of the protocol stack and delayed adoption by spectrum regulators. I will briefly describe future research which will investigate hybrid approaches with the potential to offer both stability and improved efficiency.


Location: 2150 Torgersen Hall
Contact: T. M. Murali
E-Mail: murali@cs.vt.edu
5402318534
   
copy this event into your personal desktop calendar
powered by VTCalendar 2.2.1