Jason Ernst, University of Guelph 1. Introduction ◦ Background Information ◦ Motivation for...
12
Jason Ernst, University of Guelph 1
-
Upload
linette-beasley -
Category
Documents
-
view
217 -
download
0
Transcript of Jason Ernst, University of Guelph 1. Introduction ◦ Background Information ◦ Motivation for...
Jason Ernst, University of Guelph
1
Introduction◦ Background Information◦ Motivation for Research / Current Problems
Proposed Solution◦ Algorithm Description◦ Related Work
Experiment Proposal◦ Simulation
Future Work References
2
WMN – Wireless Mesh Network◦ Ad-hoc network with a core which
has limited mobility Mesh Routers
◦ A wireless base station which has limited or no mobility
◦ Infrastructure of the network Mesh Clients
◦ A wireless node which is fully mobile, may also act as a router in some WMNs
Image: www.wilibox.com
3
Current Problems with WMN protocols:
◦ Protocols not designed for WMNs Topology not fixed as in wired networks Not all nodes fully mobile as in MANETs
◦ Poor scalability Overhead / Control Packets limit size of network As hop count increases performance decreases
◦ Congestion Certain links may become saturated
4
Make use of techniques from other fields◦ Field Programmable Gate Arrays (FPGAs) and
Network-On-Chip Designed to be a flexible, highly scalable design
◦ Reconfigurable Interconnection Algorithm (RIN) Minimizes the number of connections between a
group of nodes Group links that are common and optimize
the links as a group rather than individually◦ May allow for greater scalability grouping routing
requirements
5
RIN algorithm
Design a WMN algorithm that takes advantage of the RIN algorithm
6
Layering Approach?◦ Cross Layer seems to be common in most recent
research
Why does this make sense for this application?◦ Since algorithm deals with groups of links at a
time, it may be useful to allow communication between higher and lower layers, ex) routing & MAC layers
7
Similar problems in Field Programmable Gate Arrays (FPGAs), Network-on-chip Design
Clustering problems
Mobile ad-hoc Networks (MANETs)
Real World Implementations of WMN
8
Compare new algorithm with existing WMN algorithms against the following criteria:◦ Number of Links in the Network
New algorithm should have fewer links since routing requirements are minimizes as a group
◦ Overhead in the Network Overhead should be lower since multiple nodes can be
dealt with at together◦ Number of Bottlenecks in the Network
Should increase since multiple nodes are using the same links
Modifications to algorithm can deal with this issue in the future
9
Adapt the RIN algorithm to select edges based on the congestion of the links or other criteria to deal with congestion better
Optimize the RIN algorithm implementation since it has much room to be improved
10
PERKINS, C.E. AND ROYER, E., M. 1999. Ad-hoc On-Demand Distance Vector Routing. In Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications, Anonymous , 90-100.
PERKINS, C.E. AND BHAGWAT, P. 1994. Highly Dynamic Destination-Sequenced Distance-Vector Routing. 24, 234-244. http://delivery.acm.org.cerberus.lib.uoguelph.ca/10.1145/200000/190336/p234-perkins.pdf?key1=190336&key2=5111154021&coll=portal&dl=ACM&CFID=57489879&CFTOKEN=62698234.
FAN, H. AND WU, Y. 2008. Interconnection Graph Problem. .
AKYILDIZ, . 2005. Wireless mesh networks: a survey. Computer networks 47, 445. .
HUANG, L. AND LAI, T. 2002. On the scalability of IEEE 802.11 ad hoc networks. 173-182. .
JAIN, K., PADHYE, J., PADMANABHAN, V.N. AND QUI, L. 2005. Impact of Interference on Multi-HopWireless Network Performance. 11, 471-487. .
A., A., A., M. AND S., B. 2003. High Performance Architectures for IP-Based Multi-hop 802.11 Networks. 10, 22-28. IEEE Explore.
BARTIC, T.A., MIGNOLET, J.Y., NOLLET, V., MARESCAUX, T., VERKEST, D., VERNALDE, S. AND LAUWEREINS, R. 2005. Topology adaptive network-on-chip design and implementation. 152, 467-472. .
BEJERANO, Y., HAN, S. AND KUMAR, A. 2007. Efficient Load Balancing routing for wireless mesh networks. 51, 2450-2466. .
11
