TY - JOUR
T1 - Maximizing the effective lifetime of mobile ad hoc networks
AU - Hossain, M. Julius
AU - Dewan, M. Ali Akber
AU - Chae, Oksam
PY - 2008
Y1 - 2008
N2 - This paper presents a new routing approach to extend the effective lifetime of mobile ad hoc networks (MANET) considering both residual battery energy of the participating nodes and routing cost. As the nodes in ad hoc networks are limited in power, a power failure occurs if a node has insufficient remaining energy to send, receive or forward a message. So, it is important to minimize the energy expenditure as well as to balance the remaining battery power among the nodes. Cost effective routing algorithms attempt to minimize the total power needed to transmit a packet which causes a large number of nodes to loose energy quickly and die. On the other hand, lifetime prediction based routing algorithms try to balance the remaining energies among the nodes in the networks and ignore the transmission cost. These approaches extend the lifetime of first few individual nodes. But as nodes spend more energy for packet transfer, power failures occurs within short interval resulting more number of total dead node earlier. This reduces the effective lifetime of the network, as at this stage successful communication is not possible due to the lack of forwarding node. The proposed method keeps the transmission power in modest range and at the same time tries to reduce the variance of the residual energy of the nodes more effectively to obtain the highest useful lifetime of the networks in the long run. Nonetheless, movement of nodes frequently creates network topology changes via link breaks and link creation and thus effects on the stability of the network. So, the pattern of the node movement is also incorporated in our route selection procedure.
AB - This paper presents a new routing approach to extend the effective lifetime of mobile ad hoc networks (MANET) considering both residual battery energy of the participating nodes and routing cost. As the nodes in ad hoc networks are limited in power, a power failure occurs if a node has insufficient remaining energy to send, receive or forward a message. So, it is important to minimize the energy expenditure as well as to balance the remaining battery power among the nodes. Cost effective routing algorithms attempt to minimize the total power needed to transmit a packet which causes a large number of nodes to loose energy quickly and die. On the other hand, lifetime prediction based routing algorithms try to balance the remaining energies among the nodes in the networks and ignore the transmission cost. These approaches extend the lifetime of first few individual nodes. But as nodes spend more energy for packet transfer, power failures occurs within short interval resulting more number of total dead node earlier. This reduces the effective lifetime of the network, as at this stage successful communication is not possible due to the lack of forwarding node. The proposed method keeps the transmission power in modest range and at the same time tries to reduce the variance of the residual energy of the nodes more effectively to obtain the highest useful lifetime of the networks in the long run. Nonetheless, movement of nodes frequently creates network topology changes via link breaks and link creation and thus effects on the stability of the network. So, the pattern of the node movement is also incorporated in our route selection procedure.
KW - Cost efficiency
KW - Energy balanced
KW - Lifetime prediction
KW - MANET
KW - Routing protocol
UR - http://www.scopus.com/inward/record.url?scp=67651087331&partnerID=8YFLogxK
U2 - 10.1093/ietcom/e91-b.9.2818
DO - 10.1093/ietcom/e91-b.9.2818
M3 - Journal Article
AN - SCOPUS:67651087331
SN - 0916-8516
VL - E91-B
SP - 2818
EP - 2827
JO - IEICE Transactions on Communications
JF - IEICE Transactions on Communications
IS - 9
ER -