?
Routing-efficient CDS construction in Disk-Containment Graphs
Optimization Letters. 2012. P. 1-10.
In wireless networks, Connected Dominating Sets (CDSs) are widely used as virtual backbones for communications. On one hand, reducing the backbone size will reduce the maintenance overhead. So how to minimize the CDS size is a critical issue. On the other hand, when evaluating the performance of a wireless network, the hop distance between two communication nodes, which reflect the energy consumption and response delay, is of great importance. Hence how to minimize the routing cost is also a key problem for constructing the network virtual backbone. In this paper, we study the problem of constructing applicable CDS in wireless networks in terms of size and routing cost. We formulate a wireless network as a Disk-Containment Graph (DCG), which is a generalization of the Unit-Disk Graph (UDG), and we develop an efficient algorithm to construct CDS in such kind of graphs. The algorithm contains two parts and is flexible to balance the performance between the two metrics. We also analyze the algorithm theoretically. It is shown that our algorithm has provable performance in minimizing the CDS size and reducing the communication distance for routing.
Lazarev A. A., Musatova E. G., Kvaratskhelia A. et al., М. : Физический факультет МГУ, 2012
Данное учебное пособие посвящено задачам теории расписаний, возникающим на транспорте. Представлены основы теории расписаний, а также способы построения моделей и методы решения задач управления транспортными системами. Изложенный материал предназначен для студентов и преподавателей вузов математических специальностей, специалистов в области управления и практиков, занимающихся решением задач планирования грузовых перевозок. ...
Added: December 10, 2012
Galinina O., Andreev S., Gerasimenko M. et al., IEEE Journal on Selected Areas in Communications 2014 Vol. 32 No. 6 P. 1083-1099
As fourth generation communications technology is
already being deployed, research efforts are now being shifted to
what comes beyond state-of-the-art wireless systems. Driven by the
anticipated acceleration in mobile traffic demand, the wireless industry
is specifically focused on improving capacity and coverage
of current networks through aggressive reuse of the cellular spectrum.
Together with deploying an increasingly dense overlay tier
of smaller ...
Added: February 25, 2015
Springer, 2018
This book constitutes the refereed post-conference proceedings of the 29th International Workshop on Combinatorial Algorithms, IWOCA 2018, held in Singapore, Singapore, in July 2018. The 31 regular papers presented in this volume were carefully reviewed and selected from 69 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, ...
Added: October 23, 2018
Cham : Springer, 2021
This book constitutes the proceedings of the 20th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2021, held in Irkutsk, Russia, in July 2021.
The 29 full papers and 1 short paper presented in this volume were carefully reviewed and selected from 102 submissions. Additionally, 2 full invited papers are presented in the volume. ...
Added: July 8, 2021
Khachay M., Khachay M., Pardalos P., Springer, 2019
This volume contains the refereed proceedings of the 18th international conference on Mathematical Optimization Theory and Operations Research (MOTOR 2019)1 held during July 8–12, 2019, near Ekaterinburg, Russia. The conference brings together a wide research community in the fields of mathematical programming and global optimization, discrete optimization, complexity theory and combinatorial algorithms, optimal control and games, and their applications in relevant ...
Added: October 24, 2019
IEEE, 2016
Added: January 24, 2018
Berlin : Springer, 2012
This book constitutes the refereed proceedings of the 5th International Workshop on Multiple Access Communications, MACOM 2012, held in Maynooth, Ireland, in November 2012. The 13 full papers and 5 demo and poster papers presented were carefully reviewed and selected from various submissions. The papers are organized in topical sections on network coding, handling interference ...
Added: January 30, 2013
VDE-Verlag, 2015
Added: January 24, 2018
IEEE, 2018
Added: October 15, 2018
Gurvich V., Boros E., Manthey B. et al., Algorithmica (Германия) 2018 Vol. 80 No. 11 P. 3132-3157
We consider two-player zero-sum stochastic mean payoff games with perfect information. We show that any such game, with a constant number of random positions and polynomially bounded positive transition probabilities, admits a polynomial time approximation scheme, both in the relative and absolute sense. ...
Added: November 2, 2017
Malyshev D., Journal of Combinatorial Optimization 2017 Vol. 33 No. 3 P. 809-813
We consider the coloring problem for hereditary graph classes, i.e. classes of simple unlabeled graphs closed under deletion of vertices. For the family of the hereditary classes of graphs defined by forbidden induced subgraphs with at most four vertices, there are three classes with an open complexity of the problem. For the problem and the ...
Added: March 17, 2016
Berlin : Springer, 2014
This book constitutes the refereed proceedings of the 22st Annual European Symposium on Algorithms, ESA 2014, held in Wrocław, Poland, in September 2014, as part of ALGO 2014. The 69 revised full papers presented were carefully reviewed and selected from 269 initial submissions: 57 out of 221 in Track A, Design and Analysis, and 12 ...
Added: September 2, 2014
Lazarev A. A., Gafarov E., М. : Физический факультет МГУ, 2011
В данном учебном пособии приводятся базовые сведения о специальном разделе дискретной математики - Теории расписаний. Описаны этапы становления теории, свойства и классификации задач теории расписаний, методы их решения. На примерах классических задач представлены приемы доказательства их трудоемкости и алгоритмы решения. Учебное пособие основано на курсе лекций, читаемых в МФТИ, МГУ и ВШЭ, и предназначено для ...
Added: December 10, 2012
IEEE, 2017
Added: January 24, 2018
Bliznets Ivan, Cygan M., Komosa P. et al., ACM Transactions on Computation Theory 2018 Vol. 10 No. 2 P. 1-32
The H-free Edge Deletion problem asks, for a given graph G and integer k, whether it is possible to delete at most k edges from G to make it H-free—that is, not containing H as an induced subgraph. The H-free Edge Completion problem is defined similarly, but we add edges instead of deleting them. The study of these two problem families has recently been the subject of intensive studies from the point of ...
Added: October 30, 2018
Uvaysov S. U., Azizov R. F., Aminev D. et al., Прикаспийский журнал: управление и высокие технологии 2015 № 1(29) С. 101-107
Provides an overview of the principles of organization of communication in decentralized wireless networks is reviewed. The scheme of the decentralized network and the timing diagram of data transfer between nodes are shown. Investigated the problem of ensuring the effectiveness of collaboration with a number of nodes in low-power networks and consider the possibility of ...
Added: March 26, 2015
Belyaev E., Moltchanov P., Vinel A. et al., IEEE Transactions on Vehicular Technology 2013 Vol. 14 No. 3 P. 1035-1042
Overtaking on rural roads may cause severe accidents when oncoming traffic is detected by a driver too late, or its speed is underestimated. Recently proposed cooperative overtaking assistance systems are based on real-time video transmission, where a video stream captured with a camera installed at the windshield of a vehicle is compressed, broadcast through the ...
Added: February 25, 2015
Bankov D., Khorov E., Lyakhov A. et al., Journal of Communications Technology and Electronics 2019 Vol. 64 No. 8 P. 880-889
The development of wireless communication technologies attracts increased interest to scenarios that impose severe restrictions on data transmission reliability and latency. Such scenarios include real-time applications, such as industrial automation, remote control, video streaming, and virtual reality. It is very difficult to satisfy the requirements imposed on the quality of service with the currently widespread ...
Added: October 1, 2019
Komarov M. M., Дормидонтова Екатерина Александровна, Автоматизация. Современные технологии 2018 Т. 72 № 8 С. 377-382
Approaches to the formation of service quality evaluation in 4G networks and to the evaluation of service quality in the networks of the new (fifth) generation are considered. The metrics and approaches to this evaluation are proposed, and evaluation criteria are determined. Possible ways of 5G networks development are described. ...
Added: September 12, 2018
Springer, 2018
This book constitutes the proceedings of the 16th IFIP International Conference on Wired/Wireless Internet Communications, WWIC 2018, held in Boston, MA, USA, in June 2018.
The 26 regular papers presented in this volume were carefully reviewed and selected from 42 submissions. They were organized in topical sections named: IoT and sensor networks; learning-based networking; network deployment; ...
Added: March 12, 2019
Nonorthogonal Multiple Access for Servicing the Internet of Things and Web Traffic in Wi-Fi Networks
Тутельян С. А., Khorov E., Journal of Communications Technology and Electronics 2020 Vol. 65 No. 6 P. 741-749
Nowadays, many devices require a wireless Internet connection, while the available frequency spectrum is limited. The nonorthogonal multiple access (NOMA) is a multiplexing technology that can significantly improve spectral efficiency and thus solve this problem. In this paper, the use of NOMA in Wi-Fi networks with two traffic types, Web traffic and Internet of Things ...
Added: November 27, 2020
Springer, 2019
In this paper, we study the Maximum Happy Vertices and the Maximum Happy Edges problems (MHV and MHE for short). Very recently, the problems attracted a lot of attention and were studied in Agrawal ’17, Aravind et al. ’16, Choudhari and Reddy ’18, Misra and Reddy ’17. Main focus of our work is lower bounds on the computational complexity ...
Added: October 29, 2019
Toldova S., Azerkovich I., Гришина Ю. et al., / НИУ ВШЭ. Series WP BRP "Linguistics". 2015.
Building benchmark corpora in the domain of coreference and anaphora resolution is an important task for developing and evaluating NLP systems and models. Our study is aimed at assessing the feasibility of enhancing corpora with information about coreference relations. The annotation procedure includes identification of text segments that are subjects to annotation (markables), marking their ...
Added: December 15, 2015
Kiselyova N. N., Dudarev V.A., Korzhuev M. A., Inorganic Materials: Applied Research 2016 Vol. 7 No. 1 P. 34-39
A database (DB) on the bandgap of inorganic substances available via the Internet (http://bg.imetdb.ru) was developed for the information service of specialists in the sphere of inorganic chemistry and materials science. The DB is integrated with other information systems on the properties of inorganic substances and materials, which provides the search of a wide range ...
Added: February 23, 2016