WorldCat Identities

Mosteiro, Miguel A.

Overview
Works: 10 works in 30 publications in 1 language and 639 library holdings
Genres: Conference papers and proceedings  Academic theses 
Roles: Editor, Other, htt, Author
Classifications: QA76.9.A43, 004
Publication Timeline
.
Most widely held works by Miguel A Mosteiro
Algorithms for sensor systems : 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2016, Aarhus, Denmark, August 25-26, 2016, revised selected papers by Antonio Fernández Anta( )

11 editions published between 2017 and 2020 in English and held by 357 WorldCat member libraries worldwide

This book constitutes revised selected papers from the 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, held in Vienna, in September 2017. The 17 full papers presented in this volume were carefully reviewed and selected from 30 submissions. ALGOSENSORS is an international symposium dedicated to the algorithmic aspects of wireless networks. Originally focused on sensor networks, it now covers algorithmic issues arising in wireless networks of all types of computational entities, static or mobile, including sensor networks, sensor-actuator networks, autonomous robots. The focus is on the design and analysis of algorithms, models of computation, and experimental analysis
LATIN 2018: theoretical informatics : 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018 : proceedings by Latin American Symposium on Theoretical Informatics( )

11 editions published in 2018 in English and held by 248 WorldCat member libraries worldwide

This book constitutes the proceedings of the 13th Latin American Symposium on Theoretical Informatics, LATIN 2018, held in Buenos Aires, Argentina, in April 2018. The 63 papers presented in this volume were carefully reviewed and selected from 161 submissions. The Symposium is devoted to different areas in theoretical computer science, including, but not limited to: algorithms (approximation, online, randomized, algorithmic game theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, and random structures
LATIN 2018 : 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings by Michael A Bender( )

1 edition published in 2018 in English and held by 20 WorldCat member libraries worldwide

Crowd Computing as a Cooperation Problem: An Evolutionary Approach by Evgenia Christoforou( )

1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide

A Faster Exact-Counting Protocol for Anonymous Dynamic Networks by Maitri Chakraborty( )

1 edition published in 2017 in English and held by 2 WorldCat member libraries worldwide

Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution by Paulo Sérgio Almeida( )

1 edition published in 2016 in English and held by 2 WorldCat member libraries worldwide

Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony by Antonio Fernández Anta( )

1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide

Upper and lower bounds in radio networks by Miguel A Mosteiro( )

1 edition published in 2007 in English and held by 2 WorldCat member libraries worldwide

Sensor nodes are very weak computers that get distributed at random on a surface in order to achieve a large-scale sensing task. Once deployed, they must wake up and form a radio network. Given the extremely limited resources of sensor nodes, finding efficient solutions even for basic problems is very challenging. The results in this thesis concern the initialization from scratch, or Bootstrapping, of a Sensor Network. More precisely, we seek efficient-provable solutions to the most fundamental problem in Sensor Networks, its self organization. At the same time, we study lower bounds on the time complexity of such a problem. The first set of results in this thesis address the three parts that Sensor Network bootstrapping research has: to model the restrictions on sensor nodes; to prove that the sensors connectivity graph has a subgraph that would make a good network; and to give a distributed protocol for finding such a network subgraph that can be implemented on sensor nodes. A study of the Sensor Network Bootstrapping problem would not be complete without a study of lower bounds on the time complexity of solving it. Strikingly, the most basic problem in a Radio Network, i.e. to achieve a successful transmission, can be proved to be as difficult as other more complex problems under the constraints of a sensor node. The second set of results of this thesis shows new lower bounds for collision-free transmissions in Radio Networks. The main lower bound is tight for a variety of problems. An extension of this result gives the first lower bound for Sensor Network Bootstrapping. A lower bound on the expectation for fair protocols is also shown. Another contribuition of this thesis is a survey of research in Radio Networks. The survey includes two parts that have received extensive study: upper bounds for Sensor Network formation, and upper and lower bounds for non-colliding transmissions in Radio Networks proved under the broader context of more complex problems
Unbounded Contention Resolution in Multiple-Access Channels by Antonio Fernández Anta( )

1 edition published in 2013 in English and held by 2 WorldCat member libraries worldwide

Station Assignment with Reallocation by Austin Halper( )

1 edition published in 2018 in English and held by 2 WorldCat member libraries worldwide

 
Audience Level
0
Audience Level
1
  General Special  
Audience level: 0.00 (from 0.00 for Algorithms ... to 0.00 for Algorithms ...)

LATIN 2018: theoretical informatics : 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018 : proceedings
Covers
LATIN 2018: theoretical informatics : 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018 : proceedings
Languages
English (30)