Wireless Communications and Mobile Computing

Cover image for Vol. 12 Issue 1

Special Issue: Recent Advancement in Wireless Ad Hoc and Sensor Networks

January 2012

Volume 12, Issue 1

Pages i–ii, 1–143

Issue edited by: Yeim-Kuan Chang, Hamid Sharif, Kun Yang

    1. You have free access to this content
      Issue Information (pages i–ii)

      Version of Record online: 29 DEC 2011 | DOI: 10.1002/wcm.1266

  1. Special Issue Papers

    1. Top of page
    2. Special Issue Papers
    1. Efficient power aware routing algorithm for mobile ad hoc networks (pages 1–6)

      G. Varaprasad

      Version of Record online: 12 OCT 2009 | DOI: 10.1002/wcm.870

      Thumbnail image of graphical abstract

      Let us assume that the network has seven nodes (n1-n7) and n1 be source node and n7 be destination node as shown in the Fig 5. Here, NT indicates the transmission power and NE indicates the energy level. We are measuring energy in the scale of 0-1 and the transmission power is also measured from 0-1. If a node n1 wants to send the message to n7, then there are three possible paths form the source to destination. The proposed model will choose path 3(n1[RIGHTWARDS ARROW]n7[RIGHTWARDS ARROW]n4) due to the following reasons:

      First, the proposed model selects a route with the weak nodes having maximum residual battery capacity among all mobile nodes.

      Secondly, if all the nodes contain equal battery capacity, then the proposed algorithm chooses a node with the minimum transmission power.

      Thirdly, if all the nodes take equal transmission power, then the proposed algorithm chooses a path with the minimum number of hops to reach the destination.

    2. Mobility management algorithms and applications for mobile sensor networks (pages 7–21)

      You-Chiun Wang, Fang-Jing Wu and Yu-Chee Tseng

      Version of Record online: 8 JAN 2010 | DOI: 10.1002/wcm.886

      Thumbnail image of graphical abstract

      This paper surveys recent progress in mobile wireless sensor networks. We discuss mobility management of mobile sensors with the purposes of deploying a better network, enhancing coverage and connectivity, and relocating some sensors; then we introduce path-planning methods for data ferries to relay data between isolated sensors and to extend the network lifetime. Finally, we review some existing platforms and discuss several interesting applications of mobile wireless sensor networks.

    3. Coverage and connectivity guaranteed topology control algorithm for cluster-based wireless sensor networks (pages 23–32)

      Ning Xu, Aiping Huang, Ting-Wei Hou and Hsiao-Hwa Chen

      Version of Record online: 8 JAN 2010 | DOI: 10.1002/wcm.887

      Thumbnail image of graphical abstract

      One of the most challenging issues in wireless sensor networks is to meet coverage and connectivity requirements under given energy constraints. In this paper, a novel topology control algorithm called Adaptive Random Clustering (ARC) is proposed to form a cluster network with required coverage and connectivity without location information. This figure illustrates an example of network connectivity.

    4. A position-based routing algorithm in 3D sensor networks (pages 33–52)

      Alaa M. Al tahan and Mohamed K. Watfa

      Version of Record online: 8 JAN 2010 | DOI: 10.1002/wcm.888

      Thumbnail image of graphical abstract

      Motivated by the fact that sensor networks would probably be deployed in a three dimensional space, we present a novel 3D geographical routing algorithm (3DGR) that makes use of the position information to route packets from sources to destinations with high path quality and reliability. Compared to other geographic routing algorithms, 3DGR exhibits noticeably longer network lifetime, smaller path stretch, smaller end-to-end delay and better packet delivery ratio.

    5. A study on wireless sensor network based indoor positioning systems for context-aware applications (pages 53–70)

      Jing Wang, R. Venkatesha Prasad, Xueli An and Ignas G. M. M. Niemegeers

      Version of Record online: 8 JAN 2010 | DOI: 10.1002/wcm.889

      Thumbnail image of graphical abstract

      This paper records designing and prototyping a centralized indoor positioning system for tracking a target's position using a wireless sensor network. We present an in-depth discussion on the RSSI-based positioning algorithms both, range-based and range-free, with special concerns to improve accuracy and efficiency. The results show that positioning systems with adequate accuracy can be built with our proposed schemes, and we further expect to integrate these positioning schemes into a multitude of systems with location aware applications.

    6. Hierarchical multicast in wireless sensor networks with mobile sinks (pages 71–84)

      Shiow-Fen Hwang, Kun-Hsien Lu, Yi-Yu Su, Chi-Sen Hsien and Chyi-Ren Dow

      Version of Record online: 4 JAN 2010 | DOI: 10.1002/wcm.890

      Thumbnail image of graphical abstract

      In this paper, we propose a grid-based hierarchical multicast routing protocol in WSNs with mobile sinks. We utilize location servers to manage the information about the locations of receivers (sinks), and then distributively construct a multicast tree which can be shared by multiple sources. Moreover, an effective maintenance mechanism is employed to reduce the update cost and energy consumed by sink mobility, and make the multicast tree more stable and robust as well.

    7. A link layer protocol and link-state routing protocol suite for multi-channel ad hoc networks (pages 85–98)

      Wonyong Yoon and N. H. Vaidya

      Version of Record online: 8 JAN 2010 | DOI: 10.1002/wcm.891

      Thumbnail image of graphical abstract

      We propose a link layer protocol and link-state routing protocol suite for multi-channel ad hoc networks where nodes equipped with two radio interfaces want to utilize available channels. We show that (1) a hybrid channel assignment is good for connectivity and amenable to shortest-path routing, (2) seeking a shortest-path can be a better routing strategy in terms of global system throughput than complex channel-diverse routing, and (3) channel switching delay is not a throttling factor in terms of global system throughput.

    8. Broadcast based on layered diffusion in wireless ad hoc and sensor networks (pages 99–115)

      Bang Wang, Hock Beng Lim and Di Ma

      Version of Record online: 8 DEC 2009 | DOI: 10.1002/wcm.892

      Thumbnail image of graphical abstract

      This paper proposes a simple yet efficient broadcast protocol, which is a stateless broadcast protocol with very low message overheads and very low computation requirements. The design idea is to emulate the triangular tessellation for complete area coverage, while the protocol does not require nodes' location information for such tessellation emulation but only exploits the hop count information for each node to make local rebroadcast decision and timing.

    9. Distributed inferencing with ambient and wearable sensors (pages 117–131)

      Louis Atallah, Douglas McIlwraith, Surapa Thiemjarus, Benny Lo and Guang-Zhong Yang

      Version of Record online: 15 APR 2010 | DOI: 10.1002/wcm.893

      Thumbnail image of graphical abstract

      Scalable and distributed reasoning is preferable when compared to centralised inference in wireless sensor networks, due to the large amounts of data collected and the complexity of emergent patterns. This allows network wide decisions to be reached robustly without specific reliance on particular network components. In this paper, we provide an overview of distributed inference for both wearable and ambient sensing with specific focus on graphical models - demonstrating a framework for distributed, real-time activity monitoring within a home healthcare environment.

    10. On the energy cost of authenticated key agreement in wireless sensor networks (pages 133–143)

      David Galindo, Rodrigo Roman and Javier Lopez

      Version of Record online: 8 JAN 2010 | DOI: 10.1002/wcm.894

      Thumbnail image of graphical abstract

      We illustrate to what extent the latest implementation advancements push the efficiency boundaries of public key cryptography in wireless sensor networks. Our conclusions challenge the common wisdom which states that symmetric key cryptography is more energy-efficient than public key cryptography in wireless embedded devices.