Algorithmic models of interference in wireless ad hoc and sensor networks

Authors:
Pascal von Rickenbach;Roger Wattenhofer;Aaron Zollinger
Affiliations:
ETH Zurich, Zurich, Switzerland;ETH Zurich, Zurich, Switzerland;Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2009

Citing 23
Cited 9

Unidirectional links prove costly in wireless ad hoc networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Routing with guaranteed delivery in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
Discrete mobile centers

SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Geometric spanner for routing in mobile networks

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Message-optimal connected dominating sets in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Energy, congestion and dilation in radio networks

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Embedded Everywhere: A Research Agenda for Networked Systems of Embedded Computers

Embedded Everywhere: A Research Agenda for Networked Systems of Embedded Computers
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Geometric Spanners for Wireless Ad Hoc Networks

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Constant-time distributed dominating set approximation

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geometric ad-hoc routing: of theory and practice

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Localized construction of bounded degree and planar spanner for wireless ad hoc networks

DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Does topology control reduce interference?

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Gathering correlated data in sensor networks

Proceedings of the 2004 joint workshop on Foundations of mobile computing
Minimizing interference in ad hoc and sensor networks

DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Local approximation schemes for ad hoc and sensor networks

DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
A unified energy-efficient topology for unicast and broadcast

Proceedings of the 11th annual international conference on Mobile computing and networking
Topology control meets SINR: the scheduling complexity of arbitrary topologies

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Minimum energy mobile wireless networks

IEEE Journal on Selected Areas in Communications

Broadcasting in unreliable radio networks

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Minimizing interference for the highway model in wireless ad-hoc and sensor networks

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Exact algorithms to minimize interference in wireless sensor networks

Theoretical Computer Science
Minimizing average interference through topology control

ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Strong minimum energy minimum interference topology in wireless sensor networks

ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Minimizing interference in ad-hoc networks with bounded communication radius

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Minimizing interference in ad hoc networks with bounded communication radius

Information Processing Letters
Bounding interference in wireless ad hoc networks with nodes in random position

SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Power optimization in ad hoc wireless network topology control with biconnectivity requirements

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Among the most critical issues of wireless ad hoc and sensor networks are energy consumption in general and interfer-ence in particular. The reduction of interference is consequently considered one of the foremost goals of topology control. Almost all of the related work however considers this issue implicitly: Low interference is often claimed to be a consequence of sparseness or low degree of the constructed topologies. This paper, in contrast, studies explicit definitions of interference. Various models of in-terference--both from a sender-centric and a receiver-centric per-spective--are proposed, compared, and analyzed with respect to their algorithmic properties and complexities.