A New Fibonacci Backoff Method for Congestion Control in Wireless Sensor Network
Congestion control is one of the predominant challenges in wireless sensor network. It has a great impact on the parameters of quality of service such as end-to-end transmission delay, packet delivery ratio (PDR), and energy consumption in wireless sensor
- PDF / 291,339 Bytes
- 11 Pages / 439.37 x 666.142 pts Page_size
- 40 Downloads / 165 Views
Abstract Congestion control is one of the predominant challenges in wireless sensor network. It has a great impact on the parameters of quality of service such as end-to-end transmission delay, packet delivery ratio (PDR), and energy consumption in wireless sensor networks. Typical congestion control schemes include binary exponential backoff (BEB) or truncated binary exponential backoff (TBEB). This involves retransmission of frames in carrier sense multiple access with collision avoidance (CSMA/CA) and carrier sense multiple access with collision detection (CSMA/CD) networks. In this work, a new backoff strategy Fibonacci Backoff Algorithm (FBA) for congestion control is proposed. Each node is allocated a wait period as an incremental period. The simulated results show its better performance by decreasing the possibility of two or more nodes choosing the same backoff period, thereby decreasing the probability of collision and energy used for retransmission. Keywords Congestion control analysis Optimal scheduling
Fibonacci backoff algorithm Performance
1 Introduction In wireless sensor networks, nodes are deployed in large quantities where sensors can organize themselves to an ad hoc multipath network environment for communication between them. Each node is aware of its neighborhood nodes. Network protocol holds a strict layered structure and implements congestion control,
E. Selvaraju (&) R. Sundaram ECE Department, Dr. M.G.R. Educational and Research Institute University, Chennai, India e-mail: [email protected] R. Sundaram e-mail: [email protected] © Springer Nature Singapore Pte Ltd. 2018 M.S. Reddy et al. (eds.), International Proceedings on Advances in Soft Computing, Intelligent Systems and Applications, Advances in Intelligent Systems and Computing 628, https://doi.org/10.1007/978-981-10-5272-9_23
237
238
E. Selvaraju and R. Sundaram
scheduling, and routing protocols. However, the time-varying nature with different channel conditions proposes a significant challenge to accomplish the above goals. Traffic engineering, end-to-end rate adaptation, and transport layer signaling have been widely developed to prevent the network congestion. Shashi Kiran et al. [1] proposed an algorithm to trade-off between the latency and real-time capacity to adapt the transmission schedule in accordance with the addition, removal, and changes in dynamic queries. For fixed transmission schedules, the proposed method has the ability to overcome the changes in workload more effectively than the time division multiple access. A fair end-to-end window-based congestion control protocol for a packet-switched network is demonstrated in Shashi Kiran et al. [2]. with first come-first served (FCFS) routers. Only the end host information is used by the protocol. The network considered is a multiclass fluid model. The convergence function of the protocol is proved using a Lyapunov function. A joint optimal design of cross-layer congestion control (CCC) for wireless ad hoc network is proposed in Chen et al. [3]. The rate and
Data Loading...
