Abstract—In the existing works on distributed detection in sensor networks, local sensor nodes either quantize the observation or directly scale the analog observation and then t...
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
—In an adversarial environment, various kinds of security attacks become possible if malicious nodes could claim fake locations that are different from where they are physically ...
—Data aggregation, as a primitive communication task in wireless networks, can reduce the communication complexity. However, in-network aggregation usually brings an unavoidable ...
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...