Papers by Praveen Kaushik
In wireless sensor network, devices or nodes are generally battery powered devices. These nodes ... more In wireless sensor network, devices or nodes are generally battery powered devices. These nodes have
limited amount of initial energy that are consumed at different rates, depending on the power level. The
lifetime of the network is defined as the time until the first node fails (or runs out of battery). In this paper
different type of energy efficient routing algorithms are discussed and approach of these algorithms is to
maximize the minimum lifetime of wireless sensor network. Special attention has been devoted for
algorithms formulate the routing problem as a linear programming problem, which uses the optimal flow
path for data transmission and gives the optimum results. Advantages, limitations as well as comparative
study of these algorithms are also discussed in this paper.
Uploads
Papers by Praveen Kaushik
limited amount of initial energy that are consumed at different rates, depending on the power level. The
lifetime of the network is defined as the time until the first node fails (or runs out of battery). In this paper
different type of energy efficient routing algorithms are discussed and approach of these algorithms is to
maximize the minimum lifetime of wireless sensor network. Special attention has been devoted for
algorithms formulate the routing problem as a linear programming problem, which uses the optimal flow
path for data transmission and gives the optimum results. Advantages, limitations as well as comparative
study of these algorithms are also discussed in this paper.
limited amount of initial energy that are consumed at different rates, depending on the power level. The
lifetime of the network is defined as the time until the first node fails (or runs out of battery). In this paper
different type of energy efficient routing algorithms are discussed and approach of these algorithms is to
maximize the minimum lifetime of wireless sensor network. Special attention has been devoted for
algorithms formulate the routing problem as a linear programming problem, which uses the optimal flow
path for data transmission and gives the optimum results. Advantages, limitations as well as comparative
study of these algorithms are also discussed in this paper.