BACK TO COATI PUBLICATION INDEX
Publications of year 2010
-
D. Coudert and D. Simplot-Ryl, editors.
Ad Hoc & Sensor Wireless Networks, an International Journal -- Special issue on Ad hoc, Mobile and Wireless Networks,
volume 9.
Old City Publishing,
2010.
[WWW
] [bibtex-entry]
-
O. Dalle and G. Wainer, editors.
SIMULATION: Transactions of the Society of Modeling and Simulation International. Special Issue on Software Tools, Techniques and Architectures for Computer Simulation,
volume 86.
Sage,
2010.
[bibtex-entry]
-
F. Giroire and D. Mazauric, editors.
11es Journées Doctorales en Informatique et Réseaux (JDIR 2010),
number 11,
Sophia Antipolis, France,
March 2010.
Mascotte, INRIA, I3S(CNRS / Univ. of Nice-Sophia).
[WWW
] [bibtex-entry]
-
D. Coudert.
Algorithmique et optimisation dans les réseaux de télécommunications.
Habilitation à Diriger des Recherches,
Université de Nice Sophia-Antipolis (UNS),
March 2010.
[WWW
] [PDF
] [bibtex-entry]
-
Julian Monteiro.
Modeling and Analysis of Reliable Peer-to-Peer Storage Systems.
PhD thesis,
Ecole doctorale STIC, Université de Nice-Sophia Antipolis,
November 2010.
[WWW
] [Abstract] [bibtex-entry]
-
N. Nepomuceno.
Network optimization for wireless microwave backhaul.
PhD thesis,
Ecole doctorale STIC, Université de Nice-Sophia Antipolis,
December 2010.
[WWW
] [PDF
]
Keywords:
Wireless communications,
Mathematical programming,
Network optimization,
Multicommodity flows,
Microwave backhaul networks.
[Abstract] [bibtex-entry]
-
S. Pérennes.
Contribution à l'algorithmique des réseaux de télécommunications.
Habilitation à Diriger des Recherches,
Université de Nice Sophia-Antipolis (UNS),
March 2010.
[WWW
] [bibtex-entry]
-
A. Casamayou,
N. Cohen,
G. Connan,
T. Dumont,
L. Fousse,
F. Maltey,
M. Meulien,
M. Mezzarobba,
C. Pernet,
N.M. Thiéry,
and P. Zimmermann.
Calcul mathématique avec Sage,
chapter Théorie des graphes.
2010.
[WWW
] [bibtex-entry]
-
A. Casamayou,
N. Cohen,
G. Connan,
T. Dumont,
L. Fousse,
F. Maltey,
M. Meulien,
M. Mezzarobba,
C. Pernet,
N. M. Thiéry,
and P. Zimmermann.
Calcul mathématique avec Sage,
chapter Programmation Linéaire.
2010.
[WWW
] [bibtex-entry]
-
T. Cinkler,
D. Coudert,
M. Flammini,
G. Monaco,
L. Moscardelli,
X. Muñoz,
I. Sau,
M. Shalom,
and S. Zaks.
Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks,
volume XXVII of EATCS Texts in Theoretical Computer Science,
chapter Traffic Grooming: Combinatorial Results and Practical Resolutions,
pages 63-94.
Springer,
A. Koster and X. Muñoz edition,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Addario-Berry,
W.S. Kennedy,
A.D. King,
Z. Li,
and B. Reed.
Finding the maximum-weight induced $k$-partite subgraph of an $i$-triangulated graph.
Discrete Applied Mathematics,
158(7):765-770,
April 2010.
[WWW
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Giroire,
F. Huc,
and S. Pérennes.
Minimal selectors and fault tolerant networks.
Networks,
55(4):326-340,
July 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Havet,
F. Huc,
and S. Thomassé.
WDM and directed star arboricity.
Combinatorics, Probability and Computing,
19:161--182,
2010.
[PDF
] [Abstract] [bibtex-entry]
-
M. Asté,
F. Havet,
and C. Linhares Sales.
Grundy number and products of graphs.
Discrete Mathematics,
310(9):1482--1490,
2010.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
C. J. Colbourn,
L. Gionfriddo,
G. Quattrocchi,
and I. Sau.
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4.
SIAM Journal on Discrete Mathematics,
24(2):400-419,
2010.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
L. Gargano,
and A.A. Rescigno.
Gathering with minimum completion time in sensor tree networks.
JOIN,
11(1-2):1-33,
2010.
Note: A preliminary version has been presented at Sirocco08.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
F. Havet,
F. Huc,
and C. Linhares Sales.
Improper colouring of weighted grid and hexagonal graphs.
Discrete Mathematics, Algorithms and Applications,
2(3):395-411,
2010.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond and M-L. Yu.
Optimal gathering algorithms in multi-hop radio tree networks with interferences.
Ad Hoc and Sensor Wireless Networks,
9(1-2):109-128,
2010.
[PDF
] [Abstract] [bibtex-entry]
-
I. Caragiannis,
A. Ferreira,
C. Kaklamanis,
S. Pérennes,
and H. Rivano.
Fractional Path Coloring in Bounded Degree Trees with Applications.
Algorithmica,
58(2):516-540,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen,
D. Dimitrov,
R. Krakovski,
R. Skrekovski,
and V. Vukasinovic.
On Wiener Index of Graphs and Their Line Graphs.
MATCH Commun. Math. Comput. Chem.,
64(3):683-698,
2010.
[PDF
] [Abstract] [bibtex-entry]
-
N. Cohen,
F. V. Fomin,
G. Gutin,
E. Jung Kim,
S. Saurabh,
and A. Yeo.
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem.
Journal of Computer and System Sciences,
76(7):650 - 662,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen and F. Havet.
Planar graphs with maximum degree $\Delta\geq 9$ are ($\Delta+1$)-edge-choosable -- short proof.
Discrete Mathematics,
310(21):3049--3051,
2010.
[PDF
]
Keywords:
edge-colouring,
list colouring,
List Colouring Conjecture,
planar graphs.
[Abstract] [bibtex-entry]
-
D. Coudert,
N. Nepomuceno,
and H. Rivano.
Power-Efficient Radio Configuration in Fixed Broadband Wireless Networks.
Computer Communications, Special Section on Hot Topics in Mesh Networking,
33(8):898-906,
May 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Dalle,
Q. Liu,
G. Wainer,
and B. P. Zeigler.
Applying Cellular Automata and DEVS Methodologies to Digital Games: A Survey.
Simulation & Gaming,
41(6):796-823,
December 2010.
Note: EA DISSIMINET (Associated Team).
[WWW
] [Abstract] [bibtex-entry]
-
N. Eggemann,
F. Havet,
and S. Noble.
k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$.
Discrete Applied Mathematics,
158(16):1777--1788,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Eslahchi,
H. Pezeshk,
M. Sadeghi,
P. Giabbanelli,
F. Movahedi,
and V. Dabbaghian.
A Probabilistic Model for the Spread of HIV Infection among Injection Drug Users.
World Journal of Modelling and Simulation (WJMS),
6(4):267-273,
November 2010.
[PDF
] [Abstract] [bibtex-entry]
-
A. Ferreira,
A. Goldman,
and J. Monteiro.
Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs.
Wireless Networks,
16(3):627--640,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
A. Ferreira.
Uma estratégia face à Revolução Digital.
Teoria e Debate,
87:20-23,
2010.
[Abstract] [bibtex-entry]
-
M. Flammini,
G. Monaco,
L. Moscardelli,
H. Shachnai,
M. Shalom,
T. Tamir,
and S. Zaks.
Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks.
Theoretical Computer Science,
411(40-42):3553-3562,
September 2010.
[Abstract] [bibtex-entry]
-
F. V. Fomin,
P. A. Golovach,
J. Kratochvil,
N. Nisse,
and K. Suchan.
Pursuing a fast robber on a graph.
Theoretical Computer Science,
411(7-9):1167-1181,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
D. Král,
J.-S. Sereni,
and R. Skrekovski.
Facial coloring using Hall's theorems.
European Journal of Combinatorics,
31:1001--1019,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Molle.
Optimization of the Capacity of Wireless Mesh Networks.
4OR: A Quarterly Journal of Operations Research,
8(4):425-428,
December 2010.
[WWW
] [bibtex-entry]
-
C. Molle and M-E. Voge.
A quantitative analysis of the capacity of wireless mesh networks.
IEEE Communications Letters,
14(5):438-440,
May 2010.
[WWW
] [bibtex-entry]
-
H. Rivano,
F. Theoleyre,
and F. Valois.
A Framework for the Capacity Evaluation of Multihop Wireless Networks.
Ad Hoc and Sensor Wireless networks (AHSWN),
9(3-4):139-162,
2010.
[PDF
] [Abstract] [bibtex-entry]
-
I. Sau and D. M. Thilikos.
Subexponential Parameterized Algorithms for Degree-constrained Subgraph Problems on Planar Graphs.
Journal of Discrete Algorithms,
8(3):330-338,
September 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
E. Alvarez-Miranda,
A. Candia,
X. Chen,
X. Hu,
and B. Li.
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data.
In Proceedings of the 6th International Conference on Algorithmic Aspects in Information and Management (AAIM),
volume 6124 of Lecture Notes in Computer Science,
Weihai, China,
pages 13-24,
July 2010.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Araujo,
C. Linhares Sales,
and I. Sau.
Weighted Coloring on $P_4$-sparse Graphs.
In 11es Journées Doctorales en Informatique et Réseaux (JDIR 2010),
Sophia Antipolis, France,
pages 33--38,
March 2010.
[PDF
] [Abstract] [bibtex-entry]
-
J. Beauquier and J. Burman.
Self-stabilizing Synchronization in Mobile Sensor Networks with Covering.
In Distributed Computing in Sensor Systems, 6th IEEE International Conference, DCOSS 2010,
volume 6131 of Lecture Notes in Computer Science,
pages 362-378,
2010.
Springer.
[PDF
] [Abstract] [bibtex-entry]
-
J. Beauquier,
J. Burman,
J. Clement,
and S. Kutten.
On Utilizing Speed in Networks of Mobile Agents.
In Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010,
pages 305-314,
2010.
ACM.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Mazauric,
V. Misra,
and P. Nain.
A Distributed Scheduling Algorithm for Wireless Networks with Constant Overhead and Arbitrary Binary Interference.
In SIGMETRICS 2010,
pages 2p,
2010.
ACM.
[PDF
] [Abstract] [bibtex-entry]
-
C. Caillouet,
F. Huc,
N. Nisse,
S. Pérennes,
and H. Rivano.
Stability of a localized and greedy routing algorithm.
In 12th Workshop on Advances in Parallel and Distributed Computational Models,
pages 8p,
2010.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Caillouet,
S. Perennes,
and H. Rivano.
Cross line and column generation for the cut covering problem in wireless networks.
In International Symposium on Combinatorial Optimization (ISCO),
pages 8p,
March 2010.
Note: To appear.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Caron,
F. Giroire,
D. Mazauric,
J. Monteiro,
and S. Pérennes.
Data Life Time for Different Placement Policies in P2P Storage Systems.
In Proceedings of the 3rd Intl. Conference on Data Management in Grid and P2P Systems (Globe),
volume 6265 of Lecture Notes in Computer Science,
Bilbao, Spain,
pages 75--88,
September 2010.
[PDF
]
Keywords:
P2P storage system,
data placement,
performance,
data durability,
Markov chain model.
[Abstract] [bibtex-entry]
-
S. Caron,
F. Giroire,
D. Mazauric,
J. Monteiro,
and S. Pérennes.
P2P Storage Systems: Data Life Time for Different Placement Policies.
In Maria Gradinariu Potop-Butucaru et Hervé Rivano, editor,
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
Belle Dune France,
pages 4p,
2010.
[WWW
] [PDF
]
Keywords:
P2P storage system,
data placement,
performance,
data durability,
Markov chain model.
[Abstract] [bibtex-entry]
-
J. Chalopin,
V. Chepoi,
N. Nisse,
and Y. Vaxes.
Cop and robber games when the robber can hide and ride.
In 8th French Combinatorial Conference,
Orsay,
June 2010.
Note: Selection on abstract.
[Abstract] [bibtex-entry]
-
N. Cohen,
D. Coudert,
D. Mazauric,
N. Nepomuceno,
and N. Nisse.
Tradeoffs in process strategy games with application in the WDM reconfiguration problem.
In P. Boldi and L. Gargano, editors,
Fifth International conference on Fun with Algorithms (FUN 2010),
volume 6099 of Lecture Notes in Computer Science,
Ischia Island, Italy,
pages 121-132,
June 2010.
Springer.
Note: Http://hal.inria.fr/inria-00495443.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen,
D. Coudert,
D. Mazauric,
N. Nepomuceno,
and N. Nisse.
Tradeoffs in routing reconfiguration problems.
In Maria Gradinariu Potop-Butucaru et Hervé Rivano, editor,
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
Belle Dune France,
pages 4p,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert.
Graph searching games for the WDM reconfiguration problem.
In 24th European Conference on Operational Research (EURO),
Lisbon, Portugal,
pages 1p,
July 2010.
Note: Invited talk.
[WWW
] [Abstract] [bibtex-entry]
-
P. Giabbanelli.
Impact of complex network properties on routing in backbone networks.
In Proceedings of the IEEE Globecom 2010 Workshop on Complex and Communication Networks (CCNet 2010),
2010.
[PDF
] [Abstract] [bibtex-entry]
-
P. Giabbanelli,
A. Alimadad,
V. Dabbaghian,
and D. T. Finegood.
Modeling the influence of social networks and environment on energy balance and obesity.
In XI International Conference on Obesity (ICO),
July 2010.
Note: Acceptance rate 8.6%.
[bibtex-entry]
-
P. Giabbanelli,
D. Mazauric,
and J-C. Bermond.
Average path length of deterministic and stochastics recursive networks.
In Proceedings of the 2nd Workshop on Complex Networks (CompleNet),
volume 116 of Communications in Computer and Information Science (CCIS),
pages 1--12,
2010.
Springer-Verlag.
[PDF
] [Abstract] [bibtex-entry]
-
P. Giabbanelli,
D. Mazauric,
and S. Pérennes.
Computing the average path length and a label-based routing in a small-world graph.
In 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'10),
Belle Dune France,
pages 4p,
2010.
[WWW
] [PDF
]
Keywords:
Recursive graph,
Labeling scheme,
Decentralized routing.
[Abstract] [bibtex-entry]
-
F. Giroire,
D. Mazauric,
J. Moulierac,
and B. Onfroy.
Minimizing Routing Energy Consumption: from Theoretical to Practical Results.
In IEEE/ACM International Conference on Green Computing and Communications (GreenCom'10),
Hangzhou, China,
pages 8,
2010.
[PDF
] [Abstract] [bibtex-entry]
-
F. Giroire,
J. Monteiro,
and S. Pérennes.
Peer-to-Peer Storage Systems: a Practical Guideline to be Lazy.
In Proceedings of the IEEE Global Communications Conference (GLOBECOM),
Miami, EUA,
pages 1-6,
12 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Hanusse,
D. Ilcinkas,
A. Kosowski,
and N. Nisse.
Locating a target with an agent guided by unreliable local advice.
In 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'10),
volume XXXX,
pages 10p,
2010.
ACM.
Note: To appear.
[PDF
] [Abstract] [bibtex-entry]
-
N. Hanusse,
D. Ilcinkas,
A. Kosowski,
and N. Nisse.
Comment battre la marche aléatoire en comptant ?.
In 12ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'10),
pages 4p,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet and L. Sampaio.
On the Grundy number of a graph.
In Proceedings of the International Symposium on Parameterized and Exact Computation(IPEC),
number 6478 of Lecture Notes on Computer science,
pages 170-179,
December 2010.
[PDF
] [Abstract] [bibtex-entry]
-
L. Hogie,
D. Papadimitriou,
I. Tahiri,
and F. Majorczyk.
Simulating routing schemes on large-scale topologies.
In 24th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation (PADS),
Atlanta,
pages 8p,
May 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
B. Jaumard,
N.N. Bhuiyan,
S. Sebbah,
F. Huc,
and D. Coudert.
A New Framework for Efficient Shared Segment Protection Scheme for WDM Networks.
In IEEE High Performance Switching and Routing (HPSR),
Richardson, TX, USA,
pages 8p,
June 2010.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
B. Jaumard,
N.N. Bhuiyan,
S. Sebbah,
F. Huc,
and D. Coudert.
A New Framework for Efficient Shared Segment Protection Scheme for WDM Networks.
In 10th INFORMS Telecommunications Conference,
Montréal, Canada,
pages 2p,
May 2010.
Informs.
[WWW
] [Abstract] [bibtex-entry]
-
G. B. Mertzios,
I. Sau,
and S. Zaks.
The Recognition of Tolerance and Bounded Tolerance Graphs.
In Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS),
volume 5 of LIPIcs,
pages 585-596,
2010.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Monteiro and S. Pérennes.
Systèmes de stockage P2P : un guide pratique.
In 11es Journées Doctorales en Informatique et Réseaux (JDIR 2010),
Sophia Antipolis France,
pages 15--20,
2010.
[WWW
] [Abstract] [bibtex-entry]
-
N. Nisse.
Graph Searching and Graph Decompositions.
In 24th European Conference on Operational Research (EURO),
Lisbon, Portugal,
pages 1p,
July 2010.
Note: Invited talk.
[WWW
] [Abstract] [bibtex-entry]
-
J. Ribault,
O. Dalle,
D. Conan,
and S. Leriche.
OSIF: A Framework To Instrument, Validate, and Analyze Simulations.
In In Proc. of 3rd Intl. ICST Conference on Simulation Tools and Techniques (SIMUTools'2010),
Torremolinos, Spain,
15-19 March 2010.
[WWW
] [Abstract] [bibtex-entry]
-
P. Uribe,
J-C. Maureira Bravo,
and O. Dalle.
Extending INET Framework for Directional and Asymmetrical Wireless Communications.
In Proc. of the 2010 Intl. ICST Workshop on OMNeT++ (OMNeT++ 2010),
Torremolinos, Spain,
pages 1--8,
15-19 March 2010.
[bibtex-entry]
-
J. Bang-Jensen,
F. Havet,
and N. Trotignon.
Finding an induced subdivision of a digraph.
Research Report 7430,
INRIA,
10 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Barrière,
P. Flocchini,
F. V. Fomin,
P. Fraigniaud,
N. Nisse,
N. Santoro,
and D. Thilikos.
Connected Graph Searching.
Research Report 7363,
INRIA,
August 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Becker,
M. Matamala,
N. Nisse,
I. Rapaport,
K. Suchan,
and I. Todinca.
Adding a referee to an interconnection network: What can(not) be computed in one round.
Research Report arXiv:1009.4447,
arXiv,
September 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
F. Havet,
F. Huc,
and C. Linhares Sales.
Improper colouring of weighted grid and hexagonal graphs.
Research Report RR-7250,
INRIA,
April 2010.
[WWW
] [PDF
]
Keywords:
Improper colouring,
Weighted colouring,
Approximation algorithms.
[Abstract] [bibtex-entry]
-
V. Campos,
A. Gyárfás,
F. Havet,
C. Linhares Sales,
and F. Maffray.
New bounds on the Grundy number of products of graphs.
Research Report 7243,
INRIA,
April 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Caron,
F. Giroire,
D. Mazauric,
J. Monteiro,
and S. Pérennes.
P2P Storage Systems: Data Life Time for Different Placement Policies.
Research Report RR-7209,
INRIA,
February 2010.
[WWW
] [PDF
]
Keywords:
P2P storage system,
data placement,
data life time,
mean time to data loss,
performance evaluation,
Markov chains.
[Abstract] [bibtex-entry]
-
J. Chalopin,
V. Chepoi,
N. Nisse,
and Y. Vaxès.
Cop and robber games when the robber can hide and ride..
Technical report INRIA-RR7178,
INRIA,
January 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen and F. Havet.
Linear and 2-frugal choosability of graphs of small maximum average degree.
Research Report RR-7213,
INRIA,
02 2010.
[WWW
] [Abstract] [bibtex-entry]
-
F. Giroire,
D. Mazauric,
J. Moulierac,
and B. Onfroy.
Minimizing Routing Energy Consumption: from Theoretical to Practical Results.
Research Report inria-00464318,
May 2010.
[WWW
] [PDF
]
Keywords:
power consumption,
energy-efficient routing,
graphs,
linear programming.
[Abstract] [bibtex-entry]
-
N. Hanusse,
D. Ilcinkas,
A. Kosowski,
and N. Nisse.
How to beat the random walk when you have a clock?.
Research Report RR-7210,
INRIA,
February 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
C. Linhares Sales,
and L. Sampaio.
b-coloring of tight graphs.
Research Report 7241,
INRIA,
March 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
P. Uribe,
J-C. Maureira Bravo,
and O. Dalle.
Extending INET Framework for Directional and Asymmetrical Wireless Communications.
Research Report RR-7120,
INRIA,
03 2010.
[WWW
] [PDF
]
Keywords:
OMNeT++,
INET Framework,
Directional Radios,
Asymmetrical communication.
[Abstract] [bibtex-entry]
-
N. Cohen.
Several Graph Problems and their LP formulation,
2010.
[PDF
] [Abstract] [bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:41 2022
