Liana K. Qabajeh

Low communication cost (LCC) scheme for localizing mobile wireless sensor networks

Abstract In recent years, the number of applications utilizing mobile wireless sensor networks (WSNs) has increased, with the intent of localization for the purposes of monitoring and obtaining data from hazardous areas. Location of the event is very critical in WSN, as sensing data is almost meaningless without the location information. In this paper, two Monte Carlo based localization schemes termed MCL and MSL* are studied. MCL obtains its location through anchor nodes whereas MSL* uses both anchor nodes and normal nodes. The use of normal nodes would increase accuracy and reduce dependency on anchor nodes, but increases communication costs. For this reason, we introduce a new approach called low communication cost schemes to reduce communication cost. Unlike MSL* which chooses all normal nodes found in the neighbor, the proposed scheme uses set theory to only select intersected nodes. To evaluate our method, we simulate in our proposed scheme the use of the same MSL* settings and simulators. From the simulation, we find out that our proposed scheme is able to reduce communication cost—the number of messages sent—by a minimum of 0.02 and a maximum of 0.30 with an average of 0.18, for varying node densities from 6 to 20, while nonetheless able to retain similar MSL* accuracy rates.

A Survey on Scalable Multicasting in Mobile Ad Hoc Networks

Mobile ad hoc networks (MANETs) have gained significant interest and popularity since they have enormous potential in several fields of applications. Infrastructure-free, self-configuring and mobility are the main reasons behind this popularity. Recently, group-oriented applications over MANET gains high popularity. Multicast communication is the ideal communication technique for supporting these types of applications. However, multicast routing in large-scale networks faces several difficulties and challenges that need to be addressed. These challenges include dynamic MANET topology, multicast packet forwarding and shared wireless medium. During the last years, active research work resulted in a variety of proposals. A number of protocols, each with a particular property and often optimized for a specific application area, have been designed. They follow different design principles and exhibit substantial variations in performance depending on various parameters. In this paper, most of the existing scalable multicast routing protocols in MANETs are briefly discussed and analyzed to provide a comprehensive understanding of these protocols and pave the way for further research.

A tree-based QoS multicast routing protocol for MANETs

Multicasting communication serves as one critical operation to support many applications of Mobile Ad hoc networks (MANETs) that achieve group communication rather than pairs of individuals. Multicast routing protocols becomes increasingly important in MANETs because they effectively coordinate a set of nodes. Also, it provides efficient routing for multimedia applications such as video conferences, military and rescue operations. Such applications are highly demand for Quality of Service (QoS), which makes an efficient QoS multicast routing protocols is very important. In this paper, we propose a model that searches for QoS paths from a single source to a set of destinations. The physical area is partitioned into equal size hexagonal cells and a leader and backup leader nodes is elected to maintain up-to-date information about the network topology. Efficient routing is performed based on nodes positions to deliver data packets to all the receivers. The simulation results show that, comparing with the well-known multicast protocol ODMRP (Demand Multicast Routing Protocol), PBQMRP achieves less packet drop ratio with significant reduction in control overhead.

Sequential Monte Carlo Localization Methods in Mobile Wireless Sensor Networks: A Review

The advancement of digital technology has increased the deployment of wireless sensor networks (WSNs) in our daily life. However, locating sensor nodes is a challenging task in WSNs. Sensing data without an accurate location is worthless, especially in critical applications. The pioneering technique in range-free localization schemes is a sequential Monte Carlo (SMC) method, which utilizes network connectivity to estimate sensor location without additional hardware. This study presents a comprehensive survey of state-of-the-art SMC localization schemes. We present the schemes as a thematic taxonomy of localization operation in SMC. Moreover, the critical characteristics of each existing scheme are analyzed to identify its advantages and disadvantages. The similarities and differences of each scheme are investigated on the basis of significant parameters, namely, localization accuracy, computational cost, communication cost, and number of samples. We discuss the challenges and direction of the future research work for each parameter.

Position-based QoS multicast routing protocol for mobile Ad Hoc networks

Recently, the necessity of applications where many users have to interact in a close manner over mobile Ad-Hoc networks gains high popularity. Multicast communication is essential in this type of applications to reduce the overhead of group communication. For group-oriented multimedia applications Quality of Service (QoS) provision is a basic requirement, which makes an efficient QoS multicast routing protocol a very important issue. This paper proposes a location-based QoS multicast routing protocol via cooperation between Network and MAC layers. Along with this protocol, a location and group membership management scheme has been proposed. Unlike some of multicast routing protocols, the proposed approach limits maintaining the network topology to certain nodes to reduce control overhead and reduce bandwidth consumption. Our proposed protocol is scalable for large area networks with large multicast members regardless of the network density. Also, it achieves a significant reduction in processing overhead compared to flat QoS algorithms.

Quality of Service Multicast Routing Protocol for Large Scale MANETs

Mobile Ad hoc NETworks (MANETs) are collection of mobile nodes communicate in a multi-hop manner without relaying on any infrastructure or central administration. Multimedia and group-oriented applications over MANETs gain high popularity, which makes providing Quality of Services (QoS) a key requirement. This work proposed a new efficient approach which aims to find paths between the source and all the multicast group members using paths that meet the bandwidth and delay requirements. Unlike some of multicast routing protocols, the proposed approach has limited maintaining the network topology to certain nodes to reduce communication overhead and provide scalability. The proposed protocol partitioned the network into equal size hexagonal cells and a leader and backup leader are elected inside each cell. The location information provided by GPS receivers are used at route discovery and route maintenance. This protocol allows multicast group members to join/leave the held session dynamically. The proposed protocol is scalable for large area networks with large multicast members. Also, it achieves a significant reduction in processing overhead than non hierarchical algorithms.

A more secure and scalable routing protocol for mobile ad hoc networks

An essential problem in mobile ad hoc networks is finding an efficient and secure route from a source to an intended destination. In this paper, we have proposed a new model of routing protocol named ARANz, which is an extension of the original Authenticated Routing for Ad Hoc Networks (ARAN). ARANz adopts the authentication methods used with ARAN and aims to increase security, achieve robustness and solve the single point of failure and attack problems by introducing multiple local certificate authority servers. Additionally, via dealing with the network as zones and using restricted directional flooding, our new model exhibits better scalability and performance. Through simulation, we evaluated ARANz and compared it with the original ARAN as well as Ad Hoc On-demand Distance Vector. Simulation results show that ARANz is able to effectively discover secure routes within relatively large networks with large number of mobile nodes, while maintaining the minimum packet routing load. Copyright © 2012 John Wiley & Sons, Ltd.

Position-based multicast routing in Mobile Ad hoc Networks

Nowadays, group communications over Mobile Ad hoc Networks (MANETs) have received significant attention. Multicasting plays an important role in simultaneous delivery of information to group of receivers. Meanwhile, multimedia and real-time applications are becoming essential needs for MANET users. Thus, it is necessary to design efficient and effective multicast routing protocol to support this type of applications. Several efforts have been put to improve Quality of Service (QoS) multicast routing. However, they do not consider scalability issue. This paper introduces a position-based QoS multicast routing protocol (PBQMRP). The main objective of this protocol is to design a lightweight scalable QoS multicast routing scheme irrespective of the number of multicast members and network size. To achieve this, virtual clustering strategy has been introduced. This strategy based on partitioning the network into hexagonal cells and each cell is represented by one powerful node. The proposed scheme eliminates the duplicate packets between cells and reduces the number of participating nodes. Simulation results show that PBQMRP offers higher packet delivery ratio with significantly low overhead compared to ODMRP Protocol.

A Cluster-based QoS Multicast Routing Protocol for Scalable MANETs

Recently, multicast routing protocols become increasingly important aspect in Mobile Ad hoc Networks (MANETs), as they effectively manage group communications. Meanwhile, multimedia and real-time applications are becoming essential need for users of MANET. Thus it is necessary to design efficient and effective Quality of Service (QoS) multicast routing strategies. In this paper, we address the scalability problem of multicast routing protocols to support QoS over MANETs. In particular, we introduce a Position-Based QoS Multicast Routing Protocol (PBQMRP). Basically, the protocol based on dividing the network area into virtual hexagonal cells. Then, the location information is exploited to perform efficient and scalable route discovery. In comparison with other existing QoS multicast routing protocols, PBQMRP incurs less control packets by eliminating network flooding behavior. Through simulation, the efficiency and scalability of PBQMRP are evaluated and compared with the well-known On-Demand Multicast Routing Protocol (ODMRP). Simulation results justify that our protocol has better performance, less control overhead and higher scalability.

A Scalable Secure Routing Protocol for MANETs

Wireless Mobile Ad-Hoc Networks (MANETs) are becoming highly applicable in many fields. Due to MANETs special characteristics, secure routing may be one of the most difficult areas to deal with as opponents can add themselves to a MANET using the existing common routing protocols. This paper proposes a new model of routing protocol called ARANz, which is an extension of the original Authenticated Routing for Ad-Hoc Networks (ARAN). Later, we will demonstrate that apart from the authentication methods adopted from ARAN, ARANz aims to increase security, achieve robustness and solve the single point of failure and attack problems by introducing multiple Local Certificate Authority servers. We will reveal that via dealing with the network as zones and using restricted directional flooding, our new model will exhibit better scalability and performance.