H. K. Abadi and B. Prabhakar, Stable Matchings in Metric Spaces: Modeling Real-World Preferences using Proximity, 2017.

P. Agarwal, A. Efrat, and M. Sharir, Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. SOCG, 1995.

R. Ahuja, T. Magnanti, and J. Orlin, Network Flows: Theory, Algorithms, and Applications, 1993.

L. Atzori, A. Iera, and G. Morabito, The Internet of Things: A Survey, Computer Networks, vol.54, issue.15, pp.2787-2805, 2010.

N. T. Bailey, On Queueing Processes with Bulk Service, J. R. Stat. SOCE, vol.16, pp.80-87, 1954.

J. Bukac, Matching On a Line, 2018.

D. Gale and L. Shapley, College Admissions and Stability of Marriage, Amer. Math. Monthly, vol.69, pp.9-15, 1962.

V. Goswami and P. V. Laxmi, A Renewal Input Single and Batch Service Queues with Accessibility to Batches, International Journal of Management Science and Engineering Management, pp.366-373, 2011.

D. Gross and C. Harris, Fundamentals of Queueing Theory. Wiley Series in Probability and Statistics, 1998.

I. W. Ho, K. K. Leung, and J. W. Polak, Stochastic Model and Connectivity Dynamics for VANETs in Signalized Road Systems, IEEE/ACM Transactions on Networking, vol.19, issue.1, pp.195-208, 2011.

A. E. Holroyd, R. Pemantle, R. Peres, and O. Schramm, Poisson Matching. Annales de l IHP Probabilites et Statistiques, vol.45, pp.266-287, 2009.

I. Jawhar, N. Mohamed, and P. D. , Linear Wireless Sensor Networks: Classification and Applications, Journal of Network and Computer Applications, vol.34, issue.5, pp.1671-1682, 2011.

F. Kingman, The Effect of Queue Discipline on Waiting Time Variance, Math. Proc. Cambridge Phil. Soc, vol.58, pp.163-164, 1962.

L. Kleinrock, Queueing Systems, 1976.

K. K. Leung, W. A. Massey, and W. Whitt, Traffic Models for Wireless Communication Networks, IEEE Journal on Selected Areas in Communications, vol.12, issue.8, pp.1353-1364, 1994.

M. Mezard and G. Parisi, The Euclidean Matching Problem, J. Phys. France, vol.49, 1988.
URL : https://hal.archives-ouvertes.fr/jpa-00210882

J. Orlin, A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows, Mathematical Programming, vol.78, pp.109-129, 1997.

N. K. Panigrahy, P. Basu, P. Nain, D. Towsley, A. Swami et al., Resource Allocation in One-dimensional Distributed Service Networks, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02267631

E. M. Reingold and R. E. Tarjan, On a Greedy Heuristic for Complete Matching, SIAM Journal on Computing, vol.10, issue.4, pp.676-681, 1981.

P. Welch, On a Generalized m/g/1 Queuing Process in Which The First Customer of Each Busy Period Receives Exceptional Service, Operations Research, vol.12, pp.736-752, 1964.