Minimum Energy Consumption Multicast Algorithms And Simulation Implementations In Multi-hop Network Environment

Nodes in wireless multi-hop networks with limited energy reserve have no fixed power supply and can not be charged. Once the energy of power supply deplets, nodes will die. At the same time, multicast, as an important communication mode, can transmit information from one source node to multiple target nodes. So the energy consumption of nodes in wireless multi-hop networks has become a very important basic problem. Lots of algotithms have been debeloped in this area.Nodes in wireless multi-hop networks are self-organized with the particularity of mobility. All these attributes make it very different to design an energy-aware multicast protocol. Traditional methods improve similar protocols through ether tree-building algorithm or special cross-layer design scheme, but can not decrease multicast energy consumption to the largest degree. Different from traditonal methods, this thesis proposed three energy-aware multicast algorithms from three new perspectives, including CNM algorithm, NCM algorithm and TPM algorithm. Lots of new technical solutions are adopted such as cognitive networks, directional antenna model, non-cooperative game, network coding, cooperative communication. In additon, multicast, mobility and interference are also taken into account adequately. The simulation results show that all of these algorithms have better performance in reducing energy consumption compared to traditional algorithms. Three algorithms are listed below:A cognitive multicast routing algorithm in mobile multi-hop wireless networks with minimum energy consumption. The performance of traditional multicast algorithms are limited by network architecture since lots of useful information can not be shared among different network layers. The method adopted takes the advantage of a new network architecture, namely congitive networks architecture. In this architecture, all informantion needed to build a route can be got from other layers and thus the end to end goal (minimizing the multicast energy consumption) can be reached.Network coding based multicast routing algorithm. Network coding combines routing concepts with concepts of coding, namely, coding based on network layer. In a network with network coding applied, nodes can not only process information received by store-and-forward but also encode and decode information. With this attribute, we can decrease the energy consumption by reducing the times of forwarding. Based on this idea, this algorithm proposed two basic structures, namely butterfly architecture and butterfly-like architecture to meet the requirements of network coding in wireless multi-hop networks.Topology control based multicast routing algorithm. This algorithm makes full use of clustering information provided by topology control in MAC layer to build multicast routing. Considering the attributes of wireless multi-hop network and multicast, a new, elaborate method is designed to building routing to decrease multicast energy consumption.