Hierarchical multicast in wireless sensor networks with mobile sinks

Abstract

In most studies of wireless sensor networks (WSNs), sensor nodes and sinks are typically stationary. However, mobile sinks are required in various applications of real-life environments, and delivering sensed data to mobile sinks using ordinary routing protocols is very inefficient. Multicasting is an important process in the minimization of the number of transmissions in WSNs. Since sensor nodes have limited resources, many studies have focused on how to send data to specific receivers efficiently. This work presents a grid-based hierarchical multicast (HM) routing protocol for WSNs with mobile sinks. Location servers (LSs) are adopted to manage the information about the locations of receivers and then a multicast tree is constructed distributively to reduce the update cost and energy consumed by sink mobility. The multicast tree can be shared by multiple sources, reducing the path construction overhead. Furthermore, effective maintenance mechanisms that make the multicast tree more stable and robust are presented. Finally, the performance of the proposed HM is investigated by simulation. Simulation results demonstrate that the proposed protocol has a lower energy consumption and higher multicast efficiency than distributed multicast routing protocol (DMRP) and hierarchical geographic multicast routing (HGMR), especially when many sources and receivers are involved.This section first introduces the assumptions of the network model, and then describes the construction of hierarchical grid and the selection of location servers (LSs). AssumptionsThe network model is based on the following basic assumptions.r Sensor nodes are uniformly deployed in the sensor network and remain stationary at their initial locations.

RoCoCo: Receiver-Initiated Opportunistic Data Collection and Command Multicasting for WSNs

“…Neither the resulting energy demand nor the incurred routing overhead are discussed in detail, and thus their applicability in WSNs with limited energy budgets is unclear. While aforementioned approaches are primarily based on the composition of multicast groups, a number of contributions have analyzed the optimum structure of the routing tree in order to achieve delivery of messages at the smallest possible overhead ( [25,31,14,10]). The papers however exclusively focus on routing when group memberships are known and provide no support for the dynamic creation and adaptation of groups.…”

An Efficient Algorithm of Constructing Virtual Backbone Scheduling for Maximizing the Lifetime of Dual-Radio Wireless Sensor Networks

“…V uses a small-range radio to locally broadcast the message. (5) else if is a message from node then (6) if V is the most powerful node in ⋅ ℎ ∩ V ⋅ ℎ ∪ {V} then (7) V is marked as black. ( 8)…”

“…Wireless sensor networks are composed of many wireless sensors deployed in a wide range of areas, where each sensor is able to communicate with others through intersensor wireless communication [1][2][3][4][5]. The wireless sensor networks are able to collect, process, and store environmental information [6][7][8]. In wireless sensor networks, the batteries are the main energy sources of sensors, while the sensor nodes are expected to work in batteries for a long time without charging their batteries.…”

Energy‐efficient multicast routing scheme for wireless sensor networks

“…Nowadays, many energy‐efficient multicast routing protocols for WSNs have been put forward, including tree‐based multicast protocols, such as recently proposed EBMR (energy‐balanced multicast routing) , MTMRP (minimum transmission multicast routing protocol) , Z‐Cast (multicast routing in ZigBee cluster‐tree) and HM (grid‐based hierarchical multicast) . In tree‐based multicast routing protocols, multicast tree is constructed first, and then, data are disseminated along the tree.…”