Mohammad Hossein Anisi

A Survey of Routing Protocols in Wireless Body Sensor Networks

Wireless Body Sensor Networks (WBSNs) constitute a subset of Wireless Sensor Networks (WSNs) responsible for monitoring vital sign-related data of patients and accordingly route this data towards a sink. In routing sensed data towards sinks, WBSNs face some of the same routing challenges as general WSNs, but the unique requirements of WBSNs impose some more constraints that need to be addressed by the routing mechanisms. This paper identifies various issues and challenges in pursuit of effective routing in WBSNs. Furthermore, it provides a detailed literature review of the various existing routing protocols used in the WBSN domain by discussing their strengths and weaknesses.

A survey of wireless sensor network approaches and their energy consumption for monitoring farm fields in precision agriculture

Precision agriculture (PA) is the use of information and communication technology together with best agricultural practices for farm management. PA requires the acquisition, transmission and processing of large amounts of data from farm fields. A wireless sensor network (WSN) is a system for monitoring agriculture fields. Several researchers have used WSNs to collect the required data from the regions of interest for their intended usages in various applications. In a WSN, the energy consumption of the sensor nodes is the main issue, due to its direct impact on the lifetime of the network. Many approaches have been proposed to address this issue using different power sources and types of nodes. Specifically, in PA, because of the extended time period that is required to monitor fields, using an appropriate WSN approach is important. There is a need for a comprehensive review of WSN approaches for PA. The aim of this paper is to classify and describe the state-of-the-art of WSNs and analyze their energy consumption based on their power sources. WSN approaches in PA are categorized and discussed according to their features.

An overview of data routing approaches for wireless sensor networks.

Recent years have witnessed a growing interest in deploying large populations of microsensors that collaborate in a distributed manner to gather and process sensory data and deliver them to a sink node through wireless communications systems. Currently, there is a lot of interest in data routing for Wireless Sensor Networks (WSNs) due to their unique challenges compared to conventional routing in wired networks. In WSNs, each data routing approach follows a specific goal (goals) according to the application. Although the general goal of every data routing approach in WSNs is to extend the network lifetime and every approach should be aware of the energy level of the nodes, data routing approaches may focus on one (or some) specific goal(s) depending on the application. Thus, existing approaches can be categorized according to their routing goals. In this paper, the main goals of data routing approaches in sensor networks are described. Then, the best known and most recent data routing approaches in WSNs are classified and studied according to their specific goals.

EDR: efficient data routing in wireless sensor networks

Routing in sensor networks is very challenging compared to contemporary communication and wireless ad-hoc networks. This is attributed to several characteristics that distinguish them from such networks. Transmitting data from every sensor node within the deployment region might result in significant and unnecessary redundancy in data and incur avoidable energy and traffic expenditure; thus, a routing protocol which is able to select a set of sensor nodes and utilise data aggregation during the relaying of data is of great importance. Furthermore, timely delivery of data is required in many applications of Wireless Sensor Networks (WSNs), such as real-time target tracking in battle environments, emergent event triggering in monitoring applications impose the need of efficient routing protocol. In this paper, we propose a data routing scheme which ensures increased network lifetime by exploiting energy efficiently, supporting reliability, fast delivery of delay-sensitive data and achieving low-cost sensor design. Simulation results demonstrate that, the proposed routing scheme outperforms related existing approaches in terms of all the evaluation metrics such as packet delivery ratio, energy efficiency and timely delivery of data.

FEDA: Fault-tolerant Energy-Efficient Data Aggregation in wireless sensor networks

One of the key issues in wireless sensor networks is data collection from sensors .In this area, data aggregation is an important technique for reducing the energy consumption. Also, reliability and robustness of transferring data is one of the important challenges. The in-network data aggregation approach which is proposed in this paper, besides achieving ideal energy consumption by limiting a number of redundant and unnecessary responses from the sensor nodes, it can increase the chance of receiving data packets at the destination and cause to a more accurate results. By utilization of J-Sim simulator, the proposed approach is compared and evaluated with some important approaches in this area. The simulation results show that by using the proposed approach, the loss amount of the data packets and the average energy consumption of network will be considerably reduced.

A New Position-Based Routing Protocol for Reducing the Number of Exchanged Route Request Messages in Mobile Ad-hoc Networks

Mobile Ad-hoc network is a network of mobile nodes that within, the mobile nodes, communicate through almost slow links. In an Ad-hoc network, two nodes can communicate with each other if their distance became lower than the minimum of their transmission range. So, sending message between two nodes in such network may need routing between intermediate nodes, therefore, a specific route between such nodes should be considered. In this paper, the reasons of route breakage which are recognized by Location Aided Routing (LAR) protocol will be studied and in the following, we propose a new routing protocol that will reduce the number of exchanged route request messages. Our experimental results show that by using this protocol, the number of nodes which participate in routing operation and also the average time of route discovery will be reduced, considerably.

A Secure Trust Model Based on Fuzzy Logic in Vehicular Ad Hoc Networks With Fog Computing

In vehicular ad hoc networks (VANETs), trust establishment among vehicles is important to secure integrity and reliability of applications. In general, trust and reliability help vehicles to collect correct and credible information from surrounding vehicles. On top of that, a secure trust model can deal with uncertainties and risk taking from unreliable information in vehicular environments. However, inaccurate, incomplete, and imprecise information collected by vehicles as well as movable/immovable obstacles have interrupting effects on VANET. In this paper, a fuzzy trust model based on experience and plausibility is proposed to secure the vehicular network. The proposed trust model executes a series of security checks to ensure the correctness of the information received from authorized vehicles. Moreover, fog nodes are adopted as a facility to evaluate the level of accuracy of event’s location. The analyses show that the proposed solution not only detects malicious attackers and faulty nodes, but also overcomes the uncertainty and imprecision of data in vehicular networks in both line of sight and non-line of sight environments.

On-Demand Hybrid Routing for Cognitive Radio Ad-Hoc Network

A novel on-demand cluster-based hybrid routing protocol for cognitive radio ad hoc network with non-uniform node distribution is proposed in this paper. At first, a novel spectrum-aware clustering mechanism is introduced. The proposed clustering mechanism divides node into clusters based on three values: spectrum availability, power level of node, and node stability. Therefore, clusters are formed with the highest stability to avoid frequent reclustering. Later, a routing algorithm is introduced to minimize the delay while achieving acceptable delivery ratio. In this paper, routing is defined as a multi-objective optimization problem to combine different individual routing metrics to form a global metric. Simulation results show that our proposed routing algorithm can guarantee a lower delay and a higher packet delivery ratio than conventional routing protocols for cognitive radio ad hoc networks. Due to our routing design specification, such as power consideration and low delay, it can be suitable to be adopted for Internet of Things applications.

Energy-Efficient Data Reporting for Navigation in Position-Free Hybrid Wireless Sensor Networks

Hybrid wireless sensor network (HWSN) consists of static and mobile sensor nodes that work together for sensing and data collection in a region of interest. The static sensors detect events and send in situ notifications to the mobile node to come closer to the event to collect the data. It is challenging to the static nodes to send data packets to mobile nodes in position-free HWSN. The flood-based mechanism is commonly used in reporting data packets and supporting mobile node navigation. However, it causes energy consumption and minimizes lifetime of sensor network. In this paper, an energy-efficient packet reporting (EPR) scheme is proposed to report event packets in an energy-efficient manner. It aims at supporting mobile node navigation in position-free HWSN. EPR uses multi-metric energy-efficient-based relay node selection to send data downstream. Then, it uses transmission power adjustment strategy on the upstream sending nodes to reduce their energy consumption. In the case of multiple nodes detecting event around the same vicinity, a clustering strategy is used to send an aggregated data packet. Extensive simulations show that EPR provides superior improvements over the existing schemes.

Community detection in social networks using user frequent pattern mining

Recently, social networking sites are offering a rich resource of heterogeneous data. The analysis of such data can lead to the discovery of unknown information and relations in these networks. The detection of communities including ‘similar’ nodes is a challenging topic in the analysis of social network data, and it has been widely studied in the social networking community in the context of underlying graph structure. Online social networks, in addition to having graph structures, include effective user information within networks. Using this information leads to enhance quality of community discovery. In this study, a method of community discovery is provided. Besides communication among nodes to improve the quality of the discovered communities, content information is used as well. This is a new approach based on frequent patterns and the actions of users on networks, particularly social networking sites where users carry out their preferred activities. The main contributions of proposed method are twofold: First, based on the interests and activities of users on networks, some small communities of similar users are discovered, and then by using social relations, the discovered communities are extended. The F-measure is used to evaluate the results of two real-world datasets (Blogcatalog and Flickr), demonstrating that the proposed method principals to improve the community detection quality.