Computer Science &Amp; Information Technology ( CS &Amp; IT ) 2013
DOI: 10.5121/csit.2013.3231
|View full text |Cite
|
Sign up to set email alerts
|

Surveying Best Suitable Scheduling Algorithm for Wimax- Wi-Fi Integrated Heterogeneous Network

Abstract: ABSTRACT

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 17 publications
(26 reference statements)
0
3
0
Order By: Relevance
“…In (Gabale et al, 2013), on the other hand, an overview of scheduling algorithms in wireless mesh networks was given. In (Das et al, 2013), an overview of the most suitable scheduling algorithm for WIMAX-Wi-Fi was also given. Here in (Kathrine & Raj, 2012) an overview of packet scheduling in different networks has been done.…”
Section: Packet Schedulingmentioning
confidence: 99%
“…In (Gabale et al, 2013), on the other hand, an overview of scheduling algorithms in wireless mesh networks was given. In (Das et al, 2013), an overview of the most suitable scheduling algorithm for WIMAX-Wi-Fi was also given. Here in (Kathrine & Raj, 2012) an overview of packet scheduling in different networks has been done.…”
Section: Packet Schedulingmentioning
confidence: 99%
“…And route discovery for DYM AODV routing algorithm. Route maintenan efficient route, avoid the routes which does to reduce the packet dropping [5], [7], [9]. R DYMO takes less memory space when comp routing algorithm.…”
Section: B Dynamic Manet On-demand (Dymo) Ro Algorithmmentioning
confidence: 99%
“…The Bellman-Ford is a proactive algorith the shortest path from the single source no other nodes in the network [9]. Each node distances between itself and all other no network and stores this information in its rou node sends its routing …”
Section: Bellman-ford Algorithmmentioning
confidence: 99%