INFOCOM 2012 - PDF Preprint Papers

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

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed INFOCOM-2012 Paper

112

click to vote

INFOCOM
2012
IEEE

366views Communications» more INFOCOM 2012»

Constant-approximation for target coverage problem in wireless sensor networks

12 years 6 months ago

Download www.utdallas.edu

—When a large amount of sensors are randomly deployed into a ﬁeld, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the ﬁe...

Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai...

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	366	Constant-approximation for target coverage problem in wireless sensor networks	claim
2	318	Location privacy preservation in collaborative spectrum sensing	claim
3	311	Obfuscation of sensitive data in network flows	claim
4	309	On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approximation algorithms	claim
5	304	Expected loss bounds for authentication in constrained channels
6	298	DEOS: Dynamic energy-oriented scheduling for sustainable wireless sensor networks	claim
7	295	Di-Sec: A distributed security framework for heterogeneous Wireless Sensor Networks	claim
8	266	Data naming in Vehicle-to-Vehicle communications	claim
9	261	Dynamic lookahead mechanism for conserving power in multi-player mobile games	claim
10	255	Realizing the full potential of PSM using proxying	claim
11	255	Dynamic index coding for wireless broadcast networks	claim
12	250	Maximizing throughput when achieving time fairness in multi-rate wireless LANs	claim
13	246	Approximate convex decomposition based localization in wireless sensor networks	claim
14	246	The Bloom paradox: When not to use a Bloom filter?	claim
15	244	Energy-efficient collaborative sensing with mobile phones	claim
16	241	Achievable transmission capacity of cognitive mesh networks with different media access control	claim
17	240	Uplink soft frequency reuse for self-coexistence of cognitive radio networks operating in white-space spectrum	claim
18	240	NSDMiner: Automated discovery of Network Service Dependencies	claim
19	240	Delay and rate-optimal control in a multi-class priority queue with adjustable service rates	claim
20	240	Robust multi-pipeline scheduling in low-duty-cycle wireless sensor networks	claim
21	239	FemtoCaching: Wireless video content delivery through distributed caching helpers	claim
22	239	Capacity of distributed content delivery in large-scale wireless ad hoc networks	claim
23	238	CONSEL: Connectivity-based segmentation in large-scale 2D/3D sensor networks	claim
24	235	Optimal surface deployment problem in wireless sensor networks	claim
25	234	CARPO: Correlation-aware power optimization in data center networks	claim
26	231	Spectrum management and power allocation in MIMO cognitive networks	claim
27	230	VDN: Virtual machine image distribution network for cloud data centers	claim
28	230	Enhanced wireless channel authentication using time-synched link signature	claim
29	227	MobiShare: Flexible privacy-preserving location sharing in mobile online social networks	claim
30	223	Algorithm design for femtocell base station placement in commercial building environments	claim
31	223	SybilDefender: Defend against sybil attacks in large social networks	claim
32	221	Submodular game for distributed application allocation in shared sensor networks	claim
33	221	SpeedBalance: Speed-scaling-aware optimal load balancing for green cellular networks	claim
34	220	Comparing alternative approaches for networking of named objects in the future Internet	claim
35	219	Reverse-engineering BitTorrent: A Markov approximation perspective	claim
36	219	Link correlation aware opportunistic routing	claim
37	218	Reputation-based incentive protocols in crowdsourcing applications	claim
38	218	A robust boundary detection algorithm based on connectivity only for 3D wireless sensor networks	claim
39	217	Socialize spontaneously with mobile applications	claim
40	217	FlowSifter: A counting automata approach to layer 7 field extraction for deep flow inspection	claim
41	217	Estimating age privacy leakage in online social networks	claim
42	216	Fine-grained private matching for proximity-based mobile social networking	claim
43	216	RxIP: Monitoring the health of home wireless networks	claim
44	216	Memory-assisted universal compression of network flows	claim
45	215	Sampling directed graphs with random walks	claim
46	215	On detecting pollution attacks in inter-session network coding	claim
47	214	DEAR: Delay-bounded Energy-constrained Adaptive Routing in wireless sensor networks	claim
48	213	Characterizing geospatial dynamics of application usage in a 3G cellular data network	claim
49	213	Truthful spectrum auction design for secondary networks	claim
50	211	Delay optimal multichannel opportunistic access	claim
51	211	Strategizing surveillance for resource-constrained event monitoring	claim
52	210	TurfCast: A service for controlling information dissemination in wireless networks	claim
53	210	Robust topology control in multi-hop cognitive radio networks	claim
54	209	Maximizing capacity with power control under physical interference model in duplex mode	claim
55	209	WILL: Wireless indoor localization without site survey	claim
56	209	Data centers power reduction: A two time scale approach for delay tolerant workloads	claim
57	207	Cuckoo sampling: Robust collection of flow aggregates under a fixed memory budget	claim
58	207	Low-stretch greedy embedding heuristics	claim
59	207	Threshold compression for 3G scalable monitoring	claim
60	206	Towards energy-fairness in asynchronous duty-cycling sensor networks	claim
61	206	Spectrum trading with insurance in cognitive radio networks	claim
62	206	Combinatorial auction with time-frequency flexibility in cognitive radio networks	claim
63	206	Origin-destination flow measurement in high-speed networks	claim
64	205	Quality-assured cloud bandwidth auto-scaling for video-on-demand applications	claim
65	205	Harnessing Internet topological stability in Thorup-Zwick compact routing	claim
66	205	Truthful prioritization schemes for spectrum sharing	claim
67	204	An effective hop-by-hop Interest shaping mechanism for CCN communications	claim
68	204	Resource allocation for heterogeneous multiuser OFDM-based cognitive radio networks with imperfect spectrum sensing	claim
69	204	A theory of cloud bandwidth pricing for video-on-demand providers	claim
70	204	Impact of power-law topology on IP-level routing dynamics: Simulation results	claim
71	203	Scaling laws for cognitive radio network with heterogeneous mobile secondary users	claim
72	203	Maximizing system throughput by cooperative sensing in Cognitive Radio Networks	claim
73	202	Sherlock is around: Detecting network failures with local evidence fusion	claim
74	201	Distributed storage codes reduce latency in vehicular networks	claim
75	200	Jointly optimal bit loading, channel pairing and power allocation for multi-channel relaying	claim
76	200	Bargaining towards maximized resource utilization in video streaming datacenters	claim
77	196	HAWK: An unmanned mini helicopter-based aerial wireless kit for localization	claim
78	196	Phantom: Physical layer cooperation for location privacy protection	claim
79	195	Toward simple criteria to establish capacity scaling laws for wireless networks	claim
80	195	ADAM: An adaptive beamforming system for multicasting in wireless LANs	claim
81	195	STROBE: Actively securing wireless communications using Zero-Forcing Beamforming	claim
82	194	Transparent acceleration of software packet forwarding using netmap	claim
83	193	Spectrum mobility games	claim
84	191	On exploiting flow allocation with rate adaptation for green networking	claim
85	191	Coding and replication co-design for interactive multiview video streaming	claim
86	191	Sparse recovery with graph constraints: Fundamental limits and measurement construction	claim
87	189	Approximately optimal adaptive learning in opportunistic spectrum access	claim
88	189	L2P2: Location-aware location privacy protection for location-based services	claim
89	189	Experimental performance comparison of Byzantine Fault-Tolerant protocols for data centers	claim
90	188	Evaluating service disciplines for mobile elements in wireless ad hoc sensor networks	claim
91	187	Scaling social media applications into geo-distributed clouds	claim
92	187	Physical layer security from inter-session interference in large wireless networks	claim
93	187	RISA: Distributed Road Information Sharing Architecture	claim
94	186	The Variable-Increment Counting Bloom Filter	claim
95	185	T4P: Hybrid interconnection for cost reduction	claim
96	184	A simpler and better design of error estimating coding	claim
97	183	Multiple random walks to uncover short paths in power law networks	claim
98	181	Estimators also need shared values to grow together	claim
99	181	Fair background data transfers of minimal delay impact	claim
100	180	Robust multi-source network tomography using selective probes	claim
101	180	Analyzing collaboration networks using simplicial complexes: A case study	claim
102	179	Towards temporal access control in cloud computing	claim
103	179	Block permutations in Boolean Space to minimize TCAM for packet classification	claim
104	179	Extensive analysis and large-scale empirical evaluation of tor bridge discovery	claim
105	179	SageShift: Managing SLAs for highly consolidated cloud	claim
106	178	ICP: Design and evaluation of an Interest control protocol for content-centric networking	claim
107	178	A tale of three CDNs: An active measurement study of Hulu and its CDNs	claim
108	177	Scalable routing in 3D high genus sensor networks using graph embedding	claim
109	177	Secure top-k query processing via untrusted location-based service providers	claim
110	176	Cherish every joule: Maximizing throughput with an eye on network-wide energy consumption	claim
111	173	LBA: Lifetime balanced data aggregation in low duty cycle sensor networks	claim
112	173	Energy-optimal mobile application execution: Taming resource-poor mobile devices with cloud clones	claim
113	172	On superposition of heterogeneous edge processes in dynamic random graphs	claim
114	172	Network optimization for DHT-based applications	claim
115	172	Proactive seeding for information cascades in cellular networks	claim
116	172	A statistical approach for target counting in sensor-based surveillance systems	claim
117	171	Locating malicious nodes for data aggregation in wireless networks	claim
118	171	Firewall fingerprinting	claim
119	171	BitTrickle: Defending against broadband and high-power reactive jamming attacks	claim
120	170	Pssst, over here: Communicating without fixed infrastructure	claim
121	170	A comparative study of architectural impact on BGP next-hop diversity	claim
122	167	Squeezing the most out of interference: An optimization framework for joint interference exploitation and avoidance	claim
123	163	Sharing the cost of backbone networks: Simplicity vs. precision	claim
124	162	SAP: Smart Access Point with seamless load balancing multiple interfaces	claim
125	162	Data gathering in networks of bacteria colonies: Collective sensing and relaying using molecular communication	claim
126	161	Stochastic analysis of horizontal IP scanning	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers