spacer
Research
spacer
Quick Links
spacer
Posters
spacer
Monthly Presentations
spacer
home > research > monthly presentations > spring 2010
 

Spring 2010

 
spacer For the Fall semester 2010, the schedule of the monthly meetings and invited presentations at OpNeAR lab. is the following (Please check again for updates):
 
spacer
Date
Time
Room
Speaker
Presentation Title
Nov 12, 2010 5:30 pm ECSN 2.718 Kumaran Vijayasankar On Opportunistic Cooperative Medium Access Control Protocols For Single-Hop and Multi-Hop IEEE 802.11 Based Wireless Networks
Nov 19, 2010 5:30 pm ECSN 4.728 Wanjun Huang Wavelength Assignment for a Given Set of Multicast Trees Reduces the Total Wavelength Conversions
Nov 22, 2010 5:00 pm ECSN 4.728 Azar Taufique IEEE 802.11 Protocol Performance Analysis
Dec 2, 2010 5:30 pm ECSN 2.718 Limin Tang Find Routings for Multicast Demands in Networks where Nodes have limited or no replication capability
Dec 10, 2010 5:30 pm ECSN 2.718 Arularasi Sivasankaran TBD
 

Presentation Abstracts


spacer
Friday, Nov 12, 2010 - 5:30 pm - room ECSN 2.718

On Opportunistic Cooperative Medium Access Control Protocols For Single-Hop and Multi-Hop IEEE 802.11 Based Wireless Networks
Speaker: Kumaran Vijayasankar

Cooperative link layer protocols are typically used in single hop networks to enhance the link layer capabilities using a special node, called the relay. In multi-hop networks, a frame is sent from an original source to the final destination through a series of intermediate nodes. Although the performance benefits of cooperation at link layer can be channeled into multi-hop networks as well, little is known about the impact of cooperative link layer protocol on the performance of a multi-hop network. In this work, an opportunistic cooperative MAC protocol called COBRA MAC is applied to a multi-hop network, by using a relay if available for each of the link in a multi-hop path. A Markov chain based analytical model that can capture the performance of multi-hop network with the presence of relay accounting for multiple transmission rates is presented. Impact of cooperation at link layer on the distributed routing protocols like AODV and OLSR is studied. Finally, a cooperative routing metric, called cooperative expected transmission time (CETT) is proposed to jointly optimize the relay and route selection for an end-to-end path. Analysis is done using simulations and analytical model. It is shown that performance improvement in a multi-hop network is dependent on the choice of relay and transmission rates, and that opportunistic type of cooperation provides noticeable improvements when applied to a multi-hop networ.


spacer
Friday, Nov 19, 2010 - 5:00 pm - room ECSN 4.728

Wavelength Assignment for a Given Set of Multicast Trees Reduces the Total Wavelength Conversions
Speaker: Wanjun Huang

Multicast is a communication paradigm in which a source node sends data to multiple destination nodes. Generally, light-tree is established for multicast request in wavelength division multiplexing (WDM) network. A significant drawback when establishing multicast light-tree using lambda channels in WDM network is the potentially large amount of wavelength converters, which are required when the wavelength continuity constraint cannot be satisfied across each light-tree. Prior works address this challenge by solving the routing and wavelength assignment (RWA) problem for each individual light-tree sequentially, to locally minimize the number of WCs required by each light-tree. In this paper, the authors intend to solve the RWA problem for a group of light-trees with the objective of globally minimizing the number of WCs that are required to support the entire group of multicast requests. Multicast routing algorithm and multicast wavelength assignment algorithm are designed jointly for this common objective. The rationale for using the proposed MCRWA solution is that a joint solution of the MC-RWA problem across the whole set of requested multicast trees may significantly reduce the number of WCs overall.


spacer
Tuesday, Nov 22, 2010 - 5:00 pm - room ECSN 4.728

IEEE 802.11 Protocol Performance Analysis
Speaker: Azar Taufique


spacer
Friday, Dec 3, 2010 - 5:00 pm - room ECSN 2.718

Find Routings for Multicast Demands in Networks where Nodes have limited or no replication capability
Speaker: Limin Tang

As video contents consume more and more network bandwidth in recent years, multicast becomes a more attractive solution for video delivery over the internet. However, due to technology limitations, replication capability and capacity of nodes in different types of networks varies, force each type of networks handle multicast, hence their routings, in its own unique way. This research proposes a general solution for all types of networks in dealing with routing of multicast demands under various replication capability and capacity constraints. The proposed algorithm not only is very effective in solving this kind of problem on various scales of networks, but also can be tuned to meet different practical requirements. In addition, the algorithm is proven to be an improvement of the algorithm which finds simple path for unicast demands with must-include nodes requirement.


spacer
Friday, Dec 10, 2010 - 5:30 pm - room ECSN 2.718

TBD
Speaker: Arularasi Sivasankaran


spacer
  HomeActivitiesResearchProjectsPublicationsPeopleTarget LabContact UsSearchSite Map
spacer
© 2010. All rights reserved.
Open Networking Advanced Research Lab
Dept. of Electrical Engineering
The University of Texas at Dallas. USA.