The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Kertas kerja ini membentangkan pendekatan penghalaan baharu untuk memanjangkan hayat berkesan rangkaian ad hoc mudah alih (MANET) dengan mengambil kira kedua-dua sisa tenaga bateri nod yang mengambil bahagian dan kos penghalaan. Memandangkan nod dalam rangkaian ad hoc terhad dalam kuasa, kegagalan kuasa berlaku jika nod mempunyai tenaga yang tinggal tidak mencukupi untuk menghantar, menerima atau memajukan mesej. Jadi, adalah penting untuk meminimumkan perbelanjaan tenaga serta mengimbangi baki kuasa bateri di antara nod. Algoritma penghalaan kos efektif cuba meminimumkan jumlah kuasa yang diperlukan untuk menghantar paket yang menyebabkan sejumlah besar nod kehilangan tenaga dengan cepat dan mati. Sebaliknya, algoritma penghalaan berasaskan ramalan seumur hidup cuba mengimbangi tenaga yang tinggal di antara nod dalam rangkaian dan mengabaikan kos penghantaran. Pendekatan ini memanjangkan hayat beberapa nod individu pertama. Tetapi apabila nod membelanjakan lebih banyak tenaga untuk pemindahan paket, kegagalan kuasa berlaku dalam selang masa yang singkat menyebabkan lebih banyak jumlah nod mati lebih awal. Ini mengurangkan jangka hayat rangkaian yang berkesan, kerana pada peringkat ini komunikasi yang berjaya tidak dapat dilakukan kerana kekurangan nod pemajuan. Kaedah yang dicadangkan mengekalkan kuasa penghantaran dalam julat sederhana dan pada masa yang sama cuba mengurangkan varians tenaga sisa nod dengan lebih berkesan untuk mendapatkan jangka hayat berguna tertinggi rangkaian dalam jangka masa panjang. Namun begitu, pergerakan nod kerap mencipta perubahan topologi rangkaian melalui pemutusan pautan dan penciptaan pautan dan dengan itu memberi kesan kepada kestabilan rangkaian. Jadi, corak pergerakan nod juga dimasukkan dalam prosedur pemilihan laluan kami.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
M. Julius HOSSAIN, M. Ali Akber DEWAN, Oksam CHAE, "Maximizing the Effective Lifetime of Mobile Ad Hoc Networks" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 9, pp. 2818-2827, September 2008, doi: 10.1093/ietcom/e91-b.9.2818.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.9.2818/_p
Salinan
@ARTICLE{e91-b_9_2818,
author={M. Julius HOSSAIN, M. Ali Akber DEWAN, Oksam CHAE, },
journal={IEICE TRANSACTIONS on Communications},
title={Maximizing the Effective Lifetime of Mobile Ad Hoc Networks},
year={2008},
volume={E91-B},
number={9},
pages={2818-2827},
abstract={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.},
keywords={},
doi={10.1093/ietcom/e91-b.9.2818},
ISSN={1745-1345},
month={September},}
Salinan
TY - JOUR
TI - Maximizing the Effective Lifetime of Mobile Ad Hoc Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2818
EP - 2827
AU - M. Julius HOSSAIN
AU - M. Ali Akber DEWAN
AU - Oksam CHAE
PY - 2008
DO - 10.1093/ietcom/e91-b.9.2818
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2008
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.
ER -