Buddha Singh

A novel energy-aware cluster head selection based on particle swarm optimization for wireless sensor networks

The wireless sensor networks have long been an attractive field to the researchers and scientists for its ease in deployment and maintenance. In this research, we focus on the maximization of network lifetime which has become a critical issue in sensor networks. Clustered organization of nodes with aggregation of data at the cluster head becomes one of the significant means to extend life expectancy of the network. This paper proposes Particle Swarm Optimization (PSO) approach for generating energy-aware clusters by optimal selection of cluster heads. The PSO eventually reduces the cost of locating optimal position for the head nodes in a cluster. In addition, we have implemented the PSO-based approach within the cluster rather than base station, which makes it a semi-distributed method. The selection criteria of the objective function are based on the residual energy, intra-cluster distance, node degree and head count of the probable cluster heads. Furthermore, influence of the expected number of packet retransmissions along the estimated path towards the cluster head is also reflected in our proposed energy consumption model. The performance evaluation of our proposed technique is carried out with respect to the well-known cluster-based sensor network protocols, LEACH-C and PSO-C respectively. Finally, the simulation clarifies the effectiveness of our proposed work over its comparatives in terms of network lifetime, average packet transmissions, cluster head selection rounds supported by PSO and average energy consumption.

An energy-efficient adaptive clustering algorithm with load balancing for wireless sensor network

Maximisation of network lifetime is the issue of prime importance in Wireless Sensor Network (WSN). An energy-efficient clustering algorithm with load balancing can achieve this challenging goal. We propose Density-based Dynamic Clustering (DDC) algorithm for clustering and cluster head election mechanism with the use of independence set. Furthermore, a distributed algorithm (DISD - Distributed Independence Set Discovery) is designed for cluster head election in O(1) complexity per sensor node. In this, we dynamically find an optimal sensor cover to dominate maximum sensors within a cluster, therefore forming an InDependence Set (IDS). Only the members of IDS are allowed to participate in the cluster head selection (rotation), thereby establishing load balancing and energy management. Our model is designed for dual modes: low-and high-traffic session. According to the flow of packets, the sleep management technique is modified. Network simulator is used for the simulation of our proposed algorithms.

Hierarchical map-based location service for VANETs in urban environments

Vehicular Ad-hoc Network is gaining the attention of researchers because of the technological advancements for developing an Intelligent Transportation System (ITS). The dynamic nature of vehicles (nodes) leads to frequent path breaks and network fragmentation. Therefore, routing has become a critical issue in inter-vehicle communication. Location management in VANETs is considered as a critical issue in position based routing protocol. For this purpose we have proposed novel distributed map-based location service scheme that uses mobility pattern and density of the vehicles in the region. In the proposed location service mechanism, the geographical region is divided into segments and each segment is further fragmented into cells. For exchanging the routing information among vehicles across network, the location of destination node should be discovered within the cell. In case the destination is not discovered in the cell, the request for location search migrates to the segment. The information extracts from the digital map database helps to select location server in high traffic point regions in the entire area. The location service uses minimum speed aware policy to select location server at high traffic density waypoint and dynamic location updates are sent to location server based on threshold distance. In order to reduce the location discovery delay, adjacent level hierarchy is used for location query sent by the location servers. Simulation results obtained with different scenarios are used to demonstrate the performance of HLS, EMBL and HMLS in terms of location query answer and location update strategy. Simulation results show that HMLS achieve outperforms others in urban environments.

Traffic-Aware Density-Based Sleep Scheduling and Energy Modeling for Two Dimensional Gaussian Distributed Wireless Sensor Network

Sleep scheduling of sensors in network domain is considered to be the most fundamental way of achieving higher life expectancy of wireless sensor networks. In this paper we have proposed density-based sleep scheduling strategy with traffic awareness in Gaussian distributed sensor network for minimizing energy consumption. In uniform distributed sensor network, it has been found that nodes in the nearest belt around the sink consume more energy. The reason behind is that the nodes near the sink involve more packet relaying load than the distant nodes. Consequently, the energy of these sensors get exhausted rapidly, thereby creating connectivity breaks known as energy hole. For this purpose, Gaussian distribution is used by densely deploying nodes around the sink which well-balances the relaying load. In addition, we have developed the analytical model for computing the energy consumption and coverage analysis in the sensor network. The performance of our sleep scheduling method is evaluated with respect to the Randomized Scheduling and Linear Distance-based Scheduling protocols. The simulation results of our proposed work show commendable improvement in network lifetime.

An integrated fusion protocol for congregating sensor data in wireless sensor network

Effective fusion of data, accumulated from the sensors, can be regarded as a direct proportional factor to the successful deployment of a wireless sensor network. Two important fusion properties in support of the concerned area are: Correlation and Aggregation. This paper proposes an energy efficient data fusion protocol, which apart from employing power saving aggregation schemes, also implements network throughput enhancing routines via correlation of sensor signals. The protocol operates in dual mode to provide a perfect balance between the workload distributions among the sensor nodes during several parameter calculations. The notion of Connected Correlation Dominating Set is used to find out the clusters of active alive sensors, which actually involves in the transmission of data. On the basis of an Energy Model, the cluster heads are determined. To keep track of the error parameters, Least Squares (LS) estimation method along with the Linear Predictive Model is taken into consideration. Moreover, we simulate our algorithm using the Network Simulator (NS), ns-2.34.

A MAC approach for dynamic power control in wireless sensor network

To design energy efficient Medium Access Control (MAC) protocol for maximizing the network lifetime in Wireless Sensor Network (WSN), is evolving as a challenging portal in research area. The overall radio energy inherently depends on network workload as well as the radio characteristics. Therefore, we have proposed a Dynamic Power Control MAC (DPCMAC) protocol which supports variable power level transmission of packets according to data rate of sources. Our novel approach minimizes the aggregate energy consumption in all power states according to the network traffic. Moreover in our protocol, we calculate the desired power level for the transmission of packets for two types of scenarios: low and high network workload. The protocol is simulated for the variable size of networks and its performance is analyzed on the basis of success rate and energy consumption. The simulation results show that our protocol outperforms the existing Sensor MAC (SMAC) protocol.

Analysis of Link Prediction in Directed and Weighted Social Network Structure

The main aim of this paper is to develop algorithms for link prediction based on directed and weighted social network structure. In this paper, the four algorithms such as Modified Common Neighbor (MCN), Modified Jaccard’s Coefficient (MJC), Modified Adamic Adar (MAA) and Modified Preferential Attachment (MPA) has been proposed which is suitable for directed and weighted networks. In our proposed algorithms, the degree of nodes and weightage of each link has been considered. The weightage of each link is assigned using random function. The Modified Common Neighbor (MCN), Modified Jaccard’s Coefficient (MJC), and Modified Adamic Adar (MAA) algorithms are based on an existing Common Neighbor algorithm. The Modified Preferential Attachment (MPA) algorithm depends on the degree of the nodes. The comparative analysis of our proposed algorithms and existing algorithms is performed based on area under receiver operating characteristic values (AUC values), considering different observed links. According to the experimental analysis, it may be concluded that our proposed algorithms provide better performances in comparison to the existing algorithms. Modified Common Neighbor and Modified Adamic Adar results in highest AUC value when twitter dataset and amazon dataset is considered. The proposed algorithms will be applicable in different directed and weighted social network structure for prediction of links between the users.

Throughput and delay analysis of directional‐location aided routing protocol for vehicular ad hoc networks

Summary Vehicular ad hoc networks is an integral component of intelligent transportation systems and it is an important requisite for smarter cities. Network formation and deformation among the vehicles are very frequent because of the variation in speed. Furthermore, for safety applications, messages should not face any kind of delay or collision. Therefore, establishing communication between the vehicles becomes even more challenging. Position-based routing protocols work productively in vehicular ad hoc networks. Only finding an efficient routing protocol does not solve our purport. We need to carefully examine the effect of media access control layer parameters additionally. In the event of collisions, a large number of nodes would be re-transmitting rather than sending fresh packets. A node busy in sending the retransmitted packet is called a backlog node. With an increase in the number of collisions, number of backlog nodes also increases, which affects the delay and throughput. In this article, we present the mathematical modeling of delay and throughput with IEEE 802.11 distributed coordination function (at media access control layer) for directional-location aided routing (D-LAR) position based routing protocol. For performance evaluation, simulation has been done in realistic environment created with SUMO (traffic simulator) and NS-2 (network simulator). Simulation results show the comparison between D-LAR and location aided routing (LAR) on various metrics in terms of delay, packet delivery ratio, routing overhead, throughput, and collision probability. To validate the mathematical model, analytical results has been compared with simulation results. The results confirm that performance of D-LAR is better than LAR in terms of increasing the throughput and reduction in routing overhead and delay.

Position based routing protocols: A survey

An Ad-hoc Network is a collection of mobile nodes, which change their topology frequently and communicate through wireless links. In such dynamic environment, routing is challenging and crucial task. In these networks, position-based routings are considered more suitable routing strategies than conventional routing protocol due to its scalability. In this paper, we aim to present a comprehensive survey of existing position-based routing protocols. The paper also discusses open issues, challenges and future research directions in this area.

Effective fuzzy-based location-aware routing with adjusting transmission range in MANET

Mobile ad-hoc network is a collection of mobile nodes. Mobility of the nodes leads to dynamic changes in network topology that may complicate the routing functions. Earlier a variety of topology and position-based routing protocols have been proposed for routing process in MANET. The results reveal that the position-based routing protocols are the better choice for routing functions in comparison with topology-based routing protocols. Therefore, our study is motivated to work for position-based routing so it enhances the performance of network. The proposed protocol aims to reduce the possibility of collisions, delay and decrease the overall communication overhead in network. Hence our scheme first, defines a small triangular shaped requested zone broadcast region which is dynamic in nature. Secondly, fuzzy-based forwarding scheme is proposed which combines both distance and directionbased strategies to determine the next forwarding node to achieve better performance with regard to energy consumption, routing overhead and end-to-end delay. The proposed scheme also focuses on the hole problem in the request zone and proposes a self-adjustable transmission range-based method to overcome the problem. The simulation results show that the proposed scheme outperforms than LAR1 and LARDAR schemes.