Abdulazeez F. Salami

A Parallel Duplicate Address Detection (PDAD) mechanism to reduce handoff latency of Mobile Internet Protocol version 6 (MIPv6)

Next Generation Networks (NGN) are envisioned to be fully Internet Protocol (IP) based so that users can experience high quality and ubiquitous communication. In order to realize this, Internet Engineering Task Force (IETF) is taking advantage of Mobile Internet Protocol version 6 (MIPv6) because it has more suitable features than MIPv4. However, MIPv6 is not widely deployed due to handoff latency and other limitations. This causes packet loss and degrades the Quality of Service (QoS) for real-time applications. MIPv6 handoff latency includes link layer establishment delay, movement delay, address auto-configuration delay and binding update/registration delay. Duplicate Address Detection (DAD) is performed during address auto-configuration which takes around 70% of the time for the total handoff procedures. In order to reduce this handoff latency, a Parallel DAD (PDAD) model is proposed for reducing packet loss. The key idea behind this model is that a Mobile Node (MN) solicits for a router advertisement (RA) in parallel to its neighbor routers before leaving the previous point of attachment.

A novel biased energy distribution (BED) scheme for clustering sensor networks

This paper presents the impact of utilizing a biased energy distribution (BED) scheme among sensor nodes for clustering sensor networks. In clustering sensor networks, some of the nodes are elected as aggregators and they compress the data from their cluster members before sending the aggregated data to the sink. Existing clustering routing protocols assume that all the nodes are provided with equal amount of energy but this shortens the network lifetime and makes the network unstable once the first node dies. This paper proposes a solution by using a technique that prioritizes the network into higher and lower energy nodes. The aim of this approach is to ensure well balanced energy consumption in order to maximize network lifetime. It is shown by simulation that the proposed technique exhibits better performance when compared to existing clustering routing techniques in terms of throughput, network lifetime and energy consumption.

Investigative analysis of clustering routing protocols for scalable sensor networks

New advancements in the technology of wireless sensors have contributed to the development of special protocols which are unique to sensor networks where minimal energy consumption is vital and very important. As a result, the focus and effort of researchers is on designing better routing algorithms for a given application and network architecture of interest. Flat-based routing protocols have been found to be less advantageous to clustering routing protocols when their performance are compared in a large-scale wireless sensor network scenario. This is due to the fact that clustering operation reduces the amount of redundant messages that are transmitted all over the network when an event is detected. This paper is an investigation of cluster-based routing protocols for wireless sensor networks.