Hybrid data dissemination protocol (HDDP) for wireless sensor networks

Gabsi, Mohamed; Pathan, Al-Sakib Khan

doi:10.1007/s11276-016-1432-7

Cited by 8 publications

(7 citation statements)

References 50 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As sensor nodes are equipped built-in battery-powered and hence their lifespans are short, the researcher gave keen attention to these issues in almost every protocol developed at every layer of the protocol stack. To further enhance the network lifetime and conserve energy, a data query dissemination and gathering scheme is presented in [2]. In this work, the authors gave the concept of the parameterized query based on the user's profile to get the required data from the sensor nodes.…”

Section: Related Workmentioning

confidence: 99%

“…Wireless sensor networks are used to monitor the terrain either reachable or unreachable to human beings. A sensor node in the network can sense, process, and deliver data to its neighboring nodes or to the base station (BS), i.e., sink node either directly or in multihop fashion [1][2][3][4], etc. These types of networks are resource constraint in terms of memory, processing, bandwidth, and node residual battery (energy).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

EEHRT: Energy Efficient Technique for Handling Redundant Traffic in Zone-Based Routing for Wireless Sensor Networks

Jadoon

Zhou

Khan

et al. 2019

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

This paper presents an energy-efficient technique to handle redundant traffic (EEHRT) in the zone-based routing for wireless sensor networks. In this technique, multihop routing is performed based on the remaining energy of the nodes. Afterwards, it performs position-based routing without the need for the nodes to know their respective position. The main objective of this paper is to handle the redundant packets generated in zone-based routing using short beacon messages. Nodes of lower zones route the data of the higher zone to base station (BS) with a minimum number of hops and utilize only those nodes on the path which are energy efficient and located closer to BS. Moreover, the source node is acknowledged by the relaying node using a wireless broadcast advantage (WBA) without sending any special ACK packet to the sender, which reduces the control overhead in the routing process. The EEHRT technique improves the routing against RARZ by ensuring only one copy of the packet is propagated at each hop along the routing path to BS. Simulation results show that EEHRT achieved 28% improvement in energy efficiency, 10% and 25% improvements in data throughput against total and distinct packet reception at BS respectively, 35% increase in overall network lifetime, and 100% reduction in redundant packets generation and propagation in the network against RARZ routing.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

EEHRT: Energy Efficient Technique for Handling Redundant Traffic in Zone-Based Routing for Wireless Sensor Networks

Jadoon

Zhou

Khan

et al. 2019

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…e researcher gave keen attention to this issue in almost every protocol developed at every layer of the protocol stack. To further enhance the network lifetime and conserve energy, a data query dissemination and gathering scheme is presented in [18]. In this work, authors conceived a concept of the parameterized query based on the user's profile to get the required data from the sensor nodes.…”

Section: Related Workmentioning

confidence: 99%

Performance Evaluation of Zone-Based Routing with Hierarchical Routing in Wireless Sensor Networks

Jadoon

Zhou

Khan

et al. 2019

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Routing remains a most challenging task in sensor networks because of constrained resources like battery power, processing, and memory. Many energy efficiency techniques for the sensor networks have been proposed, among which hierarchical routing is considered the most energy-efficient and extended network lifetime technique. This technique has a lesser number of transmissions in the network. On the contrary, zone-based routing claims lesser control and routing overhead on the overall network lifetime. In this research, a simulation-based comparison of zone-based routing with static clustering hierarchical routing is conducted. The simulation results show that the zone-based routing outperforms hierarchical routing with static clustering in terms of energy efficiency, network lifetime, and throughput.

show abstract

“…For example, one same electrical unit supplies power to a few nodes. When this power unit fails-battery lifetime is a notorious issue of sensor nodes [14]-the corresponding nodes induce a faulty cluster. As another example, several nodes can be managed by one same hosting or controlling device, like two IoT things which depend on one controlling unit, or a blade inside a cabinet of a supercomputer.…”

Section: Introductionmentioning

confidence: 99%

Cluster-Fault Tolerant Routing in a Torus

Bossard

Kaneko

2020

Sensors

View full text Add to dashboard Cite

The number of Internet-connected devices grows very rapidly, with even fears of running out of available IP addresses. It is clear that the number of sensors follows this trend, thus inducing large sensor networks. It is insightful to make the comparison with the huge number of processors of modern supercomputers. In such large networks, the problem of node faults necessarily arises, with faults often happening in clusters. The tolerance to faults, and especially cluster faults, is thus critical. Furthermore, thanks to its advantageous topological properties, the torus interconnection network has been adopted by the major supercomputer manufacturers of the recent years, thus proving its applicability. Acknowledging and embracing these two technological and industrial aspects, we propose in this paper a node-to-node routing algorithm in an n -dimensional k -ary torus that is tolerant to faults. Not only is this algorithm tolerant to faulty nodes, it also tolerates faulty node clusters. The described algorithm selects a fault-free path of length at most n ( 2 k + ⌊ k / 2 ⌋ − 2 ) with an O ( n 2 k 2 | F | ) worst-case time complexity with F the set of faulty nodes induced by the faulty clusters.

show abstract

Hybrid data dissemination protocol (HDDP) for wireless sensor networks

Cited by 8 publications

References 50 publications

EEHRT: Energy Efficient Technique for Handling Redundant Traffic in Zone-Based Routing for Wireless Sensor Networks

EEHRT: Energy Efficient Technique for Handling Redundant Traffic in Zone-Based Routing for Wireless Sensor Networks

Performance Evaluation of Zone-Based Routing with Hierarchical Routing in Wireless Sensor Networks

Cluster-Fault Tolerant Routing in a Torus

Contact Info

Product

Resources

About