Machine-to-Machine (M2M) communications: A survey

Verma, Pawan Kumar; Verma, Rajesh; Prakash, Arun; Agrawal, Ashish; Naik, Kshirasagar; Tripathi, Rajeev; Alsabaan, Maazen; Khalifa, Tarek; Abdelkader, Tamer; Abogharaf, Abdulhakim

doi:10.1016/j.jnca.2016.02.016

Cited by 161 publications

(69 citation statements)

References 104 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Blockchain [215]) is vital to enhance D2D security. Machine-to-Machine communications is also a promising technology for future networks [235]. This allows automatic interaction among devices, namely sensors and actuators.…”

Section: Wireless Sensor Networkmentioning

confidence: 99%

Game Theory for Multi-Access Edge Computing: Survey, Use Cases, and Future Trends

Moura

Hutchison

2019

IEEE Commun. Surv. Tutorials

168

108

View full text Add to dashboard Cite

Game Theory (GT) has been used with significant success to formulate, and either design or optimize, the operation of many representative communications and networking scenarios. The games in these scenarios involve, as usual, diverse players with conflicting goals. This paper primarily surveys the literature that has applied theoretical games to wireless networks, emphasizing use cases of upcoming Multi-Access Edge Computing (MEC). MEC is relatively new and offers cloud services at the network periphery, aiming to reduce service latency backhaul load, and enhance relevant operational aspects such as Quality of Experience or security. Our presentation of GT is focused on the major challenges imposed by MEC services over the wireless resources. The survey is divided into classical and evolutionary games. Then, our discussion proceeds to more specific aspects which have a considerable impact on the game's usefulness, namely: rational vs. evolving strategies, cooperation among players, available game information, the way the game is played (single turn, repeated), the game's model evaluation, and how the model results can be applied for both optimizing resource-constrained resources and balancing diverse trade-offs in real edge networking scenarios. Finally, we reflect on lessons learned, highlighting future trends and research directions for applying theoretical model games in upcoming MEC services, considering both network design issues and usage scenarios.

show abstract

Section: Wireless Sensor Networkmentioning

confidence: 99%

Game Theory for Multi-Access Edge Computing: Survey, Use Cases, and Future Trends

Moura

Hutchison

2019

IEEE Commun. Surv. Tutorials

168

108

View full text Add to dashboard Cite

show abstract

“…Any distributed ACS functions by exchanging telemetry data between the ACS-controller and sensor network objects in real-time mode. Such automated control systems are sensitive to data transmission delays in the control loop, [3,4]; these time delays can generate parasitic self-oscillations in the system, [5].…”

Section: T I K H O N O Vmentioning

confidence: 99%

“…The EtherCAT protocol operates on packets transmitted within an IEEE 802. 3 Ethernet frame (with an Ethertype 88a4 field) or within a UDP/IP datagram. The EtherCAT network segment combines one master device with its MAC address and many slave devices (without their own MAC addresses).…”

Section: Literature Review and Problem Statementmentioning

confidence: 99%

See 1 more Smart Citation

Modeling the conveyor-modular transfer of multimedia data in a sensor network of transport system

Tikhonov

Tykhonova

Tsyra

et al. 2019

EEJET

View full text Add to dashboard Cite

В роботі досліджені питання побудови і взаємодії розподілених сенсорних мереж в архітектурі Інтернету речей і системах автоматизованого управління динамічними інфраструктурними об'єктами. Проаналізовано особливості та структура мультимедійних потоків цифрової телеметрії і пакетних даних між контроллерами сенсорних мереж міського транспорту. Запропоновано спосіб модифікації стандартного мережевого інтерфейсу Ethernet на підрівні управління логічним з'єднанням (LLC) за технологією "сирих сокетів" (Raw Socket) для спільної передачі багатоканальної телеметрії і пакетних даних. Розроблено програмний симулятор конвеєрно-модульного перенесення на мові Python в операційній системі Linux Ubuntu, в якому використано метод динамічного структурування даних тегами розмітки. Актуальність даної роботи обумовлена необхідністю подальшого підвищення міжмережевої інтероперабельності при побудові гетерогенних систем Інтернету речей. В результаті проведених досліджень обгрунтовано застосування конвеєрно-модульного перенесення (КМП) для обміну даними телеметрії з обмеженням затримок в системах контролю безпеки міського транспорту. Проведені випробування симулятора конвеєрно-модульного перенесення підтвердили релевантність і логічну несуперечливість основних принципів кодування, передачі і декодування мультимедійних даних в каналі зв'язку КМП. Отримані результати створюють науково-методичні передумови для поповнення існуючого стека TCP/IP новим протоколом міжмережевої взаємодії з обмеженням затримок, який може використовуватися спільно з протоколом IP в додатках реального часу Інтернету речей, і перш за все, в системах управління безпекою міського транспортуКлючові слова: сенсорна мережа, Інтернет речей, взаємодія реального часу, контроль затримок, конвеєрно-модульний перенос UDC 621.391.3

show abstract

“…Machine type communication (MTC) services with location-based information are becoming popular such as combat zone surveillance, health monitoring, fire detection and wild habitat monitoring [1,2,3]. MTC devices (in this paper, we use the term “devices” and “machines” interchangeably) with which sensors are equipped as a basic component are usually distributed randomly, accessed from far-away and configured automatically.…”

Section: Introductionmentioning

confidence: 99%

Greedy Successive Anchorization for Localizing Machine Type Communication Devices

Haq

Kim

2016

Sensors

View full text Add to dashboard Cite

Localization of machine type communication (MTC) devices is essential for various types of location-based applications. In this paper, we investigate a distributed localization problem in noisy networks, where an estimated position of blind MTC machines (BMs) is obtained by using noisy measurements of distance between BM and anchor machines (AMs). We allow positioned BMs also to work as anchors that are referred to as virtual AMs (VAMs) in this paper. VAMs usually have greater position errors than (original) AMs, and, if used as anchors, the error propagates through the whole network. However, VAMs are necessary, especially when many BMs are distributed in a large area with an insufficient number of AMs. To overcome the error propagation, we propose a greedy successive anchorization process (GSAP). A round of GSAP consists of consecutive two steps. In the first step, a greedy selection of anchors among AMs and VAMs is done by which GSAP considers only those three anchors that possibly pertain to the localization accuracy. In the second step, each BM that can select three anchors in its neighbor determines its location with a proposed distributed localization algorithm. Iterative rounds of GSAP terminate when every BM in the network finds its location. To examine the performance of GSAP, a root mean square error (RMSE) metric is used and the corresponding Cramér–Rao lower bound (CRLB) is provided. By numerical investigation, RMSE performance of GSAP is shown to be better than existing localization methods with and without an anchor selection method and mostly close to the CRLB.

show abstract

Machine-to-Machine (M2M) communications: A survey

Cited by 161 publications

References 104 publications

Game Theory for Multi-Access Edge Computing: Survey, Use Cases, and Future Trends

Game Theory for Multi-Access Edge Computing: Survey, Use Cases, and Future Trends

Modeling the conveyor-modular transfer of multimedia data in a sensor network of transport system

Greedy Successive Anchorization for Localizing Machine Type Communication Devices

Contact Info

Product

Resources

About