Sciweavers

7891 search results - page 543 / 1579
» Local Area Networking
Sort
View
MOBIHOC
2009
ACM
16 years 8 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
MOBIHOC
2003
ACM
16 years 7 months ago
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
In hostile environments, the enemy can launch traffic analysis against interceptable routing information embedded in routing messages and data packets. Allowing adversaries to tra...
Jiejun Kong, Xiaoyan Hong
INFOCOM
2005
IEEE
16 years 29 days ago
Network coding for large scale content distribution
— We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate...
Christos Gkantsidis, Pablo Rodriguez
NOMS
2002
IEEE
124views Communications» more  NOMS 2002»
16 years 8 days ago
A framework for building reusable mobile agents for network management
Mobile agents can migrate among nodes to perform a set of management tasks at each of the visited nodes. Existing mobile agent-based network management systems often assume that t...
Ichiro Satoh
TROB
2008
159views more  TROB 2008»
15 years 7 months ago
Distributed Connectivity Control of Mobile Networks
Control of mobile networks raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In particular, in applications involving mobile senso...
Michael M. Zavlanos, George J. Pappas