A channel access scheme for large dense packet radio networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks
Wireless Networks
SEEDEX: a MAC protocol for ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Comparison between graph-based and interference-based STDMA scheduling
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Distributed dynamic channel access scheduling for ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Inducing multiscale clustering using multistage MAC contention in CDMA ad hoc networks
IEEE/ACM Transactions on Networking (TON)
A mixed neural-genetic algorithm for the broadcast scheduling problem
IEEE Transactions on Wireless Communications
Properties of a transmission assignment algorithm for multiple-hop packet radio networks
IEEE Transactions on Wireless Communications
Unified collision-free coordinated distributed scheduling (CF-CDS) in IEEE 802.16 mesh networks
IEEE Transactions on Wireless Communications
Ad Hoc Networks: To Spread or Not to Spread? [Ad Hoc and Sensor Networks]
IEEE Communications Magazine
Optimal broadcast scheduling in packet radio networks using mean field annealing
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We investigate a transmission scheduling protocol that exploits direct-sequence spread-spectrum (DSSS) modulation to improve the performance of a mobile, ad hoc network. Since DSSS allows for packet capture in the presence of other nearby transmissions, multiple-access interference is less detrimental to network performance. We design a new transmission scheduling protocol that takes advantage of the multiple-access capabilities of DSSS through two key features. First, the transmission schedule employs a more aggressive spatial reuse policy. Second, our protocol reduces overhead by accounting for fewer terminals in the scheduling because only the strongest interferers disrupt packet reception. Transmissions use both common and transmitter-oriented spreading codes to support reliable neighbor discovery and broadcast capability, respectively. Spreading factors may be adapted to increase throughput of unicast traffic on links with high SINR. Through simulations, we evaluate the performance of the transmission scheduling protocol in mobile and stationary scenarios.