Vicent Cholvi

Vicent Cholvi

Auto-generated profile, based on publicly available information

Vicent Cholvi

Departament de Llenguatges i Sistemes Informàtics, Universitat Jaume I, Castelló, Spain

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 July 2019 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
EAEdgar Arribas
Edgar Arribas
VMVincenzo Mancuso
Vincenzo Mancuso
VCVicent Cholvi
Vicent Cholvi
The integration of aerial base stations carried by drones in cellular networks offers promising opportunities to enhance the connectivity enjoyed by ground users. In this paper, we propose an optimization framework for the 3-D placement and repositioning of a fleet of drones with a realistic inter-drone interference model and drone connectivity constraints. We show how to maximize network coverage by means of an extremal-optimization algorithm. The design of our algorithm is based on a mixed-integer non-convex program formulation for a coverage problem that is NP-Complete, as we prove in the paper. We not only optimize drone positions in a 3-D space in polynomial time, but also assign flight routes solving an assignment problem and using a strong geometrical tool, namely Bézier curves, which are extremely useful for non-uniform and realistic topologies. Specifically, we propose to fly drones following Bézier curves to seek the chance of approaching to clusters of ground users. This enhances coverage over time while users and drones move. We assess the performance of our proposal for synthetic scenarios as well as realistic maps extracted from the topology of a capital city. We demonstrate that our framework is near-optimal and using Bézier curves increases coverage up to 47% while drones move.

21 March 2005 in Physical Review E
Verified
Journal Article
Closed access
PDF file
VCVicent Cholvi
Vicent Cholvi
VLVíctor Laderas
Víctor Laderas
LLLuis López
Luis López
AFAntonio Fernández
Antonio Fernández
Most studies in complex networks assume that once a link is created between two nodes it is never deleted. However, there is a recent interest towards systems where links can be rapidly rewired. An important issue in that type of networks is to discover the topology that, given a search algorithm, optimizes the search process. In this paper, we present a system model that, depending on the current network congestion, makes nodes to establish link connections so that the resulting topologies tend to a starlike when congestion is small and to randomlike topologies when congestion becomes relevant. Those topologies have been shown to be optimal in the above-mentioned conditions. Such a model can be easily implemented in practice and therefore, may be relevant in areas as the topology management of peer-to-peer networks.

27 June 2004
Verified
Conference Paper
Open access
PDF file
VCVicent Cholvi
Vicent Cholvi
PFPascal Felber
Pascal Felber
EBErnst Biersack
Ernst Biersack

24 October 2011 in Networks
Verified
Journal Article
Closed access
PDF file
VMVíctor M. López Millán
Víctor M. López Millán
VCVicent Cholvi
Vicent Cholvi
LLLuis López
Luis López
AAAntonio Fernández Anta
Antonio Fernández Anta

29 November 2004 in European Transactions on Telecommunications
Verified
Journal Article
Closed access
PDF file
VCVicent Cholvi
Vicent Cholvi
PFPascal Felber
Pascal Felber
EBErnst Biersack
Ernst Biersack

1 October 2007 in Computer Networks
Verified
Journal Article
Closed access
VCVicent Cholvi
Vicent Cholvi
JEJuan Echagüe
Juan Echagüe