摘要
A novel backoff algorithm in CSMA/CA-based medium access control (MAC) protocols for clustered sensor networks was proposed. The algorithm requires that all sensor nodes have the same value of contention window (CW) in a cluster, which is revealed by formulating resource allocation as a network utility maximization problem. Then, by maximizing the total network utility with constrains of minimizing collision probability, the optimal value of CW (Wopt) can be computed according to the number of sensor nodes. The new backoff algorithm uses the common optimal value Wopt and leads to fewer collisions than binary exponential backoff algorithm. The simulation results show that the proposed algorithm outperforms standard 802.11 DCF and S-MAC in average collision times, packet delay, total energy consumption, and system throughput.
A novel backoff algorithm in CSMA/CA-based medium access control （MAC） protocols for clustered sensor networks was proposed. The algorithm requires that all sensor nodes have the same value of contention window （Cw） in a cluster, which is revealed by formulating resource allocation as a network utility maximization problem. Then, by maximizing the total network utility with constrains of minimizing collision probability, the optimal value of Cw （Wopt） can be computed according to the number of sensor nodes. The new backoff algorithm uses the common optimal value Wopt and leads to fewer collisions than binary exponential backoff algorithm. The simulation results show that the proposed algorithm outperforms standard 802.11 DCF and S-MAC in average collision times, packet delay, total energy consumption, and system throughput.
基金
Project(60772088) supported by the National Natural Science Foundation of China
