Collaborative Life-Cycle-Based Botnet Detection in IoT Using Event Entropy

Author(s):  
Abdenacer Nafir ◽  
Smaine Mazouzi ◽  
Salim Chikhi

This paper introduces a collaborative and distributed method for botnet detection in massive networks such as internet of things (IoT) and wide area networks (WAN). The method is model-based and designed as a multi-agent system where the agents are situated on IoT devices. Every agent analyzes the events' entropies, then exchanges its decision with its neighbors aiming at establishing global decision if a botnet is ongoing to be installed within the network or not. Decisions spread over the network where a consensual dominant decision can emerge. In previous similar works, it was necessary to use some central hosts in order to compute global decisions. So, scalability is compromised, and the solution is not suited for massive networks such as IoT. The proposed approach does not require any central control, which allows it to be used in IoT and ad hoc networks. Furthermore, the botnet is detected at the early stage of its life-cycle. Conducted experiments have shown that the proposed approach is well suited for botnet detection in IoT and WAN.

Transport ◽  
2019 ◽  
Vol 35 (3) ◽  
pp. 327-335 ◽  
Author(s):  
Rajendran Sathiyaraj ◽  
Ayyasamy Bharathi

An efficient and intelligent road traffic management system is the corner stone for every smart cities. Vehicular Ad-hoc NETworks (VANETs) applies the principles of mobile ad hoc networks in a wireless network for Vehicle-to-vehicle data exchange communication. VANETs supports in providing an efficient Intelligent Transportation System (ITS) for smart cities. Road traffic congestion is a most common problem faced by many of the metropolitan cities all over the world. Traffic on the road networks are widely increasing at a larger rate and the current traffic management systems is unable to tackle this impediment. In this paper, we propose an Efficient Intelligent Traffic Light Control and Deviation (EITLCD) system, which is based on multi-agent system. This proposed system overcomes the difficulties of the existing traffic management systems and avoids the traffic congestion problem compare to the prior scenario. The proposed system is composed of two systems: Traffic Light Controller (TLC) system and Traffic Light Deviation (TLD) system. The TLC system uses three agents to supervise and control the traffic parameters. TLD system deviate the vehicles before entering into congested road. Traffic and travel related information from several sensors are collected through a VANET environment to be processed by the proposed technique. The proposed structure comprises of TLC system and makes use of vehicle measurement, which is feed as input to the TLD system in a wireless network. For route pattern identification, any traditional city map can be converted to planar graph using Euler’s path approach. The proposed system is validated using Nagel–Schreckenberg model and the performance of the proposed system is proved to be better than the existing systems in terms of its time, cost, expense, maintenance and performance.


In our previous papers, a new Ant Routing Protocol for Ad-hoc Networks inspired from ant colony optimization was presented. We introduced a new approach which decreases both of nodes energy consumption and routing overhead within the network. The validation of our routing protocol was based on series of simulation. The results show that our new algorithm provides a significant improvement compared to other protocols. After the algorithm is defined and published, we have found important to validate formally each one of its components in order to avoid any conflict, lack or misbehaving situations. This process requires in a first step a formal specification. This is our main concern in this paper where we propose in a first part a formal specification using inference systems based on logical rules. A formal validation using these inference systems is proposed in a second step in order to prove the correctness, the soundness, the completeness and the optimality of the proposition.


Author(s):  
S. Srinivasan ◽  
S. P. Alampalayam

Mobile ad hoc networks (MANET) present the opportunity to connect transient nodes to the internet without having central control. This very design supports new nodes to join and leave the network based on their proximity to the MANET. Concurrently, it creates many security challenges for authenticating nodes that are not present in a traditional wired network. Much of the existing work on MANET security has focused on routing and mobility. In this paper, the authors present an algorithm that considers the neighboring nodes’ status to determine if a particular node is malicious or not. The authors used NS2 simulation tool to test the algorithm and present the results in the paper. The major benefits of this research work are in military applications.


Author(s):  
Sudha Singh ◽  
D. K. Singh ◽  
Mr. Sudipta Mondal

The growth of laptop and 802.11/Wi-Fi wireless networking have made Mobile Ad hoc NETworks (MANETs) a popular research topic since the mid to late 1990s. Many academic papers evaluate protocols and abilities assuming varying degrees of mobility within a bounded space, usually with all nodes within a few hops of each other and usually with nodes sending data at a constant rate. Different protocols are then evaluated based on the packet drop rate, the overhead introduced by the routing protocols, and other measures. Research in MANET is like playing in a vast playground with only few known rules and large number of unknown rules applied to its different areas. Some areas are still unknown and some areas are at its early stage. Some of the research challenges that MANET present are dynamic topologies, battery lifetime, disconnected operations, security, et cetera. In general there are three types of MANET: vehicular ad hoc networks, intelligent vehicular ad hoc network, and Internet based mobile ad hoc networks. Each of these three types has its own research areas.


2009 ◽  
pp. 850-857
Author(s):  
John F. Bradley ◽  
Conor Muldoon ◽  
Gregory M.P. O’Hare ◽  
Michael J. O’Grady

A significant rise in the use of mobile computing technologies has been witnessed in recent years. Various interpretations of the mobile computing paradigm, for example, ubiquitous and pervasive computing (Weiser, 1991) and more recently, ambient intelligence (Aarts & Marzano, 2003)?have been the subject of much research. The vision of mobile computing is often held as one of “smart” devices operating seamlessly and dynamically, forming ad-hoc networks with other related devices, and presenting the user with a truly ubiquitous intelligent environment. This vision offers many similarities with the concept of distributed artificial intelligence where autonomous entities, known as agents, interact with one another forming ad-hoc alliances, and working both reactively and proactively to achieve individual and common objectives. This article will focus on the current state of the art in the deployment of multi-agent systems on mobile devices and smart phones. A number of platforms will be described, along with some practical issues concerning the deployment of agents in mobile applications.


Author(s):  
Mohamed Hamdy ◽  
Birgitta König-Ries

Service popularity, e.g., how often a service is requested, can be an important non-functional property determining the life-cycle of a service. To capture it, the requesting behavior of clients needs to be modeled. In this work, we introduce and discuss: the importance of the service popularity, a generalized requesting model that can capture the requesting behavior of clients, a service popularity measure called “Gross Interest,” and a Gross Interest quantification method. Two extremely different sets of specifications for the proposed generalized requesting model which produce two different Gross Interest scenarios (rich and poor scenarios) are introduced and quantified. As an application example for the service popularity, we show a service replication protocol for Mobile Ad Hoc Networks (MANETs) which realizes and employs service popularity in its replication decisions.


Sign in / Sign up

Export Citation Format

Share Document