Congestion avoidance topology in wireless sensor network using Karnaugh map

Wireless Sensor Network (WSN) is an ad-hoc network consisting of sensor nodes having limited computational power fitted with a radio transceiver. Main constraint of a sensor node is the limitation of its energy resource in the form of a short battery life. Battery power conservation is very important in a sensor device since battery life is usually one of the critical components in extending the life time of sensor nodes and its network. Therefore energy optimization techniques must be performed while designing a network system. Problems of how to reduce energy consumption to maximize network lifetime has been studied extensively. But most of the approaches focus on selecting the shortest or energy-efficient routing path, often change in leader nodes based on residual energy, packet size optimization to prolong network lifetime. Work has been done on congestion control and minimization of packet collision, however congestion avoidance in sensor network has not received serious study until recently. The paper describes a network using congestion avoidance topology or CATopology where every wireless sensor is deterministically deployed throughout the sensing area. A congestion avoidance data retrieval strategy is proposed by forming an optimal congestion avoidance tree or CATree of sensor nodes using K-map and K-graph. Network ensures congestion free multi-hop data routing that significantly reduces packet collision and retransmission. As a result sink packet loss ratio and network end-to-end delay improves and maximizes energy efficiency and network lifetime.