On multiple‐domain cooperative diversity for communications with distributed content in G.hn networks

Broadband data applications can be delivered to homes over the available home network infrastructure (i.e., mediums). Further enhancement of the network performance is possible by exploiting spatial, time, or frequency diversity. Recently, MIMO systems have been proposed for power line communication (PLC) networks. Because of the extremely diverse physical characteristics of the mediums, an implementation of MIMO systems in G.hn across different domains represents a non‐trivial task. In this paper, we present and theoretically evaluate the performance of multiple‐domain diversity mechanism in G.hn using a cross‐layer classification algorithm. In the proposed network architecture, the signal is transmitted over different mediums selected by the classification algorithm in order to meet the quality‐of‐service demands. At the receiver, joint signal combining and equalization are done to take advantage of the multiple‐domain cooperative diversity and increase the signal‐to‐noise ratio. The merit of the proposed multiple‐domain PLC network has been confirmed by analytical performance analysis and computer simulation. Copyright © 2015 John Wiley & Sons, Ltd.     

基于G.hn标准协议的PLC混合ARQ方案研究与改进

现代电力线通信(PLC)系统为了可靠地传输数据并提高系统传输量,自动重传请求(ARQ)技术必不可少.然而ARQ技术已经很好地解决了现有通信的数据传输问题,但由于PLC信道不稳定、强干扰以及衰减非常快等缺点造成误码率极高、吞吐量低.针对PLC家庭网络提出能够适应PLC信道的H-ARQ技术来满足未来PLC通信网络的需求.改进ARQ和低密度奇偶校验(LDPC)技术相结合来提高传输率、降低误码率.最后通过仿真实验对改进的H-ARQ协议算法验证,从仿真结果可以看出误码率降低、吞吐量较高,能适应环境极其差的电力线通信.     

Energy‐efficient wireless networking for multimedia applications

In this paper we identify the most prominent problems of wireless multimedia networking and present several state‐of‐the‐art solutions with a focus on energy efficiency. Three key problems in networked wireless multimedia systems are: (1) the need to maintain a minimum quality of service over time‐varying channels; (2) to operate with limited energy resources; and (3) to operate in a heterogeneous environment. We identify two main principles to solve these problems. The first principle is that energy efficiency should involve all layers of the system. Second, Quality of Service is an essential mechanism for mobile multimedia systems not only to give users an adequate level of service, but also as a tool to achieve an energy‐efficient system. Owing to the dynamic wireless environment, adaptability of the system will be a key issue in achieving this. Copyright © 2001 John Wiley & Sons, Ltd.     

基于G.hn的智慧家庭组网关键技术

在未来智慧家庭中,超高速的综合智能组网成为家庭组网的趋势。基于此,首先分析了G.hn协议的调制技术及频宽和目前同轴线缆的频谱使用状况,然后研究了G.hn扩频技术的关键技术,最后提出了关键技术要点及扩频方向。     

Energy‐efficient cluster division for multi‐cell joint transmission technology

Coordinated Multi‐Point (CoMP) is an effective way to improve user performance in next‐generation wireless cellular networks, such as 3GPP LTE‐Advanced(LTE‐A). The base station cooperation can reduce interference, and increase the signal to interference and noise ratio (SINR) of cell‐edge users and improve the system capacity. However, the base station cooperation also adds additional power consumption for signal processing and sharing information through back‐haul links between cooperative base stations. As such, CoMP may potentially consume more energy. This paper studies such energy consumption issue in CoMP, presents a semi‐dynamic CoMP cluster division algorithm based on energy efficiency (SCCD‐EE) that can effectively adapt to users' real‐time interference, and employs the idea of Maximal Independent Set (MIS) to solve the problem of cluster overlapping. To verify the feasibility of the proposed algorithm, this paper performs comprehensive evaluations in terms of energy efficiency and system capacity. The simulation results show that the proposed semi‐dynamic cluster division algorithm can not only improve the system capacity and the quality of service (QoS) of cell‐edge users, but also achieve higher network energy efficiency compared with static cluster methods and Non‐CoMP approaches. Copyright © 2016 John Wiley & Sons, Ltd.     

Energy‐efficient power control for uplink spectrum‐sharing heterogeneous networks

This article considers energy‐efficient power control schemes for interference management in uplink spectrum‐sharing heterogeneous networks that maximize the energy efficiency of users, protect the macro base station, and support users with QoS consideration. In the first scenario, we define the objective function as the weighted sum of the energy efficiencies and develop an efficient global optimization algorithm with global linear and local quadratic rate of convergence to solve the considered problem. To ensure fairness among individual user equipments (UEs) in terms of energy efficiency, we consider the max‐min problem, where the objective is defined as the weighted minimum of the energy efficiencies, and a fractional programming theory and the dual decomposition method are jointly used to solve the problem and investigate an iterative algorithm. As by‐products, we further discuss the global energy efficiency problem and consider near‐optimal schemes. Numerical examples are provided to demonstrate significant improvements of the proposed algorithms over existing interference management schemes.     

Energy‐efficient device‐to‐device communication using adaptive resource‐block allocation

Device‐to‐device (D2D) communication in the fifth‐generation (5G) wireless communication networks (WCNs) reuses the cellular spectrum to communicate over the direct links and offers significant performance benefits. Since the scarce radio spectrum is the most precious resource for the mobile‐network operators (MNOs), optimizing the resource allocation in WCNs is a major challenge. This paper proposes an adaptive resource‐block (RB) allocation scheme for adequate RB availability to every D2D pair in a trisectored cell of the 5G WCN. The hidden Markov model (HMM) is used to allocate RBs adaptively, promoting high resource efficiency. The stringent quality‐of‐service (QoS) and quality‐of‐experience (QoE) requirements of the evolutionary 5G WCNs must not surpass the transmission power levels. This is also addressed while using HMM for RB allocation. Thus, an energy‐efficient RB allocation is performed, with higher access rate and mean opinion score (MOS). Cell sectoring effectively manages the interference in the 5G networks amid ultrauser density. The potency of the proposed adaptive scheme has been verified through simulations. The proposed scheme is an essential approach to green communication in 5G WCNs.     

Energy‐efficient resource allocation for device‐to‐device communication through noncooperative game theory

Wireless network with high data rate applications has seen a rapid growth in recent years. This improved quality of service (QoS) leads to huge energy consumption in wireless network. Therefore, in order to have an energy‐efficient resource allocation in cellular system, a device‐to‐device (D2D) communication is the key component to improve the QoS. In this paper, we propose a noncooperative game (NCG) theory approach for resource allocation to improve energy efficiency (EE) of D2D pair. A three‐tier network with macrocell base station (MBS), femtocell base station (FBS), and D2D pair is considered, which shares the uplink resource block. A resource allocation strategy with constraints is arrived, which maintains minimum throughput for each user in the network. The proposed resource allocation strategy optimizes the EE of D2D pair in the three‐tier network, which achieves Nash equilibrium (NE) and Pareto optimality (PO). Simulation results validate that EE is uniform and optimum for all D2D pair, which converges to NE when channel is static and it converges to PO when the channel is dynamic.     

ECaD: Energy‐efficient routing in flying ad hoc networks

Much progress can be expected in the domain of unmanned aerial vehicle (UAV) communication by the next decade. The cooperation between multiple UAVs in the air exchanging data among themselves can naturally form a flying ad hoc network (FANET). Such networks can be the key support to accomplish several kinds of missions while providing the required assistance to terrestrial networks. However, they are confronted with many challenges and difficulties, which are due to the high mobility of UAVs, the frequent packet losses, and the weak links between UAVs, all affecting the reliability of the data delivery. Furthermore, the unbalanced energy consumption may result in earlier UAV failure and consequently accelerate the decrease of the network lifetime, thus disrupting the overall network. This paper supports the use of the movement information and the residual energy level of each UAV to guarantee a high level of communication stability while predicting a sudden link breakage prior to its occurrence. A robust route discovery process is used to explore routing paths where the balanced energy consumption, the link breakage prediction, and the connectivity degree of the discovered paths are all considered. The performance of the scheme is evaluated through a series of simulations. The outcomes demonstrate the benefits of the proposed scheme in terms of increasing the lifetime of the network, minimizing the number of path failures, and decreasing the packet losses.     

Energy‐efficient multihop routing in WSN using the hybrid optimization algorithm

The technical growth in the field of the wireless sensor networks (WSNs) has resulted in the process of collecting and forwarding the massive data between the nodes, which was a major challenge to the WSNs as it is associated with greater energy loss and delay. This resulted in the establishment of a routing protocol for the optimal selection of the multipath to progress the routing in WSNs. This paper proposes an energy‐efficient routing in WSNs using the hybrid optimization algorithm, cat–salp swarm algorithm (C‐SSA), which chooses the optimal hops in progressing the routing. Initially, the cluster heads (CHs) are selected using the low‐energy adaptive clustering hierarchy (LEACH) protocol that minimizes the traffic in the network. The CHs are engaged in the multihop routing, and the selection of the optimal paths is based on the proposed hybrid optimization, which chooses the optimal hops based on the energy constraints, such as energy, delay, intercluster distance, intracluster distance, link lifetime, delay, and distance. The simulation results prove that the proposed routing protocol acquired minimal delay of 0.3165 with 50 nodes and two hops, maximal energy of 0.1521 with 50 nodes and three hops, maximal number of the alive nodes as 39 with 100 nodes and two hops, and average throughput of 0.9379 with 100 nodes and three hops.     

Energy‐efficient resource allocation for lifetime maximization in M2M networks

Machine‐to‐machine (M2M) communications is one of the major enabling technologies for the realization of the Internet of Things (IoT). Most machine‐type communication devices (MTCDs) are battery powered, and the battery lifetime of these devices significantly affects the overall performance of the network and the quality of service (QoS) of the M2M applications. This paper proposes a lifetime‐aware resource allocation algorithm as a convex optimization problem for M2M communications in the uplink of a single carrier frequency division multiple access (SC‐FDMA)‐based heterogeneous network. A K‐means clustering is introduced to reduce energy consumption in the network and mitigate interference from MTCDs in neighbouring clusters. The maximum number of clusters is determined using the elbow method. The lifetime maximization problem is formulated as a joint power and resource block maximization problem, which is then solved using Lagrangian dual method. Finally, numerical simulations in MATLAB are performed to evaluate the performance of the proposed algorithm, and the results are compared to existing heuristic algorithm and inbuilt MATLAB optimal algorithm. The simulation results show that the proposed algorithm outperforms the heuristic algorithm and closely model the optimal algorithm with an acceptable level of complexity. The proposed algorithm offers significant improvements in the energy efficiency and network lifetime, as well as a faster convergence and lower computational complexity.     

Energy‐efficient partner selection in cooperative wireless networks: a matching‐theoretic approach

In this paper, the problem of stable energy‐efficient partner selection in cooperative wireless networks is studied. Each node aims to be paired with another node so as to minimize the total energy consumption required to meet a target end‐to‐end signal‐to‐noise ratio requirement and thus maintain quality of service. Specifically, each node ranks every other node in the network according to their energy saving achievable through cooperation. Two polynomial time complexity algorithms based on the stable roommates matching problem are proposed through which nodes are paired according to their preference lists. The first algorithm, denoted Irving's stable matching, may not always have a stable solution. Therefore, the second algorithm—which is a modified version of Irving's algorithm and denoted maximum stable matching—is proposed to find the maximum number of stable disjoint pairs. Simulation results are provided to validate the efficiency of the proposed algorithms in comparison with centralized energy‐efficient partner selection as well as other matching algorithms, yielding a trade‐off between stability and total energy consumption, but comparable symbol error rate performance and network sum rate. Copyright © 2016 John Wiley & Sons, Ltd.     

Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks

In wireless sensor networks, most data aggregation scheduling methods let all nodes aggregate data in every time instance. It is not energy efficient and practical because of link unreliability and data redundancy. This paper proposes a lossy data aggregation (LDA) scheme to reduce traffic and save energy. LDA selects partial child nodes to sample data at partial time slots and allows estimated aggregation at parent nodes or a root in a network. We firstly consider that all nodes sample data synchronously and find that the error between the real value of a physical parameter and that measured by LDA is bounded respectively with and without link unreliability. Detailed analysis is given on error bound when a confidence level is previously assigned to the root by a newly designed algorithm. Thus, each parent can determine the minimum number of child nodes needed to achieve its assigned confidence level. We then analyze a probability to bound the error with a confidence level previously assigned to the root when all nodes sample data asynchronously. An algorithm then is designed to implement our data aggregation under asynchronization. Finally, we implement our experiment on the basis of real test‐beds to prove that the scheme can save more energy than an existing algorithm for node selection, Distributive Online Greedy (DOG). Copyright © 2012 John Wiley & Sons, Ltd.     

An energy‐efficient utility‐based distributed data routing scheme for heterogenous sensor networks

A utility‐based distributed data routing algorithm is proposed and evaluated for heterogeneous wireless sensor networks. It is energy efficient and is based on a game‐theoretic heuristic load‐balancing approach. It runs on a hierarchical graph arranged as a tree with parents and children. Sensor nodes are considered heterogeneous in terms of their generated traffic, residual energy and data transmission rate and the bandwidth they provide to their children for communication. The proposed method generates a data routing tree in which child nodes are joined to parent nodes in an energy‐efficient way. The principles of the Stackelberg game, in which parents as leaders and children as followers, are used to support the distributive nature of sensor networks. In this context, parents behave cooperatively and help other parents to adjust their loads, while children act selfishly. Simulation results indicate the proposed method can produce on average more load‐balanced trees, resulting in over 30% longer network lifetime compared with the cumulative algorithm proposed in the literature. Copyright © 2014 John Wiley & Sons, Ltd.     

Energy‐efficient outage‐constrained power allocation based on statistical channel knowledge for dual‐hop cognitive relay networks

This paper investigates the power allocation problem in decode‐and‐forward cognitive dual‐hop systems over Rayleigh fading channels. In order to optimize the performance of the secondary network in terms of power consumption, an outage‐constrained power allocation scheme is proposed. The secondary nodes adjust their transmit power subject to an average interference constraint at the primary receiver and an outage probability constraint for the secondary receivers while having only statistical channel knowledge with respect to the primary nodes. We compare this approach with a power allocation scheme based on instantaneous channel state information under a peak interference constraint. Analytical and numerical results show that the proposed approach, without requiring the constant interchange of channel state information, can achieve a similar performance in terms of outage probability as that of power allocation based on instantaneous channel knowledge. Moreover, the transmit power allocated by the proposed approach is considerably smaller than the power allocated by the method based on instantaneous channel knowledge in more than 50% of the time. Copyright © 2015 John Wiley & Sons, Ltd.     

Energy‐efficient management using a traffic‐oriented routing scheme for cognitive radio networks

This paper elaborates on a traffic manipulation routing scheme that associates the moments of the traffic, targeting the maximization of the energy conservation, as well as the effective resource management of the network nodes. The energy conservation is achieved through the data flow coordination, in association with the data traffic volume and the resource exchange, between the nodes that exploit radio spectrum access in cognitive radio networking architectures. The routing scheme that is proposed in this paper interrelates the backward difference of traffic moments for each node based on a series model, together with the sleep‐time period, towards reflecting this measurement to the minimization of the nodes activity durations to achieve energy conservation. The effective operation of the routing scheme is achieved by exploiting a signalling mechanism that was adopted for the proper communication of the nodes over the available radio spectrum parts, such as the television white spaces. Simulation tests were conducted towards examining the validity of the proposed routing scheme via multiple performance evaluation experiments. Simulation results have shown the offered reliability and the efficiency of the proposed traffic‐aware scheme, in reference to the efficient energy consumption of the networking nodes and the minimization of the delays. Copyright © 2015 John Wiley & Sons, Ltd.     

Energy‐efficient multi‐level and distance‐aware clustering mechanism for WSNs

Most sensor networks are deployed at hostile environments to sense and gather specific information. As sensor nodes have battery constraints, therefore, the research community is trying to propose energy‐efficient solutions for wireless sensor networks (WSNs) to prolong the lifetime of the network. In this paper, we propose an energy‐efficient multi‐level and distance‐aware clustering (EEMDC) mechanism for WSNs. In this mechanism, the area of the network is divided into three logical layers, which depends upon the hop‐count‐based distance from the base station. The simulation outcomes show that EEMDC is more energy efficient than other existing conventional approaches. Copyright © 2013 John Wiley & Sons, Ltd.     

Energy‐efficient network selection with mobility pattern awareness in an integrated WiMAX and WiFi network

To provide wireless Internet access, WiFi networks have been deployed in many regions such as buildings and campuses. However, WiFi networks are still insufficient to support ubiquitous wireless service due to their narrow coverage. One possibility to resolve this deficiency is to integrate WiFi networks with the wide‐range WiMAX networks. Under such an integrated WiMAX and WiFi network, how to conduct energy‐efficient handovers is a critical issue. In this paper, we propose a handover scheme with geographic mobility awareness (HGMA), which considers the historical handover patterns of mobile devices. HGMA can conserve the energy of handovering devices from three aspects. First, it prevents mobile devices from triggering unnecessary handovers according to their received signal strength and moving speeds. Second, it contains a handover candidate selection method for mobile devices to intelligently select a subset of WiFi access points or WiMAX relay stations to be scanned. Therefore, mobile devices can reduce their network scanning and thus save their energy. Third, HGMA prefers mobile devices staying in their original WiMAX or WiFi networks. This can prevent mobile devices from consuming too much energy on interface switching. In addition, HGMA prefers the low‐tier WiFi network over the WiMAX network and guarantees the bandwidth requirements of handovering devices. Simulation results show that HGMA can save about 59– 80% of energy consumption of a handover operation, make mobile devices to associate with WiFi networks with 16–62% more probabilities, and increase about 20–61% of QoS satisfaction ratio to handovering devices. Copyright © 2009 John Wiley & Sons, Ltd.     

An energy‐efficient asynchronous wake‐up scheme for underwater acoustic sensor networks

In addition to the requirements of the terrestrial sensor network where performance metrics such as throughput and packet delivery delay are often emphasized, energy efficiency becomes an even more significant and challenging issue in underwater acoustic sensor networks, especially when long‐term deployment is required. In this paper, we tackle the problem of energy conservation in underwater acoustic sensor networks for long‐term marine monitoring applications. We propose an asynchronous wake‐up scheme based on combinatorial designs to minimize the working duty cycle of sensor nodes. We prove that network connectivity can be properly maintained using such a design even with a reduced duty cycle. We study the utilization ratio of the sink node and the scalability of the network using multiple sink nodes. Simulation results show that the proposed asynchronous wake‐up scheme can effectively reduce the energy consumption for idle listening and can outperform other cyclic difference set‐based wake‐up schemes. More significantly, high performance is achieved without sacrificing network connectivity. Copyright © 2015 John Wiley & Sons, Ltd.