On the scalability of uncoordinated multiple access for the Internet of Things

Chisci, Giovanni; ElSawy, Hesham; Conti, Andrea; Alouini, Mohamed‐Slim; Win, Moe Z.

doi:10.1109/iswcs.2017.8108148

Cited by 20 publications

(26 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Consequently, the SAP active state, ζ x,t , is both spatial and temporal dependent: The spatial locations determine how the SAPs interfere with each other, and the temporal traffic dynamic affects the queue evolution. Moreover, as a generic UE may see common interferencing SAPs in consecutive time slots, the system service rate is temporally correlated [9], [14], [15]. Such temporal correlation introduces memory to the queue and can highly complicate the analysis.…”

Section: Discussionmentioning

confidence: 99%

Delay Analysis of Random Scheduling and Round Robin in Small Cell Networks

Yang

Wang

Quek

2018

IEEE Wireless Commun. Lett.

View full text Add to dashboard Cite

We analyze the delay performance of small cell networks operating under random scheduling (RS) and round robin (RR) protocols. Based on stochastic geometry and queuing theory, we derive accurate and tractable expressions for the distribution of mean delay, which accounts for the impact of random traffic arrivals, queuing interactions, and failed packet retransmissions. Our analysis asserts that RR outperforms RS in terms of mean delay, regardless of traffic statistic. Moreover, the gain from RR is more pronounced in the presence of heavy traffic, which confirms the importance of accounting fairness in the design of scheduling policy. We also find that constrained on the same delay outage probability, RR is able to support more user equipments (UEs) than that of RS, demonstrating it as an appropriate candidate for the traffic scheduling policy of internet-of-things (IoT) network.

show abstract

Section: Discussionmentioning

confidence: 99%

Delay Analysis of Random Scheduling and Round Robin in Small Cell Networks

Yang

Wang

Quek

2018

IEEE Wireless Commun. Lett.

View full text Add to dashboard Cite

show abstract

“…Note that the left hand side (L.H.S.) of the above equation is continuous and decreasing in η S over [0, 1], thus the equation has one solution if (15) holds. Otherwise, if (15) does not hold, we have the L.H.S.…”

Section: A Proof Of Theoremmentioning

confidence: 99%

“…of the above equation is continuous and decreasing in η S over [0, 1], thus the equation has one solution if (15) holds. Otherwise, if (15) does not hold, we have the L.H.S. of (18) being negative which indicates that (17) monotonically increases as a function of η S .…”

Section: A Proof Of Theoremmentioning

confidence: 99%

Locally Adaptive Scheduling Policy for Optimizing Information Freshness in Wireless Networks

Yang

Arafa

Quek

et al. 2019

2019 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

Optimization of information freshness in wireless networks has usually been performed based on queueing analysis that captures only the temporal traffic dynamics associated with the transmitters and receivers. However, the effect of interference, which is mainly dominated by the interferers' geographic locations, is not well understood. In this paper, we leverage a spatiotemporal model, which allows one to characterize the age of information (AoI) from a joint queueing-geometry perspective, and design a decentralized scheduling policy that exploits local observation to make transmission decisions that minimize the AoI. Simulations results reveal that the proposed scheme not only largely reduces the peak AoI but also scales well with the network size.

show abstract

“…In this segment, optimal number of cluster estimation is performed in such a way that it has to diminish energy consumption while providing higher degree of connectivity for transmitting the glucose level to doctors [24].…”

Section: B Adaptive Positioning Of Optimal Cluster Headmentioning

confidence: 99%

Modelling an Adaptive Cluster Head Positioning Based Map Reducing Strategy for Data Transmission in Medical IoT

2019

IJEAT

View full text Add to dashboard Cite

Internet-of-things (IoT) based health monitoring systems have turned out to be an interesting topic to enhance quality of health care services. Moreover, there is no advanced IoT based continuous monitoring of glucose systems in real time and some prevailing techniques have numerous limitations. Here, a continuous and invasive glucose monitoring system for transmitting the condition of individuals simultaneously utilizing IoT is modelled and a general system architectural design for processing back end systems to provide body temperature, real time glucose and contextual data in human readable and graphical forms to the physicians or patients is anticipated. As well, a protocol designs for monitoring the continuous data from IoT devices in order to overcome the short comings of existing methods is provided. The design of an energy efficient routing algorithm is a hot topic in the research of IoT based Data mining. Cluster Heads (CH) form backbone of inter-cluster communication. The selection of reliable and efficient cluster head is another important issue. In most of the clustering process, failure of CH occurs due to energy depletion and if the distance between sink and CH is more, it ultimately leads to failure in transmission. During transmission, nodes may fail that means sudden energy loss or node gets out of coverage. Due to relaying high data traffic, some of nodes quickly exhaust their energy and increase the risk of node failure. As a baseline to node failure, data packet loss also occurs in a CH due to congestion and poor link quality. Hence, one of the most crucial feature in designing a protocol is to minimize energy consumption for betterment of network functioning. Here, a clustering routing protocol based on data mining techniques is applied for sensor nodes in medical field called Adaptive Positioning of Cluster Head based Map reducing (APCH-MR) is proposed. Routing table based code book is generated for privacy concern, in which the process of mapping and reducing the data for dissemination is performed. The simulated outcomes depicts that the total number of packets transmitted in round 500 is 11200, total number of dead nodes during round 500 is 58, and time consumed by nodes at 500 rounds is 0.3751s respectively. The proposed method shows better trade off in contrast to conventional techniques.

show abstract

On the scalability of uncoordinated multiple access for the Internet of Things

Cited by 20 publications

References 17 publications

Delay Analysis of Random Scheduling and Round Robin in Small Cell Networks

Delay Analysis of Random Scheduling and Round Robin in Small Cell Networks

Locally Adaptive Scheduling Policy for Optimizing Information Freshness in Wireless Networks

Modelling an Adaptive Cluster Head Positioning Based Map Reducing Strategy for Data Transmission in Medical IoT

Contact Info

Product

Resources

About