Add to ORKGWe study wireless ad-hoc networks consisting of small microprocessors with limited memory, where the wireless communication between the processors can be highly unreliable. For this setting, we propose a number of algorithms to estimate the number of nodes in the network, and the number of direct neighbors of each node. The algorithms are simulated, allowing comparison of their performance
Abstract — In this letter, a probabilistic analysis is presented that captures the bounds on hop cou...
An Ad-hoc Radio Network consists of nodes with no knowledge of its neighbors and knowledge of its ow...
A wireless Ad-hoc network consists of wireless nodes communicating without the need for a centralize...
We study wireless ad-hoc networks consisting of small microprocessors with limited memory, where the...
We propose an efficient algorithm to estimate the number of live computer nodes in a network. This ...
We propose a new technique to estimate the throughput available to a wireless node in a multi-hop ne...
Mobile Ad hoc networks do not have any form of centralized control as per their definition. Therefor...
We study the performance of wireless ad hoc networks in the limit of a large number of nodes. We rst...
In this dissertation we present deterministic algorithms for reliable and efficient communication in...
Early simulation experience with wireless ad hoc networks sug-gests that their capacity can be surpr...
Abstract—This article is a contribution to mathematical mod-eling and better understanding of fundam...
We address the problem of how throughput in a wireless network scales as the number of users grows. ...
In this thesis we consider the problem of neighbor discovery in synchronous single hop wireless ad-h...
Mobile ad hoc networks consist of potentially moving, computing nodes that communicate via radio and...
In this thesis we are concerned with the problems of data transport in wireless networks. We study s...
Abstract — In this letter, a probabilistic analysis is presented that captures the bounds on hop cou...
An Ad-hoc Radio Network consists of nodes with no knowledge of its neighbors and knowledge of its ow...
A wireless Ad-hoc network consists of wireless nodes communicating without the need for a centralize...
We study wireless ad-hoc networks consisting of small microprocessors with limited memory, where the...
We propose an efficient algorithm to estimate the number of live computer nodes in a network. This ...
We propose a new technique to estimate the throughput available to a wireless node in a multi-hop ne...
Mobile Ad hoc networks do not have any form of centralized control as per their definition. Therefor...
We study the performance of wireless ad hoc networks in the limit of a large number of nodes. We rst...
In this dissertation we present deterministic algorithms for reliable and efficient communication in...
Early simulation experience with wireless ad hoc networks sug-gests that their capacity can be surpr...
Abstract—This article is a contribution to mathematical mod-eling and better understanding of fundam...
We address the problem of how throughput in a wireless network scales as the number of users grows. ...
In this thesis we consider the problem of neighbor discovery in synchronous single hop wireless ad-h...
Mobile ad hoc networks consist of potentially moving, computing nodes that communicate via radio and...
In this thesis we are concerned with the problems of data transport in wireless networks. We study s...
Abstract — In this letter, a probabilistic analysis is presented that captures the bounds on hop cou...
An Ad-hoc Radio Network consists of nodes with no knowledge of its neighbors and knowledge of its ow...
A wireless Ad-hoc network consists of wireless nodes communicating without the need for a centralize...