Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Asymptotic Bounds of Information Dissemination in Power-Constrained Wireless Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Rong Zheng ; Univ. of Houston, Houston

Dissemination of common information through broadcasting is an integral part of wireless network operations such as query of interested events, resource discovery and code update. In this paper, we characterize the behavior of information dissemination in power-constrained wireless networks by defining two quantities, i.e., broadcast capacity and information diffusion rate and derive fundamental limits in both random extended networks. We find that using multihop relay, the rate of broadcasting continuous stream is thetas((log n)-alpha/2) in extended networks. Regardless of the density, information can diffuse at constant speed, i.e., thetas (1). Furthermore, we prove that a unified routing structure and MAC schedule can be devised that achieves order-optimal broadcasting performance in both delay and throughput. The theoretical bounds obtained and proof techniques are instrumental to the modeling and design of efficient wireless network protocols.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:7 ,  Issue: 1 )