skip to main content
10.1145/1400863.1400873acmconferencesArticle/Chapter ViewAbstractPublication PagesdialmConference Proceedingsconference-collections
research-article

Local broadcasting in the physical interference model

Published: 18 August 2008 Publication History

Abstract

In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node knows how many nodes there are in its geographical proximity, and another, which makes no assumptions about topology knowledge. We show that, if the transmission probability of each node meets certain characteristics, the analysis can be decoupled from the global nature of the physical interference model, and each node performs a successful local broadcast in time proportional to the number of neighbors in its physical proximity. We also provide worst-case optimality guarantees for both algorithms and demonstrate their behavior in average scenarios through simulations.

References

[1]
F. Baccelli, B. Blaszczyszyn, and P. Muhlethaler. An Aloha protocol for multihop mobile wireless networks. Inf. Theory, IEEE Tran. on, 52(2):421--436, 2006.
[2]
R. Bar-Yehuda, O. Goldreich, and A. Itai. On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization. In Proc. 6th Symposium on Principles of Distributed Computing (PODC), pages 98--108, 1987.
[3]
A. Behzad and I. Rubin. On the Performance of Graph-based Scheduling Algorithms for Packet Radio Networks. In Globecom, pages 3432--3436, 2003.
[4]
S. A. Borbash and A. Ephremides. Wireless Link Scheduling With Power Control and SINR Constraints. IEEE Tran. on Inf. Theory, 52(11):5106--5111, 2006.
[5]
G. Brar, D. M. Blough, and P. Santi. Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks. In Mobicom, pages 2--13, 2006.
[6]
D. Chafekar, V. Kumar, M. Marathe, S. Parthasarathy, andA. Srinivasan. Cross-layer Latency Minimization for Wireless Networks using SINR Constraints. In Mobihoc, 2007.
[7]
R. L. Cruz and A. Santhanam. Optimal Routing, Link Scheduling, and Power Control in Multi-hop Wireless Networks. In Infocom, 2003.
[8]
T. A. ElBatt and A. Ephremides. Joint Scheduling and Power Control for Wireless Ad-hoc Networks. In Infocom, 2002.
[9]
A. Ephremides and T. V. Truong. Scheduling broadcasts in multihop radio networks. IEEE Trans. Communications, 38(4):456--460, Apr. 1990.
[10]
G. Ferrari and O. K. Tonguz. Performance of ad hoc wireless networks with Aloha and PR-CSMA MAC protocol. In Globecom, pages 2824--2829, 2003.
[11]
Y. Gao, J. C. Hou, and H. Nguyen. Topology control for maintaining network connectivity and maximizing network capacity under the physical model. In Infocom, 2008.
[12]
L. Gasieniec, A. Pelc, and D. Peleg. The Wakeup Problem in Synchronous Broadcast Systems. SIAM J. Discret. Math., 14(2):207--222, 2001.
[13]
J. Gronkvist. Interference-Based Scheduling in Spatial Reuse TDMA. PhD thesis, Royal Institute of Technology, Stockholm, Sweden, 2005.
[14]
J. Gronkvist and A. Hansson. Comparison between graph-based and interference-based STDMA scheduling. In Mobihoc, pages 255--258, 2001.
[15]
P. Gupta and P. R. Kumar. Critical Power for Asymptotic Connectivity in Wireless Networks. In Stochastic Analysis, Control, Optimization and Applications, pages 547--566. Birkhauser, Boston, 1998.
[16]
P. Gupta and P. R. Kumar. The Capacity of Wireless Networks. IEEE Trans. on Inf. Theory, IT-46(2):388--404, 2000.
[17]
B. Hajek and G. Sasaki. Link scheduling in polynomial time. IEEE Trans. on Inf. Theory, 34(5):910--917, 1988.
[18]
T. Jurdzinski and G. Stachowiak. Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks. LNCS, 2518:535--549, 2002.
[19]
R. Kershner. The number of circles covering a set. American Journal of Mathematics, 62, 1939.
[20]
T.-S. Kim, H. Lim, and J. C. Hou. Improving Spatial Reuse through Tuning Transmit Power, Carrier Sense Threshold, and Data Rate in Multihop Wireless Networks. In Mobicom, 2006.
[21]
F. Kuhn, T. Moscibroda, and R. Wattenhofer. Initializing Newly Deployed Ad Hoc and Sensor Networks. In Mobicom, 2004.
[22]
V. S. A. Kumar, M. V. Marathe, S. Parthasarathy, and A. Srinivasan. End-to-end packet-scheduling in wireless ad-hoc networks. In SODA, pages 1021--1030, 2004.
[23]
T. Moscibroda and R. Wattenhofer. Coloring Unstructured Radio Networks. In SPAA, July 2005.
[24]
T. Moscibroda and R. Wattenhofer. The Complexity of Connectivity in Wireless Networks. In Infocom, 2006.
[25]
T. Moscibroda, R. Wattenhofer, and Y. Weber. Protocol Design Beyond Graph-Based Models. In Hotnets, November 2006.
[26]
S. Ramanathan and E. L. Lloyd. Scheduling algorithms for multihop radio networks. IEEE/ACM Trans. Netw., 1(2):166--177, 1993.
[27]
I. Rhee, A. Warrier, J. Min, and L. Xu. DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks. In Mobihoc, pages 190--201. ACM Press, 2006.
[28]
A. Richa, P. Santi, and C. Scheideler. An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model. In Mobihoc, 2008.
[29]
L. G. Roberts. ALOHA Packet System with and without Slots and Capture. Computer Communications Review, 5(2), 1975.
[30]
G. Sharma, R. R. Mazumdar, and N. B. Shroff. On the complexity of scheduling in wireless networks. In Mobicom, pages 227--238, 2006.
[31]
S. Singh and C. Raghavendra. PAMAS: Power Aware Multi-Access Protocol with Signalling for Ad Hoc Networks. SIGCOMM Comp. Comm. Review, 28(3):5--26, July 1998.
[32]
W. Wang, X.-Y. Li, O. Frieder, Y. Wang, and W.-Z. Song. Efficient interference-aware TDMA link scheduling for static wireless networks. In Mobicom, pages 262--273, 2006.
[33]
S. Weber, X. Yang, J. Andrews, and G. de Veciana. Transmission capacity of wireless ad hoc networks with outage constraints. Inf. Theory, IEEE Tran. on, 51(12):4091--4102, 2005.
[34]
J. Zander. Distributed cochannel interference control in cellular radio systems. IEEE Trans. Veh. Technol., vol. 41, Aug. 1992.

Cited By

View all
  • (2024)Distributed Stable Multi-Source Dynamic Broadcasting for Wireless Multi-Hop Networks Under SINR-Based Adversarial Channel JammingIEEE/ACM Transactions on Networking10.1109/TNET.2024.347064932:6(5356-5371)Online publication date: Dec-2024
  • (2024)A Reassessment on Applying Protocol Interference Model Under Rayleigh Fading: From Perspective of Link SchedulingIEEE/ACM Transactions on Networking10.1109/TNET.2023.328443332:1(238-252)Online publication date: Feb-2024
  • (2023)Distributed Stable Multisource Global Broadcast for SINR-Based Wireless Multihop NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2022.319833131:2(620-633)Online publication date: Apr-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
DIALM-POMC '08: Proceedings of the fifth international workshop on Foundations of mobile computing
August 2008
100 pages
ISBN:9781605582443
DOI:10.1145/1400863
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 August 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. SINR
  2. distributed algorithms
  3. local broadcast
  4. physical interference model
  5. scheduling
  6. wireless networks

Qualifiers

  • Research-article

Conference

PODC '08

Acceptance Rates

DIALM-POMC '08 Paper Acceptance Rate 10 of 35 submissions, 29%;
Overall Acceptance Rate 21 of 68 submissions, 31%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Distributed Stable Multi-Source Dynamic Broadcasting for Wireless Multi-Hop Networks Under SINR-Based Adversarial Channel JammingIEEE/ACM Transactions on Networking10.1109/TNET.2024.347064932:6(5356-5371)Online publication date: Dec-2024
  • (2024)A Reassessment on Applying Protocol Interference Model Under Rayleigh Fading: From Perspective of Link SchedulingIEEE/ACM Transactions on Networking10.1109/TNET.2023.328443332:1(238-252)Online publication date: Feb-2024
  • (2023)Distributed Stable Multisource Global Broadcast for SINR-Based Wireless Multihop NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2022.319833131:2(620-633)Online publication date: Apr-2023
  • (2023)Distributed Age-of-Information optimization in edge computing for Internet of VehiclesJournal of Systems Architecture10.1016/j.sysarc.2023.103000144(103000)Online publication date: Nov-2023
  • (2021)On Constructing t-Spanner in IoT under SINRIWireless Communications & Mobile Computing10.1155/2021/66438102021Online publication date: 1-Jan-2021
  • (2021)Sparse Backbone and Optimal Distributed SINR AlgorithmsACM Transactions on Algorithms10.1145/345293717:2(1-34)Online publication date: 6-Jun-2021
  • (2021)Efficient Link Scheduling Solutions for the Internet of Things Under Rayleigh FadingIEEE/ACM Transactions on Networking10.1109/TNET.2021.309330629:6(2508-2521)Online publication date: Dec-2021
  • (2021)Distributed Broadcasting in Dynamic NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2021.308781829:5(2142-2155)Online publication date: Oct-2021
  • (2021)An Exact Implementation of the Abstract MAC Layer via Carrier Sensing in Dynamic NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2021.305789029:3(994-1007)Online publication date: Jun-2021
  • (2021)Implementing The Abstract MAC Layer in Dynamic NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2020.297159920:5(1832-1845)Online publication date: 1-May-2021
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media