Sciweavers

3116 search results - page 153 / 624
» Design and implementation of network puzzles
Sort
View
MOBIHOC
2009
ACM
16 years 6 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
IPSN
2005
Springer
15 years 11 months ago
Avrora: scalable sensor network simulation with precise timing
— Simulation can be an important step in the development of software for wireless sensor networks and has been the subject of intense research in the past decade. While most prev...
Ben Titzer, Daniel K. Lee, Jens Palsberg
DANCE
2002
IEEE
15 years 11 months ago
Towards an Active Network Architecture
Active networks allow their users to inject customized programs into the nodes of the network. An extreme case, in which we are most interested, replaces packets with “capsulesâ...
David L. Tennenhouse, David Wetherall
DANCE
2002
IEEE
15 years 11 months ago
Active Network Vision and Reality: Lessons from a Capsule-Based System
Although active networks have generated much debate in the research community, on the whole there has been little hard evidence to inform this debate. This paper aims to redress t...
David Wetherall
IPPS
1998
IEEE
15 years 10 months ago
Hyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
Wei Shi, Pradip K. Srimani