Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
An optimal topology-transparent scheduling method in multihop packet radio networks
IEEE/ACM Transactions on Networking (TON)
Topology management for sensor networks: exploiting latency and density
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Optimization of Efficiency and Energy Consumption in p-Persistent CSMA-Based Wireless LANs
IEEE Transactions on Mobile Computing
A Simulation Study of the Predictive p-Persistent CSMA Protocol
SS '02 Proceedings of the 35th Annual Simulation Symposium
Protocols and Architectures for Wireless Sensor Networks
Protocols and Architectures for Wireless Sensor Networks
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Hi-index | 0.00 |
This paper combines a fixed scheduling scheme and a simple p-persistent approach, creating a new MAC scheduling scheme for wireless networks. In a fixed scheduling scheme, a predetermined scheduling vector is assigned to each wireless node before run time. When a node is ready, it calculates the transmission probability pnew, using a successful transmission ratio, a previous transmission probability pold, and a queue utilization ratio. The transmission probability pnew determines whether or not a node can transmit. Our simulation study shows that the new MAC scheduling scheme improves the network throughput and minimizes collision counts.