Routing in Multi-hop Wireless Mesh Networks with Bandwidth Assurance

Mohd Abdul Javeed (09BK1A0539)

Roadmap
Introduction to wireless mesh networks

Necessity, architecture.

Security issues Existing system Proposed system Our solutions Conclusion & future work

Mesh Networks: why do we need them?

Ubiquitous broadband Internet access
Cellular networks
RNC PSDN Internet

Wide area coverage (km range) Low speed High deployment costs
W-CDMA: 384 kb/s ~ 2 Mb/s CDMA2000: 144 kb/s ~ 2.4 Mb/s

Mesh Networks: why do we need them?

Ubiquitous broadband Internet access
Wireless LAN
Interne t

High speed

802.11b: 11 Mb/s, 802.11a/g: 54 Mb/s, 802.11n: 540 Mb/s

Low deployment costs Small coverage (up to 300m for 802.11)

Wireless Mesh Networks (WMNs)

Internet
T1/E1 WiMax mesh router

mesh

Merits of Wireless Mesh Networks

High speed Extended coverage (multi-hop comm.) Low deployment costs High robustness (multiple routes) Simple configuration and maintenance Good network scalability

Application Scenarios
Broadband home networking Community and neighborhood networking Enterprise networking Metropolitan area networks Intelligent transportation systems Security surveillance systems Building automation

Network Access Security

WMN backbone

Our goal

Internet

Why difficult to achieve?

Mesh routers are designed to accept open access requests from most likely unknown mesh clients Open access to wireless channels Multi-hop, cooperative communications Dynamic network topology due to client mobility

Network Access Security Issues

WMN backbone

Our goal

Internet

Router-client authentication Router-client key agreement Client-client authentication Client-client key agreement

Existing System

The path with the maximum available bandwidth is one of the fundamental issues for supporting Qos in the wireless mesh networks. The available path bandwidth is defined as the maximum additional rate a flow can push before saturating its path. Therefore, if the traffic rate of a new flow on a path is no greater than the available bandwidth of this path, accepting the new traffic will not violate the bandwidth Guaranteed of the existing flows.

Proposed system

A new path weight that captures the concept of available bandwidth. We give the mechanism to compare two paths based on the new path weight. the widest path, many researchers develop new path weights, and the path with the minimum/maximum weight is assumed to be the maximum available bandwidth path

Our solution

we introduce our new isotonic path weight, describes how we use the path weight to construct routing tables. The isotonicity property of a path weight is the necessary and sufficient condition for developing a routing protocol satisfying the optimality and consistency requirements

Conclusion
The main contribution of our work is a new leftisotonic path weight which captures the available path bandwidth information The left-isotonicity property of our proposed path weight facilitates us to develop a proactive hop-byhop routing protocol, and we formally proved that our protocol satisfies the optimality and consistency requirements.

Future Work
Secure wireless mesh backbone Secure routing and MAC protocols When Internet marries multi-hop wireless
DoS/DDoS mitigation Worm detection & prevention IP traceback Intrusion detection

References

Wenjuan Xu, Xinwen Zhang, Member, IEEE, Hongxin Hu, Student Member, IEEE, SECURE COMPUTING, VOL. 9, NO. 3, MAY/JUNE 2012. Vinod Kone, Sudipto Das, Ben Y. Zhao and Haitao Zheng University of California, Santa Barbara {vinod, sudipto, ravenben, htzheng}@cs.ucsb.edu.

16/43