2010 International Conference on Computational Intelligence and Software Engineering 2010
DOI: 10.1109/wicom.2010.5600953
|View full text |Cite
|
Sign up to set email alerts
|

A Hybrid Routing Protocol for Hierarchy Wireless Mesh Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 7 publications
0
6
0
Order By: Relevance
“…For the routing mechanism, some research considers the flooding control of control packets. AODV-DF [37] reduces the number of route request (RREQ) packets and controls the flooding effectively. More wireless resources can be used to serve the data packets rather than control packets, and load will be reduced.…”
Section: Routing Designmentioning
confidence: 99%
“…For the routing mechanism, some research considers the flooding control of control packets. AODV-DF [37] reduces the number of route request (RREQ) packets and controls the flooding effectively. More wireless resources can be used to serve the data packets rather than control packets, and load will be reduced.…”
Section: Routing Designmentioning
confidence: 99%
“…HMesh [26] combines the proactive routing protocol OLSR [27] and reactive routing protocol AODV [28]. OLSR is used among mesh routers, and AODV is used among mesh clients.…”
Section: Related Workmentioning
confidence: 99%
“…However, existing hybrid routing protocols are even fewer. HMesh [13] combines OLSR [14] and AODV, and uses them among mesh routers and mesh clients separately. HDV [15] makes use of tree-based routing in infrastructure WMN, and uses AODV in client WMN.…”
Section: Existing Routing Protocols For Hybrid Wmnmentioning
confidence: 99%
“…where E j lef t is the residual energy of mesh client j. E r and E t are energy cost by receiving and transferring a packet respectively. Then the time cost by emptying all these packets at mesh client j (i.e., T j lif e ) is T j lif e = P ktN um j × P acketSize B j available (13) According to T j lif e and D j , the batch number which mesh client j can still be used (i.e., n j ) is…”
Section: B Client-oriented Trafficmentioning
confidence: 99%