Energy Efficient Methods for Topology Control Problem of Wireless Sensor Network

Energy conservation in sensor networks is depending on duty cycle, data driven and mobility-based methods. Duty cycle methods use synchronous and asynchronous MAC protocols for saving the node energy. Data driven methods employs in-network processing, data aggregation and hierarchical sampling methods for minimizing the energy utilization. This paper delivers energy efficient strategies for information gathering and also a selection in WSN.

A QoS-Based Topology Control Algorithm for Underwater Wireless Sensor Networks

The topology control techniques of underwater wireless sensor networks and terrestrial wireless sensor networks are significantly different because of the particularity of underwater environments and acoustic communication. In this paper, an underwater wireless sensor network model was constructed, and six universal topology control objectives were concluded. The QoS topology control problem was mapped into an ordinal potential game model, and a distributed strategy adjustment algorithm for nodes was designed accordingly. The strategy vector resulting from the algorithm converges to the Nash equilibrium; minor complexity and preferable approximate ratios can be represented by the algorithm as well. The performance of the algorithm was analyzed through simulation experiments which indicate a well-constructed topology. Every objective was upgraded when model parameters were set suitable.

OPTIMAL INTERCONNECTION OF AD HOC INJECTION NETWORKS

Multi-hop ad hoc networks allow establishing local groups of communicating devices in a self-organizing way. However, when considering realistic mobility patterns, such networks most often get divided in a set of disjoint partitions. This presence of partitions is an obstacle to communication within these networks. Ad hoc networks are generally composed of devices capable of communicating in a geographical neighborhood for free (e.g. using Wi-Fi or Bluetooth). In most cases a communication infrastructure is available. It can be a set of access point as well as a GSM/UMTS network. The use of such an infrastructure is billed, but it permits to interconnect distant nodes, through what we call “bypass links”. The objective of our work is to optimize the placement of these long-range links. To this end we rely on small-world network properties, which consist in a high clustering coefficient and a low characteristic path length. In this article we investigate the use of three genetic algorithms (generational, steady-state, and cooperative coevolutionary) to optimize three instances of this topology control problem and present initial evidence of their capacity to solve it.