Showing papers in "Wireless Networks in 2017"

A review of industrial wireless networks in the context of Industry 4.0

Abstract: There have been many recent advances in wireless communication technologies, particularly in the area of wireless sensor networks, which have undergone rapid development and been successfully applied in the consumer electronics market. Therefore, wireless networks (WNs) have been attracting more attention from academic communities and other domains. From an industrial perspective, WNs present many advantages including flexibility, low cost, easy deployment and so on. Therefore, WNs can play a vital role in the Industry 4.0 framework, and can be used for smart factories and intelligent manufacturing systems. In this paper, we present an overview of industrial WNs (IWNs), discuss IWN features and related techniques, and then provide a new architecture based on quality of service and quality of data for IWNs. We also propose some applications for IWNs and IWN standards. Then, we will use a case from our previous achievements to explain how to design an IWN under Industry 4.0. Finally, we highlight some of the design challenges and open issues that still need to be addressed to make IWNs truly ubiquitous for a wide range of applications.

A particle swarm optimization based energy efficient cluster head selection algorithm for wireless sensor networks

Abstract: Clustering has been proven to be one of the most efficient techniques for saving energy of wireless sensor networks (WSNs). However, in a hierarchical cluster based WSN, cluster heads (CHs) consume more energy due to extra overload for receiving and aggregating the data from their member sensor nodes and transmitting the aggregated data to the base station. Therefore, the proper selection of CHs plays vital role to conserve the energy of sensor nodes for prolonging the lifetime of WSNs. In this paper, we propose an energy efficient cluster head selection algorithm which is based on particle swarm optimization (PSO) called PSO-ECHS. The algorithm is developed with an efficient scheme of particle encoding and fitness function. For the energy efficiency of the proposed PSO approach, we consider various parameters such as intra-cluster distance, sink distance and residual energy of sensor nodes. We also present cluster formation in which non-cluster head sensor nodes join their CHs based on derived weight function. The algorithm is tested extensively on various scenarios of WSNs, varying number of sensor nodes and the CHs. The results are compared with some existing algorithms to demonstrate the superiority of the proposed algorithm.

A stable energy efficient clustering protocol for wireless sensor networks

Abstract: Sensor networks comprise of sensor nodes with limited battery power that are deployed at different geographical locations to monitor physical events. Information gathering is a typical but an important operation in many applications of wireless sensor networks (WSNs). It is necessary to operate the sensor network for longer period of time in an energy efficient manner for gathering information. One of the popular WSN protocol, named low energy adaptive clustering hierarchy (LEACH) and its variants, aim to prolong the network lifetime using energy efficient clustering approach. These protocols increase the network lifetime at the expense of reduced stability period (the time span before the first node dies). The reduction in stability period is because of the high energy variance of nodes. Stability period is an essential aspect to preserve coverage properties of the network. Higher is the stability period, more reliable is the network. Higher energy variance of nodes leads to load unbalancing among nodes and therefore lowers the stability period. Hence, it is perpetually attractive to design clustering algorithms that provides higher stability, lower energy variance and are energy efficient. In this paper to overcome the shortcomings of existing clustering protocols, a protocol named stable energy efficient clustering protocol is proposed. It balances the load among nodes using energy-aware heuristics and hence ensures higher stability period. The results demonstrate that the proposed protocol significantly outperforms LEACH and its variants in terms of energy variance and stability period.

Energy harvesting and battery power based routing in wireless sensor networks

Abstract: Wireless sensor networks (WSNs) are a collection of several small and inexpensive battery-powered nodes, commonly used to monitor regions of interests and to collect data from the environment. Several issues exist in routing data packets through WSN, but the most crucial problem is energy. There are a number of routing approaches in WSNs that address the issue of energy by the use of different energy-efficient methods. This paper, presents a brief summary of routing and related issues in WSNs. The most recent energy-efficient data routing approaches are reviewed and categorized based on their aims and methodologies. The traditional battery based energy sources for sensor nodes and the conventional energy harvesting mechanisms that are widely used to in energy replenishment in WSN are reviewed. Then a new emerging energy harvesting technology that uses piezoelectric nanogenerators to supply power to nanosensor; the type of sensors that cannot be charged by conventional energy harvesters are explained. The energy consumption reduction routing strategies in WSN are also discussed. Furthermore, comparisons of the variety of energy harvesting mechanisms and battery power routing protocols that have been discussed are presented, eliciting their advantages, disadvantages and their specific feature. Finally, a highlight of the challenges and future works in this research domain is presented.

A secure and trust based on-demand multipath routing scheme for self-organized mobile ad-hoc networks

Abstract: A mobile ad hoc network (MANET) is a self-configurable network connected by wireless links. This type of network is only suitable for provisional communication links as it is infrastructure-less and there is no centralized control. Providing QoS and security aware routing is a challenging task in this type of network due to dynamic topology and limited resources. The main purpose of secure and trust based on-demand multipath routing is to find trust based secure route from source to destination which will satisfy two or more end to end QoS constraints. In this paper, the standard ad hoc on-demand multi-path distance vector protocol is extended as the base routing protocol to evaluate this model. The proposed mesh based multipath routing scheme to discover all possible secure paths using secure adjacent position trust verification protocol and better link optimal path find by the Dolphin Echolocation Algorithm for efficient communication in MANET. The performance analysis and numerical results show that our proposed routing protocol produces better packet delivery ratio, reduced packet delay, reduced overheads and provide security against vulnerabilities and attacks.

Geographical awareness hybrid routing protocol in Mobile Ad Hoc Networks

Abstract: This paper proposes a geographical awareness routing protocol based on a hybrid routing protocol, the Zone Routing Protocol (ZRP), in Mobile Ad Hoc Networks (MANETs). ZRP is created from combining proactive routing protocol and on-demand routing protocol; therefore, it inherits the advantages of both these routing protocols. The long delay time of the on-demand routing protocol and the huge routing overhead of the proactive routing approach are reduced in ZRP. However, ZRP still produces a large amount of redundant routing overhead in the route discovery process, which not only wastes energy but also increases the workload of the network, while limited bandwidth is a challenge for MANETs. To mitigate routing overhead, a geographical awareness approach that is applied to limit the discovered route area in ZRP is proposed and is called the Geographical awareness ZRP (GeoZRP). Simulation results confirm that the proposed algorithm alleviates routing overhead and end-to-end delay with only a slightly decrease in the packet delivery ratio.

Network selection in heterogeneous wireless networks using multi-criteria decision-making algorithms: a review

Abstract: It is expected that next-generation wireless networks will provide a plethora of mobile wireless services to users and ubiquitous network coverage at all times. Meeting these expected goals requires that new and existing networks be seamlessly integrated together to form Heterogeneous Wireless Networks (HWNs). Thus, seamless and efficient handover mechanisms are pertinent for optimal network performance in HWNs; so that the mobile user can switch from one access network to another, in search of the best connection for the demanded services. The HWNs' performance can be reduced, if efficient network selection is not achieved. In HWNs, network-selection decisions can be evaluated by using multi-criteria, or a single criterion. However, network selection and decision-making in HWNs often involves taking into account a large number of complex and conflicting network-decision factors, or criteria. Thus multi-criteria decision-making techniques are more efficient than single-criterion techniques. Multi-Criteria Decision-Making (MCDM) techniques comprise of a developed branch of operational research for assisting in the resolution of complex decision-making problems. MCDM is an important tool that has been used to model and analyze handover-decisions and network-selection problems in HWNs. This paper reviews and classifies the most significant MCDM algorithms that have been used to address the network decision-making problems in HWNs in terms of algorithmic approach, the type of calls, the cardinality of decision criteria employed, handover-control points and the types of network utilities. Comprehensive step-wise mathematical implementations of the reviewed MCDM schemes are presented, while pointing out their strengths and limitations. This paper review fills a research gap in the investigation on network-selection criteria's interdependence and interactions, and their effects on criteria's weight of importance. It then provides an insight into the importance of network-criteria weighting and the current research trend in the application of MCDM algorithms to network-selection problems in HWNs.

A game theory based energy efficient clustering routing protocol for WSNs

Abstract: The energy constraint is one of the inherent defects of the Wireless Sensor Networks (WSNs). How to prolong the lifespan of the network has attracted more and more attention. Numerous achievements have emerged successively recently. Among these mechanisms designing routing protocols is one of the most promising ones owing to the large amount of energy consumed for data transmission. The background and related works are described firstly in detail in this paper. Then a game model for selecting the Cluster Head is presented. Subsequently, a novel routing protocol named Game theory based Energy Efficient Clustering routing protocol (GEEC) is proposed. GEEC, which belongs to a kind of clustering routing protocols, adopts evolutionary game theory mechanism to achieve energy exhaust equilibrium as well as lifetime extension at the same time. Finally, extensive simulation experiments are conducted. The experimental results indicate that a significant improvement in energy balance as well as in energy conservation compared with other two kinds of well-known clustering routing protocols is achieved.

Novel chemical reaction optimization based unequal clustering and routing algorithms for wireless sensor networks

Abstract: Energy conserving of sensor nodes is the most crucial issue in the design of wireless sensor networks (WSNs). In a cluster based routing approach, cluster heads (CHs) cooperate with each other to forward their data to the base station (BS) via multi-hop routing. In this process, CHs closer to the BS are burdened with heavier relay traffic and tend to die prematurely which causes network partition is popularly known as a hot spot problem. To mitigate the hot spot problem, in this paper, we propose unequal clustering and routing algorithms based on novel chemical reaction optimization (nCRO) paradigm, we jointly call these algorithms as novel CRO based unequal clustering and routing algorithms (nCRO-UCRA). In clustering, we partition the network into unequal clusters such that smaller size clusters near to the sink and larger size clusters relatively far away from the sink. For this purpose, we develop the CH selection algorithm based on nCRO paradigm and assign the non-cluster head sensor nodes to the CHs based on derived cost function. Then, a routing algorithm is presented which is also based on nCRO based approach. All these algorithms are developed with the efficient schemes of molecular structure encoding and novel potential energy functions. The nCRO-UCRA is simulated extensively on various scenarios of WSNs and varying number of sensors and the CHs. The results are compared with some existing algorithms and original CRO based algorithm called as CRO-UCRA to show the superiority in terms of various performance metrics like residual energy, network lifetime, number of alive nodes, data packets received by the BS and convergence rate.

CASMOC: a novel complex alliance strategy with multi-objective optimization of coverage in wireless sensor networks

Abstract: Coverage is a significant performance indicator of wireless sensor networks. Data redundancy in k-coverage raises a set of issues including network congestion, coverage reduction, energy inefficiency, among others. To address these issues, this paper proposes a novel algorithm called complex alliance strategy with multi-objective optimization of coverage (CASMOC) which could improve node coverage effectively. This paper also gives the proportional relationship of the energy conversion function between the working node and its neighbors, and applies this relationship in scheduling low energy mobile nodes, thus achieving energy balance of the whole network, and optimizing network resources. The extensive simulation results demonstrate that CASMOC could not only improve the quality of network coverage, but also mitigate rapid node energy consumption effectively, thereby extending the life cycle of the network significantly.

An overview of spectrum sharing techniques in cognitive radio communication system

Abstract: As the complexities of wireless technologies increase, novel multidisciplinary approaches for the spectrum sharing/management are required with inputs from the technology, economics and regulations. Recently, the cognitive radio technology comes into action to handle the spectrum scarcity problem. To identify the available spectrum resource, decision on the optimal sensing and transmission time with proper coordination among the users for spectrum access are the important characteristics of spectrum sharing methods. In this paper, we have technically overviewed the state-of-the-art of the various spectrum sharing techniques and discussed their potential issues with emerging applications of the communication system, especially to enhance the spectral efficiency. The potential advantages, limiting factors, and characteristic features of the existing cognitive radio spectrum sharing domains are thoroughly discussed and an overview of the spectrum sharing is provided as it ensures the channel access without the interference/collision to the licensed users in the spectrum.

Power-efficient routing schemes for MANETs: a survey and open issues

Abstract: Ubiquitous smart devices with embedded sensors are paving the way for mobile ad hoc networks (MANETs) that enable users to communicate directly, thereby playing a key role in Smart City and Internet of Things applications. In such smart environments, people with smart devices (nodes) can freely self-organize and form self-configuring MANETs to send and forward data packets to a destination over multiple hops via intermediate nodes. However, the energy consumption during routing remains a challenge in such ensemble mobile environments due to the limited battery capacity of mobile devices. This challenging issue has received substantial research attention, necessitating an exhaustive literature search over the variety of academic fields addressing this topic. The main motivation of this paper is to review various power-efficient routing schemes in MANETs that have recently been proposed to reduce the energy consumed when transmitting and receiving packets during active communication. Accordingly, these protocols are classified into six categories: (1) link state-based, (2) source-initiated-based, (3) transmission power control-based, (4) load-balancing-based, (5) location-based and (6) multicast-based routing approaches. The review covers various state-of-the-art protocols for each category and highlights their operation concepts, design challenges and key features. In addition, the various protocols are compared with emphasis on the merits and drawbacks as well as the considered metrics of each scheme. Finally, we provide a conclusion and suggest potential directions for future research in the field.

Delay and energy consumption analysis of priority guaranteed MAC protocol for wireless body area networks

Abstract: Wireless body area networks are captivating growing interest because of their suitability for wide range of applications. However, network lifetime is one of the most prominent barriers in deploying these networks for most applications. Moreover, most of these applications have stringent QoS requirements such as delay and throughput. In this paper, the modified superframe structure of IEEE 802.15.4 based MAC protocol is proposed which addresses the aforementioned problems and improves the energy consumption efficiency. Moreover, priority guaranteed CSMA/CA mechanism is used where different priorities are assigned to body nodes by adjusting the data type and size. In order to save energy, a wake-up radio based mechanism to control sleep and active modes of body sensors are used. Furthermore, a discrete time finite state Markov model to find the node states is used. Analytical expressions are derived to model and analyze the behavior of average energy consumption, throughput, packet drop probability, and average delay during normal and emergency data. Extensive simulations are conducted for analysis and validation of the proposed mechanism. Results show that the average energy consumption and delay are relatively higher during emergency data transmission with acknowledgment mode due to data collision and retransmission.

Energy efficient clustering algorithms for wireless sensor networks: novel chemical reaction optimization approach

Abstract: Clustering has been accepted as one of the most efficient techniques for conserving energy of wireless sensor networks (WSNs). However, in a two-tiered cluster based WSN, cluster heads (CHs) consume more energy due to extra overload for receiving data from their member sensor nodes, aggregating them and transmitting that data to the base station (BS). Therefore, proper selection of CHs and optimal formation of clusters play a crucial role to conserve the energy of sensor nodes for prolonging the lifetime of WSNs. In this paper, we propose an energy efficient CH selection and energy balanced cluster formation algorithms, which are based on novel chemical reaction optimization technique (nCRO), we jointly called these algorithms as novel CRO based energy efficient clustering algorithms (nCRO-ECA). These algorithms are developed with efficient schemes of molecular structure encoding and potential energy functions. For the energy efficiency, we consider various parameters such as intra-cluster distance, sink distance and residual energy of sensor nodes in the CH selection phase. In the cluster formation phase, we consider various distance and energy parameters. The algorithm is tested extensively on various scenarios of WSNs by varying number of sensor nodes and CHs. The results are compared with original CRO based algorithm, namely CRO-ECA and some existing algorithms to demonstrate the superiority of the proposed algorithm in terms of energy consumption, network lifetime, packets received by the BS and convergence rate.

Adaptive energy aware cluster-based routing protocol for wireless sensor networks

Abstract: Wireless sensor networks (WSNs) have grown excessively due to their various applications and low installation cost. In WSN, the main concern is to reduce energy consumption among nodes while maintaining timely and reliable data forwarding. However, most of the existing energy aware routing protocols incur unbalanced energy consumption, which results in inefficient load balancing and compromised network lifetime. Therefore, the main target of this research paper is to present adaptive energy aware cluster-based routing (AECR) protocol for improving energy conservation and data delivery performance. Our proposed AECR protocol differs from other energy efficient routing schemes in some aspects. Firstly, it generates balance sized clusters based on nodes distribution and avoids random clusters formation. Secondly, it optimizes both intra-cluster and inter-cluster routing paths for improving data delivery performance while balancing data traffic on constructed forwarding routes and at the end, in order to reduce the excessive energy consumption and improving load distribution, the role of Cluster Head (CH) is shifted dynamically among nodes by exploit of network conditions. Simulation results demonstrate that AECR protocol outperforms state of the art in terms of various performance metrics.

EMGGR: an energy-efficient multipath grid-based geographic routing protocol for underwater wireless sensor networks

Abstract: Routing in underwater wireless sensor networks (UWSN) is an important and a challenging activity due to the nature of acoustic channels and to the harsh environment. This paper extends our previous work [Al-Salti et al. in Proceedings of cyber-enabled distributed computing and knowledge discovery (CyberC), Shanghai, pp 331---336, 2014] that proposed a novel multipath grid-based geographical routing (MGGR) protocol for UWSNs. The extended work, EMGGR, viewed the network as logical 3D grids. Routing is performed in a grid-by-grid manner via gateways that use disjoint paths to relay data packets to the sink node. The algorithm consists of three main components: (1) a gateway election algorithm; responsible for electing gateways based on their locations and remaining energy level (2) a mechanism for updating neighboring gateways' information; allowing sensor nodes to memorize gateways in local and neighboring cells, and (3) a packet forwarding mechanism; in charge of constructing disjoint paths from source cells to destination cells, forwarding packets to the destination and dealing with holes (i.e. cells with no gateways) in the network. The performance of EMGGR has been assessed using Aqua-Sim, which is an NS2 based simulator for UWSNs. Results show that EMGGR is an energy efficient protocol in all simulation setups used in the study. Moreover, EMGGR can also maintain good delivery ratio and end-to-end delay.

Charging utility maximization in wireless rechargeable sensor networks

Abstract: Wireless energy transfer as a promising technology provides an alternative solution to prolong the lifetime of wireless rechargeable sensor networks (WRSNs). In this paper, we study replenishing energy on sensors in a WRSN to shorten energy expiration durations of sensors, by employing a mobile wireless charger to replenish sensors dynamically. We first formulate a novel sensor recharging problem with an objective of maximizing the charging utility of sensors, subject to the total traveling distance of the mobile charger per tour and the charging time window of each to-be-charged sensor. Due to the NP-hardness of the problem, we then propose an approximation algorithm with quasi-polynomial time complexity. In spite of the guaranteed performance ratio of the approximate solution, its time complexity is prohibitively high and may not be feasible in practice. Instead, we devise a fast yet scalable heuristic for the problem in response to dynamic energy consumption of sensors in the network. Furthermore, we also consider the online version of the problem where sensor replenishment is scheduled at every fixed time interval. We finally conduct extensive experiments by simulation to evaluate the performance of the proposed algorithms. Experimental results demonstrate that the proposed algorithms are very promising.

Cluster based emergency message broadcasting technique for vehicular ad hoc network

Abstract: Broadcasting is one of the major emergency services of Vehicular ad hoc network, since the number of vehicles increases every day. Because of the high density of the vehicles, it is necessary to broadcast emergency messages to all the vehicles to avoid traffic jam and vehicle accidents. Reliable broadcasting of messages in self-organizing Ad hoc networks is a promising research field. In this paper a cluster based emergency message broadcasting algorithm is proposed. In this regard we have proposed cluster based architecture for emergency message dissemination and collision avoidance in VANET. In this paper, first the formation of cluster is done in such a way that it avoids any kind of collision. Once cluster head is selected it takes the responsibility of intra cluster management to avoid interference between the clusters. To increase the reliability during emergency message dissemination two MAC layer broadcasts protocol is used. This assures that message is delivered on time without any hazards. The proposed model is simulated for DSDV, AODV, and DSR protocols with the standards 802.11 and 802.11p in SHWM, Manhattan and freeway mobility models.

A survey and analysis of multipath routing protocols in wireless multimedia sensor networks

Abstract: The main objective of this research is to conduct a performance analysis of various multipath routing protocols in wireless multimedia sensor networks for the efficient transmission of the image, audio and video data. To provide efficient routing for the large sized multimedia content, various multipath routing protocols such as energy-aware routing, QoS based routing and geographical routing methods are analyzed. In this analysis, the efficient routing techniques including geographical routing techniques such as GPSR, DGR, PW-DGR presented for wireless multimedia sensor networks are studied and the performance of each technique is evaluated to determine the efficient multipath routing technique. Comparisons are made for evaluated protocols and it is proved that the PW-DGR provides better routing performance for the multimedia data. The findings of the research also show that the PW-DGR method efficiently overcomes the routing problems such as energy bottleneck problem, energy-hole, reduced network lifetime and high delay in packet transmission.

Refined trust energy-ad hoc on demand distance vector (ReTE-AODV) routing algorithm for secured routing in MANET

Abstract: The characteristics of MANET such as decentralization, dynamic topology and openness are susceptible for security threats. To overcome the security threats and to provide a reliable network to transmit packets, a need for trust based routing arises. Moreover, the trust along with energy requirement on ad hoc on demand distance vector have paved way for the development of the newly proposed algorithm named as refined trust and energy based ad hoc on demand distance vector algorithm which is the refined form of the existing trust and energy based ad hoc on demand distance vector algorithms and the classical AODV. In this paper, the refinement parameter is the trust. Moreover, Bayesian probability is introduced in this paper for trust management due to its ability to handle uncertainty for obtaining the refined form of Trust calculation. The proposed algorithm routes the packets from the source to destination not through the shortest route but by selecting a reliable route which consumes low energy and trustful for sending the packets. The simulation results obtained from this work show that the proposed algorithm performs better than the existing algorithms in terms of Trust based routing and energy efficiency.

A comprehensive survey of network coding in vehicular ad-hoc networks

Abstract: Network coding is a data processing technique in which the flow of digital data is optimized in a network by transmitting a composite of two or more messages to make the network more robust. Network coding has been used in traditional and emerging wireless networks to overcome the communications issues of these networks. It also plays an important role in the area of vehicular ad-hoc networks (VANETs) to meet the challenges like high mobility, rapidly changing topology, and intermittent connectivity. VANETs consist of network of vehicles in which they communicate with each other to ensure road safety, free flow of traffic, and ease of journey for the passengers. It is now considered to be the most valuable concept for improving efficiency and safety of future transportation. However, this field has a lot of challenges to deal with. This paper presents a comprehensive survey of network coding schemes in VANETs. We have classified different applications like content distribution, multimedia streaming, cooperative downloading, data dissemination, and summarized other key areas of VANETs in which network coding schemes are implemented. This research work will provide a clear understanding to the readers about how network coding is implemented in these schemes in VANETs to improve performance, reduce delay, and make the network more efficient.

Certificateless online/offline signcryption for the Internet of Things

Abstract: The Internet of Things (IoT) is an emerging network paradigm that aims to obtain the interactions among pervasive things through heterogeneous networks. Security is an important task in the IoT. Luo et al. (Secur Commun Netw 7(10): 1560---1569, 2014) proposed a certificateless online/offline signcryption (COOSC) scheme for the IoT (hereafter called LTX). Unfortunately, Shi et al. showed that LTX is not secure. An adversary can easily obtain the private key of a user by a ciphertext. Recently, Li et al. proposed a new COOSC scheme (hereafter called LZZ). However, both LTX and LZZ need a point multiplication operation in the online phase, which is not suitable for resource-constrained devices. To overcome this weakness, we propose a new COOSC scheme and prove its security in the random oracle model. In addition, we analyze the performance of our scheme and show its application in the IoT.

Real-time routing algorithm for mobile ad hoc networks using reinforcement learning and heuristic algorithms

Abstract: Mobile ad hoc networks (MANETs) consist of a set of nodes which can move freely and communicate with each other wirelessly. Due to the movement of nodes and unlike wired networks, the available routes used among the nodes for transmitting data packets are not stable. Hence, proposing real-time routing protocols for MANETs is regarded as one of the major challenges in this research domain. Algorithms compatible with the changes created in the network due to the nodes' movements are of high significance. For reducing data packet transmission time among nodes, not only should route shortness be considered but also route stability should be taken into consideration. Since available factors in different environments have specific behavior patterns especially in human environments, the parameters of link stability and route shortness were taken into consideration and the reinforcement learning was used to propose a method so as to make the best choice among the neighbors at any moment to transmit a packet to the destination. That is, the proposed method was aimed at predicting the behavior pattern of the nodes in relation to the target node through using reinforcement learning. The proposed method used Q-learning algorithm which has more homogeneity to estimate the value of actions. Simulation results in OPNET demonstrate the superiority of the proposed scheme over conventional MANET routing methods.

Efficient cluster head selection using Naïve Bayes classifier for wireless sensor networks

Abstract: Data mining and approaches based on it have always been of approaches that have been considered in solving problems in the field of computer, but on some issues, this approach has been neglected. The area of wireless sensor networks and specifically the issue of optimal determining of the cluster head node are of these issues. To solve the problem of optimal determining of the cluster head node, Naive Bayes that is the subset of data mining techniques is used in this paper. The results obtained after simulation of the presented algorithm show that the efficiency of this algorithm is significantly higher compared with other approaches that have so far been used to solve this problem, and thus it can be said that using this algorithm will lead to improved outcomes of solving this problem.

Survey of ICIC techniques in LTE networks under various mobile environment parameters

Abstract: LTE networks' main challenge is to efficiently use the available spectrum, and to provide satisfying quality of service for mobile users. However, using the same bandwidth among adjacent cells leads to occurrence of Inter-cell Interference especially at the cell-edge. Basic interference mitigation approaches consider bandwidth partitioning techniques between adjacent cells, such as frequency reuse of factor m schemes, to minimize cell-edge interference. Although SINR values are improved, such techniques lead to significant reduction in the maximum achievable data rate. Several improvements have been proposed to enhance the performance of frequency reuse schemes, where restrictions are made on resource blocks usage, power allocation, or both. Nevertheless, bandwidth partitioning methods still affect the maximum achievable throughput. In this proposal, we intend to perform a comprehensive survey on Inter-Cell Interference Coordination (ICIC) techniques, and we study their performance while putting into consideration various design parameters. This study is implemented throughout intensive system level simulations under several parameters such as different network loads, radio conditions, and user distributions. Simulation results show the advantages and the limitations of each technique compared to frequency reuse-1 model. Thus, we are able to identify the most suitable ICIC technique for each network scenario.

rDFD: reactive distributed fault detection in wireless sensor networks

Abstract: Generally, fault detection approaches pursue high detection accuracy, but neglect energy consumption due to the high volume of messages exchanged. Therefore, in this work we propose a reactive distributed scheme for detecting faulty nodes. The scheme is able to detect transient and permanent faulty nodes accurately by exchanging fewer messages. In existing fault detection schemes, nodes exchange too many messages after every specific interval to detect suspicious node. However, in the proposed scheme comparatively much less messages are exchanged within a limited geographical area around the suspicious node only and that too when the node suspects its own readings. In the proposed scheme, each node exploits the temporal correlation in its own readings to detect any suspicious behavior. In order to confirm its status, the suspicious node communicates with its immediate neighbors who may be locally good or possible faulty with a certain level of confidence. Thus, the scheme utilizes the strength of both spatial and temporal correlation to find faulty nodes. Also, a confidence level is assigned to each correlated neighbor of suspicious node in order to enhance the detection accuracy. The ns-2 based simulation results show that our scheme performs better by reducing communication overhead and by detecting faulty nodes with high accuracy as compared to existing approaches.

Anomaly based intrusion detection for 802.11 networks with optimal features using SVM classifier

Abstract: The Wireless Fidelity (WiFi) is a widely used wireless technology due to its flexibility and mobility in the presence of vulnerable security features. Several attempts to secure 802.11 standard ends up with the inadequate security mechanisms that are vulnerable to various attacks and intrusions. Thus, integration of external defense mechanism like intrusion detection system (IDS) is inevitable. An anomaly-based IDS employs machine learning algorithms to detect attacks. Selecting the best set of features is central to ensure the performance of the classifier in terms of speed of learning, accuracy, and reliability. This paper proposes a normalized gain based IDS for MAC Intrusions (NMI) to improve the IDS performance significantly. The proposed NMI includes two primary components OFSNP and DCMI. The first component is optimal feature selection using NG and PSO (OFSNP) and the second component is Detecting and Categorizing MAC 802.11 Intrusions (DCMI) using SVM classifier. The OFSNP ranks the features using an independent measure as normalized gain (NG) and selects the optimal set of features using semi-supervised clustering (SSC). The SSC is based on particle swarm optimization (PSO) that uses labeled and unlabeled features simultaneously to find a group of optimal features. Using the optimal set of features, the proposed DCMI utilizes a rapid and straightforward support vector machine (SVM) learning that classifies the attacks under the appropriate classes. Thus, the proposed NMI achieves a better trade-off between detection accuracy and learning time. The experimental results show that the NMI accurately detects and classifies the 802.11 specific intrusions and also, it reduces the false positives and computation complexity by decreasing the number of features.

Congestion detection technique for multipath routing and load balancing in WSN

Abstract: In WSN, nodes collect the information from the surrounding environment and transferring to base station. Multiple data transmission in a WSN causes the nodes near the base station to get congested. Here we propose to develop a congestion avoidance and mitigation technique. For that, we select routes based on the distance between sender and receiver, relative success rate (RSR) value of node and buffer occupancy of a node. Based on these three parameters, we define a utility function to be applied to each neighbor of a transmitter node. Hence the transmitter node chooses the highest U-valued node as its next hop node among its neighbors in packet forwarding. Thus we avoid congestion by choosing non-congested nodes as its next hop node and then we mitigate congestion based on RSR values.

Energy efficient secured routing protocol for MANETs

Abstract: The design of routing protocol with energy efficiency and security is a challenging task. To overcome this challenge, we propose energy-efficient secured routing protocol. The objective of our work is to provide a secured routing protocol, which is energy efficient. To provide security for both link and message without relying on the third party, we provide security to the protocol by choosing a secure link for routing using Secure Optimized Link State Routing Protocol. Each node chooses multipoint relay nodes amongst the set of one-hop neighbors, so as to reach all two-hop neighbors. The access control entity authorizes nodes announcing the node identification to the network. In addition, the access control entity signs a public key Ki, a private key ki, and the certificate Ci required by an authorized node to obtain the group key. Each node maintains a route table with power status as one of its entry. After selecting the link, on requirement of a new route, we check nodes' power status in its routing table and then accordingly arise a route. Then, we perform group key distribution using the generated keys using a small number of messages which helps reducing energy consumption. The group key can be altered periodically to avoid nonauthorized nodes and to avoid the use of the same group key in more than some amount of data. Then, we provide communication privacy for both message sender and message recipient using Secure Source Anonymous Message Authentication Scheme. Thereby, the message sender or the sending node generates a source anonymous message authentication for message for releasing each message based on the MES scheme. Hence, our approach will provide message content authenticity without relying on any trusted third parties.

Trust based Intelligent Routing Algorithm for Delay Tolerant Network using Artificial Neural Network

Abstract: In today's world, when every mobile device corresponds with human behavioral patterns. People often come across with various communities having patterns such as mobility, communication and groups. Trust is an intrinsic factor, which plays important role in formation of such communities. It is important to see the inherent risk involved in such socially active communities. Such factors motivate the use of trust as a routing factor in Delay Tolerant Networks (DTNs). This paper proposes a Trust based Intelligent Routing Algorithm, which exploits the Call Data Record from Call Detail Record. The function of Artificial Neural Network is to calculate and learn, trust value that can be shared among network devices. Our algorithm lowers the need of nodes resources like energy consumption, computation time and space overheads. The proposed algorithm enhances the routing performance in DTN. The earlier work claiming better efficiency generally ends up consuming network's resources. On the contrary our proposed algorithm provides in-built security, without any additional overhead. To the best of our knowledge the proposed work is the first of its kind, providing ingrained security feature to the DTN. This work gives vantage point to the researchers in the field over other schemes proposed in the past.