Search

In recent times, it has been witnessed that wireless systems based on IoT-based have developed rapidly in various sectors. The IoT (Internet of Things) is the network in which physical devices, equipment, sensors and other objects can communicate among themselves without human involvement. The WSN (Wireless Sensor Network) is a central component of the IoT, which has proliferated into several different applications in real-time. The IoT and WSNs now have various critical and non-critical applications impacting nearly every area of our everyday life. WSN nodes are usually small and battery-driven machines. Thus, the energy effective data aggregation techniques that increase the lifespan of the network are highly significant. Various approaches and algorithms for energy-efficient data aggregation in IoT-WSN systems were presented. This paper reviews the literature with specific attention to aspects of wireless networking for the preservation of energy and aggregation of data.

This article considers the two-way multiple-input multiple-output (MIMO) relaying channels with multiple users, in which multiple users are served simultaneously by the base station (BS) with the assistance of the relay. The transmission consists of only two phases, doubling the system throughout over traditional one-way half-duplex transmission. A zero-forcing dirty paper coding (ZFDPC) aided physical-layer network coding (PNC) scheme is proposed in this article and the achievable capacity of the ZFDPC aided PNC scheme is derived. Simulation results show that the proposed scheme outperforms the previous decode-and-forward (DF) and zero-forcing beamforming (ZFBF) aided PNC scheme due to more degrees of freedoms and the advantage of PNC. Moreover, we analyze the effect of the imperfect channel state information (CSI) from RS to users at BS side to show the robustness of the proposed ZFDPC aided PNC scheme.

Small area femtocell increases the energy efficiency of the cellular network as the distance between base station and user is very less. Mobile femtocell causes the spectrum reuse to be used at very large extent making spectral efficiency suffer. This paper discusses recently researched techniques that have been used to increase the spectral efficiency in mobile femtocell network. But these techniques also come with their own limitations. Considering this, data aggregation and compression technique can be consider as one of the best contender to increase the spectral efficiency in cellular network which is also been explained in this paper.

Ever increasing user demands and development of modern communication technologies have led to the evolution of communication networks from 1st Generation (1G) network to 4G heterogeneous networks. Further, 4G with heterogeneous network environment will provide features such as, “Always Best Connected”, “Anytime Anywhere” and seamless communication. Due to diverse characteristics of heterogeneous networks such as bandwidth, latency, cost, coverage and Quality of Service (QoS) etc., there are several open and unsolved issues namely mobility management, network administration, security etc. Hence, Designing proficient mobility management to seamlessly integrate heterogeneous wireless networks with all-IP is the most challenging issue in 4G networks. Mobile IPv6 (MIPv6) developed by Internet Engineering Task Force (IETF) has mobility management for the packet-switched devices of homogeneous wireless networks. Further, mobility management of homogeneous networks depends on network related parameter i.e., Received Signal Strength (RSS). However the mobility management of heterogeneous networks, not only depends on network related parameters, but also on terminal-velocity, battery power, location information, user-user profile & preferences and service-service capabilities & QoS etc. Designing mobility management with all-IP, while, considering issues such as context of networks, terminal, user and services is the main concern of industry and researchers in the current era.

In this paper, an efficient beamforming technique at the aggregator node in the patient wireless body area network (WBAN) is proposed to improve the communication performance with the gateway node using C-shaped switched-beam antenna arrays. This proposed technique provides high gain beams towards the gateway node which may be located indoor or outdoor based on the medical quarantine or isolation topology and help medical staff monitor patients with less contact and infection probability. Also, a semi-blind switched-beam algorithm is developed to both reduce the processing time required for beam selection and reduce the power loss due to the off-mainlobe orientation of the selected beam with the signal direction. The proposed technique is analyzed at different wearing scenarios and simulation results show that the received power levels are improved with as less as 0.3 dBm standard deviation which helps in extending the communication range between the WBAN aggregator and gateway nodes in the health monitoring system and also extend the battery lifetime at the patient WBAN.

The current challenge for telecommunication networks is to offer new types of services. To achieve this, somehow traffic has to be conditioned. A spacer is a token bucket traffic conditioner that reshapes flows according to a periodic profile. Packets are delayed until they can be inserted according to this profile. This short paper concentrates on packet discard by overflow in the spacer. An upper bound for the overflow probability is given, valid even when it is fully loaded. It shows the ratio of discarded packets is of the same order than the ratio of out-of-profile packets.

We introduce a new communication model consisting of two interfering broadcast channels with one cognitive transmitter, who knows the message transmitted by the other non-cognitive transmitter, in a non-causal manner. An achievable rate region is derived for this model. The region is computed based on the Marton region for the general broadcast channel and its extension by Steinberg to the broadcast channel with the states known at the transmitter. By using the region evaluated, an achievable rate for the Gaussian broadcast channel is derived.

This paper targets to transmit industrial data from one sensor node to another sensor node, wirelessly and securely. However as the nodes have Internet access and are typically positioned in an unsupervised context with minimal individual intervention; security and seclusion are the prime challenges in Industrial Wireless Sensor Networks (IWSN). To use IWSN, a user must be able to get real time information straight from the source nodes and this is accomplished by Radio Frequency Identification (RFID). It yields a cost-effective solution of identification problems, but it frequently suffers from diverse safety and privacy difficulties. This paper resolves the issues of RFID systems using Global System for Mobile Communications (GSM) module that generates a One-Time Password (OTP) for accessing the data, and thereby ensures user's privacy and security in Industrial Wireless Sensor Network. Furthermore, eight evaluation criteria have been met by the proposed system surpassing the existing systems.

Mobile Ad-hoc networks (MANET) is a collection of nodes of wireless connectivity. In Mobile Ad hoc Network (MANET) all the mobile nodes are requiring restricted battery capacity. Because of the changing nature of network the sudden communication link breakage happens. Hence the possibility of data loss is more. Efficient utilization of energy and lossless transmission are the important issues in MANET. This paper proposes a new Trust based Efficient Energy Balanced Less Loss Routing (TER) Protocol for MANETS. This protocol improves the network performance by properly choosing the intermediate forwarding nodes. The Source Node picks only single of its neighbors as its next hop node by using Efficient Parameter (EP). The EP is calculated from the residual energy, distance, Occupied Queue space, the velocity of that node. The node using maximum EP is nominated as the succeeding node. This protocol reduces the number of channeling messages and hence reduces the path-finding Overhead of the network. It lessens the chance of data loss and hence improves throughput and Packet Delivery Ratio. This protocol adds trust to the selected node. In this paper, we do the simulation in ns-2 simulator and the performance is measured by with performance parameters like Routing Overhead, Packet Delivery Ratio, Throughput, End to End Delay and Average energy consumption.

The evolution of wireless body area network (WBAN) has changed the human life for its applications in the field of healthcare, fitness, entertainment and sports etc. However, two of the major challenges in the design of WBAN are energy efficiency and guaranteeing QoS. The load balance of different packet queues in a WBAN plays important role in design of energy efficient and reliable system. In this paper, we propose a Traffic Prioritized Load Balanced Scheduling (TPLBS) algorithm for load balancing in different priority queues in wireless body area networks based on IEEE 802.15.6 model. The main objective of this paper is to minimize packet drop in the queues so that throughput of WBAN can be improved. In this case we consider both priority and location from which the packet received, so that no packet should wait for a long time in the assigned queue to be transmitted to Access Point. The proposed method is simulated using Castalia to study and compare its performance with its counterparts. The simulation results reveal that the proposed protocol works better than the existing methods in terms of delay, throughput and energy efficiency.

LoRa (Long-Range) has become the Deoxyribo Nucleic Acid (DNA) of the Internet of things (IoT) for equipping smart solutions. Home automation is responsible for providing a safe and stylish home. This paper proposes a capable architecture of home automation for both short-range and long-range utilizing multiple communication technologies, namely LoRaWAN, server-based LoRa gateway, and Bluetooth connectivity. This integrated system effectively controls distinct types of home appliances and keeps smart management among all the electronics components. A regular user can easily manage these unified systems by using an Android application. This paper also presents experimental data analysis. The results and discussion section provide a set of experiments like estimated transmission delay calculation for LoRa, Wi-Fi, and Bluetooth, a coverage area calculation for LoRa with RSSI and SNR values, and a System Usability Scale (SUS). The scheme has achieved a SUS score of 93%. However, the proposed architecture can be called an outright package for smart home and will be very workable, abuzz, and handy.

Recently, the progression in Internet of Thing (IoT) has extensively influenced the model of wireless networking. As numerous wireless devices were emerged, the new Medium Access Control (MAC) and routing protocols has been introduced for assuring the end-to-end network efficiency. This paper aims to focus on the IEEE 802.15.4 MAC standards, where the security field is included in MAC header. The sensitive data security authentication on this MAC header is completely based on the method with the introduction of optimum authentication key using partially homomorphic encryption named ElGamal public key cryptosystem. More importantly, in this work, the ElGamal public key cryptosystem for securing IoT data is progressed by generating the optimal private key as well. For this optimal selection of key, this paper aims to establish a new hybrid optimization algorithm that hybrids the concept of Lion Algorithm (LA) and Cuckoo Search Algorithm (CS) named Cuckoo Mated-Lion Algorithm (CM-LA). Finally, the performance of the proposed working strategy is compared over other state-of-the-arts models by concerning various attacks, convergence and key sensitivity analysis, respectively.

An ad hoc network is a network made of movable nodes built on the fly and constructed dynamically when there is no longer an infrastructure or pre-built network on the scene. The nodes can also perform both end-to-end terminals and shape MANET roles, meaning they contribute to each route's configurations. The data must travel through several intermediate nodes during the route while routing a given flow from a source to a destination. The data should be larger than needed for just a single application use. The intermediate nodes forward data to the intended destination, taking into account the locations to which it must be sent to arrive correctly. The routing protocol in an Ad hoc network (human-made network) uses nodes to look at different device locations and procedures for any data path they choose before deciding on the route and ways in which they exchange data are viable. Anomaly, since the existing trust among the various nodes and dynamic topology, leaves the routing protocols susceptible to Denial of service attacks like a black hole, wormhole, Denial of service, and being non-integrated into a central infrastructure present a condition which MANETs are subject to such as Conventional networks typically work by injecting some control packets and tracking the target's movement once the user is already on the wireless. Still, in a MANET, the attacker acts before the mark has moved into the wireless medium. Maliciously exploiting various routing information has the potential to drive the system into a situation of more significant disorder, which will eventually lead to widespread network failure. This existing AODV attack, called the Blackhole attack, might have worked by purposefully withholding important routing information from end-users who could have benefitted from it, which is just what the adversary does in this task. In this scenario, the data packets are never delivered, and the system suffers a total data loss. The variety of detection and protection techniques employed against the blackhole attacker significantly lower the number of suspects. Therefore, this paper advocate for OSPFV [for wireless LANs] protocol integration with built-in security, where Threshold evaluation and cryptographic verification are employed. In this paper, two protocols: the blackhole attack and the proposed AODV-BS protocols, are simulated on different MANET models, and the two other network metrics are used: Network Packet Delivery Ratio and the normalized Out of Routing Overhead Utilization and Network Delay are calculated, and then their performance is studied to discover the result.

VANET (Vehicular Ad-hoc NETwork) is a wireless network technology that uses vehicles as mobile nodes to exchange data without the need for a Central Access (CA) point, which is used for safety problems. In this, the vehicles (node) transmit data about traffic and road conditions. Because of the latest advances in information technologies, it is now important to take the first step toward using software to evaluate this network prior to deployment. By implementing the network in a real-world environment, we can use simulation software to perform a detailed review of it. There are various network simulators, each with its own collection of features that set it apart from the others. We should concentrate on finding the right alternative that yields the best outcomes. NS2 is the most commonly used simulator tools; in this paper, we used NS2 to build the VANET, which allowed communication between nodes using AODV routing protocols. By changing the number of vehicles when applying TCP traffic, we use routing protocols (AODV) for various standard metrics, such as Cumulative Sum of Packet, throughput, jitter, and packet loss. The simulation was carried out using the NS2 simulation tool. Different mobility models would be considered in order to make the network situation more realistic. In this paper, we used Five forms of mobility patterns using 10, 20, 30, 40, and 50 vehicle nodes. On NS2, we drafted a TCL script to verify the affectations of the routing protocols used in the VANET. After successfully run, we conclude that the Cumulative Sum of Packet gets less forwarded to the destination, throughput is high in case of sent Packet, Jitter gets stable at last, and the most important is that there is no loss of any packet from Source to Destination.

Wireless sensor network has attracted significant attention in research and development due to its tremendous applications in medical, military and defence, medical, environmental, industrial, infrastructure protection, and commercial applications to enable to interact with each other controlled remotely. A Wireless Sensor Network (WSN) has wide applications such as environmental monitoring and tracking of the target nodes for communication. The sensor nodes are equipped with wireless interfaces used for communication between the nodes and another network. Wireless Sensor Network suffers from many constraints that make security a primary challenge. When the sensor node is deployed in a communication environment unattended, the nodes are vulnerable to various attacks. This paper deals with the different types of Active and Passive security attacks in Wireless Sensor Networks to design effective countermeasures for secured communication. This paper will help researchers identify the most vulnerable attacks in the communication and defensive mechanisms to encounter the attacks in WSN.

Aiming at the security issues during the multi-types data storage and data transmission in autonomous Internet of Things (IoT) systems, this paper proposes an AI algorithm for data enhanced encryption used in the ends and the intermediate nodes of IoTs. The algorithm in this paper first constructs a three-dimensional Arnold transformation matrix for data unit value encryption in the end of IoTs, and designs a quantum logic intelligent mapping that effectively diffuses the encrypted data units to reduce the linear correlation of the image data and to improve the security performance of IoT edge data. Furthermore, the algorithm designs an AI access strategy for scrambling sequence nodes and builds a random-access route for the elements of the scrambling sequence which can reduce the calculation cost and improve the operating efficiency of IoT system in the ends and intermediate nodes. Finally, the data shared matrix is used to share the encrypted data to achieve the (k, n) threshold strategy. Experimental results prove that the algorithm has high plaintext and key sensitivity and can effectively resist brute force attacks, statistical analysis and differential attacks. The algorithm in this paper provides an AI solution for data security encryption in the ends and the intermediate nodes of autonomous IoT systems.

In this paper, we study a wireless networked control system (WNCS) with N ⩾ 2 sub-systems sharing a common wireless channel. Each sub-system consists of a plant and a controller and the control message must be delivered from the controller to the plant through the shared wireless channel. The wireless channel is unreliable due to shadowing and fading. As a result, a packet can be successfully delivered in a slot with a certain probability. A network scheduling policy determines how to transmit those control messages generated by such N sub-systems and directly influences the transmission delay of control messages. We first consider the case that all sub-systems have the same sampling period. We characterize the stability condition of such a WNCS under the joint design of the control policy and the network scheduling policy by means of 2N linear inequalities . For scalar systems, we further simplify the stability condition into only one linear inequality for two special cases: the perfect-channel case and the symmetric-structure case. One main technical contribution of this paper is to introduce the recent results on the network scheduling policy design for delay-constrained wireless communications into the analysis of WNCSs. In addition, we have applied our theory to a practical problem of stabilizing multiple pendulum-cart sub-systems over a shared wireless channel. Simulations show that our joint design effectively achieves better performance than existing baseline.

Internet technology, as a product of the development of the network era, connects a large number of hardware devices, but the connection of many devices makes its corresponding security be greatly tested. The network security technology and the corresponding computer hardware security technology have become the focus of people's attention. At the same time, the construction of multimedia database based on this related technology has become the development trend of people's research and attention. Most of the conventional computer security technology focuses on the security construction of the operating system, which has certain openness, so its corresponding reliability is very low, but also uncontrollable. Based on this, this paper proposes a design scheme of the public security architecture on the embedded terminal, and realizes the design of the multimedia security broadcast control system based on this scheme, and realizes the play and storage of multimedia files, as well as the interaction between the corresponding media servers. The wireless network embedded security terminal designed in this paper includes client terminal identity authentication, corresponding media content protection and storage, and real-time broadcast content monitoring. Finally, the experiment is carried out based on the proposed design scheme. The experimental results show that the embedded security terminal proposed in this paper has obvious performance advantages, and its correctness and availability have been verified in practice.

Reasonable channel selection and allocation is the basis and premise of fair routing protocol design in information physical fusion system. In this paper, a channel allocation optimization algorithm for hybrid wireless mesh networks is proposed for the information physical fusion system. A new channel allocation model is designed, which uses greedy algorithm to select the channel with the least interference for the wireless network link. Based on the spatiotemporal multi interface and multi-channel allocation optimization algorithm, a joint channel allocation algorithm based on greedy algorithm is proposed in this paper. The communication between nodes is artificially divided into continuous sub time periods, but the communication between nodes cannot be guaranteed to exist in a certain period of time. The communication lines between nodes can be determined to avoid the shortcoming because the shortest path is used as the index to allocate the communication path.

This paper investigates secure bipartite consensus tracking of linear multi-agent systems under denial-of-service(DoS) attacks by using event-triggered control mechanism with data sampling. Both bipartite leader-following and containment tracking consensus are considered in this paper. The event-triggered control protocol using sampled-data information is designed to save limited resources. The communication channels are interrupted by intermittent DoS attacks. Sufficient conditions on the sampling periods, attack frequency and attack duration are obtained to ensure secure bipartite tracking consensus of the multi-agent systems. Finally, simulation example is provided to illustrate the effectiveness of the theoretical results.

This paper addresses the maintenance of a communication network in which mobile agents are connected to their nearest neighbours. While all agents are able to move individually, the geometrical relation to each other changes along their trajectories. The main idea is to develop distributed algorithms which enable the agents to monitor and to switch communications links in real time so that the overall network topology equals a Delaunay triangulation at any time. It is shown which information has to be stored locally by each agent and exchanged among the agents via digital communication. The paper closes with an experimental evaluation of the proposed methods.

With the rapid development of intelligent hardware and the Internet of Things, the bandwidth and resource utilization efficiency of related networks need to be improved. At the same time, the corresponding communication spectrum is becoming more and more scarce. At present, cognitive D2D communication technology in 5G network can establish communication link directly through communication equipment, so that two established communication equipment can realize direct communication, so as to make full use of communication resources and finally meet the explosive growth of traffic demand. How to manage communication resources and select communication links is the main research direction of D2D communication technology in 5G technology. Based on the knowledge of game theory, this paper proposes a communication channel allocation scheme and resource optimization scheme based on spectrum clustering and non cooperative game to maximize the operation efficiency of D2D communication equipment. The actual efficiency can reach about 1.5 times of the original communication efficiency. Finally, the optimization method proposed in this paper is compared with the traditional communication method. The experimental results show that this method has higher advantages.

As a new type of network, the types of attack in the Internet of Vehicles (IoV) are constantly emerging and changing. Consequently, the machine learning based intrusion detection model has to update to cope with new attacks. However, existing machine learning based IoV intrusion detection schemes require large amounts of labeled data to complete model updates. For new attacks, the IoV cloud is also difficult to identify in time, which requires a lot of labor and time cost in IoV. To solve above issue, this paper employs transfer learning and proposes two model update schemes based on whether the IoV cloud can timely provide a small amount of labeled data for a new attack. The first one is the cloud-assisted update scheme where the IoV cloud can provide a small amount of data. And the second one is the local update scheme where the IoV cloud cannot provide any labeled data timely. In this paper, the local update scheme obtains pseudo label of the unlabeled data in new attacks via pre-classifies and uses the pseudo-labeled data for multiple rounds of transfer learning. Then the vehicle can complete the update without obtaining any labeled data through the IoV cloud. The experimental results show that compared with the existing method, our two schemes have improved the detection accuracy by at least 23%.

This paper analyzes the network architecture of the Iridium system, Orbcomm system, Narrow Band-Internet of Things (NB-IoT) and Long Range Radio (Lo Ra) in the satellite 5G mobile communication system. A new Dynamic Routing based on Multi-factor Forwarding (MF-DR) protocol is proposed. This paper simulates the ladder-type data fusion algorithm in terms of energy consumption in the Wireless Sensor Network (WSN), the number of surviving nodes in the WSN, the communication traffic in the WSN, and the applicability of the ladder-type fusion algorithm. This verifies the superiority of the improved data fusion algorithm.

The growing demand of users for video streaming services has brought huge challenges to the streaming media service system. The cooperative edge-cloud computing architecture that combines cloud computing and edge computing can effectively reduce the burden on streaming media service systems. The streaming content caching under the cooperative edge-cloud computing architecture is important to improve the quality of user service. Based on this, this paper proposed a cache strategy based on user mobility and content popularity. In this cache strategy, the Markov model is used to describe the user mobility, the multiple linear regression model is used for content popularity prediction, and the content caching operation is performed according to the user mobility and the content popularity. To reduce the load of edge servers and further improve the quality of user service, this paper proposed a content placement strategy based on marginal gain. In this content placement strategy, a content placement problem is established by considering the content access latency and the content placement cost. Then a content placement algorithm based on marginal gain is proposed to solve the content placement problem. The content placement operation is performed by analyzing the marginal gain brought by placing the contents on edge servers to achieve the optimal performance of content placement. The experimental results show that the proposed strategies can effectively improve the performance in terms of the cache hit ratio, the content access latency, the storage cost and the remote data access cost.

Enhancement of the life time of sensor network is an important task. Routing of packet in a network plays a major impact on the energy utilization of nodes in a network. To increase the life time of network and to reduce the energy utilization of node, a new Dijkstra based routing management algorithm is proposed. This paper provides a solution to find the shortest path to route the packet from source to sink. The Dijkstra’s routing management has been chosen for the effective management of the energy efficiency in network. In this method, using the weight factor of the node, the connection cost between the nodes are calculated and it is estimated through the amount of energy spent by the node from the source to sink. In DRM method, the energy efficiency is achieved by finding the shortest route from source node to destination node and the number of hops of a node from source to sink is based on the size of the network. In this paper the new Dijkstra’s routing management algorithm has been discussed and the results are compared, with the existing distance based, Dijkstra’s routing method in the aspect of packet loss and successful packet transmission. When experimented with 50 nodes the results shows that the packet loss in DRM is 3 and successful transmission is 22 and in DDRM the packet loss and transmission is about 7 and successful transmission is 17.The percentage of dead nodes is 32% in DDRM; where 11% in DRM. This shows that the Dijkstra’s routing management algorithm gives more deterministic performance compared to the distance-based routing Management method.

The prominent capacities of 5G New Radio (5G NR) cellular networking drive the rapid development of many fields. The ubiquitous implementations of 5G NR cellular networking also provide swarm Unmanned Aircraft System (UAS) networking the feasibility of scalable deployment and smart control. However, the conveniences derived from 5G NR also bring other vulnerabilities to swarm UAS networking. The advanced capacities of 5G NR enable attackers to commit disruptive attacks to swarm UAS networking more severely and quickly. The requirement for the security of swarm UAS networking is imminent. In this paper, we propose a lightweight Blockchain-based secure routing algorithm for swarm UAS networking. We leverage the lightweight Blockchain to enhance the security of routing of swarm UAS networking which is based on 5G NR cellular networking. Different from the conventional routing algorithms, the proposed algorithm with lightweight Blockchain can avoid the malicious connections from attackers, recognize the malicious UASs and mitigate the attacks from malicious UASs. Concurrently, the proposed algorithm are swarm UAS oriented which aims to extend the deployment of swarm UAS networking on a large scale. Compared with Proof-of-Work (PoW) and Proof-of-Stake(PoS), we adopt pheromone to estimate the traffic status of each UAS in swarm UAS networking, construct consensus for swarm UAS networking with Proof-of-Traffic (PoT) and synchronize the updated blocks for lightweight Blockchain passively under the constraints of energy consumption. The evaluation shows PoT can reduce the routing consumption in the processes of consensus construction and blocks synchronization. Compatible with the constrained resource of swarm UASs, the lightweight Blockchain-assisted approach, proposed in this paper, can maintain the efficiency of swarm UAS networking.

With the increasing popularity of smart user equipments (UEs), numerous exciting wireless big data services are coming into life. However, due to the constraints of physical size, UEs are struggling with limited battery energy and computation capacity. In this paper, we propose a multi-user vehicle-aided multi-access edge computing (MEC) network architecture by deploying parked vehicles as the temporary computation service providers. A dynamic pricing strategy is proposed to minimize the energy consumption of UEs under the constraints on quality of service while maximize mobile service providers (MSPs)’ revenue. A differential evolution (DE) algorithm is proposed to determine UE’s fine-grained offloading decision. Moreover, a Q-learning algorithm is utilized to assist the DE algorithm in selecting the proper unit service price. The results show that the proposed dynamic pricing strategy can achieve better performance than the fixed pricing strategy and the differential pricing strategy regarding the overall cumulative cost. In addition, the proposed approach promises higher resource efficiency in comparison with all local execution and random offloading algorithms. The results obtained in this paper can be applied to design the future healthcare service pricing scheme of the IoT-based intelligent system.

The aim of this paper is to point out the importance of port throughput in terms of fulfilling its basic tasks related to loading/unloading of cargo. Maritime and inland ports are a significant component of the efficient functioning of many countries’ economies. Their basic activity is mainly focused on loading/unloading of cargo in various variants of work. The total amount of cargo transferred during the navigation period is expressed as port capacity. Navigation period represents the number of days. During these days it is possible to transport cargo on the waterway by vessels. Increasing the throughput is important, especially in terms of the port’s revenue and the discharge of its financial budget. Knowledge how to increase the throughput allows to make a full use of the potential of the port and to propose its possibilities for its development. By pointing to the individual components of throughput and their impact on the efficient functioning of ports, it forms the basis for the creation of effective components. And these components are key factor in the development of loading/unloading activities and ultimately the port itself. So, the results of this paper are focused on better using of port facilities and port operations.

In the wireless communication, nowadays Flying adhoc network or UAV networks hold the most important place in the field of recent research topic. The drones or Un manned aerial vehicles which are enabled with camera, special circuit, sensors and advanced communication systems are coordinated among each other under the Network called as Flying adhoc network. FANET plays vital role in both military and civil applications. In spite of all these pros there are some unavoidable challenges and issues bonds around FANET. Since FANET possess the characteristics of dynamic rapid changing mobility, the choice of Routing protocol in FANET also open wide space in the field of Research. In our previous papers the topology based Routing protocols are analysed under different network scenarios and described the best performed one. It has been also found that the type OLSR is the better choice of FANET in terms of delay, Network load, Throughput and retransmission attempts. The OLSR routing protocol mechanism depends on the link state algorithm. It is proactive and table driven in nature. In order to maintain the topology information of the network, it completely supports the periodic exchanges of messages among themselves. OLSR is good in compacting the size of information sent in the messages. It avoids flooding by controlling the retransmissions. To exhibits this, the protocol utilizes multi point relaying techniques. It also provides optimal routes and this is completely suitable for dense and large networks. In this paper the performance of OLSR is investigated and analysed under 4 different network scenarios and different data rates. In a simulation using OPNET, the results show that the Optimized link state routing protocol has greater improved key indicators.

How to realize data transmission between Intranet and extranet devices in physical isolation is an important problem. QR code can be used to identify text, image information, can be used as a carrier of information exchange. In this paper, QR code technology is used to propose a data transmission system between the Internet and the Internet under the physical isolation state based on visual recognition, which makes the information transmitted only through visible light, enhances the confidentiality, and can meet the daily office needs. At the sending end, the division of the transferred file is completed and multiple corresponding QR codes are generated. After the receiving end scans and recognizes the QR code, it finally forms a complete file identical to the original file. Then, the multi-QR code picture transmission was upgraded to the QR code stream transmission mode, and the transmission efficiency was improved by more than 10 times compared with similar work. In face of the real needs, we have added the function of retrieving pictures or database information from another computer and sending it back to the sending computer according to the instructions of the sending end. The paper also carries on the test analysis to each work.

With the fast-emerging trend of deploying Internet-of-things (IoT) in smart homes and cities, next-generation wireless systems (i.e., beyond fifth-generation (5G) of wireless mobile communications) are expected to connect a plurality of devices, including machines, sensors, tablets, cameras, etc. To this end, the radio frequency (RF) spectrum would fail to fulfill the demands of such enormous data-heavy wireless applications, as operating at the RF spectrum would largely suffer from data congestion and interference. Based on the potential of Visible Light Communications (VLC) to solve the problem of spectrum scarcity and satisfy the high data-rate requirements of beyond 5G systems, this paper focuses on utilizing VLC for IoT applications in indoor environments by means of adequately routing data among VLCbased nodes. Operating at the unlicensed optical band in the visible light region utilizes simple Light-Emitting-Diodes (LEDs), which is a health-friendly communication method. VLC has the advantages of providing ultra-high bandwidth, robustness to electromagnetic interference, and inherent physical security. VLC, however, suffers from severe short communication ranges and line-of-sight (LoS) constraints. This paper proposes overcoming such challenges by means of adopting a transmit diversity scheme that transmits messages over several paths. In order to reduce the receiver outage probability, the paper proposes multiple combination schemes at the receiver side, namely selection combining, maximal-ratio combining, and threshold combining. The simulation results assess the effectiveness of the proposed diversity schemes in terms of signal-to-noise-ratio and outage probability and illustrate the suitability of deploying VLC for next-generation indoor networks. The results show that that maximal-ratio combining outperforms selection combining and threshold combining by approximately 10% and 40%, respectively.

In the secure multicast communication, data is transmitted in such a manner that only authorized group members are able to receive the data. The main challenging issue in dynamic and secure multicast communication is to design a centralized group key distribution protocol with minimum computation and storages complexity. This paper, proposes a more efficient centralized group key distribution (CGKD) protocol that minimizes the computation cost of key server (KS) during key updating. The computation cost of members is balanced during key recovery. This reduction in computation cost of KS is achieved by performing one addition, one multiplication and one encryption during single member join and one subtraction, one division and one encryption during a single member leave operation. Moreover, the storage complexity of KS is also minimized. Further, this paper also proposes an extended CGKD protocol based on clustered tree which is very scalable and efficient to deal with enormous membership changes. By comparing with existing similar protocols, the proposed protocol has significantly reduced computation and storage complexity of KS while maintaining less and balanced communication overhead of KS and storage load of each group member. The proposed protocol is implemented and tested on key-star and cluster tree based structure. The experimental results show that the proposed protocol is efficient in terms of computational overhead of KS and group members.

Google published the first release of the Bottleneck Bandwidth and Round-trip Time (BBR) congestion control algorithm in 2016. Since then, BBR has gained a widespread attention due to its ability to operate efficiently in the presence of packet loss and in scenarios where routers are equipped with small buffers. These characteristics were not attainable with traditional loss-based congestion control algorithms such as CUBIC and Reno. BBRv2 is a recent congestion control algorithm proposed as an improvement to its predecessor, BBRv1. Preliminary work suggests that BBRv2 maintains the high throughput and the bounded queueing delay properties of BBRv1. However, the literature has been missing an evaluation of BBRv2 under different network conditions. This paper presents an experimental evaluation of BBRv2 Alpha (v2alpha-2019-07-28) on Mininet, considering alternative active queue management (AQM) algorithms, routers with different buffer sizes, variable packet loss rates and round-trip times (RTTs), and small and large numbers of TCP flows. Emulation results show that BBRv2 tolerates much higher random packet loss rates than loss-based algorithms but slightly lower than BBRv1. The results also confirm that BBRv2 has better coexistence with loss-based algorithms and lower retransmission rates than BBRv1, and that it produces low queuing delay even with large buffers. When a Tail Drop policy is used with large buffers, an unfair bandwidth allocation is observed among BBRv2 and CUBIC flows. Such unfairness can be reduced by using advanced AQM schemes such as FQ-CoDel and CAKE. Regarding fairness among BBRv2 flows, results show that using small buffers produces better fairness, without compromising high throughput and link utilization. This observation applies to BBRv1 flows as well, which suggests that rate-based model-based algorithms work better with small buffers. BBRv2 also enhances the coexistence of flows with different RTTs, mitigating the RTT unfairness problem noted in BBRv1. Lastly, the paper presents the advantages of using TCP pacing with a loss-based algorithm, when the rate is manually configured a priori. Future algorithms could set the pacing rate using explicit feedback generated by modern programmable switches.

© 2018 Elsevier B.V. As we progress in into a digital era where most aspects of our life depend upon a network of computers, it is essential to focus on digital security. Each component of a network, be it a physical network, virtual network or social network requires security when transmitting data. Hence the dynamic wireless mesh network must also deploy high levels of security as found in current legacy networks. This paper presents a secure Geo-Location Oriented Routing (Secure-GLOR) protocol for wireless mesh networks, which incorporates a hybrid encryption scheme for its multilevel security framework. The hybrid encryption technique improves the network's overall performance compared to the basic encryption by using a combination of symmetric key as well as asymmetric key encryption. Using the combination of the two encryption schemes, the performance of the network can be improved by reducing the transmitted data size, reduced computational overhead and faster encryption–decryption cycles. In this paper discussed multiple encryption schemes for both symmetric and asymmetric encryption, compare their performance in various experimental scenarios. Proposed security scheme achieves better performance based on the results obtained with most viable options for our network model.

The Internet of Things (IoT) is the core infrastructure of the smart city information system. With the explosive growth of IoT devices, how to securely maintain the important data generated by IoT devices has become an important issue. In the conventional IoT-cloud based infrastructure, the sensitive IoT data was stored in a third cloud service provider. However, in such a manner, the private IoT data may be disclosed by the cloud server since the cloud server knows all the data stored in it. This paper, for the first time, proposes a decentralized secure mechanism based on the blockchain technique to store the important data generated in the IoT system. This mechanism effectively solves the data reliability, security and privacy issues that may be encountered in the conventional IoT-cloud system. Considering the defects of simplified payment verification used by light nodes in blockchain networks, this paper proposes an Unspent Transaction Output (UTXO) verification mechanism based on the RSA accumulator, which makes the computational complexity of light nodes to generate and verify the UTXO proof to be constant. The proposed mechanism not only provides proof of inclusion but also supports efficient proof of exclusion for a lightweight node. Our experiment results indicate that the proposed scheme is practical and efficient.

The demand for digital media services is increasing as the number of wireless subscriptions is growing exponentially. In order to meet this growing need, mobile wireless networks have been advanced at a tremendous pace over recent days. However, the centralized architecture of existing mobile networks, with limited capacity and range of bandwidth of the radio access network and low bandwidth back-haul network, can not handle the exponentially increasing mobile traffic. Recently, we have seen the growth of new mechanisms of data caching and delivery methods through intermediate caching servers. In this paper, we present a survey on recent advances in mobile edge computing and content caching, including caching insertion and expulsion policies, the behavior of the caching system, and caching optimization based on wireless networks. Some of the important open challenges in mobile edge computing with content caching are identified and discussed. We have also compared edge, fog and cloud computing in terms of delay. Readers of this paper will get a thorough understanding of recent advances in mobile edge computing and content caching in mobile wireless networks.

In recent years, AR (Augmented Reality) technology has gradually entered people’s horizons and has become a research hotspot in the field of image processing. At the same time, the mobility and interactivity of AR have also been valued. This paper studies the interaction technology in the AR scene, and proposes a scheme to detect the user’s gaze at the cone perspective. The Leapmotion body sensor was used for gesture extension, and the hardware connection and data transmission scheme of Leapmotion and Holo Lens was designed. Based on the three input modes of sight, gesture and voice, the interaction logic between the user and the system in the AR scene is designed. The network of the Internet of Things is dominated by wireless sensor networks (Wireless Sensor Networks). This paper studies the problem of congestion in wireless sensor network sensing data transmission. WSNs nodes need to transmit the sensed data or preprocessed sensed data to sink nodes. When the data packets (or packets) received by a sensor node exceed its upper limit for forwarding or processing data packets, the excess data packets need to be buffered. When the memory of cached packets is full, excess packets are discarded, causing buffer overflows and causing node-level congestion. This paper proposes an energy balance strategy based on feedback control. The feedback control algorithm is used to adjust the node’s transmit power to realize the redistribution of node load in the network, solve the problem of node energy imbalance in wireless sensor networks, and further extend the sensor network.

In the classic gossip-based model of communication for disseminating information in a network, in each time unit, every node $u$ is allowed to contact a single random neighbor $v$. If $u$ knows the data (rumor) to be disseminated, it disperses it to $v$ (known as PUSH) and if it does not, it requests it from $v$ (known as PULL). While in the classic gossip model, each node is only allowed to contact a single neighbor in each time unit, each node can possibly be contacted by many neighboring nodes. In the present paper, we consider a restricted model where at each node only one incoming request can be served. As long as only a single piece of information needs to be disseminated, this does not make a difference for push requests. It however has a significant effect on pull requests. In the paper, we therefore concentrate on this weaker pull version, which we call 'restricted pull'. We distinguish two versions of the restricted pull protocol depending on whether the request to be served among a set of pull requests at a given node is chosen adversarially or uniformly at random. As a first result, we prove an exponential separation between the two variants. We show that there are instances where if an adversary picks the request to be served, the restricted pull protocol requires a polynomial number of rounds whereas if the winning request is chosen uniformly at random, the restricted pull protocol only requires a polylogarithmic number of rounds to inform the whole network. Further, as the main technical contribution, we show that if the request to be served is chosen randomly, the slowdown of using restricted pull versus using the classic pull protocol can w.h.p. be upper bounded by $O(\Delta / \delta \log n)$, where $\Delta$ and $\delta$ are the largest and smallest degree of the network.

In this paper, we proposed an improvement of SET protocol for E-commerce transaction. We study the security technology and protocol flow of set protocol, and point out the shortcomings of SET protocol. Due to the lack of security and low scalability of the current protocol, this paper proposes a server e-wallet strategy, which divides the original client into e-wallet client and e-wallet server, and enhances the convenience and security of the transaction by transferring the client to the issuer or the third-party financial institution, while the scalability is stronger. In order to ensure the atomicity of goods and confirm the atomicity of delivery, this paper proposes a secure e-commerce payment protocol based on the fourth party, which includes master protocol, customer return protocol, customer exchange protocol and customer merchant transaction dispute resolution protocol. According to the efficiency of SET protocol, a security hierarchical control model is proposed, which can select different security levels to operate according to the actual needs of customers, and the principle and implementation of the model are analyzed.

With the rapid development of computer technology and Internet of things technology, the concept of intelligent city is becoming more and more clear, and the construction of information-based city has gradually become the focus of all countries. However, in the concept of smart city, Internet of things technology is one of its key core technologies. At the same time, the construction of information system in intelligent city system is also the key problem to be solved and optimized. In this paper, the core technologies of the Internet of things and the Internet are taken as the basis of the intelligent city information system architecture, and an innovative intelligent city information system platform based on edge fog computing is proposed. On this platform, we will make full use of the lightweight fog computing virtual technology among terminal equipment, cloud server and edge fog computing network layer to provide the whole information system. The functions of storage and calculation can solve the problems of the traditional intelligent city information system, such as the pressure of network bandwidth, time extension and so on. Finally, based on the intelligent city information system proposed in this paper, the intelligent city information system of typical cities is constructed. The experimental results show that the algorithm proposed in this paper has obvious advantages in the running speed and the convergence of the corresponding algorithm.

With the rise of intelligent hardware and the rapid development of the Internet of Things, its security issues are also facing severe challenges. Internet of things devices are often limited devices with limited computing power and limited resource space. Therefore, a lightweight security solution needs to be designed specifically for this purpose. The purpose of this article is to study the method of IoT device access and network communication based on MQTT (Message Queuing Telemetry Transport). Based on the MQTT protocol and the theoretical foundation of Wi-Fi technology, this paper proposes a Wi-Fi distribution network optimization scheme and terminal communication method, and sets up a system test platform. The experiment proves that the communication method of the IoT terminal equipment based on MQTT proposed in this paper can reliably and flexibly implement the communication function of the equipment and meet the communication needs of the IoT system. According to the performance of the Wi-Fi access configuration method, this paper tests the performance of transmitting information with lengths of 10 bytes, 30 bytes, 50 bytes, and 70 bytes, respectively, the average time of the distribution network is 0.6692s, 1.3546s, 2.8600s, 4.7319s, all rates are 100%. It can be seen that the system has a higher efficiency in network distribution.

Future communication networks may encounter various issues in order to facilitate heavy heterogeneous data traffic and large number of users, therefore more advanced multiple access (MA) schemes are being developed to meet the changing requirements. The research space on making more robust MA scheme is continuously increasing, so it becomes significant to analyze the various schemes to determine the appropriate MA scheme for 5G networks. Therefore, in this paper the comprehensive overview of the most popular and recent MA schemes is presented for 5G networks. This paper mainly classifies the MA techniques in orthogonal MA (OMA) and various types of non-OMA (NOMA) techniques. Specifically, we introduce RSMA (Rate splitting multiple access) and IDMA (interleave division multiple access). Further the close attention is paid to NOMA family, including code-domain NOMA (e.g., SCMA (sparse code multiple access)), power-domain NOMA. Above all, from this exploration, the opportunities and challenges could be notified in MA schemes and further the optimum MA technique can be point out among discussed MA schemes for 5G and beyond communication networks.

With wireless mesh networks widely deployed in daily life, more and more researchers have begun to put their eyes on the problem of resource allocation and load balancing as well as networking security in wireless mesh networks. The admission control strategy takes great advantages in resource allocation and network load, thus having been widely applied in wireless networking. To maximize the benefits of game participants, it is essential to build an effective admission control model for user admission and resource allocation. Game theory, as an effective analytical modeling tool, is widely used in wireless networking researches. The access points determine whether to allow user’s access according to the admission control mechanism, for which this paper investigates resource allocation in wireless mesh networks. Our main works and contributions are as follows. Firstly, this paper analysis the importance of admission control in wireless mesh network, and addresses the problem of resource allocation and user admission control with game theory on the basis of existing researches. Secondly, this paper depicts the architecture and features of wireless mesh network as well as the functionality of admission control. Then, an admission control algorithm with the non-cooperative game theory for bandwidth and connections allocation in each network area is proposed based on the networking coverage, in which the Nash equilibrium existence is proved. This paper evaluates the proposed algorithm with blocking rate and system efficiency in the networks, which indicates that it is effective and efficient to allocate resource for each area dynamically.

In-network caching is considered to be a vital part of the Internet for future applications (e.g., Internet of Things). One proposal that has attracted interest in recent years, Named Data Networking (NDN), aims to facilitate in-network caching by locating content by name. However, the efficiency of in-network caching has been questioned by experts. Data correlation among caches builds strong dependencies between caches at the edge and in the core. That dependency makes analyzing network performance difficult. This paper proposes CCndnS (Content Caching strategy for NDN with Skip), a caching policy to break the dependencies among caches, thus facilitating the design of an efficient data placement algorithm. Specifically, each cache – regardless of its location in the network – should receive an independent set of requests; otherwise, only misses from downstream caches make their way to the upstream caches, i.e. a filtering effect that induces a correlation among the caches. CCndnS breaks a file into smaller segments and spreads them in the path between requester and publisher in a way that the head of the file (the first segment) should be cached at the edge router close to the requester and the tail far from the requester and towards the content provider. Requests for a segment skip searching caches in its path, to search only the cache with the segment of interest. That reduces the number of futile checks on caches, and thus the delay from memory accesses. This mechanism also decouples the caches, so there is a simple analytical model for cache performance in the network. We illustrate an application of the model to enforce a Service Level Agreement (SLA) between a content provider and the caching system proposed in this paper. The model can be used for cache provisioning for two purposes: (1) To specify the cache size to be reserved for specific contents to reach some desired performance. For instance, if the client of an SLA requires a 50% cache hit for its content at each router, the model can be used to determine the cache size that needs to be reserved to reach the 50% hit rate. (2) To calculate the effect of such reservations on other contents that use the routers covered by the SLA. The design, analysis, and application are tested with extensive simulations.

The development of Unmanned Aerial Vehicle (UAV) business requires that the wireless mobile network can provide the highest possible data rate with limited wireless resources and harsh channel environment, while ensuring the requirements of different quality of service (QoS). The present algorithm only considers one or two spatial sub channels with the maximum eigenvalue, and does not consider how to satisfy multiple requirements with limited resources, nor does it consider the problem of admission control. In order to solve the above problems, this paper proposes an intelligent resource dynamic allocation method based on QoS. In this paper, resources are managed effectively through resource reservation mechanism and selective QoS adjustment mechanism. Then, all non-zero eigenvalue space sub channels are used for data transmission to maximize channel capacity under the condition that the total transmission power is limited and user QoS requirements are met. The simulation results show that the algorithm can effectively improve the throughput of the system by making full use of multi-user diversity on the basis of satisfying the QoS requirements of users.