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.

No abstract

No abstract

No abstract

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.

No abstract

No abstract

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.