Wireless Sensor Networks (WSNs) are expected to find wide applicability and increasing deployment in near future. In this paper, we propose a new protocol, Threshold Sensitive Stable Election Protocol (TSEP), which is reactive protocol using three levels of heterogeneity. Reactive networks, as opposed to proactive networks, respond immediately to changes in relevant parameters of interest. We evaluate performance of our protocol for a simple temperature sensing application and compare results of protocol with some other protocols LEACH, DEEC, SEP, ESEP and TEEN. And from simulation results it is observed that protocol outperforms concerning life time of sensing nodes used.

Cybersecurity is a fast-evolving discipline that is always in the news over the last decade, as the number of threats rises and cybercriminals constantly endeavor to stay a step ahead of law enforcement. Over the years, although the original motives for carrying out cyberattacks largely remain unchanged, cybercriminals have become increasingly sophisticated with their techniques. Traditional cybersecurity solutions are becoming inadequate at detecting and mitigating emerging cyberattacks. Advances in cryptographic and Artificial Intelligence (AI) techniques (in particular, machine learning and deep learning) show promise in enabling cybersecurity experts to counter the ever-evolving threat posed by adversaries. Here, we explore AI's potential in improving cybersecurity solutions, by identifying both its strengths and weaknesses. We also discuss future research opportunities associated with the development of AI techniques in the cybersecurity field across a range of application domains.

With the rapid increase in social networks and blogs, the social media services are increasingly being used by online communities to share their views and experiences about a particular product, policy and event. Due to economic importance of these reviews, there is growing trend of writing user reviews to promote a product. Nowadays, users prefer online blogs and review sites to purchase products. Therefore, user reviews are considered as an important source of information in Sentiment Analysis (SA) applications for decision making. In this work, we exploit the wealth of user reviews, available through the online forums, to analyze the semantic orientation of words by categorizing them into +ive and -ive classes to identify and classify emoticons, modifiers, general-purpose and domain-specific words expressed in the public’s feedback about the products. However, the un-supervised learning approach employed in previous studies is becoming less efficient due to data sparseness, low accuracy due to non-consideration of emoticons, modifiers, and presence of domain specific words, as they may result in inaccurate classification of users’ reviews. Lexicon-enhanced sentiment analysis based on Rule-based classification scheme is an alternative approach for improving sentiment classification of users’ reviews in online communities. In addition to the sentiment terms used in general purpose sentiment analysis, we integrate emoticons, modifiers and domain specific terms to analyze the reviews posted in online communities. To test the effectiveness of the proposed method, we considered users reviews in three domains. The results obtained from different experiments demonstrate that the proposed method overcomes limitations of previous methods and the performance of the sentiment analysis is improved after considering emoticons, modifiers, negations, and domain specific terms when compared to baseline methods.

Sink mobility has attracted much research interest in recent years because it can improve network performance such as energy efficiency and throughput. An energy-unconscious moving strategy is potentially harmful to the balance of the energy consumption among sensor nodes so as to aggravate the hotspot problem of sensor networks. In this paper, we propose an autonomous moving strategy for the mobile sinks in data-gathering applications. In our solution, a mobile sink approaches the nodes with high residual energy to force them to forward data for other nodes and tries to avoid passing by the nodes with low energy. We performed simulation experiments to compare our solution with other three data-gathering schemes. The simulation results show that our strategy cannot only extend network lifetime notably but also provides scalability and topology adaptability.

With the mushroom growth of state-of-the-art digital image and video manipulations tools, establishing the authenticity of multimedia content has become a challenging issue. Digital image forensics is an increasingly growing research field that symbolises a never ending struggle against forgery and tampering. This survey attempts to cover the blind techniques that have been proposed for exposing forgeries. This work dwells on the detection techniques for three of the most common forgery types, namely copy/move, splicing and retouching.

Despite significant infrastructure improvements, cloud computing still faces numerous challenges in terms of load balancing. Several techniques have been applied in the literature to improve load balancing efficiency. Recent research manifested that load balancing techniques based on metaheuristics provide better solutions for proper scheduling and allocation of resources in the cloud. However, most of the existing approaches consider only a single or few QoS metrics and ignore many important factors. The performance efficiency of these approaches is further enhanced by merging with machine learning techniques. These approaches combine the relative benefits of load balancing algorithm backed up by powerful machine learning models such as Support Vector Machines (SVM). In the cloud, data exists in huge volume and variety that requires extensive computations for its accessibility, and hence performance efficiency is a major concern. To address such concerns, we propose a load balancing algorithm, namely, Data Files Type Formatting (DFTF) that utilizes a modified version of Cat Swarm Optimization (CSO) along with SVM. First, the proposed system classifies data in the cloud from diverse sources into various types, such as text, images, video, and audio using one to many types of SVM classifiers. Then, the data is input to the modified load balancing algorithm CSO that efficiently distributes the load on VMs. Simulation results compared to existing approaches showed an improved performance in terms of throughput (7%), the response time (8.2%), migration time (13%), energy consumption (8.5%), optimization time (9.7%), overhead time (6.2%), SLA violation (8.9%), and average execution time (9%). These results outperformed some of the existing baselines used in this research such as CBSMKC, FSALB, PSO-BOOST, IACSO-SVM, CSO-DA, and GA-ACO.

No abstract

SUMMARY Current distributed publish/subscribe systems consider all participants to have similar QoS requirements and contribute equally to the system's resources. However, in many real‐world applications, the message delay tolerance of individual participants may differ widely. Disseminating messages according to individual delay requirements not only allows for the satisfaction of user‐specific needs, but also significantly improves the utilization of the resources that participants contribute to a publish/subscribe system. In this article, we propose a peer‐to‐peer‐based approach to satisfy the individual delay requirements of subscribers in the presence of bandwidth constraints. Our approach allows subscribers to dynamically adjust the granularity of their subscriptions according to their bandwidth constraints and delay requirements. Subscribers maintain the overlay in a decentralized manner, exclusively establishing connections that satisfy their individual delay requirements, and that provide messages exactly meeting their subscription granularity. The evaluations show that for many practical workloads, the proposed publish/subscribe system can scale up to a large number of subscribers and performs robustly in a very dynamic setting. Copyright © 2011 John Wiley & Sons, Ltd.