Special Issue "Selected Papers from: 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA'17)"

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (30 April 2018)

Special Issue Editors

Guest Editor
Dr. Xiaofeng Gao

Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China
Website | E-Mail
Interests: data engineering; combinatorial optimization; wireless network
Guest Editor
Dr. Zhipeng Cai

Department of Computer Science, Georgia State University, 25 Park Place, Suite 741, Atlanta, GA 30303, USA
Website | E-Mail
Interests: algorithm; networking; big data; privacy

Special Issue Information

Dear Colleagues,

Combinatorial optimization is an area of research at the intersection of applied mathematics, computer science, and operations research, which has important applications in several fields.

This Special Issue is devoted to the theoretical and experimental research of all aspects of areas of combinatorial optimization and its applications, including Algorithms and Data Structures, Approximation Algorithms, Operation Research, Communication Network Optimization, Social Networks, Computational Algebra, Graph Theory, Distributed Computational Systems, and Scheduling, etc.

The topics of interest to this Special Issue cover the scope of the COCOA 2017 Conference (http://anl.sjtu.edu.cn/cocoa2017/callforpapers.html).

Extended versions of papers presented at COCOA 2017 are sought, but this call for papers is fully open to all those who wish to contribute by submitting a relevant research manuscript.

Dr. Xiaofeng Gao
Dr. Zhipeng Cai
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 850 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Combinatorial optimization
  • Approximation Algorithms
  • Operation Research
  • Game Theory
  • Graph Theory
  • Network
  • Application

Published Papers (1 paper)

View options order results:
result details:
Displaying articles 1-1
Export citation of selected articles as:

Research

Open AccessArticle A Robust and Energy-Efficient Weighted Clustering Algorithm on Mobile Ad Hoc Sensor Networks
Algorithms 2018, 11(8), 116; https://doi.org/10.3390/a11080116
Received: 12 May 2018 / Revised: 13 June 2018 / Accepted: 25 July 2018 / Published: 1 August 2018
PDF Full-text (2999 KB) | HTML Full-text | XML Full-text
Abstract
In an Ad hoc sensor network, nodes have characteristics of limited battery energy, self-organization and low mobility. Due to the mobility and heterogeneity of the energy consumption in the hierarchical network, the cluster head and topology are changed dynamically. Therefore, topology control and
[...] Read more.
In an Ad hoc sensor network, nodes have characteristics of limited battery energy, self-organization and low mobility. Due to the mobility and heterogeneity of the energy consumption in the hierarchical network, the cluster head and topology are changed dynamically. Therefore, topology control and energy consumption are growing to be critical in enhancing the stability and prolonging the lifetime of the network. In order to improve the survivability of Ad hoc network effectively, this paper proposes a new algorithm named the robust, energy-efficient weighted clustering algorithm (RE2WCA). For the homogeneous of the energy consumption; the proposed clustering algorithm takes the residual energy and group mobility into consideration by restricting minimum iteration times. In addition, a distributed fault detection algorithm and cluster head backup mechanism are presented to achieve the periodic and real-time topology maintenance to enhance the robustness of the network. The network is analyzed and the simulations are performed to compare the performance of this new clustering algorithm with the similar algorithms in terms of cluster characteristics, lifetime, throughput and energy consumption of the network. The result shows that the proposed algorithm provides better performance than others. Full article
Figures

Figure 1

Back to Top