Sciweavers

11217 search results - page 220 / 2244
» Network Coding for Wireless Networks
Sort
View
100
Voted
MOBIHOC
2009
ACM
16 years 4 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
105
Voted
CORR
2010
Springer
106views Education» more  CORR 2010»
15 years 3 months ago
Real Time and Energy Efficient Transport Protocol for Wireless Sensor Networks
---------------------------------------------------ABSTRACT-----------------------------------------------Reliable transport protocols such as TCP are tuned to perform well in trad...
S. Ganesh, R. Amutha
140
Voted
MOBIHOC
2012
ACM
13 years 5 months ago
Stability analyses of longest-queue-first link scheduling in MC-MR wireless networks
Longest-queue-first (LQF) link scheduling is a greedy link scheduling in multihop wireless networks. Its stability performance in single-channel single-radio (SC-SR) wireless net...
Peng-Jun Wan, XiaoHua Xu, Zhu Wang, ShaoJie Tang, ...
137
Voted
TIT
2011
128views more  TIT 2011»
14 years 10 months ago
Secure Network Coding on a Wiretap Network
—In the paradigm of network coding, the nodes in a network are allowed to encode the information received from the input links. With network coding, the full capacity of the netw...
Ning Cai, Raymond W. Yeung
162
Voted
ICMCS
2009
IEEE
143views Multimedia» more  ICMCS 2009»
15 years 1 months ago
Rateless codes network coding for simple and efficient P2P video streaming
The goal of this paper is the development of network coding solutions able to improve the performance of video streaming applications over peer-to-peer overlays. Recent advances i...
Marco Grangetto, Rossano Gaeta, Matteo Sereno