The Constrained Application Protocol for pervasive machine-to-machine communications

2012 ◽  
Author(s):  
Markus Becker ◽  
Thomas Potsch ◽  
Koojana Kuladinithi ◽  
Carmelita Goerg
Keyword(s):  
Machine To Machine ◽  
Constrained Application Protocol

scholarly journals A Sleep-Awake Scheme Based on CoAP for Energy-Efficiency in Internet of Things

2017 ◽  
Vol 1 (4) ◽  
pp. 110 ◽  
Author(s):  
Wenquan Jin ◽  
DoHyeun Kim
Keyword(s):  
Energy Efficiency ◽  
Internet Of Things ◽  
Low Power ◽  
Task Force ◽  
Message Queue ◽  
Machine To Machine ◽  
Increase Energy Efficiency ◽  
The Core ◽  
Constrained Environments ◽  
Constrained Application Protocol

Internet Engineering Task Force (IETF) have developed Constrained Application Protocol (CoAP) to enable communication between sensor or actuator nodes in constrained environments, such as small amount of memory, and low power. IETF CoAP and HTTP are used to monitor or control environments in Internet of Things (IoT) and Machine-to-Machine (M2M). In this paper, we present a sleep-awake scheme based on CoAP for energy efficiency in Internet of Things. This scheme supports to increase energy efficiency of IoT nodes using CoAP protocol. We have slightly modified the IoT middleware to improve CoAP protocol to conserve energy in the IoT nodes. Also, the IoT middleware includes some functionality of the CoRE Resource Directory (RD) and the Message Queue (MQ) broker with IoT nodes to synchronize sleepy status.

On Multiple Access of a Large Number of Machine-Type Devices in Cellular Networks

2018 ◽  
pp. 105-114
Author(s):  
O. S. Galinina ◽  
S. D. Andreev ◽  
A. M. Tyurlikov
Keyword(s):  
Success Probability ◽  
Random Access ◽  
Time Interval ◽  
Short Time Interval ◽  
Control Mechanisms ◽  
Network Access ◽  
Smart Meters ◽  
Machine To Machine ◽  
Machine To Machine Communication ◽  
Machine Communication

Introduction: Machine-to-machine communication assumes data transmission from various wireless devices and attracts attention of cellular operators. In this regard, it is crucial to recognize and control overload situations when a large number of such devices access the network over a short time interval.Purpose:Analysis of the radio network overload at the initial network entry stage in a machine-to-machine communication system.Results: A system is considered that features multiple smart meters, which may report alarms and autonomously collect energy consumption information. An analytical approach is proposed to study the operation of a large number of devices in such a system as well as model the settings of the random-access protocol in a cellular network and overload control mechanisms with respect to the access success probability, network access latency, and device power consumption. A comparison between the obtained analytical results and simulation data is also offered. 

Platform Independent Analysis of Probabilities on Multithreaded Programs

2013 ◽  
Vol 1 (3) ◽  
pp. 48-65
Author(s):  
Yuting Chen
Keyword(s):  
Operating System ◽  
Static Analysis ◽  
Main Idea ◽  
Experimental Results ◽  
Machine To Machine ◽  
Concurrent Program ◽  
Acceptable Accuracy ◽  
Multithreaded Programs ◽  
Independent Analysis ◽  
And Performance

A concurrent program is intuitively associated with probability: the executions of the program can produce nondeterministic execution program paths due to the interleavings of threads, whereas some paths can always be executed more frequently than the others. An exploration of the probabilities on the execution paths is expected to provide engineers or compilers with support in helping, either at coding phase or at compile time, to optimize some hottest paths. However, it is not easy to take a static analysis of the probabilities on a concurrent program in that the scheduling of threads of a concurrent program usually depends on the operating system and hardware (e.g., processor) on which the program is executed, which may be vary from machine to machine. In this paper the authors propose a platform independent approach, called ProbPP, to analyzing probabilities on the execution paths of the multithreaded programs. The main idea of ProbPP is to calculate the probabilities on the basis of two kinds of probabilities: Primitive Dependent Probabilities (PDPs) representing the control dependent probabilities among the program statements and Thread Execution Probabilities (TEPs) representing the probabilities of threads being scheduled to execute. The authors have also conducted two preliminary experiments to evaluate the effectiveness and performance of ProbPP, and the experimental results show that ProbPP can provide engineers with acceptable accuracy.

Sign in / Sign up

Export Citation Format

Share Document