Design of a Scalable Hybrid MAC Protocol for Heterogeneous M2M Networks

Liu, Yi; Yuen, Chau; Cao, Xianghui; Hassan, Naveed Ul; Chen, Jiming

doi:10.1109/jiot.2014.2310425

Cited by 164 publications

(69 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to these schemes, each node in the network is assigned a time slot to transmit but it could capture the channel on any other slot after performing CSMA procedure. Similarly, authors in [22] propose a hybrid MAC protocol for heterogeneous Machine-to-Machine (M2M) networks which combine features of contention-based and TDMA schemes. A spectrum-aware cluster-based energy-efficient routing hybrid scheme is discussed in [23].…”

Section: Coexistence Of Heterogeneous Mac Schemesmentioning

confidence: 99%

Neighbors-Aware Proportional Fair scheduling for future wireless networks with mixed MAC protocols

Katila

Buratti

Abrignani

et al. 2017

J Wireless Com Network

View full text Add to dashboard Cite

In this paper, we consider a beyond-5G scenario, where two types of users, denoted as scheduled and uncoordinated nodes, coexist on the same set of radio resources for sending data to a base station. Scheduled nodes rely solely on a centralized scheduler within the base station for the assignment of resources, while uncoordinated nodes use an unslotted Carrier Sense Multiple Access (CSMA) protocol for channel access. We propose and evaluate through simulations: (a) a novel centralized resource scheduling algorithm, called Neighbors-Aware Proportional Fair (N-PF) and (b) a novel packet length adaptation algorithm, called Channel-Aware (CA) Packet Length Adaptation algorithm for the scheduled nodes. The N-PF algorithm considers the uplink channel state conditions and the number of uncoordinated nodes neighboring each scheduled node in the aggregate scheduling metric, in order to maximize packet transmission success probability. The CA algorithm provides an additional degree of freedom for improving the performance, thanks to the fact that scheduled nodes with lower number of hidden terminals, i.e., having higher packet capture probability, are assigned longer packet transmission opportunities. We consider two benchmark schemes: Proportional Fair (PF) algorithm, as a resource scheduling algorithm, and a discrete uniform distribution (DUD) scheme for packet lengths distribution. Simulation results show that the proposed schemes can result in significant gain in terms of network goodput, without compromising fairness, with respect to two benchmark solutions taken from the literature.Keywords: Proportional Fair, Neighbors-Aware, Scheduling, Unslotted CSMA, Packet delivery rate, Fairness, Packet length adaptation BackgroundIn future wireless systems, such as 5G and beyond, the current dominating human-centric communication systems will be complemented by a tremendous increase in the number of smart devices, i.e., things, equipped with radio devices, possibly sensors, and uniquely addressable [1]. This will result in explosion of wireless traffic volume [2] and consequently exponential growth in demand of radio spectrum. However, the radio spectrum resource will remain limited, and thus, efficient radio resource utilization techniques, such as advanced medium access control (MAC) schemes, will be of paramount importance.*Correspondence: charlesjumaa.katila@unibo.it Electrical, Electronics and Information Engineering Department, University of Bologna, Bologna, Italy Based on the above motivation, we envision a novel scenario, where some users (hereafter denoted as scheduled nodes), synchronized and coordinated by a base station (BS), coexist on the same set of radio resources with some other users (hereafter denoted as uncoordinated nodes), asynchronous with the BS and among them. As shown in Fig. 1, scheduled nodes could be user equipment (i.e., cellular users), while uncoordinated nodes could be things of the Internet of Things (IoT) paradigm, i.e., cars, machines, buildings [3].In wireless networks, MAC prot...

show abstract

Section: Coexistence Of Heterogeneous Mac Schemesmentioning

confidence: 99%

Neighbors-Aware Proportional Fair scheduling for future wireless networks with mixed MAC protocols

Katila

Buratti

Abrignani

et al. 2017

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…The distributed sleep scheduling and range adjustment [28] periodically determines the set of active nodes and sleep nodes for each cycle. An optimization problem is formulated for a scalable hybrid MAC protocol [29] to concurrently access the channel in a machine-to-machine network. The drawbacks of these methods are as follows: 1) The computation may be too time consuming to fit into the small computational power of a sensor node when there are a large number of neighbors; and 2) the production cost of the node as well as the node's overhead is increased.…”

Section: B Sleep Scheduling In Nonhierarchical Networkmentioning

confidence: 99%

Releasing Network Isolation Problem in Group-Based Industrial Wireless Sensor Networks

Shu

Wang

Niu

et al. 2017

IEEE Systems Journal

View full text Add to dashboard Cite

Abstract-In this paper, we propose a cross-layer optimization scheme named Adjusting the Transmission Radius (ATR), which is based on the Energy Consumed uniformly Connected K-Neighborhood (EC-CKN) sleep scheduling algorithm in wireless sensor networks (WSNs). In particular, we discovered two important problems, namely, the death acceleration problem and the network isolation problem, in EC-CKN-based WSNs. Furthermore, we solve these two problems in ATR, which creates sleeping opportunities for the nodes that cannot get a chance to sleep in the EC-CKN algorithm. Simulation and experimental results show that the network lifetime of ATR-Connected-K-Neighborhoodbased WSNs increases by 19%, on average, and the maximum increment is 41%. In addition, four important insights were discovered through this research work and presented in this paper.

show abstract

“…Moreover, one major drawback is its low channel utilization when only a small portion of nodes have data to send due to the pre-assigned time slots. Hybrid designs for multiple access are also proposed by many researchers [11][12][13]. The goal is to develop a hybrid multiple access protocol for heterogeneous M2M networks, which combines the benefits of both contention-based and reservation-based protocols.…”

Section: Introductionmentioning

confidence: 99%

“…A FPP of N points is of order m, where m 2 þ m þ 1 ¼ N. The plane consists of N sets of points, each of which has m þ 1 points. For example, a FPP of three points has three sets: (1,2), (1,3), and (2, 3); a FPP of seven points has seven sets: (1,2,3), (1,4,5), (1,6,7), (2,4,6), (2,5,7), (3,5,6), and (3,4,7); and a FPP of thirteen points consists of (1, 2, 3, 4), (1,5,6,7), (1,8,9,10), (1,11,12,13), (2,5,8,11), (2,6,9,12), (2,7,10,13), (3,5,…”

Section: Introductionmentioning

confidence: 99%

FISH: Finite Projective Plane Based Interference Cancellation for Slotted ALOHA

Woo

2016

Wireless Pers Commun

View full text Add to dashboard Cite

Due to the large number of light weight, low power devices in the future Internet, an efficient distributed multiple access protocol that can support a small fixed number of machines with continuous traffic along with a large variable number of devices with sporadic traffic is needed. The traffic in the future Internet has fundamentally different requirements: first, the accessing devices are of low power, which limit the transmission range; secondly, the delay is very stringent; thirdly, the number of active devices is time varying. In this paper, we propose a finite projective plane (FPP) based multiple access protocol (FISH) to meet such requirements. A low power node can transmit the replicas of a data packet in multiple time slots to achieve the same range of transmission as a high power node at one time. The initialization time slot of a frame allows for the estimation of the number of active nodes and the adjustment of the size of the frame to maximize the throughput. The interference cancellation and conflict resolution scheme of the FISH protocol is based on the theory of FPP. By using the property that the union of the sets of the FPP sharing one common point is a complete set, we are able to extract each of the individual user signals. One distinguishing feature of the FISH protocol is the amplification of the signal-to-noise ratio (SNR), which can either extend the transmission range or improve the bit error rate without sacrificing the throughput. In the performance evaluation, we demonstrate that the throughput is identical to the Slotted Aloha, while the SNR is magnified m times, where m is the order of the FPP. The proposed FISH protocol is of great use in the machine-to-machine communications as well as traditional cellular and satellite systems.

show abstract

Design of a Scalable Hybrid MAC Protocol for Heterogeneous M2M Networks

Cited by 164 publications

References 22 publications

Neighbors-Aware Proportional Fair scheduling for future wireless networks with mixed MAC protocols

Neighbors-Aware Proportional Fair scheduling for future wireless networks with mixed MAC protocols

Releasing Network Isolation Problem in Group-Based Industrial Wireless Sensor Networks

FISH: Finite Projective Plane Based Interference Cancellation for Slotted ALOHA

Contact Info

Product

Resources

About