Elements of information theory
Elements of information theory
Randomized algorithms
CDMA-based MAC protocol for wireless ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Single and Multi-Carrier CDMA: Multi-User Detection, Space-Time Spreading, Synchronisation and Standards
Communication Networks
Challenges: towards truly scalable ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Clustered CDMA ad hoc networks without closed-loop power control
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
Capacity regions for wireless ad hoc networks
IEEE Transactions on Wireless Communications
An Integrated Neighbor Discovery and MAC Protocol for Ad Hoc Networks Using Directional Antennas
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Communications Magazine
A new distributed cooperative MIMO scheme for mobile ad hoc networks
Information Sciences: an International Journal
Modeling message diffusion in epidemical DTN
Ad Hoc Networks
Hi-index | 0.01 |
We introduce a collaboration-driven approach to the sharing of the available bandwidth in wireless ad hoc networks, which we call many-to-many communication, that allows concurrent multi-packet transmissions (MPTs) and multipacket receptions (MPRs). Many-to-many communication also permits one-time multi-copy relaying of the same packet, which reduces the packet delivery delay compared to single-copy relaying without any penalty in capacity. Our scheme is based on the integration of multi-user detection and position-location information with frequency and code division in mobile ad hoc networks (MANETs). Transmissions are divided in frequency and codes according to node locations, and successive interference cancellation (SIC) is used at receivers to allow them to decode and use all transmissions from strong interfering sources. Consequently, the interference is divided into constructive interference (COI) and destructive interference (DEI). We show that, if each node is allowed to expand its bandwidth, both the link's Shannon capacity and the per source-destination throughput scale like O(nα/2) (upper-bound) and Ω[f(n)] (lower-bound), for n nodes in the network, a path loss parameter α 2, and 1≤f(n) nα/2.