Performance Evaluation of Frame Slotted-ALOHA with Succesive Interference Cancellation in Machine-to-Machine Networks
|
|
- Randolph Johns
- 6 years ago
- Views:
Transcription
1 Performance Evaluation of Frame Slotted-ALOHA with Succesive Interference Cancellation in Machine-to-Machine Networks F. Vázquez-Gallego, M. Rietti,J.Bas, J. Alonso-Zarate, and L. Alonso Centre Tecnològic de Telecomunicacions de Catalunya (CTTC), Castelldefels, Barcelona, Spain {francisco.vazquez, joan.bas, Universitat Politècnica de Catalunya (UPC), Castelldefels, Barcelona, Spain Abstract Machine-to-Machine (M2M) area networks connect a gateway with a huge number of energy-constrained end-devices. Therefore, energy efficiency is essential to prolong the lifetime of M2M networks. In this paper, we consider an M2M area network composed of hundreds or thousands of end-devices that periodically transmit data upon request from a gateway. We propose a Medium Access Control (MAC) protocol based on Frame Slotted- ALOHA (FSA) with Successive Interference Cancellation (SIC), also referred to as SIC-FSA, for data collection applications. By means of comprehensive computer-based simulations, we evaluate the delay and the energy consumed by the gateway and the enddevices using SIC-FSA. We have compared the delay and energy performance provided by SIC-FSA with that of conventional FSA and diversity-fsa (D-FSA). Results show that SIC-FSA can reduce the delay and energy consumption of the gateway in more than 5%, and the energy consumed by an end-device in more than %, with respect to FSA in dense M2M networks equipped with radio-transceivers in compliance with the IEEE 82. physical layer. Index Terms successive interference cancellation, frame slotted-aloha, performance evaluation, data collection. I. INTRODUCTION One of the major challenges in the design and deployment of Machine-to-Machine (M2M) networks is energy-efficiency. Future M2M networks will connect a large number of energyconstrained end-devices that must operate autonomously for years without human intervention. Therefore, communication protocols for M2M networks need to be specifically designed to reduce the energy consumed per end-device and the overall energy consumption of the network. In this paper, we focus on wireless M2M area networks for data collection applications []. Some examples of applications are asset tracking or Automatic Meter Reading (AMR), among others. In these networks, a large group of hundreds or thousands of end-devices are coordinated to periodically transmit data to an M2M gateway upon request. Although the traffic load generated by each end-device may be relatively low, the total number of end-devices that can attempt to get access This work was supported in part by the Research Projects CO2GREEN (TEC2-2823), ADVANTAGE (FP ), NEWCOM# (FP7-3836), and by the Catalan Government under grant 29SGR46. to the wireless channel simultaneously can be larger than the one manageable by traditional Medium Access Control (MAC) protocols. Consequently, an energy efficient and lowcomplexity MAC is needed to reduce collisions and manage the access to the channel. Random access protocols [2], such as Carrier Sense Multiple Access (CSMA) or ALOHA [3], are simple to implement and their distributed operation makes them ideal for low-cost end-devices with limited processing and memory resources. Indeed, many standards for wireless short-range communications typically used in M2M, such as the IEEE 82., IEEE , EN (Wireless M-bus for AMR), or ISO- 8-7 (for asset tracking) rely on random access. Unfortunately, since the end-devices must compete for the channel, random access protocols suffer from degraded performance [4] in terms of throughput and energy consumption, due to the high probability of collision, when the traffic load is high or when the number of end-devices increase, which is the case in M2M networks. Recent research works [5] [8] have adopted successive interference cancellation (SIC) techniques to resolve collisions and improve the performance of random access. The work in [9] proposes diversity frame slotted-aloha (D- FSA) as a variation of slotted-aloha (SA). In D-FSA, devices are synchronized to a common time frame pattern where every frame is divided into a number of slots in which devices contend to transmit several replicas of each data packet. Results show that D-FSA provides slight throughput enhancement with respect to SA. A more efficient use of the packet replicas was provided by Contention Resolution Diversity Slotted-ALOHA (CRDSA) [5] and Irregular Repetition Slotted-ALOHA (IRSA) [6]. In CRDSA and IRSA, similarly to D-FSA, devices also transmit two or more replicas of each data packet in every frame at random slots. In addition, both protocols implement a SIC algorithm which allows decoding collided packets, thus increasing throughput with respect to D- FSA. The works in [7] and [8] also proposed variants of FSA with SIC for M2M and Radio Frequency Identification (RFID), respectively. Up to our knowledge, previous works related to FSA with SIC have analyzed the performance enhancement
2 in terms of throughput with respect to FSA. Nevertheless, the energy efficiency provided by FSA with SIC remains an open research question. This is the main motivation of this paper, where we focus on identifying the conditions when a SIC- FSA protocol improves the energy efficiency with respect to FSA in M2M networks for data collection. Towards this end, we present the performance evaluation of a SIC-FSA protocol, and compare the performance of SIC-FSA, D-FSA, and FSA in terms of delay and energy consumption. For this purpose, we consider low power radio transceivers in compliance with the IEEE 82. standard []. The remainder of this paper is organized as follows. In Section II and Section III, we describe the system model and summarize the operation of the FSA, D-FSA, and SIC- FSA protocols considered in this work. In Section IV, we formulate the delay and energy consumption models. Section V is devoted to evaluate the performance of the protocols through comprehensive computer-based simulations. Finally, Section VI concludes the paper. II. SYSTEM MODEL We consider a wireless M2M area network composed of gateway (also referred to as coordinator) and n end-devices. The coordinator gathers data from the end-devices via periodic data collection rounds (DCR). A DCR is initiated when the coordinator broadcasts a Request for Data (RFD) packet. In every DCR each end-device has exactly one data packet ready to transmit to the coordinator. We assume that all enddevices are listening to the channel when the coordinator transmits an RFD. After decoding an RFD, the end-devices are synchronized to a common time frame pattern and contend for the channel to transmit their data packet according to the rules of the adopted MAC protocol described in Section III. Every RFD is followed by a sequence of time frames further divided into m slots. The size of the data packets is fixed and the duration of a time slot is equal to the duration of a data packet. The end-devices transmit their data packet in randomly selected slots and without performing carrier sensing, thus, each slot of a frame can be in one of three states: (i) empty, i.e., no end-device has transmitted in the slot; (ii) success, i.e., just one end-device has transmitted successfully in the slot; or (iii) failure, i.e., one or more end-devices have transmitted in the slot but none data packet can be decoded by the coordinator due to channel error or collision. Since we focus on the MAC layer, we assume that all data packets are always transmitted without errors induced by the wireless channel and there is no capture effect, i.e., none data packet involved in a collision can be decoded by the coordinator. The inclusion of capture effect and transmission errors constitutes part of our future work. In addition, we assume that the coordinator has perfect knowledge of the wireless channel between the coordinator and each end-device. The coordinator broadcasts a feedback packet (FBP) at the end of each frame in order to inform about the data packets successfully decoded in every frame. An end-device succeeds when its data packet has been decoded by the coordinator. The contention process of a DCR finishes when the coordinator has decoded one data packet from each end-device. The coordinator and the end-devices can be in four different modes of operation: i) transmitting a packet, ii) receiving, iii) idle listening, iv) standby, or v) sleeping. The associated power consumptions are ρ tx, ρ rx, ρ σ, ρ stby, and ρ sleep, respectively. We assume that the energy and time required to switch between inactive (i.e., standby, sleep) and active modes (i.e., transmitting, receiving, idle listening) are negligible, being ρ σ = ρ rx. In order to save energy, when an end-device succeeds in a given frame, it enters into sleep mode for the remaining of the DCR. III. MEDIUM ACCESS CONTROL PROTOCOLS In this section, we describe the MAC protocols that we have evaluated and compared in this paper: FSA, D-FSA, and SIC- FSA. In FSA, each end-device transmits its data packet in only one randomly selected slot of every frame until it succeeds. In D-FSA, each end-device transmits K replicas of the same data-packet, being K >, in K different slots of a frame. It is worth noting that D-FSA becomes FSA for K =, i.e., a data packet is only transmitted once in a frame. In both protocols FSA and D-FSA, those end-devices that do not succeed in a given frame will contend again in the following frames. Figure.a shows an example of a DCR using D-FSA with 4 end-devices, 5 slots per frame, and K =2replicas. In the example, end-device succeeds in transmitting one replica of its data packet in frame. All replicas transmitted by enddevices 2, 3 and 4 collide in frame and have to be retransmitted in frame 2. Finally, end-devices 2, 3, and 4 succeed in frame 2. SIC-FSA also relies on the transmission of K replicas of the data packet in K random slots within a frame. The key of SIC-FSA is that the information from a successfully decoded replica of a data packet is used to cancel the interference that other replicas of the same data packet may cause in other slots of the frame. An example of SIC-FSA is depicted in Figure.b. Each replica of a data packet includes in the MAC header a pointer to the position of the other K replicas in the frame. Thus, when the coordinator successfully decodes one replica of a data packet, it can determine the slots where the other replicas have been transmitted. Then, in the slots where a replica has collided, the coordinator can subtract the interference signal of the replica to the original signal received in the corresponding slot. This IC process may allow decoding data packets that were initially lost due to collision. Since every recovered replica may allow decoding other collided packets, the IC process is iterated in every frame until the coordinator is unable to decode more packets. At this point there are only empty slots or slots with collisions that cannot be cancelled. The coordinator broadcasts in the FBP the identification of the end-devices that have succeeded in each frame. The end-devices that do not succeed in a frame will transmit again in subsequent frames.
3 Coordinator End-Device End-Device 2 End-Device 3 Success RFD IFS Frame 2 FBP IFS (a) Diversity Frame Slotted-ALOHA (b) SIC Frame Slotted-ALOHA 2 Failure due to collision Frame End-Device Coordinator End-Device End-Device 2 End-Device 3 End-Device 4 Slot Slot RFD End-Device Frame Slot FBP slot Time+ FBP Decoded after IC Figure. Example of a data collection round using K =2replicas: (a) D-FSA with n =4devices and m =5slots per frame, and (b) SIC-FSA with n =5devices and m =6slots per frame. Figure.b shows an example of a DCR using SIC-FSA with n =5end-devices, m =6slots per frame, and K =2replicas of the data packet. In the first iteration of the IC process, the coordinator decodes successfully one replica transmitted by end-device in slot 2 (packet ) and one replica transmitted by end-device 2 in slot 5 (packet 2). In the second iteration, packet is subtracted to the signal received in slot 3, and thus one of the replicas transmitted by end-device 5 is decoded (packet 5). In the third iteration, packet 2 is subtracted to the signal received in slot 4, and thus one of the replicas transmitted by end-device 4 is decoded (packet 4). In the fourth and last iteration, packet 5 is subtracted to the signal received in slot, and thus one of the replicas transmitted by end-device 3 is decoded (packet 3). In this example, the coordinator is able to decode all data packets in the first frame of the DCR by executing 4 successive iterations of interference cancellation. As shown in Figure, a guard time called Inter Frame Space (IFS) is left between reception and transmission modes in order to compensate propagation, processing, and turn-around times to switch the radio transceivers between reception and transmission. IV. DELAY AND ENERGY MODELS In this section, we formulate the delay and energy models of FSA, D-FSA, and SIC-FSA. These models are later used in Section V to compute the delay and energy performance results by means of computer-based simulations. The average delay to successfully transmit to the coordinator one data packet from each of the n end-devices can be formulated as T CR = CF (mt SLOT +2T IFS +T FBP ), () where T SLOT, T IFS, and T FBP are the duration of a slot, an IFS, and the time of transmission of a FBP, respectively, and CF is the average number of frames needed to complete a DCR. The average energy consumed by the coordinator to successfully receive one data packet from each of the n enddevices in a DCR is denoted by E coord. The coordinator goes through the following steps in every frame: (i) it listens to the channel for the m slots and stores in memory the signals received in each slot, (ii) it performs a number of iterations of the successive IC process, and (iii) it transmits a FBP at the end of the frame. Assuming that the energy required to execute the SIC algorithm is negligible, the average energy consumed by the coordinator in a DCR can be formulated as E coord = CF (mρ rx T SLOT +2ρ σ T IFS + ρ tx T FBP ). (2) The average energy consumed per end-device is denoted by E device. An end-device that has not succeeded yet to transmit its data packet goes through the following steps in every frame: (i) it transmits K replicas of the data packet in K of the m slots, (ii) it keeps in standby mode for the other m K slots, and (iii) it receives a FBP. The energy consumed by an end-device in a frame where it contends can be formulated as E frame tx = Kρ tx T SLOT +(m K) ρ stby T SLOT +2ρ σ T IFS + ρ rx T FBP. (3) An end-device that succeeds in transmitting its data packet in a given frame will not contend in subsequent frames. Then, the end-device sleeps for the remaining of the DCR and its energy consumption in a frame can be formulated as E frame sleep = ρ sleep (mt SLOT +2T IFS + T FBP ). (4) Finally, the average energy consumed per end-device can be formulated as E device = CF tx E frame tx + CF sleep E frame sleep, (5) where CF tx is the average number of frames for which the end-device has to contend, and CF sleep is the average number of frames for which it sleeps until the DCR terminates. All the parameters in the expressions of T CR (), E coord (2), and E device (5) have deterministic and known values, except for the values of CF, CF tx, and CF sleep. In the next section, we compute these values through computer-based simulation in order to evaluate the delay and energy performance of SIC- FSA and compare it to the performance of D-FSA and FSA.
4 V. PERFORMANCE EVALUATION The delay and energy performance of D-FSA and SIC-FSA in M2M networks for data collection is evaluated in this section by means of computer simulations using MATLAB. The operations of the protocols have been implemented without any simplification, thus representing the actual operation of a single-hop network using D-FSA or SIC-FSA. We have averaged the results of simulation samples for each test case. The parameters used to run the simulations are summarized in Table I. They have been selected according to the IEEE 82. Standard and from the specification of a low power Wi-Fi device (RN-3 from Roving Networks []). The length of the FBP payload has been set to attach 6 bits per slot to inform about the status of the slots and the identification of the end-device whose data packet has been decoded in each slot. The length of the data packet payload has been set to 24 bytes. In the following sections, we first evaluate the average delay and the average energy consumed by the coordinator and per end-device as a function of the number K of replicas using different numbers of slots per frame. Results show that there exists an optimum value of K which minimizes both average delay and energy consumption. In all tested cases, this value is approximately equal to K =3replicas when m =2n slots per frame. Finally, using this optimum value, we evaluate the performance of FSA, D-FSA, and SIC-FSA when the number of end-devices increases in dense M2M networks. A. Optimum Number of Replicas and Slots per Frame The average delay to terminate a DCR, the average energy consumption of the coordinator, and the average energy consumed per end-device are represented in Figure 2, Figure 3, and Figure 4, respectively. They have been evaluated as a function of the number K of replicas for D-FSA and SIC- FSA considering a fixed number of end-devices (n = ) and using three different frame lengths (m = n, m =2n, and m =3n slots). As it could be expected from the analytical expressions formulated in Section IV, both delay () and coordinator energy consumption (2) show a similar trend. Recall that in FSA a data packet is only transmitted once in a frame. Thus, the average delay and energy consumption using FSA correspond to the results at K =. Indeed, the optimum m that minimizes delay and energy consumption in FSA is found when m = n, as it was demonstrated in [2]. As it can be observed in Figure 2, Figure 3, and Figure 4, SIC-FSA improves the average delay and energy performance with respect to that of D-FSA in all tested cases. Indeed, this Table I SYSTEM PARAMETERS Parameter Value Parameter Value MAC header 3 bytes Data-rate 54 Mbps Data payload 24 bytes T SLOT μs FBP payload 6 bits/slot T FBP FBP 8/data-rate CRC 4 bytes T IFS 6 μs ρ tx 2 ma 3V ρ stby 5 ma 3V ρ rx = ρ σ 4 ma 3V ρ sleep 4 μa 3V Average Delay [s] Delay (n = end devices) D FSA, m = n SIC FSA, m = n D FSA, m = 2n SIC FSA, m = 2n D FSA, m = 3n SIC FSA, m = 3n Number of replicas (K) Figure 2. Average delay to finish a data collection round using D-FSA and SIC-FSA over the number K of replicas. Average Energy Consumption of the Coordinator [J] Coordinator Energy Consumption (n = end devices) D FSA, m = n SIC FSA, m = n D FSA, m = 2n SIC FSA, m = 2n D FSA, m = 3n SIC FSA, m = 3n Number of replicas (K) Figure 3. Average energy consumed by the coordinator in a data collection round using D-FSA and SIC-FSA over the number K of replicas. is due to the fact that a successfully decoded replica in SIC- FSA can be used to cancel the interference in other slots of the same frame, and this allows decoding other data packets that collided. As it could be expected, the average delay and the average energy consumption have a convex trend over the number of replicas in D-FSA and SIC-FSA. Indeed, when K is within its optimal range, the average number of frames required to solve the contention in D-FSA and SIC-FSA is much lower than in FSA. In SIC-FSA, the average delay and energy consumption of the coordinator reach a minimum value for K [2, 3] when m = n; K [3, 7] when m =2n; and K [3, 3] when m = 3n slots. In D-FSA, the delay and the energy consumption of the coordinator are minimum for K =when m = n; K [2, 3] when m =2n; and K [3, 4] when m =3n.
5 Average Energy Consumption per End Device [J] Energy Consumption per End Device (n = end devices) D FSA, m = n SIC FSA, m = n D FSA, m = 2n SIC FSA, m = 2n D FSA, m = 3n SIC FSA, m = 3n Average Delay [s].5.5 Delay D FSA (m = 2n, K = 6) D FSA (m = 2n, K = 3) FSA (m = n) SIC FSA (m = 2n, K = 3) SIC FSA (m = 2n, K = 6) Reduction SIC FSA wrt FSA Delay Reduction [%] Number of replicas (K) Number of end devices Figure 4. Average energy consumed per end-device in a data collection round using D-FSA and SIC-FSA over the number K of replicas. Regarding the average energy consumed per end-device, in SIC-FSA it reaches a minimum value for K =2when m = n; K [2, 3] when m =2n; and K =2when m =3n slots. In D-FSA, the energy consumption of an end-device is minimum for K =. Therefore, D-FSA does not improve the energy consumed per end-device with respect to FSA. When the number K of replicas is not within the optimal range that leads to the lowest average delay and energy consumption, the performance of the protocols differs. When the value of K is below the optimum, the delay and energy performance of D-FSA and SIC-FSA tend to that of FSA. However, when the value of K increases above the optimum, the average delay and energy consumption increase exponentially with K in both protocols. Indeed, when the number of replicas transmitted in one frame increases considerably, the probability of collision may increase dramatically and thus the number of frames may also increase, even degrading the average delay and energy consumption with respect to FSA. In addition, the higher the number of transmitted replicas, the higher the energy consumed by an end-device in a frame. Therefore, the value of m and K need to be optimized in D- FSA and SIC-FSA according to the expected number n of enddevices in order to minimize delay and energy consumption. B. Delay and Energy Performance in Dense M2M Networks In this section, we aim at understanding the performance of D-FSA and SIC-FSA as a function of the number n of end-devices. The average delay and energy consumed by the coordinator are represented in Figure 5 and Figure 6 (left vertical axis), respectively, as a function of the number n of end-devices (from 5 to ). In all cases, we have used the optimum values of K and m that minimize delay and energy consumption. According to the discussion presented in the previous section, this corresponds to m = n in FSA (i.e., K =), and K =3 Figure 5. Average delay to finish a data collection round using FSA, D-FSA and SIC-FSA over the number of end-devices. Average Energy consumption [J] Energy Consumption of the Coordinator D FSA (m = 2n, K = 6) D FSA (m = 2n, K = 3) FSA (m = n) SIC FSA (m = 2n, K = 3) SIC FSA (m = 2n, K = 6) SIC FSA wrt FSA Number of end devices Figure 6. Average energy consumed by the coordinator in a data collection round using FSA, D-FSA and SIC-FSA over the number of end-devices. with m =2n in D-FSA and SIC-FSA. It is worth noting that the average delay and energy consumption of the coordinator in D-FSA and SIC-FSA increase linearly with the increasing value of n. This fact was also demonstrated in [2] for FSA. As it could be expected, SIC- FSA outperforms FSA and D-FSA in terms of average delay and energy consumption of the coordinator. As it can be observed, SIC-FSA provides delay reductions and energy savings (shown on the right vertical axis of Figure 5 and Figure 6, respectively) of up to 6% with respect to FSA. These delay reductions and energy savings increase with the number of end-devices. In addition, it is worth noting that when n<5 the delay and the energy consumption of the coordinator are very similar with either FSA or D-FSA. Therefore, the use of SIC-FSA can improve considerably the energy efficiency in dense M2M networks, compared to that 6 4 Energy Saving [%]
6 Average Energy consumption [J] Energy Consumption per End Device D FSA (m = 2n, K = 6) D FSA (m = 2n, K = 3) SIC FSA (m = 2n, K = 6) SIC FSA (m = 2n, K = 3) FSA (m = n) SIC FSA (m =.5n, K = 3) Saving SIC FSA wrt FSA Number of end devices Figure 7. Average energy consumed per end-device in a data collection round using FSA, D-FSA and SIC-FSA over the number of end-devices. of FSA, when the number of devices is very high. The average energy consumed per end-device is represented in Figure 7 as a function of the number n of end-devices (from 5 to ). We have used the optimum values of K and m that minimize the energy consumed per end-device. According to the discussion presented in the previous section for n = end-devices, this corresponds to m = n in FSA and K =3 with m = 2n in D-FSA and SIC-FSA. It is worth noting that the average energy consumption of an end-device using FSA, D-FSA, and SIC-FSA also increases linearly with the increasing number of end-devices. As it can be observed in Figure 7, the energy consumed per end-device with SIC-FSA (using K = 3 replicas and m =2n slots) becomes higher than with FSA when n>3 end-devices. Therefore, we have also evaluated the energy performance of SIC-FSA using K =3and m =.5n slots per frame. With these values, SIC-FSA outperforms FSA and D-FSA in terms of average energy consumed per end-device. SIC-FSA provides energy savings (shown on the right vertical axis of Figure 7) of a % with respect to FSA Energy Saving [%] similarly to FSA, the delay and the energy consumption using SIC-FSA increase linearly with the number of end-devices when we use the optimal number of replicas and slots. SIC- FSA provides delay reductions and energy savings of more than 5% in the energy consumption of the coordinator with respect to FSA, and of more than % in the energy consumed per end-device. Therefore, the use of SIC-FSA can improve considerably the energy efficiency of M2M networks when the number of devices is huge. Future work aims at evaluating the performance of SIC- FSA analytically and at reducing the energy consumed by the end-devices implementing inter-frame SIC. REFERENCES [] Technical Specification, Machine-to-Machine communications (M2M); Functional Architecture. TS 2 69, v.., ETSI, October 2. [2] P. Huang, L. Xiao, S. Soltani, M. Mutka, and N. Xi, The Evolution of MAC Protocols in Wireless Sensor Networks: A Survey, IEEE Communications Surveys Tutorials, vol. 5, no., pp. 2, 23. [3] L. Roberts, Aloha packet system with and without slots and capture, in ACM SIGCOMM Comput. Commun. Rev., vol. 5, no. 2, 975. [4] L. Kleinrock and F. A. Tobagi, Packet switching in radio channels:part : CSMA modes and their throughput-delay characteristics, IEEE Trans. Commun., vol. 23, pp. 4 46, 975. [5] E. Casini, R. De Gaudenzi, and O. Herrero, Contention resolution diversity slotted aloha (CRDSA): An enhanced random access scheme for satellite access packet networks, IEEE Transactions on Wireless Communications, vol. 6, no. 4, pp , April 27. [6] G. Liva, Graph-based analysis and optimization of contention resolution diversity slotted ALOHA, IEEE Transactions on Communications, vol. 59, no. 2, pp , February 2. [7] C. Stefanovic, K. Trilingsgaard, N. Pratas, and P. Popovski, Joint estimation and contention-resolution protocol for wireless random access, in IEEE International Conference on Communications (ICC), June 23, pp [8] F. Ricciato and P. Castiglione, Pseudo-random ALOHA for enhanced collision-recovery in RFID, IEEE Communications Letters, vol. 7, no. 3, pp. 68 6, March 23. [9] L. Choudhury and S. Rappaport, Diversity ALOHA - a random access scheme for satellite communications, IEEE Transactions on Communications, vol. 3, no. 3, pp , Mar 983. [] IEEE 82. Standard: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Local and Metropolitan Area Networks, IEEE Std., 27. [] RN3 datasheet. [Online]. Available: products/rn 3C RN3C RM [2] F. Vazquez-Gallego, L. Alonso, and J. Alonso-Zarate, Energy and Delay Analysis of Contention Resolution Mechanisms for Machine-to-Machine Networks based on Low-Power WiFi, in IEEE International Conference on Communications (ICC), June 23, pp VI. CONCLUSION In this paper, we have evaluated the delay and the energy consumed by the gateway and end-devices of dense M2M area networks that use a Frame Slotted-ALOHA (FSA) protocol with Successive Interference Cancellation (SIC-FSA) to periodically transmit data to a coordinator. We have compared the performance of SIC-FSA with respect to that of conventional FSA. Results show that in SIC-FSA there is an optimal number of packet replicas and slots per frame, which minimize delay and energy consumption, and must be optimized as a function of the number of end-devices. The delay and the energy consumption increase exponentially when the number of replicas increases above its optimal value. In addition,
Intra-Slot Interference Cancellation for Collision Resolution in Irregular Repetition Slotted ALOHA
Intra-Slot Interference Cancellation for Collision Resolution in Irregular Repetition Slotted ALOHA G. Interdonato, S. Pfletschinger, F. Vázquez-Gallego, J. Alonso-Zarate, G. Araniti University Mediterranea
More informationEnhanced Contention Resolution Aloha - ECRA
Enhanced Contention Resolution Aloha - ECRA Federico Clazzer and Christian Kissling German Aerospace Centre (DLR) Oberpfaffenhofen, D-82234, Wessling, Germany Email: {federico.clazzer, christian.kissling}@dlr.de
More informationAnalysis of a Distributed Queuing Medium Access Control Protocol for Cooperative ARQ
Analysis of a Distributed Queuing Medium Access Control Protocol for Cooperative ARQ J. Alonso-Zárate, L. Alonso, Ch. Skianis, and C. Verikoukis Centre Tecnològic de Telecomunicacions de Catalunya (CTTC),
More informationEnergy Efficiency of an Enhanced DCF Access Method using Bidirectional Communications for Infrastructure-based IEEE WLANs
3 IEEE 8th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD) Energy Efficiency of an Enhanced Access Method using Bidirectional Communications for
More informationCoded Splitting Tree Protocols
Coded Splitting Tree Protocols Jesper H. Sørensen, Čedomir Stefanović, and Petar Popovski Aalborg University, Department of Electronic Systems, Fredrik Bajers Vej, 0 Aalborg, Denmark E-mail: {jhs,petarp,cs}@es.aau.dk
More informationThe MAC layer in wireless networks
The MAC layer in wireless networks The wireless MAC layer roles Access control to shared channel(s) Natural broadcast of wireless transmission Collision of signal: a /space problem Who transmits when?
More informationDisclaimer and Legal Information
Disclaimer and Legal Information All opinions expressed in this document are those of the author individually and are not reflective or indicative of the opinions and positions of any author s present
More informationA Directional MAC Protocol with the DATA-frame Fragmentation and Short Busy Advertisement Signal for Mitigating the Directional Hidden Node Problem
2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC) A Directional MAC Protocol with the DATA-frame Fragmentation and Short Busy Advertisement Signal for
More informationOutline. Introduction to Networked Embedded Systems - Embedded systems Networked embedded systems Embedded Internet - Network properties
Outline Introduction to Networked Embedded Systems - Embedded systems Networked embedded systems Embedded Internet - Network properties Layered Network Architectures - OSI framework descriptions of layers
More informationImplementation of an Adaptive MAC Protocol in WSN using Network Simulator-2
Implementation of an Adaptive MAC Protocol in WSN using Network Simulator-2 1 Suresh, 2 C.B.Vinutha, 3 Dr.M.Z Kurian 1 4 th Sem, M.Tech (Digital Electronics), SSIT, Tumkur 2 Lecturer, Dept.of E&C, SSIT,
More informationTABLE I OVERVIEW OF CONTENTION-BASED CHANNEL ACCESS MECHANISMS IN VARIOUS COMMUNICATION TECHNOLOGIES FOR IOT. Contention-based access mechanism
1 Goodbye, ALOHA! A. Laya, C. Kalalas, F. Vazquez-Gallego, L. Alonso and J. Alonso-Zarate KTH Royal Institute of Technology, Sweden. e-mail: laya@kth.se Universitat Politècnica de Catalunya (UPC), Spain.
More informationMaximizing the Lifetime of Clustered Wireless Sensor Network VIA Cooperative Communication
Vol., Issue.3, May-June 0 pp--7 ISSN: - Maximizing the Lifetime of Clustered Wireless Sensor Network VIA Cooperative Communication J. Divakaran, S. ilango sambasivan Pg student, Sri Shakthi Institute of
More information/99/$10.00 (c) 1999 IEEE
COLLISION-FREE MEDIUM ACCESS CONTROL SCHEME FOR AD-HOC NETWORKS Zygmunt J. Haas and Jing Deng School of Electrical Engineering Cornell University Ithaca, NY 14853 haas@ee.cornell.edu Siamak Tabrizi US
More informationComputational Model for Energy Aware TDMA-based MAC Protocol for Wireless Sensor Network System
6th WSEAS International Conference on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, Dec 29-31, 2007 489 Computational Model for Energy Aware TDMA-based MAC Protocol for Wireless
More informationPerformance Evaluation of a Medium Access Control Protocol for a Distributed ARQ Scheme in Cooperative Wireless Networks
Performance Evaluation of a Medium Access Control Protocol for a Distributed ARQ Scheme in Cooperative Wireless Networks J. ALONSO-ZÁRATE 1, P. GIOTIS 1, E. KARTSAKLI 2, C. VERIKOUKIS 1, L. ALONSO 2 1
More informationMultiple Access Protocols
Multiple Access Protocols Computer Networks Lecture 2 http://goo.gl/pze5o8 Multiple Access to a Shared Channel The medium (or its sub-channel) may be shared by multiple stations (dynamic allocation) just
More informationImplementation of a Wake-up Radio Cross-Layer Protocol in OMNeT++ / MiXiM
Implementation of a Wake-up Radio Cross-Layer Protocol in OMNeT++ / MiXiM Jean Lebreton and Nour Murad University of La Reunion, LE2P 40 Avenue de Soweto, 97410 Saint-Pierre Email: jean.lebreton@univ-reunion.fr
More informationPower-efficient Communication Protocol for Social Networking Tags for Visually Impaired
Power-efficient Communication Protocol for Social Networking Tags for Visually Impaired Problem Social Networking Tags System for Visually Impaired is an project aims to utilize electronic id technology
More informationLecture 9 November 12, Wireless Access. Graduate course in Communications Engineering. University of Rome La Sapienza. Rome, Italy
Lecture 9 November 12, 2018 Wireless Access Graduate course in Communications Engineering University of Rome La Sapienza Rome, Italy 2018-2019 Medium Access Control Scheduled access Classification of wireless
More informationMedium Access Control Sublayer
Wireless (WLAN) Medium Access Control Sublayer Mahalingam Mississippi State University, MS October 20, 2014 Outline Medium Access Protocols Wireless (WLAN) 1 Medium Access Protocols ALOHA Slotted ALOHA
More informationCHAPTER 7 MAC LAYER PROTOCOLS. Dr. Bhargavi Goswami Associate Professor & Head Department of Computer Science Garden City College
CHAPTER 7 MAC LAYER PROTOCOLS Dr. Bhargavi Goswami Associate Professor & Head Department of Computer Science Garden City College MEDIUM ACCESS CONTROL - MAC PROTOCOLS When the two stations transmit data
More informationThe MAC layer in wireless networks
The MAC layer in wireless networks The wireless MAC layer roles Access control to shared channel(s) Natural broadcast of wireless transmission Collision of signal: a time/space problem Who transmits when?
More informationA Novel Contention Window Control Scheme Based on a Markov Chain Model in Dense WLAN Environment
05 Third International Conference on Artificial Intelligence, Modelling and Simulation A Novel Contention Window Control Scheme Based on a Markov Chain Model in Dense WLAN Environment Yoshiaki Morino,
More informationImpact of IEEE n Operation on IEEE Operation
2009 International Conference on Advanced Information Networking and Applications Workshops Impact of IEEE 802.11n Operation on IEEE 802.15.4 Operation B Polepalli, W Xie, D Thangaraja, M Goyal, H Hosseini
More informationPacket multiple access and the Aloha protocol
Packet multiple access and the Aloha protocol Massachusetts Institute of Technology Department of Aeronautics and Astronautics Slide 1 Packet Multiple Access PMA SHARED UPLINK TERMINAL TERMINAL APPL TRANS
More informationUncoordinated Multiple Access for Vehicular Networks
Uncoordinated Multiple Access for Vehicular Networks Mikhail Ivanov, Fredrik Brännström, Alexandre Graell i Amat, Petar Popovski Chalmers University of Technology, Gothenburg, Sweden Aalborg University,
More informationImpact of IEEE MAC Packet Size on Performance of Wireless Sensor Networks
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 10, Issue 3, Ver. IV (May - Jun.2015), PP 06-11 www.iosrjournals.org Impact of IEEE 802.11
More informationReservation Packet Medium Access Control for Wireless Sensor Networks
Reservation Packet Medium Access Control for Wireless Sensor Networks Hengguang Li and Paul D Mitchell Abstract - This paper introduces the Reservation Packet Medium Access Control (RP-MAC) protocol for
More informationCoded random access: Using coding theory to build random access protocols
Coded random access: Using coding theory to build random access protocols 2017 IEEE European School of Information Theory Enrico Paolini Dept. of Electrical, Electronic, and Information Engineering Guglielmo
More informationMarkov Chains and Multiaccess Protocols: An. Introduction
Markov Chains and Multiaccess Protocols: An Introduction Laila Daniel and Krishnan Narayanan April 8, 2012 Outline of the talk Introduction to Markov Chain applications in Communication and Computer Science
More informationLecture 12 December 04, Wireless Access. Graduate course in Communications Engineering. University of Rome La Sapienza. Rome, Italy
Lecture 12 December 04, 2017 Wireless Access Graduate course in Communications Engineering University of Rome La Sapienza Rome, Italy 2017-2018 Random Medium Access Control Part II - CSMA and Collision
More informationMultiple Access. Data Communications and Networking
Multiple Access In the previous part we discussed data link control, a mechanism which provides a link with reliable communication. In the protocols we described, we assumed that there is an available
More information4 IEEE COMMUNICATIONS SURVEYS & TUTORIALS, VOL. 16, NO. 1, FIRST QUARTER 2014
4 IEEE COMMUNICATIONS SURVEYS & TUTORIALS, VOL. 16, NO. 1, FIRST QUARTER 214 Is the Random Access Channel of LTE and LTE-A Suitable for M2M Communications? A Survey of Alternatives Andres Laya, Member,
More informationHigh Level View. EE 122: Ethernet and Random Access protocols. Medium Access Protocols
High Level View EE 122: Ethernet and 802.11 Ion Stoica September 18, 2002 Goal: share a communication medium among multiple hosts connected to it Problem: arbitrate between connected hosts Solution goals:
More informationCS 716: Introduction to communication networks. - 9 th class; 19 th Aug Instructor: Sridhar Iyer IIT Bombay
CS 716: Introduction to communication networks - 9 th class; 19 th Aug 2011 Instructor: Sridhar Iyer IIT Bombay Contention-based MAC: ALOHA Users transmit whenever they have data to send Collisions occur,
More informationMultiple Access Links and Protocols
Multiple Access Links and Protocols Two types of links : point-to-point PPP for dial-up access point-to-point link between Ethernet switch and host broadcast (shared wire or medium) old-fashioned Ethernet
More informationWP-PD Wirepas Mesh Overview
WP-PD-123 - Wirepas Mesh Overview Product Description Version: v1.0a Wirepas Mesh is a de-centralized radio communications protocol for devices. The Wirepas Mesh protocol software can be used in any device,
More informationAnalysis of Throughput and Energy Efficiency in the IEEE Wireless Local Area Networks using Constant backoff Window Algorithm
International Journal of Computer Applications (975 8887) Volume 6 No.8, July Analysis of Throughput and Energy Efficiency in the IEEE 8. Wireless Local Area Networks using Constant backoff Window Algorithm
More informationCHAPTER 5 PROPAGATION DELAY
98 CHAPTER 5 PROPAGATION DELAY Underwater wireless sensor networks deployed of sensor nodes with sensing, forwarding and processing abilities that operate in underwater. In this environment brought challenges,
More informationStrengthening Unlicensed Band Wireless Backhaul
be in charge Strengthening Unlicensed Band Wireless Backhaul Use TDD/TDMA Based Channel Access Mechanism WHITE PAPER Strengthening Unlicensed Band Wireless Backhaul: Use TDD/TDMA Based Channel Access Mechanism
More informationSENSOR-MAC CASE STUDY
SENSOR-MAC CASE STUDY Periodic Listen and Sleep Operations One of the S-MAC design objectives is to reduce energy consumption by avoiding idle listening. This is achieved by establishing low-duty-cycle
More informationLecture 16: QoS and "
Lecture 16: QoS and 802.11" CSE 123: Computer Networks Alex C. Snoeren HW 4 due now! Lecture 16 Overview" Network-wide QoS IntServ DifServ 802.11 Wireless CSMA/CA Hidden Terminals RTS/CTS CSE 123 Lecture
More information/$10.00 (c) 1998 IEEE
Dual Busy Tone Multiple Access (DBTMA) - Performance Results Zygmunt J. Haas and Jing Deng School of Electrical Engineering Frank Rhodes Hall Cornell University Ithaca, NY 85 E-mail: haas, jing@ee.cornell.edu
More informationEE 122: Ethernet and
EE 122: Ethernet and 802.11 Ion Stoica September 18, 2002 (* this talk is based in part on the on-line slides of J. Kurose & K. Rose) High Level View Goal: share a communication medium among multiple hosts
More informationRedes de Computadores. Medium Access Control
Redes de Computadores Medium Access Control Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto 1 » How to control the access of computers to a communication medium?» What is the ideal Medium
More informationMedia Access Control in Ad Hoc Networks
Media Access Control in Ad Hoc Networks The Wireless Medium is a scarce precious resource. Furthermore, the access medium is broadcast in nature. It is necessary to share this resource efficiently and
More informationWireless Medium Access Control Protocols
Wireless Medium Access Control Protocols Telecomunicazioni Undergraduate course in Electrical Engineering University of Rome La Sapienza Rome, Italy 2007-2008 Classification of wireless MAC protocols Wireless
More informationAloha and slotted aloha
CSMA 2/13/06 Aloha and slotted aloha Slotted aloha: transmissions are synchronized and only start at the beginning of a time slot. Aloha sender A sender B collision sender C t Slotted Aloha collision sender
More informationLesson 2-3: The IEEE x MAC Layer
Module 2: Establishing Wireless Connectivity Lesson 2-3: The IEEE 802.11x MAC Layer Lesson Overview This lesson describes basic IEEE 802.11x MAC operation, beginning with an explanation of contention schemes
More informationCSMA/IC: A New Class of Collision free MAC Protocols for Ad Hoc Wireless Networks
CSMA/IC: A New Class of Collision free MAC Protocols for Ad Hoc Wireless Networks Tiantong You (you@cs.queensu.ca) Department of Computing and Information Science Chi-Hsiang Yeh (yeh@ece.queensu.ca) Department
More informationA CDCA-TRACE MAC PROTOCOL FRAMEWORK IN MOBILE AD-HOC NETWORK
Research Manuscript Title A CDCA-TRACE MAC PROTOCOL FRAMEWORK IN MOBILE AD-HOC NETWORK Jaichitra.I, Aishwarya.K, P.G Student, Asst.Professor, CSE Department, Arulmigu Meenakshi Amman College of Engineering,
More informationIs the Random Access Channel of LTE and LTE-A Suitable for M2M Communications? A Survey of Alternatives
1 Is the Random Access Channel of LTE and LTE-A Suitable for M2M Communications? A Survey of Alternatives Andres Laya, Luis Alonso and Jesus Alonso-Zarate Department of Signal Theory and Communications,
More informationLecture 8 The Data Link Layer part I. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it
Lecture 8 The Data Link Layer part I Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Link Layer: setting the context two physically connected devices: host-router, router-router,
More informationEnhanced Broadcasting and Code Assignment in Mobile Ad Hoc Networks
Enhanced Broadcasting and Code Assignment in Mobile Ad Hoc Networks Jinfang Zhang, Zbigniew Dziong, Francois Gagnon and Michel Kadoch Department of Electrical Engineering, Ecole de Technologie Superieure
More informationTSIN01 Information Networks Lecture 3
TSIN01 Information Networks Lecture 3 Danyo Danev Division of Communication Systems Department of Electrical Engineering Linköping University, Sweden September 10 th, 2018 Danyo Danev TSIN01 Information
More informationThe Marriage between Random Access and Codes on Graphs: Coded ALOHA for Massive Random Access
The Marriage between Random Access and Codes on Graphs: Coded ALOHA for Massive Random Access Marco Chiani CNIT, University of Bologna, Italy Based on joint works with Gianluigi Liva, Enrico Paolini PhD
More informationMohammad Hossein Manshaei 1393
Mohammad Hossein Manshaei manshaei@gmail.com 1393 1 An Analytical Approach: Bianchi Model 2 Real Experimentations HoE on IEEE 802.11b Analytical Models Bianchi s Model Simulations ns-2 3 N links with the
More informationEthernet. Introduction. CSE 3213 Fall 2011
Ethernet CSE 3213 Fall 2011 19 October 2011 1 Introduction Rapid changes in technology designs Broader use of LANs New schemes for high-speed LANs High-speed LAN technologies: Fast and gigabit Ethernet
More informationMobile Communications Chapter 3 : Media Access
Mobile Communications Chapter 3 : Media Access 2. Motivation 3. SDMA, FDMA, TDMA 1. Aloha and contention based schemes 4. Reservation schemes 5. Collision avoidance, MACA 6. Polling CDMA (Lecture 6) Prof.
More informationENGI 4557 Digital Communications Practice Problems 2017 (Part 2)
ENGI 4557 Digital Communications Practice Problems 207 (Part 2) H = n p i log 2 ( ) p i C = W log 2 ( + S N ) SNR = 6m + 0 log 0 ( 3σ2 x V ) 2 SNR = 6m 0 ( ) n n! = k k!(n k)! x = σ 2 = + + x p(x)dx (x
More informationECE 358 MAC Examples. Xuemin (Sherman) Shen Office: EIT 4155 Phone: x
ECE 358 MAC Examples Xuemin (Sherman) Shen Office: EIT 4155 Phone: x 32691 Email: xshen@bbcr.uwaterloo.ca Problem 1. Consider the following Aloha systems. (a) A group of N users share a 56 kbps pure Aloha
More information4.3 IEEE Physical Layer IEEE IEEE b IEEE a IEEE g IEEE n IEEE 802.
4.3 IEEE 802.11 Physical Layer 4.3.1 IEEE 802.11 4.3.2 IEEE 802.11b 4.3.3 IEEE 802.11a 4.3.4 IEEE 802.11g 4.3.5 IEEE 802.11n 4.3.6 IEEE 802.11ac,ad Andreas Könsgen Summer Term 2012 4.3.3 IEEE 802.11a Data
More informationCoded Random Access: Applying Codes on Graphs to Design Random Access Protocols
Coded Random Access: Applying Codes on Graphs to Design Random Access Protocols Enrico Paolini Department of Electrical, Electronic, and Information Engineering G. Marconi, University of Bologna, Italy
More informationAn energy-efficient MAC protocol for infrastructure WLAN based on modified PCF/ DCF access schemes using a bidirectional data packet exchange
An energy-efficient MAC protocol for infrastructure WLAN based on modified PCF/ DCF access schemes using a bidirectional data packet exchange Raúl Palacios, Fabrizio Granelli University of Trento Trento,
More informationDelay Analysis of ML-MAC Algorithm For Wireless Sensor Networks
Delay Analysis of ML-MAC Algorithm For Wireless Sensor Networks Madhusmita Nandi School of Electronics Engineering, KIIT University Bhubaneswar-751024, Odisha, India ABSTRACT The present work is to evaluate
More informationCOMPUTER NETWORKS - Local area networks
Local area networks Telecommunication Networks Group firstname.lastname@polito.it http://www.telematica.polito.it/ COMPUTER NETWORKS LANs - 1 Copyright Quest opera è protetta dalla licenza Creative Commons
More informationLocal area networks. Copyright
Local area networks Telecommunication Networks Group firstname.lastname@polito.it http://www.telematica.polito.it/ COMPUTER NETWORKS LANs - 1 Copyright Quest opera è protetta dalla licenza Creative Commons
More informationA Backoff Algorithm for Improving Saturation Throughput in IEEE DCF
A Backoff Algorithm for Improving Saturation Throughput in IEEE 80.11 DCF Kiyoshi Takahashi and Toshinori Tsuboi School of Computer Science, Tokyo University of Technology, 1404-1 Katakura, Hachioji, Tokyo,
More informationChapter 6 Medium Access Control Protocols and Local Area Networks
Chapter 6 Medium Access Control Protocols and Local Area Networks Part I: Medium Access Control Part II: Local Area Networks CSE 3213, Winter 2010 Instructor: Foroohar Foroozan Chapter Overview Broadcast
More informationPessimistic Backoff for Mobile Ad hoc Networks
Pessimistic Backoff for Mobile Ad hoc Networks Saher S. Manaseer Department of computing science Glasgow University saher@dcs.gla.ac.uk Muneer Masadeh Department of Computer Science Jordan University of
More informationIEEE modifications and their impact
Mobile Information Systems 7 (2011) 69 92 69 DOI 10.3233/MIS-2011-0111 IOS Press IEEE 802.15.4 modifications and their impact M. Goyal, W. Xie and H. Hosseini Department of Computer Science, University
More informationHIPERLAN/2 and a: A Comparative Study
HIPERLAN/2 and 802.11a: A Comparative Study PADMA BONDE Reader, Department of Computer Science Shri Vaishnav Institute of Technology and Science Indore, INDIA JAYESH BONDE Executive Engineer, Department
More informationChapter 12 Multiple Access 12.1
Chapter 12 Multiple Access 12.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 12.2 Figure 12.1 Data link layer divided into two functionality-oriented sublayers
More informationCS 43: Computer Networks. 27: Media Access Contd. December 3, 2018
CS 43: Computer Networks 27: Media Access Contd. December 3, 2018 Last Class The link layer provides lots of functionality: addressing, framing, media access, error checking could be used independently
More informationInterference avoidance in wireless multi-hop networks 1
Interference avoidance in wireless multi-hop networks 1 Youwei Zhang EE228A Project Report, Spring 2006 1 Motivation Wireless networks share the same unlicensed parts of the radio spectrum with devices
More informationRandom Assignment Protocols
Random Assignment Protocols Random assignment strategies attempt to reduce problem occur in fixed assignment strategy by eliminating pre allocation of bandwidth to communicating nodes. Random assignment
More informationECE 4450:427/527 - Computer Networks Spring 2017
ECE 4450:427/527 - Computer Networks Spring 2017 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 5.4: Multiple Access Protocols Dr. Nghi Tran (ECE-University of Akron) ECE 4450:427/527
More informationTopics. Link Layer Services (more) Link Layer Services LECTURE 5 MULTIPLE ACCESS AND LOCAL AREA NETWORKS. flow control: error detection:
1 Topics 2 LECTURE 5 MULTIPLE ACCESS AND LOCAL AREA NETWORKS Multiple access: CSMA/CD, CSMA/CA, token passing, channelization LAN: characteristics, i basic principles i Protocol architecture Topologies
More informationMedium Access Control Protocols With Memory Jaeok Park, Member, IEEE, and Mihaela van der Schaar, Fellow, IEEE
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 18, NO. 6, DECEMBER 2010 1921 Medium Access Control Protocols With Memory Jaeok Park, Member, IEEE, and Mihaela van der Schaar, Fellow, IEEE Abstract Many existing
More informationMAC Essentials for Wireless Sensor Networks
MAC Essentials for Wireless Sensor Networks Abdelmalik Bachir, Mischa Dohler, Senior Member, IEEE, Thomas Watteyne, Member, IEEE, and Kin K. Leung, Fellow, IEEE Medium access control Part of the link layer
More informationA new MAC protocol for reducing effect of needless transmission deferment induced by missed RTS/CTS handshake
Mobile Information Systems 5 (009) 3 DOI 0.333/MIS-009-0070 IOS Press A new MAC protocol for reducing effect of needless transmission deferment induced by missed / handshake Tetsuya Shigeyasu a, Daishi
More informationMultiple Access (1) Required reading: Garcia 6.1, 6.2.1, CSE 3213, Fall 2010 Instructor: N. Vlajic
1 Multiple Access (1) Required reading: Garcia 6.1, 6.2.1, 6.2.2 CSE 3213, Fall 2010 Instructor: N. Vlajic Multiple Access Communications 2 Broadcast Networks aka multiple access networks multiple sending
More informationCollisions & Virtual collisions in IEEE networks
Collisions & Virtual collisions in IEEE 82.11 networks Libin Jiang EE228a project report, Spring 26 Abstract Packet collisions lead to performance degradation in IEEE 82.11 [1] networks. The carrier-sensing
More informationA New Full Duplex MAC Protocol to Solve the Asymmetric Transmission Time
A New Full Duplex MAC Protocol to Solve the Asymmetric Transmission Time Jin-Ki Kim, Won-Kyung Kim and Jae-Hyun Kim Department of Electrical and Computer Engineering Ajou University Suwon, Korea E-mail
More informationComputer and Network Security
CIS 551 / TCOM 401 Computer and Network Security Spring 2009 Lecture 6 Announcements First project: Due: 6 Feb. 2009 at 11:59 p.m. http://www.cis.upenn.edu/~cis551/project1.html Plan for Today: Networks:
More informationWireless Networks (MAC)
802.11 Wireless Networks (MAC) Kate Ching-Ju Lin ( 林靖茹 ) Academia Sinica 2016.03.18 CSIE, NTU Reference 1. A Technical Tutorial on the IEEE 802.11 Protocol By Pablo Brenner online: http://www.sss-mag.com/pdf/802_11tut.pdf
More informationCPSC 441 Tutorial-19. Department of Computer Science University of Calgary
CPSC 441 Tutorial-19 Department of Computer Science University of Calgary Problem-1 Consider n nodes that use the slotted CSMA/ CD with binary exponential back-off to access a shared broadcast channel.
More informationModeling of Partially Overlapping Wireless Personal Area Networks
Modeling of Partially Overlapping Wireless Personal Area Networks 21. ComNets-Workshop Mobil- und Telekommunikation Dipl.-Ing. Holger Rosier March 16, 2012 ComNets Research Group RWTH Aachen University,
More informationThe Link Layer and LANs. Chapter 6: Link layer and LANs
The Link Layer and LANs EECS3214 2018-03-14 4-1 Chapter 6: Link layer and LANs our goals: understand principles behind link layer services: error detection, correction sharing a broadcast channel: multiple
More informationAn Improved DFSA Anti-collision Algorithm Based on the RFID-based Internet of Vehicles
2016 2 nd International Conference on Energy, Materials and Manufacturing Engineering (EMME 2016) ISBN: 978-1-60595-441-7 An Improved DFSA Anti-collision Algorithm Based on the RFID-based Internet of Vehicles
More informationReview of Medium Access Control protocol for MANET
Review of Medium Access Control protocol for MANET Khushboo Agarwal Department of CSE&IT, Madhav Institute of Technology and Science, Gwalior 474005 ka.agarwal5@gmail.com Abstract: The mobile Adhoc network
More informationCHAPTER 7 SIMULATION OBSERVATIONS
CHAPTER 7 CHAPTER 7 SIMULATION OBSERVATIONS Over a randomly distributed wireless network system with the specification is modeled with the suggested algorithms for communication from a selected source
More informationCS 716: Introduction to communication networks. - 8 th class; 17 th Aug Instructor: Sridhar Iyer IIT Bombay
CS 716: Introduction to communication networks - 8 th class; 17 th Aug 2011 Instructor: Sridhar Iyer IIT Bombay Key points to consider for MAC Types/Modes of communication: Although the medium is shared,
More informationCS 43: Computer Networks Media Access. Kevin Webb Swarthmore College November 30, 2017
CS 43: Computer Networks Media Access Kevin Webb Swarthmore College November 30, 2017 Multiple Access Links & Protocols Two classes of links : point-to-point dial-up access link between Ethernet switch,
More informationTime Synchronization in Wireless Sensor Networks: CCTS
Time Synchronization in Wireless Sensor Networks: CCTS 1 Nerin Thomas, 2 Smita C Thomas 1, 2 M.G University, Mount Zion College of Engineering, Pathanamthitta, India Abstract: A time synchronization algorithm
More informationA Framework to Minimize Energy Consumption for Wireless Sensor Networks
A Framework to Minimize Energy Consumption for Wireless Sensor Networks Feng Shu, Taka Sakurai,HaiL.Vu, Moshe Zukerman Department of Electrical and Electronic Engineering, The University of Melbourne,
More informationA Medium Access Control Protocol with Retransmission using NACK and Directional Antennas for Broadcasting in Wireless Ad-Hoc Networks
A Medium Access Control Protocol with Retransmission using NACK and Directional Antennas for Broadcasting in Wireless Ad-Hoc Networks Yoriko Utsunomiya, Michito Takahashi, Masaki Bandai, and Iwao Sasase
More informationarxiv: v1 [cs.ni] 8 Aug 2013
Evolution of IEEE 8. compatible standards and impact on Energy Consumption arxiv:8.96v [cs.ni] 8 Aug ABSTRACT Stratos Keranidis, Giannis Kazdaridis, Nikos Makris, Thanasis Korakis, Iordanis Koutsopoulos
More information1-1. Switching Networks (Fall 2010) EE 586 Communication and. November 8, Lecture 30
EE 586 Communication and Switching Networks (Fall 2010) Lecture 30 November 8, 2010 1-1 Announcements Quiz on Wednesday Next Monday hands-on training on Contiki OS Bring your laptop 4-2 Multiple Access
More informationRemarks On Per-flow Differentiation In IEEE
Remarks On Per-flow Differentiation In IEEE 82.11 Imad Aad and Claude Castelluccia PLANETE project, INRIA Rhône-Alpes ZIRST - 655, Avenue de l Europe - Montbonnot. 38334 Saint Ismier Cedex - France [imad.aad,
More information