Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Capacity and delay scaling for broadcast transmission in highly mobile wireless networks

Capacity and delay scaling for broadcast transmission in highly mobile wireless networks

Thumbnail Image
Download
Name

1701.04130.pdf

Size

521.73 KB

Format

Adobe PDF

Checksum (MD5)

92de045730794a122def19c5119cbdc2

Download all files submitted through automated deposit
sword-2018-03-22.original.zip (375.53 KB)
Author(s)
Talak, Rajat Rajendra
•
Karaman, Sertac
•
Modiano, Eytan H
Date Issued
July 2017
Journal
Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing - Mobihoc '17
Publisher
Association for Computing Machinery (ACM)
Citation
Talak, Rajat, Sertac Karaman, and Eytan Modiano. “Capacity and Delay Scaling for Broadcast Transmission in Highly Mobile Wireless Networks.” Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing - Mobihoc ’17 (2017).
Version
Original manuscript
Abstract
We study broadcast capacity and minimum delay scaling laws for highly mobile wireless networks, in which each node has to disseminate or broadcast packets to all other nodes in the network. In particular, we consider a cell partitioned network under the simplified independent and identically distributed (IID) mobility model, in which each node chooses a new cell at random every time slot. We derive scaling laws for broadcast capacity and minimum delay as a function of the cell size. We propose a simple first-come-first-serve (FCFS) flooding scheme that nearly achieves both capacity and minimum delay scaling. Our results show that high mobility does not improve broadcast capacity, and that both capacity and delay improve with increasing cell sizes. In contrast to what has been speculated in the literature we show that there is (nearly) no tradeoff between capacity and delay. Our analysis makes use of the theory of Markov Evolving Graphs (MEGs) and develops two new bounds on flooding time in MEGs by relaxing the previously required expander property assumption.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/114741
DOI of Published Version
https://doi.org/10.1145/3084041.3084045
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.