Emílio C. G. Wille

Orcid: 0000-0003-1916-0031

According to our database1, Emílio C. G. Wille authored at least 28 papers between 1997 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Simple and Accurate Approximations for the Sum of Nakagami-m and Related Random Variables.
Int. J. Wirel. Inf. Networks, December, 2023

Improving TCP performance over a common IoT scenario using the Early Window Tailoring method.
Comput. Networks, October, 2023

Strategies to increase connectivity and performance of VANETs: Analysis of route lifetime and routing protocol proposal.
Trans. Emerg. Telecommun. Technol., January, 2023

2022
An Analysis of Route Duration Times in Vehicular Networks Considering Influential Factors.
J. Inf. Technol. Res., 2022

2020
Bio-inspired routing algorithm for MANETs based on fungi networks.
Ad Hoc Networks, 2020

2019
Early Window Tailoring: A New Approach to Increase the Number of TCP Connections Served.
J. Comput. Networks Commun., 2019

2018
FB-APSP: A new efficient algorithm for computing all-pairs shortest-paths.
J. Netw. Comput. Appl., 2018

Routing in Vehicular Ad Hoc Networks: Main Characteristics and Tendencies.
J. Comput. Networks Commun., 2018

2016
Routing Protocols for VANETs: An Approach based on Genetic Algorithms.
KSII Trans. Internet Inf. Syst., 2016

P-AOMDV: An improved routing protocol for V2V communication based on public transport backbones.
Trans. Emerg. Telecommun. Technol., 2016

Early congestion control: A new approach to improve the performance of TCP in ad hoc networks.
Proceedings of the 7th International Conference on the Network of the Future, 2016

2015
Improving VANETs Connectivity with a Totally Ad Hoc Living Mobile Backbone.
J. Comput. Networks Commun., 2015

Performance of routing protocols for VANETs: a realistic analysis format.
Proceedings of the 9th International Conference on Ubiquitous Information Management and Communication, 2015

2013
Solving the base station placement problem by means of swarm intelligence.
Proceedings of the 2013 IEEE Symposium on Computational Intelligence for Communication Systems and Networks, 2013

2012
Fast emergency paths schema to overcome transient link failures in ospf routing
CoRR, 2012

2011
Discrete Capacity Assignment in IP networks using Particle Swarm Optimization.
Appl. Math. Comput., 2011

2008
Fast recovery paths schema to improve reliability in IP networks.
Proceedings of the IEEE/IFIP Network Operations and Management Symposium: Pervasive Management for Ubioquitous Networks and Services, 2008

A Simulation Study of the WFQ Scheduler in a DiffServ Node under LRD Traffic.
Proceedings of the Seventh International Conference on Networking (ICN 2008), 2008

A Fast Rerouting Approach to Reduce Packet Loss during IP Routing Protocols Convergence.
Proceedings of the 22nd International Conference on Advanced Information Networking and Applications, 2008

Fast Recovery Paths: Reducing Packet Loss Rates during IP Routing Convergence.
Proceedings of the Fourth Advanced International Conference on Telecommunications, 2008

2006
Algorithms for IP network design with end-to-end QoS constraints.
Comput. Networks, 2006

A Simple Acceptance Criterion for Binary Block Codes Soft-Decision Algorithms.
Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT/ICIW 2006), 2006

2005
Topological Design of Survivable IP Networks Using Metaheuristic Approaches.
Proceedings of the Quality of Service in Multiservice IP Networks, 2005

2004
Design and planning of IP networks under end-to-end QoS constraints.
PhD thesis, 2004

2001
Multilevel coding modulation system with binary block codes.
Comput. Commun., 2001

Analysis of a Bound of Voronoi Region V(C0) and Proposal of Sub-Optimum Decoding Algorithm.
Proceedings of the 2001 International Symposium on Information Technology (ITCC 2001), 2001

1998
Proposal of sub-optimum decoding algorithm with a bound of Voronoi region V(C<sub>0</sub>).
Comput. Commun., 1998

1997
A new approach to the information set decoding algorithm.
Comput. Commun., 1997


  Loading...