Impact of Interference on Multi-Hop Wireless Network Performance

By Kamal Kumar Jain, J. Padhye, V. Padmanabhan, Lili Qiu. ACM/IEEE International Conference on Mobile Computing and Networking, 2003

1,937 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/bfa48f2c858526f7888b20ad22f38424ae84f71c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Modeling Per-Flow Throughput and Capturing Starvation in CSMA Multi-Hop Wireless Networks (2006, methodology): “If the system structure and access mechanism result in a convex feasibility region as is the case for TDMA [14], [23] and Aloha [16], then the solution can be determined via convex programming techniques.”
Minimum-cost multicast over coded packet networks (2005, background): “The rate vectorz, consisting ofziJ , (i, J) ∈ A, is called a subgraph, and we assume that it must lie within a constraint setZ for, if not, the packet queues associated with one or more hyperarcs becomes unstable (for examples of constraint set s Z that pertain specifically to multi-hop wireless net”
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks (2004, methodology): “However, bandwidth aggregation is rarely used in the context of multi-hop 802.11-based LANs that operate in the ad hoc mode.”
Cell Association and Interference Coordination in Heterogeneous LTE-A Cellular Networks (2010, background): “In general, we construct a conflict graph [26], where the set of links which have a conflict (due to high interference) with link i is denoted by Ci.”
End-to-end performance and fairness in multihop wireless backhaul networks (2004, methodology): “In [15], the authors formulate the throughput maximization problem in a general setting and find upper and lower bounds of throughput for any network topology and system parameters.”
Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks (2007, methodology): “There have been various interference models proposed in the literature, for example, the physical and protocol interference models [11] [14] [22] .”
Measurement-Based Self Organization of Interfering 802.11 Wireless Access Networks (2007, background): “spirit, some papers have addressed optimal channel allocation in wireless meshed networks [5].”
Topology control in wireless ad hoc and sensor networks (2005, background): “2Interference-aware routing protocols send packets along low-interference paths in the network (Couto et al. 2003; Jain et al. 2003).”
Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks (2008, methodology): “There have been various interference models proposed in the literature, for example, the physical and protocol interference models [15, 18, 27].”
SSCH: slotted seeded channel hopping for capacity improvement in IEEE 802.11 ad-hoc wireless networks (2004, background): “Simulation results show that SSCH signi.cantly increases network capacity in several multi-hop and single-hop wireless networking scenarios.”
Utilization and fairness in spectrum assignment for opportunistic spectrum access (2006, background): “Past work has demonstrated the effectiveness of using conflict graphs to model interference [11], [20], [28].”
A General Framework for Wireless Spectrum Auctions (2007, background): “While the problem is NP-hard, we show that by restricting bids and radio interference constraints judiciously, we can design a practical and efficient auction system that is simple, scalable and yet provides powerful performance guarantee.”
A multi-radio unification protocol for IEEE 802.11 wireless networks (2004, methodology): “In the remainder of this section, we describe in detail the two major components of MUP: neighbor discovery and classification, and the communication protocol between MUPcapable nodes.”
Wireless mesh networks: a survey (2005, background): “A clear understanding of the relationship between network capacity and the above factors provides a guideline for protocol development, architecture design, deployment and operation of the network.”
A review on algorithms for maximum clique problems (2015, neutral): “…Ryan, & Ehrgott, 2010), signal transmission analysis (Chen, Zhai, & Fang, 2010), social network analysis (Balasundaram, Butenko, & Hicks, 2011; Pattillo, Youssef, & Butenko, 2012), wireless networks and telecommunications (Balasundaram & Butenko, 2006; Jain, Padhye, Padmanabhan, & Qiu, 2005).”
Augmenting data center networks with multi-gigabit wireless links (2011, methodology): “We use the Monte-Carlo method to find maximal independent sets of flyway links [12].”