Introduction to Real-Time Ethernet I

Total Page:16

File Type:pdf, Size:1020Kb

Introduction to Real-Time Ethernet I Volume5•Issue3 MAY-JUNE © 2004 Contemporary Control Systems, Inc. Introduction to Real-Time Ethernet I By Paula Doyle, a doctoral researcher with the Circuits and Systems Research Centre at the University of Limerick in Ireland INTRODUCTION far as its timely execution is concerned. RT systems are Real-time electronic distributed control systems are generally broken into two main sub-categories: hard an important development of the technological and soft. evolution. Electronics are employed to control and Node with RT Clock monitor most safety-critical applications from flight Controller Station 3 decks to hospital operating rooms. As these real-time systems become increasingly prevalent and advanced, RT Network so does the demand to physically distribute the control in strict real-time. Thus, there is a need for control network protocols to support stringent real-time Station 1 Station 2 requirements. Real-time networks must provide a guarantee of service so they will consistently operate deterministically and correctly. Figure 1—Distributed Real-Time Processing Ethernet, as defined in IEEE 802.3, is non-deterministic and thus, is unsuitable for hard real-time applications. Hard Real-Time (HRT) systems are those in which The media access control protocol, CSMA/CD with its incorrect operation can lead to catastrophic events. backoff algorithm, prevents the network from supporting Errors in HRT systems can cause accidents or even hard real-time communication due to its random delays death, such as in flight control or train control. and potential transmission failures. Soft Real-Time (SRT) systems, on the other hand, Decreasing costs and increasing demand for a single are not as brittle. An error in a SRT system, while not network type, from boardroom to plant-floor, have led encouraged, will not cause loss of property or life. SRT to the development of Industrial Ethernet. The desire to systems are not as safety-critical as HRT systems, and incorporate a real-time element into this increasingly should not be employed in a safety-critical situation. popular single-network solution has led to the Examples of SRT systems are online reservation development of different real-time Industrial Ethernet systems and streaming multimedia applications where strategies. Fieldbus networking standards have failed to occasional delays are inconvenient but not serious. deliver an integrated solution. Typically, emerging real- Jobs are the RT system’s building blocks. Each RT job time Industrial Ethernet solutions complement the has certain temporal quantities (Figure 2): fieldbus standards — for example, by using common 1. Release Time, user layers. This article covers an introduction to real- 2. Ready Time, time systems and a study of Ethernet’s potential as a 3. Execution Time, real-time network. Part 2 provides a study of the 4. Response Time, real-time Industrial Ethernet solutions available today. 5. Deadline. Real-Time Introduction Release Time of a job is when a job becomes Real-Time (RT) systems are becoming increasingly available to the system. Execution Time is the time important, as industries focus on distributed computing for a job to be completely processed. Response Time in automation, see Figure 1. As computing costs is the interval between release time and completion of decrease, and computing power increases, industry has the execution. Ready Time is the earliest time a job relied more on distributed computers to deliver can start executing (never less than the Release Time). efficiency and increased yield to production lines. RT The Deadline is the time by which execution must be does not automatically mean faster execution, but rather finished, beyond which the job is late. A deadline can that a process is dependent on the progression of time for be either hard or soft, indicating the job’s temporal valid execution. dependence. As mentioned earlier, a missed hard dead- RT systems are those that depend not solely on the line can have serious consequences. All RT systems validity of data but also on its timeliness. A correct RT have a certain level of jitter (a variance on actual system will guarantee successful system operation—so timing). In a RT system, jitter should be measurable so system performance can be guaranteed. For textbook information on RT systems, refer to [1]. (No part of the Extension may be reproduced without the written consent of Contemporary Controls.) 1 Release Ready introduce overhead through its minimum message data Time Time Deadline size (46 bytes), which is large in comparison to existing control network standards, its increased bandwidth, Respon se Time standardization and integration with existing plant technology should generate good reasons to consider Ethernet as a control network solution. Execution Time Ethernet and CSMA/CD Ethernet, as defined in IEEE 802.3, is unsuitable for time strict RT industrial applications because its communication Figure 2 is non-deterministic. This is due to the definition of its To develop a RT distributed system of interconnected media access control (MAC) protocol, based on Carrier computers, it is vital to provide communication among Sense Multiple Access/ Collision Detection (CSMA/CD). the various computers in a reliable and timely fashion. The implementation described in the standard uses a Distributed processors running RT applications must be truncated binary exponential backoff algorithm. able to intercommunicate via a RT protocol, otherwise With CSMA/CD, each node can detect if another the temporal quality of work is lost. Real-Time node is transmitting on the medium (Carrier Sense). Communication networks are like any RT system. When a node detects a carrier, its Carrier Sense is They can be hard or soft, depending on requirements turned on and it will defer transmission until determining and their ‘jobs’ include message transmission, the medium is free. If two nodes transmit simultaneously propagation, and reception. A number of RT control (Multiple Access), a collision occurs and all frames are networks are employed in industry, but none have the destroyed. Nodes detect collisions (Collision Detection) popularity or bandwidth of Ethernet. by monitoring the collisionDetect signal provided by the physical layer. When a collision occurs, the node The Demand for Real-Time Ethernet transmits a jam sequence. Demand for Ethernet as a RT control network is When a node begins transmission there is a time increasing as manufacturers realize the benefits of interval, called the Collision Window, during which a employing a single network technology from collision can occur. This window is large enough to boardroom to plant floor. Decreased product costs allow the signal to propagate around the entire plus the possibility of overlapping training and network/segment. When this window is over, all maintenance costs for information, field level, control (functioning) nodes should have their Carrier Sense on, and possibly device networks would greatly reduce and so would not attempt to commence transmission. manufacturers’ expense. When a collision occurs, the truncated binary At the RT control level, Ethernet offers many exponential backoff algorithm is employed at each benefits over existing solutions. As a control network, ‘colliding’ node. The algorithm works as follows: 10 Gbps Ethernet offers bandwidth almost 1000x faster Initially: n:=0, k:=0, r:=0. than today’s comparable fieldbus networks (such as the When a collision occurs, the node enters the 12 Mbps of ProfiBus) and can also support RT algorithm which states: communication. Distributed applications in control • It increments n, the Transmit Counter, which environments require tight synchronization so to tracks the number of sequential collisions guarantee the delivery of control messages within experienced by a node. defined message cycle times (typical times appear in •Ifn > 16, (16 unsuccessful successive transmission Table 1). Traditional Ethernet and fieldbus systems attempts), transmission fails and the higher layers cannot meet cycle time requirements below a few should be informed. milliseconds, but emerging RT Industrial Ethernet •Ifn <= 16, select a number from the set k = min solutions allow cycle times of a few microseconds. (n, 10) (Truncation). Along with the increased bandwidth and tight • A random number, r, is selected from the set synchronization, RT Ethernet gives manufacturers the (0,1,2,4...2 k) (Exponential and Binary). security of using a physical and data-link layer technology • The node then waits r x slot_time before that has been standardized by both the IEEE and the recommencing a transmission attempt. ISO. Ethernet can provide reduced complexity with all the attributes required of a field, control or device One advantage of this backoff algorithm is that it network — in operations having up to 30 different controls the medium load. If the medium is heavily networks installed at this level [2]. Furthermore, loaded, the likelihood of collisions increases, and the Ethernet devices can also support TCP/IP stacks so that algorithm increases the interval from which the random Ethernet can easily gate to the Internet. This feature is delay time is chosen. This should lighten the load and attractive to users since it allows remote diagnostics, reduce further collisions. control, and observation of their plant network from Ethernet introduces the possibility of complete any Internet-connected device around the world with a transmission failure and the possibility of random license-free web browser. Although Ethernet does transmission time, hence IEEE 802.3’s non-determinism 2 and unsuitability for RT communications—especially on Since full duplex links have a maximum of two heavily-loaded networks. Re-definition of the media nodes per link, such technology is not viable as an access protocol could solve the problem but would industrial RT solution without the use of fast, intelligent leave the new nodes unable to interoperate with legacy switches that can form a network with single collision Ethernet nodes. domains for each node — i.e., Switched Ethernet. Ethernet is non-deterministic only if collisions can Full Duplex, Switched Ethernet occur.
Recommended publications
  • Securing the Everywhere Perimeter Iot, BYOD, and Cloud Have Fragmented the Traditional Network Perimeter
    White Paper Securing the Everywhere Perimeter IoT, BYOD, and Cloud have fragmented the traditional network perimeter. This revolution necessitates a new approach that is comprehensive, pervasive, and automated. Businesses need an effective strategy to differentiate critical applications and confidential data, partition user and devices, establish policy boundaries, and reduce their exposure. Leveraging Extreme Networks technology, organizations can hide much of their network and protect those elements that remain visible. Borders are established that defend against unauthorized lateral movement, the attack profile is reduced, and highly effective breach isolation is delivered. This improves the effectiveness of anomaly scanning and the value of specialist security appliances. Redundant network configuration is rolled back, leaving an edge that is “clean” and protected from hacking. Businesses avoid many of the conventional hooks and tools that hackers seek to exploit. Additionally, flipping the convention of access-by-default, effective access control policy enforcement denies unauthorized connectivity. The Business Imperative As businesses undertake the digital transformation, the trends of cloud, mobility, and IoT converge. Organizations need to take a holistic approach to protecting critical systems and data, and important areas for attention are the ability to isolate traffic belonging to different applications, to reduce the network’s exposure and attack profile, and to dynamically control connectivity to network assets. In addition to all of the normal challenges and demands, businesses are also starting to experience IoT. This networking phenomenon sees unconventional embedded system devices appearing, seemingly from nowhere, requiring connectivity. WWW.EXTREMENETWORKS.COM 1 IoT is being positioned as the enabling technology for all manner of “Smart” initiatives.
    [Show full text]
  • MAC Protocols for IEEE 802.11Ax: Avoiding Collisions on Dense Networks Rafael A
    MAC Protocols for IEEE 802.11ax: Avoiding Collisions on Dense Networks Rafael A. da Silva1 and Michele Nogueira1;2 1Department of Informatics, Federal University of Parana,´ Curitiba, PR, Brazil 2Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA E-mails: [email protected] and [email protected] Wireless networks have become the main form of Internet access. Statistics show that the global mobile Internet penetration should exceed 70% until 2019. Wi-Fi is an important player in this change. Founded on IEEE 802.11, this technology has a crucial impact in how we share broadband access both in domestic and corporate networks. However, recent works have indicated performance issues in Wi-Fi networks, mainly when they have been deployed without planning and under high user density. Hence, different collision avoidance techniques and Medium Access Control protocols have been designed in order to improve Wi-Fi performance. Analyzing the collision problem, this work strengthens the claims found in the literature about the low Wi-Fi performance under dense scenarios. Then, in particular, this article overviews the MAC protocols used in the IEEE 802.11 standard and discusses solutions to mitigate collisions. Finally, it contributes presenting future trends arXiv:1611.06609v1 [cs.NI] 20 Nov 2016 in MAC protocols. This assists in foreseeing expected improvements for the next generation of Wi-Fi devices. I. INTRODUCTION Statistics show that wireless networks have become the main form of Internet access with an expected global mobile Internet penetration exceeding 70% until 2019 [1]. Wi-Fi Notice: This work has been submitted to the IEEE for possible publication.
    [Show full text]
  • LAB MANUAL for Computer Network
    LAB MANUAL for Computer Network CSE-310 F Computer Network Lab L T P - - 3 Class Work : 25 Marks Exam : 25 MARKS Total : 50 Marks This course provides students with hands on training regarding the design, troubleshooting, modeling and evaluation of computer networks. In this course, students are going to experiment in a real test-bed networking environment, and learn about network design and troubleshooting topics and tools such as: network addressing, Address Resolution Protocol (ARP), basic troubleshooting tools (e.g. ping, ICMP), IP routing (e,g, RIP), route discovery (e.g. traceroute), TCP and UDP, IP fragmentation and many others. Student will also be introduced to the network modeling and simulation, and they will have the opportunity to build some simple networking models using the tool and perform simulations that will help them evaluate their design approaches and expected network performance. S.No Experiment 1 Study of different types of Network cables and Practically implement the cross-wired cable and straight through cable using clamping tool. 2 Study of Network Devices in Detail. 3 Study of network IP. 4 Connect the computers in Local Area Network. 5 Study of basic network command and Network configuration commands. 6 Configure a Network topology using packet tracer software. 7 Configure a Network topology using packet tracer software. 8 Configure a Network using Distance Vector Routing protocol. 9 Configure Network using Link State Vector Routing protocol. Hardware and Software Requirement Hardware Requirement RJ-45 connector, Climping Tool, Twisted pair Cable Software Requirement Command Prompt And Packet Tracer. EXPERIMENT-1 Aim: Study of different types of Network cables and Practically implement the cross-wired cable and straight through cable using clamping tool.
    [Show full text]
  • Migrating Backoff to the Frequency Domain
    No Time to Countdown: Migrating Backoff to the Frequency Domain Souvik Sen Romit Roy Choudhury Srihari Nelakuditi Duke University Duke University University of South Carolina Durham, NC, USA Durham, NC, USA Columbia, SC, USA [email protected] [email protected] [email protected] ABSTRACT 1. INTRODUCTION Conventional WiFi networks perform channel contention in Access control strategies are designed to arbitrate how mul- time domain. This is known to be wasteful because the chan- tiple entities access a shared resource. Several distributed nel is forced to remain idle while all contending nodes are protocols embrace randomization to achieve arbitration. In backing off for multiple time slots. This paper proposes to WiFi networks, for example, each participating node picks a break away from convention and recreate the backing off op- random number from a specified range and begins counting eration in the frequency domain. Our basic idea leverages the down. The node that finishes first, say N1, wins channel con- observation that OFDM subcarriers can be treated as integer tention and begins transmission. The other nodes freeze their numbers. Thus, instead of picking a random backoff duration countdown temporarily, and revive it only after N1’s trans- in time, a contending node can signal on a randomly cho- mission is complete. Since every node counts down at the sen subcarrier. By employing a second antenna to listen to same pace, this scheme produces an implicit ordering among all the subcarriers, each node can determine whether its cho- nodes. Put differently, the node that picks the smallest ran- sen integer (or subcarrier) is the smallest among all others.
    [Show full text]
  • Collision Detection
    Computer Networking Michaelmas/Lent Term M/W/F 11:00-12:00 LT1 in Gates Building Slide Set 3 Evangelia Kalyvianaki [email protected] 2017-2018 1 Topic 3: The Data Link Layer Our goals: • understand principles behind data link layer services: (these are methods & mechanisms in your networking toolbox) – error detection, correction – sharing a broadcast channel: multiple access – link layer addressing – reliable data transfer, flow control • instantiation and implementation of various link layer technologies – Wired Ethernet (aka 802.3) – Wireless Ethernet (aka 802.11 WiFi) • Algorithms – Binary Exponential Backoff – Spanning Tree 2 Link Layer: Introduction Some terminology: • hosts and routers are nodes • communication channels that connect adjacent nodes along communication path are links – wired links – wireless links – LANs • layer-2 packet is a frame, encapsulates datagram data-link layer has responsibility of transferring datagram from one node to adjacent node over a link 3 Link Layer (Channel) Services • framing, physical addressing: – encapsulate datagram into frame, adding header, trailer – channel access if shared medium – “MAC” addresses used in frame headers to identify source, dest • different from IP address! • reliable delivery between adjacent nodes – we see some of this again in the Transport Topic – seldom used on low bit-error link (fiber, some twisted pair) – wireless links: high error rates 4 Link Layer (Channel) Services - 2 • flow control: – pacing between adjacent sending and receiving nodes • error control: – error
    [Show full text]
  • Understanding CIDR Notation Used for IP Address Display on 2500 Series® Processors
    Application Note 2500 Series® Programmable Automation Control System Understanding CIDR Notation Used for IP Address Display on 2500 Series® Processors Newer CTI products featuring Ethernet ports, such as the 2500 Series® processor, the 2500P-ECC1, and 2500P-ACP1, display the IP address of the product on the front panel multi-segment display. This information has proven very useful to most customers, facilitating the connection of browsers to obtain diagnostic data and providing visual confirmation of the operating IP address. Beginning with Version 8.02 of the 2500 Series® processor firmware, we’ve added the capability to display the subnet mask in CIDR notation. This gives users more complete information about the IP address setting to allow them to easily get connected. This application note shows how to interpret the CIDR notation displayed on the front of the processor. What is CIDR Notation? CIDR notation (Classless Inter-Domain Routing) is an alternate method of representing a subnet mask. It is simply a count of the number of network bits (bits that are set to 1) in the subnet mask. Subnet mask bits are explained in a following section. The CIDR number is typically preceded by a slash “/” and follows the IP address. For example, an IP address of 131.10.55.70 with a subnet mask of 255.0.0.0 (which has 8 network bits) would be represented as 131.10.55.70 /8. CIDR notation is more concise method for designating the subnet mask. Compared to Dotted Decimal notation, which represents the mask as four values, each representing the decimal value of an octet of the mask, the CIDR format represents the mask as a single value.
    [Show full text]
  • LAN Topologies
    0390.book Page 13 Wednesday, November 14, 2001 3:28 PM C H A P T E R 2 LAN Topologies The application in use, such as multimedia, database updates, e-mail, or file and print sharing, generally determines the type of data transmission. LAN transmissions fit into one of three categories: • Unicast • Multicast • Broadcast Unicast With unicast transmissions, a single packet is sent from the source to a destination on a network. The source-node addresses the packet by using the network address of the destination node. The packet is then forwarded to the destination network and the network passes the packet to its final destination. Figure 2-1 is an example of a unicast network. Figure 2-1 Unicast Network Server Client Client Client 0390.book Page 14 Wednesday, November 14, 2001 3:28 PM 14 Chapter 2: LAN Topologies Multicast With a multicast transmission, a single data packet is copied and forwarded to a specific subset of nodes on the network. The source node addresses the packet by using a multicast address. For example, the TCP/IP suite uses 224.0.0.0 to 239.255.255.255. The packet is then sent to the network, which makes copies of the packet and sends a copy to each segment with a node that is part of the multicast address. Figure 2-2 is an example of a multicast network. Figure 2-2 Multicast Network Server Client Client Client Broadcast Broadcasts are found in LAN environments. Broadcasts do not traverse a WAN unless the Layer 3 edge-routing device is configured with a helper address (or the like) to direct these broadcasts to a specified network address.
    [Show full text]
  • Draft NIST SP 800-125B, Secure Virtual Network Configuration for Virtual Machine
    The attached DRAFT document (provided here for historical purposes) has been superseded by the following publication: Publication Number: NIST Special Publication (SP) 800-125B Title: Secure Virtual Network Configuration for Virtual Machine (VM) Protection Publication Date: 3/29/2016 • Final Publication: http://dx.doi.org/10.6028/NIST.SP.800-125B (which links to http://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-125B.pdf). • Related Information on CSRC: http://csrc.nist.gov/publications/PubsSPs.html#SP-800-125-B • Information on other NIST cybersecurity publications and programs can be found at: http://csrc.nist.gov/ The following information was posted with the attached DRAFT document: Sep. 29, 2015 SP 800-125 B DRAFT Secure Virtual Network Configuration for Virtual Machine (VM) Protection NIST requests public comments on Draft Special Publication 800-125B, Secure Virtual Network Configuration for Virtual Machine (VM) Protection. VMs constitute the primary resource to be protected in a virtualized infrastructure, since they are the compute engines on which business/mission critical applications of the enterprise are run. Further, since VMs are end-nodes of a virtual network, the configuration of virtual network forms an important element in the security of VMs and their hosted applications. The virtual network configuration areas considered for VM protection in this document are – Network Segmentation, Network Path Redundancy, Firewall Deployment Architecture and VM Traffic Monitoring. The configuration options in each of these areas are analyzed for their advantages and disadvantages and security recommendations are provided. The specific areas where comments are solicited are: • Advantages and Disadvantages of the various configuration options in the four virtual network configuration areas.
    [Show full text]
  • 1.2. OSI Model
    1.2. OSI Model The OSI model classifies and organizes the tasks that hosts perform to prepare data for transport across the network. You should be familiar with the OSI model because it is the most widely used method for understanding and talking about network communications. However, remember that it is only a theoretical model that defines standards for programmers and network administrators, not a model of actual physical layers. Using the OSI model to discuss networking concepts has the following advantages: Provides a common language or reference point between network professionals Divides networking tasks into logical layers for easier comprehension Allows specialization of features at different levels Aids in troubleshooting Promotes standards interoperability between networks and devices Provides modularity in networking features (developers can change features without changing the entire approach) However, you must remember the following limitations of the OSI model: OSI layers are theoretical and do not actually perform real functions. Industry implementations rarely have a layer‐to‐layer correspondence with the OSI layers. Different protocols within the stack perform different functions that help send or receive the overall message. A particular protocol implementation may not represent every OSI layer (or may spread across multiple layers). To help remember the layer names of the OSI model, try the following mnemonic devices: Mnemonic Mnemonic Layer Name (Bottom to top) (Top to bottom) Layer 7 Application Away All Layer 6 Presentation Pizza People Layer 5 Session Sausage Seem Layer 4 Transport Throw To Layer 3 Network Not Need Layer 2 Data Link Do Data Layer 1 Physical Please Processing Have some fun and come up with your own mnemonic for the OSI model, but stick to just one so you don't get confused.
    [Show full text]
  • Collision & Broadcast Domain a Collision Domain Is a Section of A
    Computer Networking & Communication 4th Class Arranged By: Dr.Ahmed Chalak Shakir Collision & Broadcast Domain A collision domain is a section of a network where data packets can collide with one another when being sent on a shared medium or through repeaters, particularly when using early versions of Ethernet. A network collision occurs when more than one device attempts to send a packet on a network segment at the same time. A broadcast domain is a logical division of a computer network, in which all nodes can reach each other by broadcast at the data link layer. LAYER 1 - PHYSICAL LAYER Devices - Hubs, Repeaters Collision Domain: As you might have studied both these devices just forward the data as it is to all the devices that are connected to them after attenuating it (making it stronger so that it travels more distance). All the devices fall in the SAME COLLISION DOMAIN because two or more devices might send the data at the same time even when we have CSMA/CD working. So, the data can collide and nullify each other that way no one gets nothing. Broadcast Domain: These devices don't use any type of addressing schemes to help them forward the data like MAC or IP addresses. So, if a PC A sends something for PC B and there are also C,D and E PC's connected to the hub then all the devices i.e. B,C,D and E would receive the data ( Only PC B accepts it while others drop it ). This is what is being in a single BROADCAST DOMAIN.
    [Show full text]
  • How Computers Share Data
    06 6086 ch03 4/6/04 2:51 PM Page 41 HOUR 3 Getting Data from Here to There: How Computers Share Data In this hour, we will first discuss four common logi- cal topologies, starting with the most common and ending with the most esoteric: . Ethernet . Token Ring . FDDI . ATM In the preceding hour, you read a brief definition of packet-switching and an expla- nation of why packet switching is so important to data networking. In this hour, you learn more about how networks pass data between computers. This process will be discussed from two separate vantage points: logical topologies, such as ethernet, token ring, and ATM; and network protocols, which we have not yet discussed. Why is packet switching so important? Recall that it enables multiple computers to send multiple messages down a single piece of wire, a technical choice that is both efficient and an elegant solution. Packet switching is intrinsic to computer network- ing—without packet switching, no network. In the first hour, you learned about the physical layouts of networks, such as star, bus, and ring technologies, which create the highways over which data travels. In the next hour, you learn about these topologies in more depth. But before we get to them, you have to know the rules of the road that determine how data travels over a network. In this hour, then, we’ll review logical topologies. 06 6086 ch03 4/6/04 2:51 PM Page 42 42 Hour 3 Logical Topologies Before discussing topologies again, let’s revisit the definition of a topology.
    [Show full text]
  • Listen Before You Talk but on the Frequency Domain
    1 Listen Before You Talk But On The Frequency Domain Souvik Sen Romit Roy Choudhury Srihari Nelakuditi Duke University Duke University University of South Carolina Abstract Access control strategies are designed to arbitrate how multiple entities access a shared resource. Several dis- tributed protocols embrace randomization to achieve arbitration. In WiFi networks, for example, each participating node picks a random number from a specified range and begins counting down. The device that reaches zero first wins the contention and initiates transmission. This core idea – called backoff – is known to be inherently wasteful because the channel must remain idle while all contending nodes are simultaneously counting down. This wastage has almost been accepted as a price for decentralization. In this paper, we ask whether the entire backoff operation can be migrated to the frequency domain, thereby eliminating a long-standing source of channel inefficiency. Our core idea draws on OFDM subcarriers in modern WiFi radios, treating each subcarrier as an integer number. By transmitting a signal on a random subcarrier frequency, and using a second antenna to listen for all active frequencies, each node may be able to detect its rank among all contenders. Since signaling on subcarriers is almost instantaneous, the wastage from backoff can become negligible. We design such an unconventional backoff scheme called Back2F, implement it on a software- radio testbed, and demonstrate its feasibility with real-world experiments. A natural next step would be to revisit today’s protocols, and ask what other operations may be similarly migrated to the frequency domain. I. PROBLEM &MOTIVATION Accessing a shared resource in a decentralized manner has been studied for several decades.
    [Show full text]