A Low Interference Channel Assignment Algorithm for Wireless Mesh Networks Can Que 1,2, Xinming Zhang 1, and Shifang Dai 1 1.Department of Computer Science.

Slides:

Advertisements

Similar presentations

February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.

Advertisements

Page 1 Approximately Maximum Bandwidth Routing for Slotted Wireless Ad Hoc Networks Approximately Maximum Bandwidth Routing for Slotted Wireless Ad Hoc.

Does the IEEE MAC Protocol Work Well in Multihop Wireless Ad Hoc Networks? Shugong Xu Tark Saadawi June, 2001 IEEE Communications Magazine.

Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.

* Distributed Algorithms in Multi-channel Wireless Ad Hoc Networks under the SINR Model Dongxiao Yu Department of Computer Science The University of Hong.

A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.

Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.

Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.

Joint Access Point Placement and Channel Assignment for Wireless LANs Xiang Ling School of Communication and Information Engineering University.

SELECT: Self-Learning Collision Avoidance for Wireless Networks Chun-Cheng Chen, Eunsoo, Seo, Hwangnam Kim, and Haiyun Luo Department of Computer Science,

Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)

1 A Novel Topology-blind Fair Medium Access Control for Wireless LAN and Ad Hoc Networks Z. Y. Fang and B. Bensaou Computer Science Department Hong Kong.

A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.

An Adaptive Coordinated Medium Access Control for Wireless Sensor Networks Jing Ai, Jingfei Kong, Damla Turgut Networking and Mobile Computing (NetMoC)

CS541 Advanced Networking 1 Dynamic Channel Assignment and Routing in Multi-Radio Wireless Mesh Networks Neil Tang 3/10/2009.

Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Vikram Kanodia.

Does the IEEE MAC Protocol Work Well in Multihop Wireless Ad Hoc Networks? Shugong Xu Tark Saadawi June, 2001 IEEE Communications Magazine (Adapted.

Algorithms for Maximum Induced Matching Problem Somsubhra Sharangi Fall 2008 CMPT 881.

Isolation of Wireless Ad hoc Medium Access Mechanisms under TCP Ken Tang,Mario Correa,Mario Gerla Computer Science Department,UCLA.

1 TDMA Scheduling in Competitive Wireless Networks Mario CagaljHai Zhan EPFL - I&C - LCA February 9, 2005.

1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:

Yanyan Yang, Yunhuai Liu, and Lionel M. Ni Department of Computer Science and Engineering, Hong Kong University of Science and Technology IEEE MASS 2009.

1 A Topology Control Approach to Using Directional Antennas in Wireless Mesh Networks Umesh Kumar, Himanshu Gupta and Samir R. Das Department of Computer.

Medium Access Control Protocols Using Directional Antennas in Ad Hoc Networks CIS 888 Prof. Anish Arora The Ohio State University.

A Fair Scheduling for Wireless Mesh Networks Naouel Ben Salem and Jean-Pierre Hubaux Laboratory of Computer Communications and Applications (LCA) EPFL.

A Survey on Channel Assignment for Multi-Radio Meshed Networks

RTS/CTS-Induced Congestion in Ad Hoc Wireless LANs Saikat Ray, Jeffrey B. Carruthers, and David Starobinski Department of Electrical and Computer Engineering.

Opersating Mode DCF: distributed coordination function

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)

Joint Channel Assignment and Routing in Real Time Wireless Mesh Network Xiaoguang Li †, Changqiao Xu ‡ † College of Software Engineering, Southeast University,

Qian Zhang and Christopher LIM Department of Computer Science and Engineering, Hong Kong University of Science and Technology IEEE ICC 2009.

Power Save Mechanisms for Multi-Hop Wireless Networks Matthew J. Miller and Nitin H. Vaidya University of Illinois at Urbana-Champaign BROADNETS October.

Addressing Deafness and Hidden Terminal Problem in Directional Antenna Based Wireless Multi-hop Networks Anand Prabhu Subramanian and Samir R. Das {anandps,

1 Core-PC: A Class of Correlative Power Control Algorithms for Single Channel Mobile Ad Hoc Networks Jun Zhang and Brahim Bensaou The Hong Kong University.

Optimal Power Control, Rate Adaptation and Scheduling for UWB-Based Wireless Networked Control Systems Sinem Coleri Ergen (joint with Yalcin Sadi) Wireless.

Multicast Algorithms for Multi- Channel Wireless Mesh Networks Guokai Zeng, Bo Wang, Yong Ding, Li Xiao, Matt Mutka Department of Computer Science and.

IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.

Improving Capacity and Flexibility of Wireless Mesh Networks by Interface Switching Yunxia Feng, Minglu Li and Min-You Wu Presented by: Yunxia Feng Dept.

Tonghong Li, Yuanzhen Li, and Jianxin Liao Department of Computer Science Technical University of Madrid, Spain Beijing University of Posts & Telecommunications.

1 Multicast Algorithms for Multi- Channel Wireless Mesh Networks Guokai Zeng, Bo Wang, Yong Ding, Li Xiao, Matt Mutka Michigan State University ICNP 2007.

Logical Topology Design and Interface Assignment for Multi- Channel Wireless Mesh Networks A. Hamed Mohsenian Rad Vincent W.S. Wong The University of British.

End-to-End Performance and Fairness in Multihop Wireless Backhaul Networks V. Gambiroza, B. Sadeghi, and E. Knightly Department of Electrical and Computer.

Collision-free Time Slot Reuse in Multi-hop Wireless Sensor Networks

Advanced Communication Network Joint Throughput Optimization for Wireless Mesh Networks R 戴智斌 R 蔡永斌 Xiang-Yang.

Distributed Channel Assignment and Routing Multiradio Mutlichannel Multihop Wireless Networks Haitao Wu, Fan Yang, Kun Tan, Jie Chen, Qian Zhang, and Zhenshrng.

Mohamed Elhawary Computer Science Department Cornell University PERCOM 2008 Zygmunt J. Haas Electrical and Computer Engineering Department Cornell University.

SenProbe: Path Capacity Estimation in Wireless Sensor Networks Tony Sun, Ling-Jyh Chen, Guang Yang M. Y. Sanadidi, Mario Gerla.

STUMP: Exploiting Position Diversity in the Staggered TDMA Underwater MAC Protocol Kurtis Kredo II, Petar Djukic, Prasant Mohapatra IEEE INFOCOM 2009.

A New Link Scheduling Algorithm for Concurrent Tx/Rx Wireless Mesh Networks Author: Kwan-Wu Chin University of Wollongong, Australia From: ICC 2008 Speaker:

A Multi-Channel CSMA MAC Protocol with Receiver Based Channel Selection for Multihop Wireless Networks Nitin Jain, Samir R. Das Department of Electrical.

Chih-Min Chao and Kuo-Hsiang Lu Department of Computer Science and Engineering National Taiwan Ocean University IEEE Sensor Networks, Ubiquitous and Trustworthy.

Power Controlled Network Protocols for Multi- Rate Ad Hoc Networks Pan Li +, Qiang Shen*, Yuguang Fang +, and Hailin Zhang # +: EE, Florida University.

A Multi-Channel Cooperative MIMO MAC Protocol for Wireless Sensor Networks(MCCMIMO) MASS 2010.

Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation Yanwei Wu, Member, IEEE, Xiang-Yang Li, Senior Member, IEEE, YunHao Liu, Senior.

Khaled Hatem Almotairi and Xuemin (Sherman) Shen IEEE Globecom 2010 Speak: Huei-Rung, Tsai Symmetrical Power Control for Multi- channel Multi-hop Wireless.

An Adaptive, High Performance MAC for Long-Distance Multihop Wireless Networks Sergiu Nedevschi *, Rabin K. Patra *, Sonesh Surana *, Sylvia Ratnasamy.

Hongkun Li, Yu Cheng, Chi Zhou Illinois Institute of Technology, Chicago, IL, USA IEEE GLOBECOM 2008.

Mitigating starvation in Wireless Ad hoc Networks: Multi-channel MAC and Power Control Adviser : Frank, Yeong-Sung Lin Presented by Shin-Yao Chen.

A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.

Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.

1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),

SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.

Fast and Slow Hopping MAC Protocol for Single-hop Ad Hoc Wireless Networks Khaled Hatem Almotairi, Xuemin (Sherman) Shen Department of Electrical and Computer.

A New MAC Protocol for Wi-Fi Mesh Networks Tzu-Jane Tsai, Hsueh-Wen Tseng, and Ai-Chun Pang IEEE AINA’06.

A Maximum Fair Bandwidth Approach for Channel Assignment in Wireless Mesh Networks Bahador Bakhshi and Siavash Khorsandi WCNC 2008.

A Bidirectional Multi-channel MAC Protocol for Improving TCP Performance on Multihop Wireless Ad Hoc Networks Tianbo Kuang and Carey Williamson Department.

Presented by Tae-Seok Kim

Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So and Nitin Vaidya Modified and Presented.

Multi-channel, multi-radio wireless networks

Javad Ghaderi, Tianxiong Ji and R. Srikant

Presentation transcript:

A Low Interference Channel Assignment Algorithm for Wireless Mesh Networks Can Que 1,2, Xinming Zhang 1, and Shifang Dai 1 1.Department of Computer Science and Technology University of Science and Technology of China 2. Department of Computer Science City University of Hong Kong IEEE Wireless Communications, Networking and Mobile Computing,

Outline Introduction Protocol Simulation Conclusion 2

Introduction Motivation To avoid the hidden terminal problem within two hops. To make full use of the multiple NICs and channels in the wireless mesh networks. 3

Introduction Assumption Multiple non-overlapping channel Multiple network interface cards (NIC) The centralized algorithm have enough information about the topology and the traffic load of each link. 4

5 How effective is the IEEE RTS/CTS Handshake in Ad Hoc Network?? SenderReceiver

Combinable flows 6 Protocol Common node The RTS/CTS mechanism can always work well to avoid interference within the combinable structures.

Combinable flows 7 Protocol Common node If they are in the same channel, the result is always one flow can work.

G(V,E) V contains the nodes that have packets to send I(V,E) Two nodes are within the interference range of each other 8 Protocol

to find maximal independent combinable structures 9 Protocol Not interfered with each otherlargest Load / Interference- degree value

The NP-hardness of this problem can be proved by reducing this problem to the max independent set problem. Authors use a greedy approximation algorithm to solve this problem. 10 Protocol

If (the traffic load is small) Algorithm I If(the traffic load is large) Algorithm II 11 Protocol

Algorithm I A.Calculate the Load / Interference-degree value of each combinable structure. B. Choose the structures with the largest Load / Interference-degree value, and assign these interfaces to an unused channel. C. there remains structures not interfered by the chosen structures, then go to step B. 12 Protocol

Algorithm I D. If there are no more interfaces or channels available for unassigned flows, we go to the algorithm designed for the large traffic load. E. If there are still some flows unscheduled, remove the nodes have no flows, go to step A. 13 Protocol

Algorithm II To divide these flows into several groups. Each group has almost the same total flow load To divide time into some fixed intervals (slot) To choose flows one by one from each group at the time when we begin to make schedules for a slot To solve the starvation problem 14 Protocol

Group All the flows in the same group are interfered by one another, in other words, only one flow in the same group can be activated when there is only one channel available. The size of each group should be almost the same as each other. 15 Protocol

Group Decide how large should the group be might be a tricky issue. We use the load of the node with the maximum throughput as the size of the group. 16 Protocol

17 Protocol F1 F2 F3 F5 F4 F6

18 Protocol We use the load of the node with the maximum throughput as the size of the group.

There are 2 interfaces and 2 channels available for each node. 19 Protocol

20 Protocol we choose one flow from each group, say,F1, F4, F6. The max independent set of these three flows is {F1, F6}.

21 Protocol we choose one flow from each group, say,F1, F4, F6. The max independent set of these three flows is {F1, F6}.

22 Protocol If one flow hasn’t been scheduled for k (k > 0) times, then the priority of this link is P K = -2 K. F4 is set to -2 K=1

23 Protocol Since there are still flows and channels available, we can assign more flows in slot 1 by assigning them to channel B.

24 Protocol This time {F2, F4, F6} is chosen from each group. The priority value -2 is added on F4.

25 Protocol This time {F2, F4, F6} is chosen from each group. We can add F3 to F4, since they are not interfered with each other.

26 Protocol This time {F2, F4, F6} is chosen from each group. The priority value of F2 and F6 are set to -2.

27 Protocol The assignment step of slot 1 ends.

28 Protocol Set {F2, F5, F6} is chosen as the candidate flows of slot 2,channel A. F2 and F6 are chosen this time. The priority value of F5 is set to -2.

29 Protocol F5 is assigned to channel B. All the flows are scheduled, and the algorithm is ended.

30 Simulation

31 Simulation Number of channels for each node is set to three

32 Simulation Number of NICs per node is set to four

33 Conclusion The capacity issue is one of the most important problems in the wireless mesh networks. In this paper, we propose two centralized algorithms to make full use of the multiple NICs and channels in the wireless mesh networks.