Metamodeling: a study of approximations in queueing models
Metamodeling: a study of approximations in queueing models
Fixed point approximation for multirate multihop loss networks with state-dependent routing
IEEE/ACM Transactions on Networking (TON)
Analytical models of throughput performance over multi-hop wireless and sensor networks
Analytical models of throughput performance over multi-hop wireless and sensor networks
Analytical models for single-hop and multi-hop ad hoc networks
Mobile Networks and Applications - Special issue: Recent advances in wireless networking
New insights from a fixed-point analysis of single cell IEEE 802.11 WLANs
IEEE/ACM Transactions on Networking (TON)
Analytical models for understanding misbehavior and MAC friendliness in CSMA networks
Performance Evaluation
A scalable delay based analytical framework for CSMA/CA wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improving the Performance of Wireless Ad Hoc Networks Through MAC Layer Design
IEEE Transactions on Wireless Communications
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Capability-Based Defenses Against DoS Attacks in Multi-path MANET Communications
Wireless Personal Communications: An International Journal
Context-Aware Service Ranking in Wireless Sensor Networks
Journal of Network and Systems Management
| Hi-index | 0.00 |
In wireless networks employing carrier-sense multiple-access with collision avoidance (CSMA/CA), correlations between the service processes of different nodes arise as a result of competition for common wireless channels and the dependencies between upstream and downstream traffic flows. These dependencies make the development of tractable performance models extremely difficult. To address this purpose, we present a new continuous-time model for CSMA wireless networks where we combine a node model and a channel model in order to capture correlation. Simplification methods are presented that make our models computationally tractable for large networks with minimal loss of accuracy. The model can be used for both single and multi-hop wireless networks and takes into account non-saturated queues, backoff-stage dependence of collision probabilities, and the correlation between departure processes and arrival processes of adjacent nodes. The model can be used to compute probabilistic quality of service guarantees to optimize end-to-end throughput and end-to-end delay by adjusting arrival and backoff rates along various paths.