A Proactive routing algorithm based on bitmap tables for wireless sensor networks

Current routing protocols in the sensor network focus on finding energy-efficient route setup so that the lifetime of the network is maximized. They do not use a routing table to decide the route due to increasing memory and updating costs. However, this paper proposes a new routing algorithm to broadcast a routing table to reduce the number of messages transferred to setup the routing path. The routing table is formed with a two-dimensional array, where each row and column is represented by one bit. When a node receives a request message, it updates its routing table after broadcasting. Thus, each node has a routing table with partial link information, which allows them to give much alternative route to the sink node. The proposed routing algorithm reduces the number of required messages for the routing establishment and preserves larger remained energy in compared to the previous algorithms.