The Research On Routing And Broadcasting Algorithms For Wireless Sensor Networks

Recent advances in wireless communications, computing technology, and micro-electro-mechanical systems technology have enabled the development of multifunctional sensor nodes which consist of sensing, data processing, and communicating components. Sensor nodes leverage the idea of wireless sensor networks based on collaborative effort of a large number of nodes. Wireless sensor networks, which are an important creative project in computer networks area, are much attractive in military applications, environmental applications, health applications, and other commercial applications.The responsibility of routing protocol is to deliver data between source and destination nodes. The different features of wireless sensor networks make the traditional routing algorithms can not be applied efficiently to them. Broadcasting is an important operation used for delivering control message, emergent data, alarming, route discovery, and even direct routing. The straightforward solution for broadcasting in wireless sensor networks is flooding (blind flooding), however blind flooding is improper in wireless sensor networks since it consumes too much energy and bandwidth which are deeply constrained in wireless sensor networks, and results in serious redundancy, contention, and collision.Routing and broadcasting algorithms are hot research area in wireless sensor networks, and researchers are endeavoring to study the algorithms suitable for wireless sensor networks. Based on systematically summarizing the relevant works on routing and broadcasting algorithms, this dissertation focuses on the routing and broadcasting algorithms for wireless sensor networks, and gains several achievements. The major contributions of this dissertation are as below:(1) This dissertation studies the progress of the routing algorithms for wireless sensor networks. Traditional routing algorithms can not be applied efficiently to wireless sensor networks. Therefore many routing algorithms for wireless sensor networks are put forward. After presenting the classification standards for routing protocols, the key mechanisms of the existing representative routing protocols are analyzed.(2) This dissertation studies the progress of the broadcasting algorithms for wireless sensor networks. There are many broadcasting algorithms for wireless sensor networks proposed in literatures, and there are still some issues needed to be studied further. For no comprehensive survey for this area, the key mechanisms and characteristics of the broadcasting algorithms that are among the most representative of this research area are analyzed.(3) This dissertation proposes an algorithm for minimum connected dominating set basing on maximal independent set which is called MISB. Constructing connected dominating set is the key technology for routing algorithm basing on connected dominating sets. The better routing can be constructed via smaller connected dominating set, and the non-dominating nodes without monitoring task can be in sleep mode, so energy is conserved much. At first MISB makes the nodes with maximal degree as independent nodes basing on the local network topology information, and get a maximal independent set. Then MISB makes use of the independent nodes as anchor nodes, and connects the anchor nodes to get a connected dominating set. The simulation results show that, using MISB, the size of the resultant connected dominating set is smaller. So MISB can conserve the energy efficiently while using in routing.(4) This dissertation proposes a minimum energy broadcasting algorithm improving upon RBOP which is called ERBOP. In ERBOP, nodes can adjust its transmission power in order to minimize total energy consumption but still enable a message originated from a source node to reach all the other nodes in wireless sensor networks. The simulation results show that ERBOP conserves energy efficiently.(5) This dissertation proposes an energy aware broadcasting algorithm basing on clustering which is called CBEA. Considering that nodes almost being static and position aware in wireless sensor networks, CBEA is proposed for using energy efficiently. Simulations show that CBEA reduces the number of redundant retransmissions nodes and balances the network traffic, so energy is conserved and energy dissipation is distributed evenly throughout the nodes. Thereby network lifetime is prolonged greatly.(6) This dissertation proposes a broadcasting algorithm basing on transmission range coverage with 1-hop neighbor knowledge which is called TRCB. Leveraging 1-hop neighbor knowledge can adapt topology changing with little communication overhead. Simulations show that TRCB reduces redundant retransmissions efficiently and outperforms edge forwarding broadcasting (EFB) which also leverages 1-hop neighbor knowledge.