Multicast in Wireless Sensor Networks The next step

Silva, Jorge Sá; Camilo, Tiago; Rodrigues, André; Silva, M.; Gaudêncio, Filipa; Boavida, Fernando

doi:10.1109/iswpc.2007.342598

Cited by 11 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Intuitively, while multicasting is expected to be a more efficient method of data distribution for small group sizes, broadcasting would be more efficient for large group sizes. Thus it is obvious that in multicast communication the management of WSNs may benefit by reducing the number of transmitted packets and also by saving the energy [12], [7].…”

Section: Background and Related Work Multicast Approach In Wsnsmentioning

confidence: 99%

“…Multi casting potentially optimises bandwidth consumption and node resources, when several users simultaneously participate in a communication session [7]. The main design objectives of multicasting mechanisms is to achieve high efficiency in terms of minimizing the number of relaying nodes, minimizing the total transmission power, and maximizing the network lifetime.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On Demand Multicast Routing in Wireless Sensor Networks

Sule

Shah

Doddapaneni

et al. 2014

2014 28th International Conference on Advanced Information Networking and Applications Workshops

View full text Add to dashboard Cite

Abstract-The wireless networking environment presents imposing challenges to the study of broadcasting and multicasting problems. Developing an algorithm to optimize communication amongst a group of spatially distributed sensor nodes in a WSN (Wireless Sensor Network) has been met with a number challenges due to the characterization of the sensor node device. These challenges include, but are not limited to: energy, memory, and throughput constraints. The traditional approach to overcome these challenges have emphasised the development of low power electronics, efficient modulation, coding, antenna design etc., it has been recognised that networking techniques can also have a strong impact on the energy efficiency of such systems. A variety of networking based approaches to energy efficiency are possible. One of the well-known approaches is to apply clustering techniques to effectively establish an ordered connection of sensor nodes whilst improving the overall network lifetime. This paper proposes an improved clustering based multicast approach that allows any CH to be a multicast source with an unlimited number of subscribers, to optimize group communication in WSNs whilst ensuring sensor nodes do not deprecate rapidly in energy levels. We review several clustering approaches and examine multicast versus broadcast communication in WSNs.

show abstract

Section: Background and Related Work Multicast Approach In Wsnsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

On Demand Multicast Routing in Wireless Sensor Networks

Sule

Shah

Doddapaneni

et al. 2014

2014 28th International Conference on Advanced Information Networking and Applications Workshops

View full text Add to dashboard Cite

show abstract

“…This simultaneous forwarding of the same packet in a proximity by multiple routers leads to spatially correlated contention. A detailed discussion on multicast in WSN can be found in [3].…”

Section: Introductionmentioning

confidence: 99%

A Distributed TDMA Slot Scheduling Algorithm for Spatially Correlated Contention in WSNs

Bhatia

Hansdah

2015

Mobile Information Systems

View full text Add to dashboard Cite

In WSNs the communication traffic is often time and space correlated, where multiple nodes in a proximity start transmitting simultaneously. Such a situation is known asspatially correlated contention. The random access method to resolve such contention suffers from high collision rate, whereas the traditional distributed TDMA scheduling techniques primarily try to improve the network capacity by reducing the schedule length. Usually, the situation ofspatially correlated contentionpersists only for a short duration, and therefore generating an optimal or suboptimal schedule is not very useful. Additionally, if an algorithm takes very long time to schedule, it will not only introduce additional delay in the data transfer but also consume more energy. In this paper, we present a distributed TDMA slot scheduling (DTSS) algorithm, which considerably reduces the time required to perform scheduling, while restricting the schedule length to the maximum degree of interference graph. The DTSS algorithm supports unicast, multicast, and broadcast scheduling, simultaneously without any modification in the protocol. We have analyzed the protocol for average case performance and also simulated it using Castalia simulator to evaluate its runtime performance. Both analytical and simulation results show that our protocol is able to considerably reduce the time required for scheduling.

show abstract

“…In one‐to‐many and many‐to‐many applications, multicasting is more efficient than unicasting or broadcasting, in terms of both packet delivery and energy consumption. In recent years, issues associated with multicasting in WSNs have been discussed and some multicasting protocols have been proposed 8–20. However, most of the available approaches are not designed for an environment that includes mobile receivers.…”

Section: Introductionmentioning

confidence: 99%

Hierarchical multicast in wireless sensor networks with mobile sinks

Hwang

et al. 2011

Wireless Communications

View full text Add to dashboard Cite

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.

show abstract

Multicast in Wireless Sensor Networks The next step

Cited by 11 publications

References 13 publications

On Demand Multicast Routing in Wireless Sensor Networks

On Demand Multicast Routing in Wireless Sensor Networks

A Distributed TDMA Slot Scheduling Algorithm for Spatially Correlated Contention in WSNs

Hierarchical multicast in wireless sensor networks with mobile sinks

Contact Info

Product

Resources

About