Robust Evolutionary-Game-Based Routing for Wireless Multimedia Sensor Networks

A Novel Technique to Mitigate the Data Redundancy and to Improvise Network Lifetime Using Fuzzy Criminal Search Ebola Optimization for WMSN

Wireless Multimedia Sensor Network (WMSN) is a powerful technology that is widely used to gather data and monitor the actual environment for analysis. Furthermore, multimedia applications' needs and the features, such as constrained latency and high bandwidth consumption, complicate the design of WMSN routing protocols. Despite several methods, the trouble of designing WMSNs routing protocol remains a hurdle. The miniaturization and enhancement of hardware facilitate an extensive range of applications in the military and public sectors. On the contrary, the streaming of multimedia content is captured and generated due to some event-triggered surveillance for a long duration of time. Hence, it is necessary for wireless multimedia sensor network (WMSN) to provide a strong hardware foundation, thereby satisfying Quality of Service (QoS) requirements. Initially, the network is clustered into several clusters and the nodes with rich resources are chosen as cluster heads. The significant intention of this paper is to eliminate data redundancy and to select optimal cluster heads, thereby minimizing the energy consumption. Therefore, this paper proposes a novel Fuzzy Criminal Search Ebola Optimization (FCSEO) algorithm for optimal selection of cluster heads. In addition to this, the data redundancy present in the proposed algorithm is mitigated and thus the network lifetime is enhanced. Finally, extensive experimentation is carried out for various performance measures to determine the efficiency of the proposed approach.

A Distributed Testbed for 5G Scenarios: An Experimental Study

This paper demonstrates the use of Universal Software Radio Peripheral (USRP), together with Raspberry Pi3 B+ (RP3) as the brain (or the decision making engine), to develop a distributed wireless network in which nodes can communicate with other nodes independently and make decision autonomously. In other words, each USRP node (i.e., sensor) is embedded with separate processing units (i.e., RP3), which has not been investigated in the literature, so that each node can make independent decisions in a distributed manner. The proposed testbed in this paper is compared with the traditional distributed testbed, which has been widely used in the literature. In the traditional distributed testbed, there is a single processing unit (i.e., a personal computer) that makes decisions in a centralized manner, and each node (i.e., USRP) is connected to the processing unit via a switch. The single processing unit exchanges control messages with nodes via the switch, while the nodes exchange data packets among themselves using a wireless medium in a distributed manner. The main disadvantage of the traditional testbed is that, despite the network being distributed in nature, decisions are made in a centralized manner. Hence, the response delay of the control message exchange is always neglected. The use of such testbed is mainly due to the limited hardware and monetary cost to acquire a separate processing unit for each node. The experiment in our testbed has shown the increase of end-to-end delay and decrease of packet delivery ratio due to software and hardware delays. The observed multihop transmission is performed using device-to-device (D2D) communication, which has been enabled in 5G. Therefore, nodes can either communicate with other nodes via: (a) a direct communication with the base station at the macrocell, which helps to improve network performance; or (b) D2D that improve spectrum efficiency, whereby traffic is offloaded from macrocell to small cells. Our testbed is the first of its kind in this scale, and it uses RP3 as the distributed decision-making engine incorporated into the USRP/GNU radio platform. This work provides an insight to the development of a 5G network.

Multimedia Independent Multipath Routing Algorithms for Internet of Things Based on a Node Hidden Communication Model

In order to achieve a multi-path routing algorithm with time delay and energy consumption balance to alleviate the energy holes around a sink, a multimedia independent multipath routing algorithm for internet of things (IoT) based on node hidden communication model is proposed in this paper. On the premise of satisfying the application delay, a multi-source multi-path routing algorithm is proposed by using the idea of software definition and fitting multiple curves to form independent multi-path routing. Through a sink node centralized programming control source node routing, according to the priority of the source node, the dynamic angle of the source node can be allocated, which effectively reduces the energy consumption of the network. In addition, considering that the Internet of Things has more perceptive nodes, limited computing and storage capacity, frequent joining and exiting operations and other factors, a hidden communication model of nodes is designed for the IoT. It is helpful to improve the level of privacy protection in the IoT, and to effectively improve the ability of nodes to resist attacks in the IoT. The experimental results show that the proposed algorithm avoids the interference between paths and various network attacks to the greatest extent, and the energy consumption is relatively low under the requirement of quality of service (QoS) delay.

Energy Efficient Multipath Routing Algorithm for Wireless Multimedia Sensor Network

Wireless multimedia sensor networks (WMSNs) are capable of collecting multimedia events, such as traffic accidents and wildlife tracking, as well as scalar data. As a result, WMSNs are receiving a great deal of attention both from industry and academic communities. However, multimedia applications tend to generate high volume network traffic, which results in very high energy consumption. As energy is a prime resource in WMSN, an efficient routing algorithm that effectively deals with the dynamic topology of WMSN but also prolongs the lifetime of WMSN is required. To this end, we propose a routing algorithm that combines dynamic cluster formation, cluster head selection, and multipath routing formation for data communication to reduce energy consumption as well as routing overheads. The proposed algorithm uses a genetic algorithm (GA)-based meta-heuristic optimization to dynamically select the best path based on the cost function with the minimum distance and the least energy dissipation. We carried out an extensive performance analysis of the proposed algorithm and compared it with three other routing protocols. The results of the performance analysis showed that the proposed algorithm outperformed the three other routing protocols.