Linear fractional programming problem

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.

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.

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.

The revolution of wireless sensors networks (WSNs) has highly augmented the expectations of people to get the work done efficiently, but there is little bit impediment to deal with deployed nodes in WSNs. The nature of used routing and medium access control (MAC) protocols in WSNs is completely different from wireless adhoc network protocols. Sensor nodes do not have enough capability to synchronize with robust way, in resulting causes of longer delay and waste of energy. In this paper, we deploy efficientenergy consuming sensors and to find one hop robust and efficient destination search in WSNs. We firstly deploy BT (Bluetooth enabled) sensors, which offer passive and active sensing capability to save energy. This work is a continuation of previous published work in . The BT node is supported with efficient searchmethodss. The main objective of this contribution is to control different types of objects from remote places using cellular phone. To validate our proposed methodology,simulation is done with network simulator (ns2) to examine the behavior of WSNs. Based on simulation results, we claim that our approach saves 62% energy spent for finding best onehop destination as compared with existing techniques.

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.

In the present paper we present a new method for solving a class of single stage single constraints linear fractional programming (LFP) problem. The proposed method is based on transformation the objective value and the constraints also. After reducing the fractional program in to equivalent linear program with the help of transformation technique, after that we apply Simplex method to find objective value. Numerical examples are constructed to show the applicability of the above technique KEYWORDS Linear fractional programming problem(LFPP); Linear program; Simplex method Mathematical Subject Classi_cation (2010): 90C05; 90C32; 46N10

In the present paper we present a new method for solving a class of single stage single constraints linear fractional programming (LFP) problem. The proposed method is based on transformation the objective value and the constraints also. After reducing the fractional program in to equivalent linear program with the help of transformation technique, after that we apply Simplex method to find objective value. Numerical
examples are constructed to show the applicability of the above technique