{"paper":{"title":"Improved Interference in Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Gautam K. Das, Pragya Agrawal","submitted_at":"2012-07-24T14:24:48Z","abstract_excerpt":"Given a set ${\\cal V}$ of $n$ sensor node distributed on a 2-dimensional plane and a source node $s \\in {\\cal V}$, the {\\it interference problem} deals with assigning transmission range to each $v \\in {\\cal V}$ such that the members in ${\\cal V}$ maintain connectivity predicate ${\\cal P}$, and the maximum/total interference is minimum. We propose algorithm for both {\\it minimizing maximum interference} and {\\it minimizing total interference} of the networks. For minimizing maximum interference we present optimum solution with running time $O(({\\cal P}_n + n^2) \\log n)$ for connectivity predica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5708","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}