Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks

We study the fundamental lower bound for node buffer size in intermittently connected wireless networks. The intermittent connectivity is caused by the possibility of node inactivity due to some external constraints. We find even with infinite channel capacity and node processing speed, buffer occup...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems Vol. 24; no. 4; pp. 754 - 766
Main Authors: Wang, Xinbing, Yu, Tuo, Xu, Yuanzhong
Format: Journal Article
Language:English
Published: New York IEEE 01.04.2013
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Asymptotic properties
Buffer size
Buffers
Channel capacity
Computer networks
Delay
Heuristic
Lower bounds
Messages
Networks
Occupation
Routing
Studies
Throughput
Transmitters
Wireless networks
Wireless sensor networks
ISSN:1045-9219, 1558-2183
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first