2018
DOI: 10.1007/s00521-018-3751-3
|View full text |Cite
|
Sign up to set email alerts
|

An admission control algorithm based on matching game and differentiated service in wireless mesh networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 21 publications
0
4
0
Order By: Relevance
“…e original IDNCassisted algorithms without admission control are labeled as EDF, SIN, and PVDD, respectively. e algorithms with (1) If R i receives a newly arriving request r i then (2) Determine the priority of r i ; (3) if r i is high priority then (4) Admit r i and put r i into the high priority service queue; (5) else (6) Vectorize r i as rv ij , the mean vector of VE α as rv α , and the mean vector of VE β as rv β ; (7) Calculate rv α and rv β as described in Section 4.2.1; (8) Calculate the distance between rv ij and rv α , and the distance between rv ij and rv β , respectively; (9) Compare the distances (10) if dist(rv ij , rv α ) ≤ dist(rv ij , rv β ) then (11) Reject r i ; (12) Send a rejection message to the vehicle; (13) else (14) if dist(rv ij , rv α ) > dist(rv ij , rv β ) then (15) Admit r i and put r i into the low priority service queue; (16) end if (17) end if (18) end if (19) network coding-aware admission control are denoted as EDF_NCaAC, SIN_NCaAC, and PVDD_NCaAC. e results are obtained when the system is in a steady state and all data points are based on the average of over 5000 simulation runs.…”
Section: Performance Evaluationmentioning
confidence: 99%
See 1 more Smart Citation
“…e original IDNCassisted algorithms without admission control are labeled as EDF, SIN, and PVDD, respectively. e algorithms with (1) If R i receives a newly arriving request r i then (2) Determine the priority of r i ; (3) if r i is high priority then (4) Admit r i and put r i into the high priority service queue; (5) else (6) Vectorize r i as rv ij , the mean vector of VE α as rv α , and the mean vector of VE β as rv β ; (7) Calculate rv α and rv β as described in Section 4.2.1; (8) Calculate the distance between rv ij and rv α , and the distance between rv ij and rv β , respectively; (9) Compare the distances (10) if dist(rv ij , rv α ) ≤ dist(rv ij , rv β ) then (11) Reject r i ; (12) Send a rejection message to the vehicle; (13) else (14) if dist(rv ij , rv α ) > dist(rv ij , rv β ) then (15) Admit r i and put r i into the low priority service queue; (16) end if (17) end if (18) end if (19) network coding-aware admission control are denoted as EDF_NCaAC, SIN_NCaAC, and PVDD_NCaAC. e results are obtained when the system is in a steady state and all data points are based on the average of over 5000 simulation runs.…”
Section: Performance Evaluationmentioning
confidence: 99%
“…Admission control is pervasively adopted in wireless networks, in the aim of load balancing and providing guaranteed QoS [7,8]. e essence of admission control is to determine whether to accept a newly arrived service request, concerning if the rest network resources could meet the new service request's resource demand without affecting the existing requests' QoS, based on a certain criterion or calculation in the network [9,10]. VANETs have the characteristics of mobile ad hoc networks, such as dynamic network topology and unfixed structure.…”
mentioning
confidence: 99%
“…Zhang et al studied the admission control problem in sensor nodes and developed stochastic models in wireless sensor networks to explore admission control with the sleep/active scheme [31]. Shang et al established an admission control model based on the matching game and multi-attribute decision-making according to the network's attribute and system resource allocation [32]. They proposed an algorithm, which balances the interests of the network and user, reflects the superiority of the balanced decision of both parties, and guarantees the common interests of the network and user.…”
Section: Admission Control In Wireless Networkmentioning
confidence: 99%
“…The authors in [9] made use of a sender based admission control to regulate real-time UDP traffic. Makrakis [10] also proposed a QoS routing algorithm that depends on an effective admission control while the authors in [11] proposed a measured-based admission control algorithm. It is important to note that while proposing a measured-based admission control, there cannot be an accurate measurement in its design for MANET considering the unpredictable movement of mobile host [12].…”
Section: Introductionmentioning
confidence: 99%