INFOCOM 2011 - PDF Preprint Papers

INFOCOM 2011 Annual Joint Conference of the IEEE Computer and Communications Societies

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed INFOCOM-2011 Paper

click to vote

INFOCOM
2011
IEEE

385views Communications» more INFOCOM 2011»

Secure and practical outsourcing of linear programming in cloud computing

8 months 26 days ago

Download www.sundaychennai.com

—Cloud Computing has great potential of providing robust computational power to the society at reduced cost. It enables customers with limited computational resources to outsourc...

Cong Wang, Kui Ren, Jia Wang

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	385	Secure and practical outsourcing of linear programming in cloud computing	claim
2	82	Throughput and delay analysis of hybrid wireless networks with multi-hop uplinks	claim
3	79	A high-throughput routing metric for reliable multicast in multi-rate wireless mesh networks	claim
4	72	iLight: Indoor device-free passive tracking using wireless sensor networks	claim
5	71	Optimal channel assignment and power allocation for dual-hop multi-channel multi-user relaying	claim
6	70	A distributed triangulation algorithm for wireless sensor networks on 2D and 3D surface	claim
7	69	Forwarding anomalies in Bloom filter-based multicast	claim
8	65	A cross-domain privacy-preserving protocol for cooperative firewall optimization	claim
9	65	Mahout: Low-overhead datacenter traffic management using end-host-based elephant detection	claim
10	64	An analytical approach to real-time misbehavior detection in IEEE 802.11 based wireless networks	claim
11	63	Spherical representation and polyhedron routing for load balancing in wireless sensor networks	claim
12	63	STAP: A social-tier-assisted packet forwarding protocol for achieving receiver-location privacy preservation in VANETs	claim
13	62	Consolidating virtual machines with dynamic bandwidth demand in data centers	claim
14	62	Pricing-based spectrum access control in cognitive radio networks with random access	claim
15	61	Ubiquitous data collection for mobile users in wireless sensor networks	claim
16	60	Resource management for fading wireless channels with energy harvesting nodes	claim
17	59	Opportunistic spectrum access for mobile cognitive radios	claim
18	59	Delay-bounded MAC with minimal idle listening for sensor networks	claim
19	58	Novasky: Cinematic-quality VoD in a P2P storage cloud	claim
20	57	Fast and scalable secret key generation exploiting channel phase randomness in wireless networks	claim
21	57	The digital rights management game in peer-to-peer streaming systems	claim
22	57	Prevalence and mitigation of forum spamming	claim
23	56	QoF: Towards comprehensive path quality measurement in wireless sensor networks	claim
24	56	Does wireless sensor network scale? A measurement study on GreenOrbs	claim
25	56	Contrabass: Concurrent transmissions without coordination for ad hoc networks	claim
26	55	Capacity of byzantine agreement with finite link capacity	claim
27	55	A distributed and privacy preserving algorithm for identifying information hubs in social networks	claim
28	54	A first look at inter-data center traffic characteristics via Yahoo! datasets	claim
29	54	Modeling residual-geometric flow sampling	claim
30	54	Consort: Node-Constrained Opportunistic Routing in wireless mesh networks	claim
31	54	Secure friend discovery in mobile social networks	claim
32	54	Risk sensitive optimal control framework applied to delay tolerant networks	claim
33	54	WiZi-Cloud: Application-transparent dual ZigBee-WiFi radios for low power internet access	claim
34	54	Adaptive wireless channel probing for shared key generation	claim
35	53	A dynamic relay selection scheme for mobile users in wireless relay networks	claim
36	53	Bayesian-inference based recommendation in online social networks	claim
37	53	Scalable and fully distributed localization with mere connectivity	claim
38	53	Content downloading in vehicular networks: What really matters	claim
39	53	Timely data delivery in a realistic bus network	claim
40	53	Fully secure pairwise and triple key distribution in wireless sensor networks using combinatorial designs	claim
41	53	RelSamp: Preserving application structure in sampled flow measurements	claim
42	52	A real-time multicast routing scheme for multi-hop switched fieldbuses	claim
43	51	Optimal power control in Rayleigh-fading heterogeneous networks	claim
44	51	Multiple task scheduling for low-duty-cycled wireless sensor networks	claim
45	51	Approximate distance queries and compact routing in sparse graphs	claim
46	51	Adaptive algorithms for detecting community structure in dynamic social networks	claim
47	51	Smart sleep: Sleep more to reduce delay in duty-cycled wireless sensor networks	claim
48	51	Describing and forecasting video access patterns	claim
49	51	Dynamic right-sizing for power-proportional data centers	claim
50	49	On adaptive-width channel allocation in non-cooperative, multi-radio wireless networks	claim
51	49	Reconciling privacy preservation and intrusion detection in sensory data aggregation	claim
52	49	BodyT2: Throughput and time delay performance assurance for heterogeneous BSNs	claim
53	49	Scheduling in mapreduce-like systems for fast completion time	claim
54	49	Construction of directional virtual backbones with minimum routing cost in wireless networks	claim
55	49	Optimized asynchronous multi-channel neighbor discovery	claim
56	49	Aggregation capacity of wireless sensor networks: Extended network case	claim
57	49	A robust optimization approach to backup network design with random failures	claim
58	48	Identifying mobiles hiding behind wireless routers	claim
59	48	Continuous multi-dimensional top-k query processing in sensor networks	claim
60	47	Channel allocation in wireless data center networks	claim
61	47	Dissemination in opportunistic mobile ad-hoc networks: The power of the crowd	claim
62	47	Incentive provision using intervention	claim
63	47	Fine-grained location-free planarization in wireless sensor networks	claim
64	47	Physical layer wireless security made fast and channel independent	claim
65	46	Maintaining source privacy under eavesdropping and node compromise attacks	claim
66	46	Throughput and delay scaling of general cognitive networks	claim
67	46	SelectCast: Scalable data aggregation scheme in wireless sensor networks	claim
68	46	Connected coverage in wireless networks with directional antennas	claim
69	45	Making sense of customer tickets in cellular networks	claim
70	45	Content management in a mobile ad hoc network: Beyond opportunistic strategy	claim
71	45	User-centric data dissemination in disruption tolerant networks	claim
72	45	Network-aware behavior clustering of Internet end hosts	claim
73	45	Privacy analysis of user association logs in a large-scale wireless LAN	claim
74	45	Connectivity maintenance in mobile wireless networks via constrained mobility	claim
75	45	Converge-cast with MIMO	claim
76	45	Sensor localization with deterministic accuracy guarantee	claim
77	44	On power and throughput tradeoffs of WiFi and Bluetooth in smartphones	claim
78	44	Analysis and algorithms for partial protection in mesh networks	claim
79	44	Scheduling design and analysis for end-to-end heterogeneous flows in an avionics network	claim
80	44	Feasibility and optimization of delay guarantees for non-homogeneous flows in IEEE 802.11 WLANs	claim
81	44	Approximation algorithms for throughput maximization in wireless networks with delay constraints	claim
82	44	SigSag: Iterative detection through soft message-passing	claim
83	44	A nearly-optimal index rule for scheduling of users with abandonment	claim
84	43	There's something about MRAI: Timing diversity can exponentially worsen BGP convergence	claim
85	43	Estimating the performance of hypothetical cloud service deployments: A measurement-based approach	claim
86	43	SMALL: A Strategy-proof Mechanism for radio spectrum allocation	claim
87	43	Identity-based attack detection in mobile wireless networks	claim
88	42	Clustering in cooperative networks	claim
89	42	Sharing multiple messages over mobile networks	claim
90	42	Delay-bounded adaptive UFH-based anti-jamming wireless communication	claim
91	41	Finite-horizon energy allocation and routing scheme in rechargeable sensor networks	claim
92	41	Space-time tradeoff in regular expression matching with semi-deterministic finite automata	claim
93	41	VIRO: A scalable, robust and namespace independent virtual Id routing for future networks	claim
94	40	Information propagation speed in bidirectional vehicular delay tolerant networks	claim
95	40	Optimal sampling algorithms for frequency estimation in distributed data	claim
96	40	On the throughput scaling of Cognitive Radio ad hoc networks	claim
97	40	A highly scalable bandwidth estimation of commercial hotspot access points	claim
98	40	Optimal multicast capacity and delay tradeoffs in MANETs: A global perspective	claim
99	40	A dynamic game solution to malware attack	claim
100	40	Distinguishing locations across perimeters using wireless link measurements	claim
101	39	Hidden communication in P2P networks Steganographic handshake and broadcast	claim
102	39	General capacity scaling of wireless networks	claim
103	39	Transport throughput of secondary networks in spectrum sharing systems	claim
104	39	Networking low-power energy harvesting devices: Measurements and algorithms	claim
105	39	Understanding robustness of mobile networks through temporal network measures	claim
106	39	Utilizing shared vehicle trajectories for data forwarding in vehicular networks	claim
107	39	Optimal control of epidemic evolution	claim
108	38	A prior-free revenue maximizing auction for secondary spectrum access	claim
109	38	PVA in VANETs: Stopped cars are not silent	claim
110	38	SocialFilter: Introducing social trust to collaborative spam mitigation	claim
111	38	On the achievable throughput of CSMA under imperfect carrier sensing	claim
112	38	Experimental evaluation of optimal CSMA	claim
113	38	Delay constrained minimum energy broadcast in cooperative wireless networks	claim
114	37	Multi-path routing and rate allocation for multi-source video on-demand streaming in wireless mesh networks	claim
115	37	Taming user-generated content in mobile networks via Drop Zones	claim
116	37	A comparative study of two network-based anomaly detection methods	claim
117	36	The resilience of WDM networks to probabilistic geographical failures	claim
118	36	Strategyproof auctions for balancing social welfare and fairness in secondary spectrum markets	claim
119	35	Scheduling for small delay in multi-rate multi-channel wireless networks	claim
120	35	Optimizing network-coded cooperative communications via joint session grouping and relay node selection	claim
121	35	To preempt or not: Tackling bid and time-based cheating in online spectrum auctions	claim
122	35	Utility optimization for dynamic peer-to-peer networks with tit-for-tat constraints	claim
123	34	Implications of device diversity for organic localization	claim
124	34	Optimal multiple-coverage of sensor networks	claim
125	34	Optimal Sybil-resilient node admission control	claim
126	33	Heterogeneity increases multicast capacity in clustered network	claim
127	29	Sampling vs sketching: An information theoretic comparison	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers