PapersFlow Research Brief

Physical Sciences · Computer Science

Wireless Networks and Protocols
Research Guide

What is Wireless Networks and Protocols?

Wireless Networks and Protocols is the study of performance analysis, optimization, and enhancement of medium access control (MAC) protocols for wireless LANs, particularly the IEEE 802.11 standard, covering rate adaptation, quality of service (QoS) support, multi-hop network behavior, interference mitigation, and coexistence with other wireless systems.

This field encompasses 37,053 papers on topics including IEEE 802.11 MAC protocols, distributed coordination function (DCF), and ad hoc routing. Giuseppe Bianchi (2000) analyzed the performance of the IEEE 802.11 DCF, a CSMA/CA scheme with binary slotted exponential backoff. Research also addresses capacity limits, as Piyush Gupta and P. R. Kumar (2000) showed that n nodes achieve throughput Θ(W/√(n log n)) bits per second.

Topic Hierarchy

100%
graph TD D["Physical Sciences"] F["Computer Science"] S["Computer Networks and Communications"] T["Wireless Networks and Protocols"] D --> F F --> S S --> T style T fill:#DC5238,stroke:#c4452e,stroke-width:2px
Scroll to zoom • Drag to pan
37.1K
Papers
N/A
5yr Growth
413.3K
Total Citations

Research Sub-Topics

Why It Matters

Wireless networks and protocols enable reliable communication in mobile ad hoc networks, wireless LANs, and sensor systems used in offices, IoT devices, and dynamic environments. For example, the Ad hoc On-Demand Distance Vector (AODV) Routing protocol by Perkins et al. (2003) supports quick adaptation to dynamic link conditions with low overhead, cited in 10,608 works for unicast routes in ad hoc networks. OpenFlow by McKeown et al. (2008) facilitates experimental protocols on Ethernet switches via flow tables, impacting network research with 8,323 citations. These protocols improve throughput amid misbehavior, as Marti et al. (2000) demonstrated using watchdogs and pathraters to categorize nodes, and support low-power operation in sensor networks through B-MAC's adaptive preamble sampling by Polastre et al. (2004).

Reading Guide

Where to Start

'Performance analysis of the IEEE 802.11 distributed coordination function' by Giuseppe Bianchi (2000), as it provides foundational modeling of the core DCF mechanism central to wireless LAN MAC protocols.

Key Papers Explained

Bianchi (2000) establishes DCF performance baselines in 'Performance analysis of the IEEE 802.11 distributed coordination function', which Gupta and Kumar (2000) extend to capacity limits in 'The capacity of wireless networks' showing Θ(W/√(n log n)) throughput. Perkins et al. (2003) build on this for routing in 'Ad hoc On-Demand Distance Vector (AODV) Routing', offering low-overhead ad hoc paths, while Johnson and Maltz (2007) compare protocols including DSR in 'Dynamic Source Routing in Ad Hoc Wireless Networks' and 'A performance comparison of multi-hop wireless ad hoc network routing protocols' by Broch et al. (1998). McKeown et al. (2008) introduce programmable flows in 'OpenFlow' applicable to wireless experimentation.

Paper Timeline

100%
graph LR P0["The active badge location system
1992 · 3.8K cites"] P1["A performance comparison of mult...
1998 · 4.7K cites"] P2["Performance analysis of the IEEE...
2000 · 8.6K cites"] P3["The capacity of wireless networks
2000 · 8.3K cites"] P4["Ad hoc On-Demand Distance Vector...
2003 · 10.6K cites"] P5["Dynamic Source Routing in Ad Hoc...
2007 · 8.5K cites"] P6["OpenFlow
2008 · 8.3K cites"] P0 --> P1 P1 --> P2 P2 --> P3 P3 --> P4 P4 --> P5 P5 --> P6 style P4 fill:#DC5238,stroke:#c4452e,stroke-width:2px
Scroll to zoom • Drag to pan

Most-cited paper highlighted in red. Papers ordered chronologically.

Advanced Directions

Research continues on interference mitigation and QoS in IEEE 802.11 multi-hop networks, with no recent preprints available. Focus remains on optimizing MAC for dynamic links and coexistence.

Papers at a Glance

# Paper Year Venue Citations Open Access
1 Ad hoc On-Demand Distance Vector (AODV) Routing 2003 10.6K
2 Performance analysis of the IEEE 802.11 distributed coordinati... 2000 IEEE Journal on Select... 8.6K
3 Dynamic Source Routing in Ad Hoc Wireless Networks 2007 8.5K
4 OpenFlow 2008 ACM SIGCOMM Computer C... 8.3K
5 The capacity of wireless networks 2000 IEEE Transactions on I... 8.3K
6 A performance comparison of multi-hop wireless ad hoc network ... 1998 4.7K
7 The active badge location system 1992 ACM Transactions on In... 3.8K
8 The Cricket location-support system 2000 3.7K
9 Mitigating routing misbehavior in mobile ad hoc networks 2000 3.4K
10 Versatile low power media access for wireless sensor networks 2004 3.4K

Frequently Asked Questions

What is the IEEE 802.11 distributed coordination function?

The IEEE 802.11 distributed coordination function (DCF) is the primary MAC technique using carrier sense multiple access with collision avoidance (CSMA/CA) and binary slotted exponential backoff. Giuseppe Bianchi (2000) provided its performance analysis in 'Performance analysis of the IEEE 802.11 distributed coordination function'. This scheme manages medium access in wireless LANs.

How does AODV routing work in ad hoc networks?

Ad hoc On-Demand Distance Vector (AODV) Routing by Perkins et al. (2003) enables mobile nodes to form routes on demand with quick adaptation to dynamic links, low processing overhead, and low network utilization. It determines unicast routes within ad hoc networks. The protocol is detailed in 'Ad hoc On-Demand Distance Vector (AODV) Routing'.

What limits the capacity of wireless networks?

Piyush Gupta and P. R. Kumar (2000) showed that for n identical nodes transmitting at W bits per second, each node's throughput to a random destination is Θ(W/√(n log n)) bits per second under noninterfering conditions. This result appears in 'The capacity of wireless networks'. It quantifies scalability constraints.

What is OpenFlow in wireless network contexts?

OpenFlow by McKeown et al. (2008) proposes a flow-table-based interface on Ethernet switches for running experimental protocols in daily networks. It standardizes adding and removing flow entries. Described in 'OpenFlow', it aids researchers in protocol testing.

How does B-MAC achieve low power in sensor networks?

B-MAC by Polastre et al. (2004) uses adaptive preamble sampling for ultra-low power operation, collision avoidance, and high channel utilization in wireless sensor networks. It provides a flexible interface. Detailed in 'Versatile low power media access for wireless sensor networks'.

What methods mitigate routing misbehavior in ad hoc networks?

Sergio Marti et al. (2000) proposed watchdogs to identify misbehaving nodes and pathraters to select reliable paths, improving throughput. Nodes are categorized by behavior. From 'Mitigating routing misbehavior in mobile ad hoc networks'.

Open Research Questions

  • ? How can MAC protocols optimize rate adaptation beyond IEEE 802.11 DCF for high-density wireless LANs?
  • ? What interference mitigation techniques maximize throughput in multi-hop ad hoc networks under dynamic topologies?
  • ? How do QoS support mechanisms in 802.11 handle coexistence with emerging wireless systems?
  • ? What channel assignment strategies minimize interference in multi-hop networks with random node placements?
  • ? How can low-power MAC protocols like B-MAC scale to large wireless sensor deployments?

Research Wireless Networks and Protocols with AI

PapersFlow provides specialized AI tools for Computer Science researchers. Here are the most relevant for this topic:

See how researchers in Computer Science & AI use PapersFlow

Field-specific workflows, example queries, and use cases.

Computer Science & AI Guide

Start Researching Wireless Networks and Protocols with AI

Search 474M+ papers, run AI-powered literature reviews, and write with integrated citations — all in one workspace.

See how PapersFlow works for Computer Science researchers