— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
— Probe stations are specially instrumented nodes from where probes can be sent to monitor the network. Probe station locations affect probing efficiency, monitoring capability,...
—Previous studies of receive diversity have carefully modeled the impact of spatial correlation and antenna coupling on the signal component at the receiver. By contrast, relativ...
Carlo P. Domizioli, Brian L. Hughes, Kevin G. Gard...
—This paper presents a group-based security scheme for distributed wireless sensor networks. The scheme is proposed with 3-types of entities: one or more base stations, Y number ...
Md. Abdul Hamid, Md. Mustafizur Rahman, Young Yig ...
—We consider the situation where N nodes share a common access point. With each node i there is an associated buffer and channel state that change in time. Node i dynamically cho...
Eitan Altaian, Konstantin Avrachenkov, Nicolas Bon...
— Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number ...
— A ‘queued-code’ is a novel code which allows for instantaneous rate adaptation, to match the current channel state information (CSI), assumed known to the transmitter. Prev...
— A fundamental problem in quality-of-service (QoS) routing is to find a path connecting a source node to a destination node that satisfies K ≥ 2 additive QoS constraints. Th...
Abstract— We consider two-hop communication of a delaysensitive, memoryless Gaussian source over two independent paths in an ad-hoc network. To capture the behavior an ad-hoc net...