NDLI: Passive learning of the interference graph of a wireless network

Content Provider	IEEE Xplore Digital Library
Author	Jing Yang Draper, S.C. Nowak, R.
Copyright Year	2012
Description	Author affiliation: Department of Electrical and Computer Engineering, University of Wisconsin, Madison, WI 53706 (Jing Yang; Draper, S.C.; Nowak, R.)
Abstract	A key challenge in wireless networking is the management of interference between transmissions. Identifying which transmitters interfere with each other is crucial. Complicating this task is the fact that the topology of wireless networks can change from time to time, and so the identification process may need to be carried out on a regular basis. Injecting active probing traffic to assess interference can lead to unacceptable overhead, and so this paper focuses on interference estimation based on passive traffic monitoring in networks that use the CSMA/CA (Carrier Sense Multiple Access/Collision Avoidance) protocol. A graph is used to represent the interference in the network, where the nodes represent transmitters and edges represent interference between pairs of transmitters. We investigate the problem of learning the graph structure based on passive observations of network traffic transmission patterns and information about successes or failures in transmissions. Previous work has focused on algorithms and validations in small testbed networks. This paper focuses on the scaling behavior of such methods which is unaddressed in prior work. In particular we establish bounds on the minimum observation period required to identify the interference graph reliably. The main results are expressed in terms of the total number of nodes n and the maximum number of interfering transmitters per node (i.e., maximum node degree) d. The effects of hidden terminal interference (i.e., interference not detectable via carrier sensing) on the observation time requirement are also quantified. We show that it is necessary and sufficient that the observation period grows like $d^{2}$ log n, and we propose a practical algorithm that reliably identifies the graph from this length of observation. We conclude that the observation requirements scale quite mildly with network size, and that the networks with sparse interference patterns can be more rapidly identified than those with dense interference patterns.
Starting Page	2735
Ending Page	2740
File Size	150113
Page Count	6
File Format	PDF
ISBN	9781467325806
ISSN	21578117
e-ISBN	9781467325790
e-ISBN	9781467325783
DOI	10.1109/ISIT.2012.6284019
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-07-01
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Interference Transmitters Upper bound Estimation Multiaccess communication Protocols Wireless networks
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Location-Based MAC Scheme for Random Wireless Network

Network information theory for wireless communications

Characterizing and Exploiting Partial Interference in Wireless Mesh Networks

The Connectivity of Selfish Wireless Networks

Mean Interference in Hard-Core Wireless Networks

Connectivity of Large-Scale CSMA Networks

A capacity upper bound for large wireless networks with generally distributed nodes

Coverage Estimations in a WLAN-based Open Broadband Access Network (OBAN)

On the capacity of multihop device-to-device caching networks

Passive learning of the interference graph of a wireless network

Similar Documents

A Location-Based MAC Scheme for Random Wireless Network

Network information theory for wireless communications

Characterizing and Exploiting Partial Interference in Wireless Mesh Networks

The Connectivity of Selfish Wireless Networks

Mean Interference in Hard-Core Wireless Networks

Connectivity of Large-Scale CSMA Networks

A capacity upper bound for large wireless networks with generally distributed nodes

Coverage Estimations in a WLAN-based Open Broadband Access Network (OBAN)

On the capacity of multihop device-to-device caching networks

Passive learning of the interference graph of a wireless network