Skip to main content
SpringerLink
Log in

A Compatibility Vector Technique for Cooperative Scheduling and Channel Assignment Algorithm in Broadband Wireless Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

Broadband Wireless Networks is growing rapidly due to the increased number of mobile users. The greatest challenge is to achieve maximum throughput with minimal or no interference while performing concurrent transmission. To reduce the interference problem, this paper proposes a cooperative scheduling and channel assignment algorithm for multi-channel wireless mesh networks. In scheduling algorithm, to avoid the primary interference, the proper time slot is assigned through centralized scheduling for the packet and link in a network. The objective of using the scheduling algorithm is to reduce the transmission delay for uplink/downlink networks. Channel assignment algorithm helps to avoid secondary interference and to perform concurrent transmission with an optimal number of channels. In scheduling, the priority of packets contributes to preventing the accumulation of packets and transmission delay in a multi-hop network. Simulation analysis shows that our channel assignment algorithm avoids both interferences with an optimal number of channels.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

Notes

  1. Line graph L(G) is also represented as interchange graph as in Fig. 2b. Associating a vertex with each edge of a graph is obtained in the graph. It connects two vertices with an edge if the corresponding edges of G have a vertex in common.

  2. The degree of a vertex {deg (v)} is the number of edges incident to the vertex in a graph. The maximum degree is denoted by Δ (G), and the minimum degree by δ(G).

  3. Minimum degree is defined as the link that has a minimum number of interfering links

  4. A graph consisting of a single path is represented as path graph. P n is denoted as path graph with n vertices.

References

  1. Chen S, Zhao J, Peng Y (2014) The development of TD-SCDMA 3G to TD-LTE-advanced 4G from 1998 to 2013. IEEE Wirel Commun 21(6):167–176

    Article  Google Scholar 

  2. Si W, Selvakennedy S, Zomaya AY (2010) An overview of channel assignment methods for multi-radio multi-channel wireless mesh networks. J Parallel Distrib Comput 70(5):505–524 Elsevier Publications

    Article  MATH  Google Scholar 

  3. Sgora A, Vergados DJ, Vergados DD (2015) A survey of TDMA scheduling schemes in wireless multihop networks. J ACM Comput Surv 47(3). doi:10.1145/2677955

  4. Miray Kas BY, Korpeoglu I, Karasan E (2010) A survey on scheduling in IEEE 802.16 mesh mode. IEEE Commun Surv Tutorials 12(2):205–221

    Article  Google Scholar 

  5. Raja G, Bhaskaran SBM, Ghosal D, Padmanabhan J (2016) Reduced overhead frequent user authentication in EAP - dependent broadband wireless networks. Mob Netw Appl 21(3):523–538 Springer

    Article  Google Scholar 

  6. Ying Q, Ng B, Seah W (2016) A survey of routing and channel assignment in multi-channel multi-radio WMNs. J Netw Comput Appl 65:120–130 Elsevier Publications

    Article  Google Scholar 

  7. Gopinath S, Nagarajan N (2015) Energy based reliable multicast routing protocol for packet forwarding in MANET. J Appl Res Technol 13(3):374–381 Elsevier Publications

    Article  Google Scholar 

  8. Narayan DG, Mudenagudi U (2017) A cross-layer framework for joint routing and resource management in multi-radio infrastructure wireless mesh networks. Arab J Sci Eng 42(2):651–667 Springer

    Article  MathSciNet  Google Scholar 

  9. Liao W-H, Kedia SP, Dubey AK (2012) Scheduling and channel assignment algorithm for IEEE 802.16 mesh networks using clique partitioning technique. J Comput Commun 35(16):2025–2034

    Article  Google Scholar 

  10. Chieochan S, Hossain E (2013) Channel assignment for throughput optimization in multichannel multiradio wireless mesh networks using network coding. IEEE Trans Mob Comput 12(1):118–135

    Article  Google Scholar 

  11. Liu H, Lin L, Wu D, Yu J, Chen D (2015) Routing, spectrum access, and scheduling in multi-hop multi-channel wireless networks with MIMO links. EURASIP J Wirel Commun Netw 65. doi:10.1186/s138-015-0252-2

  12. Wang J, Shi W, Cui K, Jin F, Li Y (2015) Partially overlapped channel assignment for multi-channel multi-radio wireless mesh networks. EURASIP Wirel Commun Netw. doi:10.1186/s13638-015-0259-8 Springer

    Google Scholar 

  13. Davoodi A, Javadi R, Omoomi B (2016) Edge clique covering sum of graphs. Acta Math Hungar 149(1):82–91 Springer

    Article  MathSciNet  MATH  Google Scholar 

  14. Lamm S, Sanders P, Schulz C (2015) Graph partitioning for independent sets. Lect Notes Comput Sci, pp 68–81. Springer

  15. Wang L (2015) Link scheduling in multi-transmit-receive wireless mesh networks, Ph.D thesis, University of Wollongong, Australia

  16. Misra S, Ghosh TI, Obaidat MS (2014) Routing bandwidth guaranteed paths for traffic engineering in WiMAX mesh networks. Int J Commun Syst 27(11):2964–2984 Wiley online library

    Google Scholar 

  17. Jamali S, Rezaei L, Gudakahriz SJ (2013) An energy-efficient routing protocol for MANETs: a particle swarm optimization approach. J Appl Res Technol 11(6):803–812 Elsevier Publications

    Article  Google Scholar 

  18. Du P, Jia W, Huang L, Lu W (2007) Centralized scheduling and channel assignment in multi-channel singletransceiver wimax mesh network. In Wireless Communications and Networking Conference (WCNC), pp 1734–1739

  19. Liu C-y, Bo F, Huang H-J (2014) Delay minimization and priority scheduling in wireless mesh networks. Wirel Netw 20(7):1955–1965 Springer

    Article  Google Scholar 

  20. Gunasekaran R, Siddharth S, Krishnaraj P, Kalaiarasan M, Rhymend Uthariaraj V (2010) Efficient algorithms to solve broadcast scheduling problem in WiMAX mesh networks. J Comput Commun Elsevier 33(11):1325–1333

    Article  Google Scholar 

  21. Kala SM, Pavan Kumar Reddy M, Musham R, Tamma BR (2016) Interference mitigation in wireless mesh networks through radio co-location aware conflict graphs. Wirel Netw 22(2):679–702 Springer

    Article  Google Scholar 

  22. Dardouri S, Bouallegue R (2015) comparative study of downlink packet scheduling for LTE networks. Wirel Pers Commun 82(3):1405–1418 Springer Publications

    Article  Google Scholar 

  23. Gore AD, Karandikar A (2010) Link scheduling algorithms for wireless mesh networks. IEEE Commun Surv Tutorials 13(2):258–273

    Article  Google Scholar 

  24. Iqbal F, Javed MY, Naveed A (2014) Interference-aware multipath routing in wireless mesh network. EURASIP J Wirel Commun Netw. doi:10.1186/1687-1499-2014-140

    Google Scholar 

  25. Ning Z, Guo L, Peng Y, Wang X (2012) Joint scheduling and routing algorithm with load balancing in wireless mesh network. Comput Electr Eng 38(3):533–550 Elsevier

    Article  Google Scholar 

  26. Hossain E, Rasti M, Tabassum H, Abdel Nasser A (2014) Evolution toward 5G multi-tier cellular wireless networks: an interference management perspective. IEEE Wirel Commun 21(3):118–127

    Article  Google Scholar 

  27. Wang S-S, Lien C-Y, Liao W-H, Shih K-P (2012) LASER: A load-aware spectral-efficient routing metric for path selection in IEEE 802.16j multi-hop relay networks. Comput Electr Eng 38(4):953–962 Elsevier

    Article  Google Scholar 

  28. Dzal GIM, Feng S (2013) The dynamic channel assignment for multi-radio multi-channel wireless mesh networks. International Conference on Communication Systems and Network Technologies (CSNT), pp 277–280

  29. Delgado O, Jaumard B (2010) Scheduling and resource allocation in LTE uplink with a delay requirement. Eighth Annual Communication Networks and Services Research Conference (CNSR), pp 268–275

  30. Wellons J, Xue Y (2014) The robust joint solution for channel assignment and routing for wireless mesh networks with time partitioning. Ad Hoc Netw 13(A):210–221 Elsevier Publications

    Article  Google Scholar 

  31. Yadav AL, Vyavahare PD, Bansod PP (2015) Review of WiMAX scheduling algorithms and their classification. J Inst Eng (India) Ser B 95(2):197–208 Springer

    Article  Google Scholar 

  32. Han B, Jia W, Lin L (2007) Performance evaluation of scheduling in IEEE 802.16 based wireless mesh networks. Comput Commun 30(4):782–792 Elsevier Publications

    Article  Google Scholar 

  33. Du P, Jia W, Huang L, Lu W (2007) Centralized scheduling and channel assignment in Multi-Channel single-transceiver WiMax mesh network. IEEE Wireless Communications and Networking Conference, WCNC, pp 1734–1739

Download references

Acknowledgements

Ramkumar Jayaraman gratefully acknowledges support from Anna University - Anna Centenary Research Fellowship.

Gunasekaran Raja gratefully acknowledges support from the UGC Raman Post-Doctoral Fellowship F.No.5-72/2014(IC).

Gunasekaran Raja, Ramkumar Jayaraman, Rajakumar Arul, Sabareesh Kumar A gratefully acknowledges support from NGNLabs, Department of Computer Technology, Anna University, Chennai.

Author information

Authors and Affiliations

  1. Department of Computer Technology, Anna University, Chennai, India

    Ramkumar Jayaraman, Gunasekaran Raja, Rajakumar Arul & Sabareesh Kumar A

  2. Department of Computer Science, University of California, Davis, CA, USA

    Gunasekaran Raja & Dipak Ghosal

Authors
  1. Ramkumar Jayaraman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gunasekaran Raja
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dipak Ghosal
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rajakumar Arul
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sabareesh Kumar A
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ramkumar Jayaraman.

Appendix

Appendix

The total number of links is denoted as N and average transmission range of nodes as R. The number of PCV is denoted as P and the number of channels as M then M is proportional to the maximum size of PCV. M can represent the direct function of the size of PCV and transmission range, R and M are equal to the maximum number of SCV generated from one PCV.

Proposition 1:

If P = 1 and R is large, then M is large

Proof: Transmission range has a direct impact on secondary interference. Large transmission range implies that every link has secondary interference with almost all other nodes. So the single PCV formed as the result of null primary interference which can be divided into a large number of SCVs of small sizes. Hence, the required number of channels to eliminate secondary interference will be large.

Proposition 2:

If P = N and R is large, then M = 1

Proof: In a network with nodes trying to perform multiple tasks involving almost every other node, the possibility of primary interference is high. In the worst case, every PCV has only one link to eliminate primary interference. Since all PCVs are of a unit size, it cannot be further divided. In every time slot, only one link is going to be active. Hence, one channel is enough.

Proposition 3:

If P = 1 and R is small, then M is small

Proof: In the case of no primary interference, the number of PCV, P is 1. The possibility of secondary interference is low when all nodes have small transmission range. This limited number of SCVs that implies a number of channels required are small.

Proposition 4:

If P = N and R is small, then M = 1

Proof: If P = N, then there can be only one link in every PCV. So eliminating secondary interference is a non-necessary one. The number of channels required is just one. When P = N, then irrespective of R, M be one.

Table 3 Comparison – number of channels with transmission range
Full size table

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jayaraman, R., Raja, G., Ghosal, D. et al. A Compatibility Vector Technique for Cooperative Scheduling and Channel Assignment Algorithm in Broadband Wireless Networks. Mobile Netw Appl 22, 730–742 (2017). https://doi.org/10.1007/s11036-017-0841-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-017-0841-x

Keywords

Search

Navigation