QoS-guaranteed energy saving routing strategy using SDN central control for backbone networks

This paper targets on energy saving and considers network responding time for backbone networks. The objective is to find idle links as many as possible which can be put into sleep mode under the situation of quality of service(QoS)-guaranteed. This paper proposes a software defined network(SDN) based routing strategy which is especially aimed at QoS-guaranteed energy saving for backbone networks. Under SDN structure, the topology change of network can be detected directly by network controller. And network can be managed more easily and effectively. Based on the open shortest path first(OSPF) protocol, network topology can be changed as little as possible in our strategy. So, the network reconfiguring time caused by the energy saving strategy will be decreased dramatically. This makes the strategy more feasible. Then the backbone network energy optimizing problem is transformed to the maximum clique problem(MCP). And, this paper designed a routing strategy called backbone networks energy saving strategy(BNESS) for energy saving in backbone networks. Simulation result shows that our proposed strategy can save energy and QoS can be guaranteed.

Energy efficiency enhancement in heterogeneous networks:a joint resource allocation approach

To support the drastic growth of wireless multimedia services and the requirements of ubiquitous access, numerous wireless infrastructures which consume enormous energy, such as macrocell, small cell, distributed antenna systems and wireless sensor networks, have been deployed. Under the background of environmental protection, improving the energy efficiency（EE） in wireless networks is becoming more and more important. In this paper, an EE enhancement scheme in heterogeneous networks（Het Nets） by using a joint resource allocation approach is proposed. The Het Nets consists of a mix of macrocell and small cells. Firstly, we model this strategic coexistence as a multi-agent system in which decentralized resource management inspired from Reinforcement Learning are devised. Secondly, a Q-learning based joint resource allocation algorithm is designed. Meanwhile, with the consideration of the time-varying channel characteristics, we take the long-term learning reward into account. At last, simulation results show that the proposed decentralized algorithm can approximate to centralized algorithm with low-complexity and obtain high spectral efficiency（SE） in the meantime.

Multi-radio access based bandwidth allocation strategy for video communication in heterogeneous wireless networks

In order to make full use of the radio resource of heterogeneous wireless networks（HWNs） and promote the quality of service（Qo S） of multi-homing users for video communication, a bandwidth allocation algorithm based on multi-radio access is proposed in this paper. The proposed algorithm adopts an improved distributed common radio resource management（DCRRM） model which can reduce the signaling overhead sufficiently. This scheme can be divided into two phases. In the first phase, candidate network set of each user is obtained according to the received signal strength（RSS）. And the simple additive weighted（SAW） method is employed to determine the active network set. In the second phase, the utility optimization problem is formulated by linear combining of the video communication satisfaction model, cost model and energy efficiency model. And finding the optimal bandwidth allocation scheme with Lagrange multiplier method and Karush-Kuhn-Tucker（KKT） conditions. Simulation results show that the proposed algorithm promotes the network load performances and guarantees that users obtain the best joint utility under current situation.

Energy aware hierarchical cluster-based routing protocol for WSNs

Wireless sensor networks（WSNs） are emerging as essential and popular ways of providing pervasive computing environments for various applications. Unbalanced energy consumption is an inherent problem in WSNs, characterized by multi-hop routing and a many-to-one traffic pattern. This uneven energy dissipation can significantly reduce network lifetime. In multi-hop sensor networks, information obtained by the monitoring nodes need to be routed to the sinks, the energy consumption rate per unit information transmission depends on the choice of the next hop node. In an energy-aware routing approach, most proposed algorithms aim at minimizing the total energy consumption or maximizing network lifetime. In this paper, we propose a novel energy aware hierarchical cluster-based（NEAHC） routing protocol with two goals： minimizing the total energy consumption and ensuring fairness of energy consumption between nodes. We model the relay node choosing problem as a nonlinear programming problem and use the property of convex function to find the optimal solution. We also evaluate the proposed algorithm via simulations at the end of this paper.

A Novel Routing Strategy to Provide Source Location Privacy in Wireless Sensor Networks

In order to secure the source location privacy when information is sent back to the base station in wireless sensor network, we propose a novel routing strategy which routes the packets to the base station through three stages： directional random routing, h-hop routing in the annular region and the shortest path routing. These stages provide two fold protections to prevent the source location from being tracked down by the adversary. The analysis and simulation results show that proposed scheme, besides providing longer safety period, can significantly reduce energy consumption compared with two baseline schemes.

Coordinated adaptive beamformer over distributed antenna network

The spatial diversity of distributed network demands the individual filter to accommodate the topology of interference environment. In this paper, a type of distributed adaptive beamformer is proposed to mitigate interference over coordinated antenna arrays network. The proposed approach is formulated as generalized sidelobe canceller （GSC） structure to facilitate the convex combination of neighboring nodes＇ weights, and then it is solved by unconstrained least mean square （LMS） algorithm due to simplicity. Numerical results show that the robustness and convergence rate of antenna arrays network can be significantly improved in strong interference scenario. And they also clearly illustrate that mixing vector is optimized adaptively and adjusted according to the spatial diversity of the distributed nodes which are placed in different power of received signals to interference ratio （SIR） environments.

Distributed Algorithms for Event Reporting in Mobile-Sink WSNs for Internet of Things

Wireless Sensor Networks（WSNs） have many applications, such as climate monitoring systems, fire detection, smart homes, and smart cities. It is expected that WSNs will be integrated into the Internet of Things（IoT）and participate in various tasks. WSNs play an important role monitoring and reporting environment information and collecting surrounding context. In this paper we consider a WSN deployed for an application such as environment monitoring, and a mobile sink which acts as the gateway between the Internet and the WSN. Data gathering is a challenging problem in WSNs and in the IoT because the information has to be available quickly and effectively without delays and redundancies. In this paper we propose several distributed algorithms for composite event detection and reporting to a mobile sink. Once data is collected by the sink, it can be shared using the IoT infrastructure. We analyze the performance of our algorithms using WSNet simulator, which is specially designed for event-based WSNs. We measure various metrics such as average residual energy, percentage of composite events processed successfully at the sink, and the average number of hops to reach the sink.