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

MobiHoc17-rajat copy.pdf

Size

873.76 KB

Format

Adobe PDF

Checksum (MD5)

0af9a04956af91af34ed4a3c89d25c38

Author(s)
Talak, Rajat Rajendra
•
Karaman, Sertac
•
Modiano, Eytan H
Date Issued
July 2017
Journal
Mobihoc '17 Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing
Publisher
Association for Computing Machinery
Citation
Talak, RajaT, Sertac Karaman, and Eytan Modiano. "Capacity and delay scaling for broadcast transmission in highly mobile wireless networks." Mobihoc '17 Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 10-14 July, 2017, Chennai, India, Association for Computing Machinery, 2017.
Version
Author's final 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 simplifed 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-firstserve (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 ooding time in MEGs by relaxing the previously required expander property assumption. Keywords: Mobile ad hoc networks, Wireless networks, Broadcast, Throughputdelay tradeoff, Scaling laws, Flooding time, Markov evolving graph
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
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/117002
DOI of Published Version
https://doi.org/10.1145/3084041.3084045
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.