Search

In the world of connected devices with enormous application market, wireless sensor network comes with inherent challenges. Energy consumption balancing among the sensors affects its lifetime and connectivity. A hybrid approach for the randomly deployed sensor network is proposed in this paper with better consumption energy balance through the lifetime of the sensor network. An optimized threshold probability is analyzed for the improvement of network lifetime in comparison with stable election protocol. Simulation results provide improved consumption energy distribution and prolonged network lifetime of heterogeneous wireless sensor network. The proposed protocol is reactive to the change in the network, making it suitable for the Internet of Things applications. [ABSTRACT FROM AUTHOR]

In wireless sensor network projects, it is generally desired to cover the area to be monitored at a given cost and to achieve the maximum useful network lifetime. In the deployment of the wireless sensors, it is necessary to know in advance how many sensor nodes will be required, how much the distance between the nodes should be, etc., or what the transmit power level should be, etc. depending on the channel parameters of the area. This necessitates accurate calculation of variables such as maximum network lifetime, communication channel parameters, number of nodes to be used, and distance between nodes. As numbers reach to the order of hundreds, calculation tends to a NP hard problem to solve. At this point, we employed both single-based and stacked ensemble-based machine learning models to speed up the parameter estimations with highly accurate outcomes. Adaboost was superior over other models (Elastic Net, SVR) in single-based models. Stacked ensemble models achieved best results for the WSN parameter prediction compared to single-based models. [ABSTRACT FROM AUTHOR]

The performance of traditional AODV protocol will be sharply decreased in the scenario of large-scale VANET, which covers a wide range geographic space and contains a huge number of vehicles. This paper proposes an improved AODV routing protocol based on restricted broadcasting by communication zones for data transmitting in large-scale VANET. The whole network is divided into several communication zones according to the spatial distribution characteristic of inter-vehicle communication connectivity probabilities of road sections. The connectivity performance of the communication zone is evaluated using the grey correlation analysis method, in which both the historical and forecasting connectivity probabilities of road sections are considered. Following the maximum grey correlation degree principle, a series of key communication zones is selected to construct a restricted broadcasting area for route discovery in AODV. In the paper, the simulation scheme for the proposed AODV protocol in large-scale VANET scenario is also presented. Simulation results show that, compared with traditional AODV, the proposed improved protocol has advantages in packet delivery fraction, overhead and route setup time. [ABSTRACT FROM AUTHOR]

Identifying a trusted and secure route in an un-trusted environment is always a challenging problem. Lack of centralized infrastructure and dependence on other nodes for routing data, always pose security threats in ad hoc networks. So routing in ad hoc networks demands a secure end-to-end route that is free of malicious nodes for reliable packet forwarding. In this paper, we have designed a routing solution called Trust Based Dynamic Source Routing that enables the Dynamic Source Routing (DSR) Protocol to find a secure end-to-end route free of black hole nodes with cooperation from the neighbors. Also our solution can be able to protect the network in the presence of colluding attackers without the need of promiscuous monitoring the neighbor nodes. Extensive simulation has been carried out to evaluate the design of our protocol. The experiment results show that our protocol is able to achieve routing security with 42 % increase in packet delivery ratio and 37 % reduction in packet loss rate when compared to standard DSR under cooperative black hole attack. [ABSTRACT FROM AUTHOR]

A mobile ad hoc network is an infrastructureless network where the nodes are free to move independently in any directions. As the nodes have limited battery power so we require energy efficient route discovery scheme. This method reduces the cost of messages and energy consumption in nodes, thereby increasing the network throughput. In mobile communication, an ad hoc network refers to a network connection recognized for a single session. During route discovery phase, generally the route request packets generated by the source arrive at the destination through multiple paths. EXERP assigns weights to those paths depending on the expected duration of their links, number of links present in the path and energy efficiency of the routers. One of the routes with highest weight is elected as optimal path for communication between the corresponding pair of source and destination nodes. Simulation results clearly establish the fact that communication through energy-efficient link-stability conscious routes significantly reduces the message cost in the network. The main reason behind this improvement is reduction in link breakage due to node movement and battery exhaustion that saves cost of flooding route_request packets which would have been otherwise required to repair the broken links. Less message cost generates less signal collision and also saves battery power of nodes preserving the network connectivity as much as possible. Hence data packet delivery ratio increases up to a great extent. All these emphasize the efficiency of EXERP over other energy-efficient protocols. [ABSTRACT FROM AUTHOR]

Wireless mobile ad hoc networks are the special type of networks where a collection of mobile devices forms a temporary network without any established infrastructure aid. Having no central infrastructure and random devices movement cause some problems in ad hoc networks such as routing and security. Routing is a critical function in mobile ad hoc networks. The most important requirement for routing protocols is the capability to act in adversarial environments. In this article a secure routing algorithm is suggested to increase confidentiality and authentication in ad hoc routing protocols. The secure routing algorithm presented with two methods high secure AODV authenticated with asymmetric algorithms (HSAODV1) and high secure AODV authenticated with MAC algorithms (HSAODV2) which every one of them has two phases as follows: at the first phase of HSAODV1, the source, destination and intermediate nodes authenticate by using digital signature and asymmetric algorithms, and in the second phase, the protocol utilizes one way key-chain for increased data confidentiality. In the first phase of HSAODV2, the destination and intermediate nodes authenticate by using MAC algorithm for source node and the second phase operates approximately as the second phase of HSAODV1. In order to assess the functionality of these algorithms, security matrix, normalized routing overhead and energy consumption are evaluated for the proposed algorithm. [ABSTRACT FROM AUTHOR]

The characteristics of mobile ad hoc networks (MANETs) such as dynamic changing topology, lack of centralized management, and the vulnerability of links, have made MANETs security a real concern. It is notable that security in this area is still a challenging issue. Without having a trusted public authority, designing suitable security for this type of networking is troublesome. One of the important issues in security mechanisms which is based on RSA algorithms is the support of key-management infrastructure based on the concept of a certificate authority (CA). In this paper, we have employed the Cluster Based Routing Protocol (CBRP) as a Routing layer protocol to use unique features of the Cluster Based MANETs and to avoid traffic flooding. CBRP is a robust/scalable routing protocol for medium and large MANETs. We have also employed the cross-layering technique to reduce the number of exchanging packets and increase the speed of the network. In addition, we have introduced a new security key management mechanism based on the CA distribution in MANETs. We introduced a distributed CA mechanism based on cluster-based architecture to create a secure network that is highly adapted to the characteristics of ad hoc networks. Our experiment showed that the proposed protocol does not generate significant overhead in the network. The average energy consumption and end-to-end delay in this protocol are less than the Authentication Protocol Based on CBRP (APBC). [ABSTRACT FROM AUTHOR]