Fog computing is an emerging computing paradigm that has come into consideration for the deployment of Internet of Things (IoT) applications amongst researchers and technology industries over the last few years. Fog is highly distributed and consists of a wide number of autonomous end devices, which contribute to the processing. However, the variety of devices offered across different users are not audited. Hence, the security of Fog devices is a major concern that should come into consideration. Therefore, to provide the necessary security for Fog devices, there is a need to understand what the security concerns are with regards to Fog. All aspects of Fog security, which have not been covered by other literature works, need to be identified and aggregated. On the other hand, privacy preservation for user’s data in Fog devices and application data processed in Fog devices is another concern. To provide the appropriate level of trust and privacy, there is a need to focus on authentication, threats and access control mechanisms as well as privacy protection techniques in Fog computing. In this paper, a survey along with a taxonomy is proposed, which presents an overview of existing security concerns in the context of the Fog computing paradigm. Moreover, the Blockchain-based solutions towards a secure Fog computing environment is presented and various research challenges and directions for future research are discussed.

Technological advancements have led to increased confidence in the design of large-scale wireless networks that comprise small energy constraint devices. Despite the boost in technological advancements, energy dissipation and fault tolerance are amongst the key deciding factors while designing and deploying wireless sensor networks. This paper proposes a Fault-tolerant Energy-efficient Hierarchical Clustering Algorithm (FEHCA) for wireless sensor networks (WSNs), which demonstrates energy-efficient clustering and fault-tolerant operation of cluster heads (CHs). It treats CHs as no special node but equally prone to faults as normal sensing nodes of the cluster. The proposed scheme addresses some of the limitations of prominent hierarchical clustering algorithms, such as the randomized election of the cluster heads after each round, which results in significant energy dissipation; non-consideration of the residual energy of the sensing nodes while selecting cluster heads, etc. It utilizes the capability of vector quantization to partition the deployed sensors into an optimal number of clusters and ensures that almost the entire area to be monitored is alive for most of the network’s lifetime. This supports better decision-making compared to decisions made on the basis of limited area sensing data after a few rounds of communication. The scheme is implemented for both friendly as well as hostile deployments. The simulation results are encouraging and validate the proposed algorithm.

Pastures are a vital source of dairy products and cattle nutrition, and as such, play a significant role in New Zealand’s agricultural economy. However, weeds can be a major problem for pastures, making it a challenge for dairy farmers to monitor and control them. Currently, most of the tasks for weed management are done manually, and farmers lack persistent technology for weed control. This motivated us to design, implement, and evaluate a Decision Support System (DSS) to detect weeds in pastures and provide decisions for the cleanup of weeds. Our proposed system uses two primary inputs: weeds and bare patches. We created a synthetic dataset to train a weed detection model and designed a fuzzy inference system to assess a pasture. We also used a neuro-fuzzy system in our DSS to evaluate our fuzzy model and tune its parameters for better functioning and accuracy. Our work aims to assist dairy farmers in better weed monitoring, as well as to provide 2D maps of weed density and yield score, which can be of significant value when no digital and meaningful images of pastures exist. The system can also support farmers in scheduling, recommending prohibitive tasks, and storing historical data for pasture analysis, collaborated by stakeholders.

Internet piracy is a significant ongoing problem for content producers and rights holders. Estimates of the cost of copyright infringement to the film and music industries range in the tens to hundreds of billions of dollars every year. The vast majority of this illegal content is shared using three key technologies: peer-to-peer (P2P) protocols such as BitTorrent, illegal file streaming, and one-click file hosting services (OCHs). The current dominant analogy for file- sharing, promoted by copyright holders and industry lobby groups, is one of 'copyright theft'; with content uploaders predominantly depicted as opportunists motivated by financial gain. Recently, academics from various disciplines have begun to question this narrative, proposing alternative models for understanding piracy based on the concept of the social or 'altruistic' sharer. In this paper, two OCH indexes were studied for insights into uploader dynamics. Results suggest that traditional understandings of Internet piracy are significantly limited in their ability to explain a number of aspects of the current OCH ecosystem. A significant number of uploaders are found to be behaving in ways that do not fit the traditional economic narrative; large numbers of users are making negligible money, and aggregate figures show a significant amount of uploaders are failing to take actions to appropriately maximise their hypothetical earnings.