Energy conservation has become an important issue in wireless communication. In this thesis, we compare different routing algorithms for Bluetooth-Base wireless computer network to achieve the target of energy conservation. We considered an information retrieving system when a controller needs any information from other devices in the system, the controller send out commands and hops this signal to its destination and then obtains its required information. If all devices have sufficient energy to hop their signals, a maximum number of paths are provided in the system. If all hopping paths mentioned above are in the same path, the devices in this path will be exhausted quickly and their lives will end. However, for those devices not within this path, their energy is intact. Consequently,...[ Read more ]

Energy conservation has become an important issue in wireless communication. In this thesis, we compare different routing algorithms for Bluetooth-Base wireless computer network to achieve the target of energy conservation. We considered an information retrieving system when a controller needs any information from other devices in the system, the controller send out commands and hops this signal to its destination and then obtains its required information. If all devices have sufficient energy to hop their signals, a maximum number of paths are provided in the system. If all hopping paths mentioned above are in the same path, the devices in this path will be exhausted quickly and their lives will end. However, for those devices not within this path, their energy is intact. Consequently, whenever any device uses up its energy in the system, the system lifetime is ‘ended’. One of the main disadvantages of such phenomenon is the uneven power consumption of the devices.

To achieve energy saving, we compared several algorithms in order to develop the system with the longest lifetime and one which uses the power of the devices fairly. We found that algorithms perform differently according to the environment. The Maximum Residual Energy routing algorithm (MRE) has the longest system lifetime when used in a small and a medium sized network. However, the Dijkstra-like Maximum Residual Energy routing algorithm (DMRE) is the best in a large network.