Abdul Hanan Abdullah

A comprehensive study of data collection schemes using mobile sinks in wireless sensor networks.

Recently sink mobility has been exploited in numerous schemes to prolong the lifetime of wireless sensor networks (WSNs). Contrary to traditional WSNs where sensory data from sensor field is ultimately sent to a static sink, mobile sink-based approaches alleviate energy-holes issues thereby facilitating balanced energy consumption among nodes. In mobility scenarios, nodes need to keep track of the latest location of mobile sinks for data delivery. However, frequent propagation of sink topological updates undermines the energy conservation goal and therefore should be controlled. Furthermore, controlled propagation of sinks topological updates affects the performance of routing strategies thereby increasing data delivery latency and reducing packet delivery ratios. This paper presents a taxonomy of various data collection/dissemination schemes that exploit sink mobility. Based on how sink mobility is exploited in the sensor field, we classify existing schemes into three classes, namely path constrained, path unconstrained, and controlled sink mobility-based schemes. We also organize existing schemes based on their primary goals and provide a comparative study to aid readers in selecting the appropriate scheme in accordance with their particular intended applications and network dynamics. Finally, we conclude our discussion with the identification of some unresolved issues in pursuit of data delivery to a mobile sink.

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.

Smart Environment as a Service: Three Factor Cloud Based User Authentication for Telecare Medical Information System

The Telecare Medical Information System (TMIS) provides a set of different medical services to the patient and medical practitioner. The patients and medical practitioners can easily connect to the services remotely from their own premises. There are several studies carried out to enhance and authenticate smartcard-based remote user authentication protocols for TMIS system. In this article, we propose a set of enhanced and authentic Three Factor (3FA) remote user authentication protocols utilizing a smartphone capability over a dynamic Cloud Computing (CC) environment. A user can access the TMIS services presented in the form of CC services using his smart device e.g. smartphone. Our framework transforms a smartphone to act as a unique and only identity required to access the TMIS system remotely. Methods, Protocols and Authentication techniques are proposed followed by security analysis and a performance analysis with the two recent authentication protocols proposed for the healthcare TMIS system.

MOICA: A novel multi-objective approach based on imperialist competitive algorithm

A novel multi-objective evolutionary algorithm (MOEA) is developed based on imperialist competitive algorithm (ICA), a newly introduced evolutionary algorithm (EA). Fast non-dominated sorting and the Sigma method are employed for ranking the solutions. The algorithm is tested on six well-known test functions each of them incorporate a particular feature that may cause difficulty to MOEAs. The numerical results indicate that MOICA shows significantly higher efficiency in terms of accuracy and maintaining a diverse population of solutions when compared to the existing salient MOEAs, namely fast elitism non-dominated sorting genetic algorithm (NSGA-II) and multi-objective particle swarm optimization (MOPSO). Considering the computational time, the proposed algorithm is slightly faster than MOPSO and significantly outperforms NSGA-II.

Message Drop Control Buffer Management Policy for DTN Routing Protocols

In delay tolerant network interruptions will occur continuously because there is no end-to-end path exists for the longer period of time from source to destination. In this context, delays can be immensely large due to its environment contrails e.g. wildlife tracking, sensor network, deep space and ocean networks. Furthermore, larger replication of messages put into the network is to increase delivery probability. Due to this high buffer occupancy storage space and replication result in a huge overhead on the network. Consequently, well-ordered intelligent message control buffer drop policies are necessary to operate on buffer that allows control on messages drop when the node buffers are near to overflow. In this paper, we propose an efficient buffer management policy which is called message drop control source relay (MDC-SR) for delay tolerant routing protocols. We also illustrate that conventional buffer management policy like Drop oldest, LIFO and MOFO be ineffective to consider all appropriate information in this framework. The proposed MDC-SR buffer policy controls the message drop while at the same time maximizes the delivery probability and buffer time average and reduces the message relay, drop and hop count in the reasonable amount. Using simulations support on an imitation mobility models Shortest Path Map Based Movement and Map Route Movements, we show that our drop buffer management MDC-SR with random message sizes performs better as compared to existing MOFO, LIFO and DOA.

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.

Contact quality based forwarding strategy for delay tolerant network

The probabilistic routing protocols accelerate the network traffic towards more vital nodes to achieve high delivery ratio and low delays. However, as the traffic burden rises, the nodes turn into soaked and drop previously stored messages that reduce the delivery ratio and increase end-to-end delay. Hereby it is vital to compute the accurate quality value of nodes. In this paper, we have proposed a Contact Quality Based Forwarding strategy (CQBFS) for city-based environments where nodes are heterogeneous, resources are scarce and traffic density is high. The activity of a node is measured in terms of its ability to transmit the carried message and drop magnitude. Moreover, an effective quality impact based buffer management policy has been used to control the impact of message drop on network throughput. The proposed CQBFS outperforms PRoPHET, Epidemic, Maxprop and TTL based routing protocols in terms of message transmissions, delivery probability, message drop, end-to-end delay and Hop count average under the real time traces Sassy and Helsinki city.

Dynamic Prediction based Multi Queue (DPMQ) drop policy for probabilistic routing protocols of delay tolerant network

Abstract Two most important issues should be considered to achieve data delivery in DTN networking: routing protocols for the network and intelligent buffer management policy for everyone node in the network. The routing scheme decides which messages should be forwarded when nodes meet, and the buffer management policy determines which message is purged when the buffer overflows in a node. This study proposes a buffer management policy named as Dynamic Prediction based Multi Queue (DPMQ) for probabilistic routing protocols. It works by classification of local buffer into three queues of messages, which are DCTL, HPTL and LPTL. The simulation results have proven that the DPMQ performs well as compared to DLA, DOA, MOFO, LIFO, LEPR and LIFO in terms of reducing the message relay, message drop, hop counts average and overhead while rising in the delivery probability.

Connection Frequency Buffer Aware Routing Protocol for Delay Tolerant Network

DTN flooding based routing protocol replicate the message copy to increase the delivery like hood that overloads the network resources. The probabilistic routing protocols reduce replication cost by forwarding the message to a node that holds high predictability value to meet its destination. However, the network traffic converges to high probable nodes and produce congestion that triggers the drop of previously stored messages. In this paper, we have proposed a routing protocol called as Connection frequency Buffer Aware Routing Protocol (CFBARP) that uses an adaptive method to maintain the information about the available buffer space at the receiver before message transmission. Furthermore, a frequency based method has been employed to determine the connection recurrence among nodes. The proposed strategy has performed well in terms of reducing message drop, message relay while increases the delivery probability.

DF++: an adaptive buffer-aware probabilistic delegation forwarding protocol for Delay Tolerant Network

The delegated forwarding (DF) curb transmissions by forwarding the message to a node that holds high quality value seen by the message. However, DF assumes infinite buffer space that is not possible in real time applications. In addition, quality value computation considers the encountering history and does not account for additional network parameters such as aging and transitive connectivity. In this paper, we have proposed a routing protocol called as DF++ that compute quality value based on probabilistic model used in PRoPHET protocol and forwards the message to current node by adaptive computation of available buffer space. We have compared performance of DF++ with DF, Epidemic and PRoPHET routing protocols. The proposed DF++ has higher delivery probability and fewer message drop and transmissions.