Sciweavers

771 search results - page 39 / 155
» Wireless Network Information Flow: A Deterministic Approach
Sort
View
ADHOC
2007
144views more  ADHOC 2007»
13 years 9 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac
SRDS
2010
IEEE
13 years 7 months ago
Crash-Tolerant Collision-Free Data Aggregation Scheduling for Wireless Sensor Networks
Data aggregation scheduling, or convergecast, is a fundamental pattern of communication in wireless sensor networks (WSNs), where sensor nodes aggregate and relay data to a sink no...
Arshad Jhumka
ISCAS
2005
IEEE
199views Hardware» more  ISCAS 2005»
14 years 2 months ago
Congestion-optimized scheduling of video over wireless ad hoc networks
We analyze the benefits of information sharing between the application layer and the transport layer, for streaming video encoded at several different qualities, in a mobile wir...
Eric Setton, Xiaoqing Zhu, Bernd Girod
ICOIN
2003
Springer
14 years 2 months ago
Information-Theoretic Bounds for Mobile Ad-hoc Networks Routing Protocols
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
Nianjun Zhou, Alhussein A. Abouzeid
CORR
2008
Springer
79views Education» more  CORR 2008»
13 years 9 months ago
A System Theoretic Approach to Bandwidth Estimation
It is shown that bandwidth estimation in packet networks can be viewed in terms of min-plus linear system theory. The available bandwidth of a link or complete path is expressed i...
Jörg Liebeherr, Markus Fidler, Shahrokh Valae...