Energy-efficient privacy homomorphic encryption scheme for multi-sensor data in WSNs

YesThe recent advancements in wireless sensor hardware ensures sensing multiple sensor data such as temperature, pressure, humidity, etc. using a single hardware unit, thus defining it as multi-sensor data communication in wireless sensor networks (WSNs). The in-processing technique of data aggregation is crucial in energy-efficient WSNs; however, with the requirement of end-to-end data confidentiality it may prove to be a challenge. End-to-end data confidentiality along with data aggregation is possible with the implementation of a special type of encryption scheme called privacy homomorphic (PH) encryption schemes. This paper proposes an optimized PH encryption scheme for WSN integrated networks handling multi-sensor data. The proposed scheme ensures light-weight payloads, significant energy and bandwidth consumption along with lower latencies. The performance analysis of the proposed scheme is presented in this paper with respect to the existing scheme. The working principle of the multi-sensor data framework is also presented in this paper along with the appropriate packet structures and process. It can be concluded that the scheme proves to decrease the payload size by 56.86% and spend an average energy of 8-18 mJ at the aggregator node for sensor nodes varying from 10-50 thereby ensuring scalability of the WSN unlike the existing scheme

iTREE: Intelligent Traffic and Resource Elastic Energy scheme for Cloud-RAN

YesBy 2020, next generation (5G) cellular networks are expected to support a 1000 fold traffic increase. To meet such traffic demands, Base Station (BS) densification through small cells are deployed. However, BSs are costly and consume over half of the cellular network energy. Meanwhile, Cloud Radio Access Networks (C-RAN) has been proposed as an energy efficient architecture that leverage cloud computing technology where baseband processing is performed in the cloud. With such an arrangement, more energy gains can be acquired through statistical multiplexing by reducing the number of BBUs used. This paper proposes a green Intelligent Traffic and Resource Elastic Energy (iTREE) scheme for C-RAN. In iTREE, BBUs are reduced by matching the right amount of baseband processing with traffic load. This is a bin packing problem where items (BS aggregate traffic) are to be packed into bins (BBUs) such that the number of bins used are minimized. Idle BBUs can then be switched off to save energy. Simulation results show that iTREE can reduce BBUs by up to 97% during off peak and 66% at peak times with RAN power reductions of up to 27% and 18% respectively compared with conventional deployments

Aggregated sensor payload submission model for token-based access control in the Web of Things

YesWeb of Things (WoT) can be considered as a merger of newly emerging paradigms of Internet of Things (IoT) and cloud computing. Rapidly varying, highly volatile and heterogeneous data traffic is a characteristic of the WoT. Hence, the capture, processing, storage and exchange of huge volumes of data is a key requirement in this environment. The crucial resources in the WoT are the sensing devices and the sensing data. Consequently, access control mechanisms employed in this highly dynamic and demanding environment need to be enhanced so as to reduce the end-to-end latency for capturing and exchanging data pertaining to these underlying resources. While there are many previous studies comparing the advantages and disadvantages of access control mechanisms at the algorithm level, vary few of these provide any detailed comparison the performance of these access control mechanisms when used for different data handling procedures in the context of data capture, processing and storage. This study builds on previous work on token-based access control mechanisms and presents a comparison of two different approaches used for handling sensing devices and data in the WoT. It is shown that the aggregated data submission approach is around 700% more efficient than the serial payload submission procedure in reducing the round-trip response time

An energy-efficient and scalable slot-based privacy homomorphic encryption scheme for WSN-integrated networks

YesWith the advent of Wireless Sensor Networks (WSN) and its immense popularity in a wide range of applications, security has been a major concern for these resource-constraint systems. Alongside security, WSNs are currently being integrated with existing technologies such as the Internet, satellite, Wi-Max, Wi-Fi, etc. in order to transmit data over long distances and hand-over network load to more powerful devices. With the focus currently being on the integration of WSNs with existing technologies, security becomes a major concern. The main security requirement for WSN-integrated networks is providing end-to-end security along with the implementation of in-processing techniques of data aggregation. This can be achieved with the implementation of Homomorphic encryption schemes which prove to be computationally inexpensive since they have considerable overheads. This paper addresses the ID-issue of the commonly used Castelluccia Mykletun Tsudik (CMT) [12] homomorphic scheme by proposing an ID slotting mechanism which carries information pertaining to the security keys responsible for the encryption of individual sensor data. The proposed scheme proves to be 93.5% lighter in terms of induced overheads and 11.86% more energy efficient along with providing efficient WSN scalability compared to the existing scheme. The paper provides analytical results comparing the proposed scheme with the existing scheme thus justifying that the modification to the existing scheme can prove highly efficient for resource-constrained WSNs

Multicast source mobility support for regenerative satellite networks

YesSatellite communications provides an effective solution to the ever increasing demand for mobile and ubiquitous communications especially in areas where terrestrial communication infrastructure is not present. IP multicasting is a bandwidth saving technology which could become an indispensable means of group communication over satellites since it can utilise the scarce and expensive satellite resources in an efficient way. In Source-Specific Multicast (SSM) the data is sent through a multicast tree from the source to all the receivers. However, if a source is a mobile node moving from one network to another, then special mechanisms are required to make sure this multicast tree does not break. Until now, while many research efforts have been made to provide IP multicast for the mobile nodes, they are mainly focused on terrestrial networks. Unfortunately, the terrestrial mobile multicast schemes are not directly applicable in a satellite environment. This paper, proposes a new mechanism to support multicast source mobility in SSM based applications for a mesh multi-beam satellite network with receivers both within the satellite network and in the Internet. In the proposed mechanism, the SSM receivers continue to receive multicast traffic from the mobile source despite the fact that the IP address of the source keeps on changing as it changes its point of attachment from one satellite gateway (GW) to another. The proposed scheme is evaluated and the results compared with the mobile IP home subscription (MIP HS)-based approach. The results show that the proposed scheme outperforms the MIP HS-based approach in terms of signalling cost and packet delivery cost

Discrete flower pollination algorithm for resource constrained project scheduling problem

YesIn this paper, a new population-based and nature-inspired metaheuristic algorithm, Discrete Flower Pollination Algorithm (DFPA), is presented to solve the Resource Constrained Project Scheduling Problem (RCPSP). The DFPA is a modification of existing Flower Pollination Algorithm adapted for solving combinatorial optimization problems by changing some of the algorithm's core concepts, such as flower, global pollination, Lévy flight, local pollination. The proposed DFPA is then tested on sets of benchmark instances and its performance is compared against other existing metaheuristic algorithms. The numerical results have shown that the proposed algorithm is efficient and outperforms several other popular metaheuristic algorithms, both in terms of quality of the results and execution time. Being discrete, the proposed algorithm can be used to solve any other combinatorial optimization problems.Innovate UKAwarded 'Best paper of the Month

IP multicast receiver mobility support using PMIPv6 in a global satellite network

YesA new generation of satellite systems that support regenerative on-board processors (OBPs) and multiple spot beam technology have opened new and efficient possibilities of implementing IP multicast communication over satellites. These new features have widened the scope of satellite-based applications and also enable satellite operators to efficiently utilize their allocated bandwidth resources. This makes it possible to provide cost effective satellite network services. IP multicast is a network layer protocol designed for group communication to save bandwidth resources and reduce processing overhead on the source side. The inherent broadcast nature of satellites, their global coverage (air, land, and sea), and direct access to a large number of subscribers imply satellites have unrivalled advantages in supporting IP multicast applications. IP mobility support in general and IP mobile multicast support in particular on mobile satellite terminals like the ones mounted on long haul flights, maritime vessels, continental trains, etc., still remain big challenges that have received very little attention from the research community. This paper proposes how Proxy Mobile IPv6 (PMIPv6)-based IP multicast mobility support defined for terrestrial networks can be adopted and used to support IP mobile multicast in future satellite networks, taking cognizance of the trend in the evolution of satellite communications

Interoperability Among Heterogeneous Networks for Future Aeronautical Communications

General surger

Fuzzy-Logic Based Call Admission Control in 5G Cloud Radio Access Networks with Pre-emption

YesFifth generation (5G) cellular networks will be comprised of millions of connected devices like wearable devices, Androids, iPhones, tablets and the Internet of Things (IoT) with a plethora of applications generating requests to the network. The 5G cellular networks need to cope with such sky-rocketing tra c requests from these devices to avoid network congestion. As such, cloud radio access networks (C-RAN) has been considered as a paradigm shift for 5G in which requests from mobile devices are processed in the cloud with shared baseband processing. Despite call admission control (CAC) being one of radio resource management techniques to avoid the network congestion, it has recently been overlooked by the community. The CAC technique in 5G C-RAN has a direct impact on the quality of service (QoS) for individual connections and overall system e ciency. In this paper, a novel Fuzzy-Logic based CAC scheme with pre-emption in C-RAN is proposed. In this scheme, cloud bursting technique is proposed to be used during congestion, where some delay tolerant low-priority connections are pre-empted and outsourced to a public cloud with a penalty charge. Simulation results show that the proposed scheme has low blocking probability below 5%, high throughput, low energy consumption and up to 95% of return on revenue