Sign for Notice Everyday    Sign Up| Sign In| Link|

Our Sponsors

Receive Latest News

Feedburner
Share Us

12th International Conference on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks (GRAPH-HOC – 2020)

View: 1145

Website Copenhagen,Denmark | Edit Freely

Category Copenhagen, Denmark

Deadline: May 30, 2020 | Date: September 26, 2020-September 27, 2020

Venue/Country: Copenhagen, Denmark, Denmark

Updated: 2020-05-18 18:49:02 (GMT+9)

Call For Papers - CFP

September 26 ~ 27, 2020, Copenhagen, Denmark

https://cseit2020.org/graphhoc/index.html

Call for papers

12th International Conference on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks (GRAPH-HOC - 2020) focuses on the applications of graph theory in different areas of wireless ad hoc networks such as Mobile Ad hoc Networks (MANETs), Vehicular Ad hoc Networks (VANETs) and sensor networks. Graph theoretic concepts are applied in several fundamental issues such as connectivity, data gathering, routing, mobility, energy efficiency and topology control. Papers submitted for the conference should focus on a problem that is of both theoretical as well as practical interest in the area of ad hoc networks and sensor networks. This conference will thus provide a platform for researchers from both theoretical and practical domains of ad hoc networks to meet and exchange their ideas.

Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the following areas, but are not limited to.

Topics of Interest :

Distributed extensions of centralized graph theoretic routing algorithms

Connectivity Analysis under Different Mobility Models

Data Gathering Algorithms and Protocols for Sensor Networks

Applications of Random Graph Theory in Ad Hoc Networks and Sensor Networks

Algorithms for Scheduling and Resource Allocation Problems

Algorithms for Topology Control and Power Assignment

Evacuation Routing Algorithms and Protocols for Vehicular Ad Hoc Networks

Secure Routing Algorithms and Protocols Based on Graph Theory

Approximation Heuristics for NP-complete problems related to Ad Hoc Networks

Paper Submission

Authors are invited to submit papers through conference Submission system by May 30, 2020. Submissions must be original and should not have been published previously or be under consideration for publication while being evaluated for this conference. The proceedings of the conference will be published by Computer Science Conference Proceedings in Computer Science & Information Technology (CS & IT) series (Confirmed).

Selected papers from GRAPH-HOC 2020, after further revisions, will be published in the special issue of the following journal.

International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks (GRAPH-HOC)

International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC)- UGC Listed

International Journal of Advanced Smart Sensor Network Systems (IJASSN)

International Journal on AdHoc Networking Systems (IJANS)

Information Technology in Industry (ITII)New- ESCI-Thomson Reuters Indexed

Important Dates

Submission Deadline : May 30, 2020

Notification :  June 20, 2020

Final Manuscript Due : June 28, 2020

Publication Date : Determined by the Editor-in-Chief

Here’s where you can reach us: graphhoc@cseit2020.org or graphhocconf@yahoo.com

Paper Submission Link : https://cseit2020.org/submission/index.php


Keywords: Accepted papers list. Acceptance Rate. EI Compendex. Engineering Index. ISTP index. ISI index. Impact Factor.
Disclaimer: ourGlocal is an open academical resource system, which anyone can edit or update. Usually, journal information updated by us, journal managers or others. So the information is old or wrong now. Specially, impact factor is changing every year. Even it was correct when updated, it may have been changed now. So please go to Thomson Reuters to confirm latest value about Journal impact factor.