Multipath Routing Techniques in Wireless Sensor Networks: A Survey

Sha, Kewei; Gehlot, Jegnesh; Greve, Robert A.

doi:10.1007/s11277-012-0723-2

Cited by 130 publications

(74 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This category defined how the source node finds a route to a destination node. This routing family is subdivided into three sub-categories [3]. Each routing family has its advantages and drawbacks as shown in …”

Section: Related Workmentioning

confidence: 99%

A New Enhanced Version of Vleach Protocol Using a Smart Path Selection

Aziz¹

2017

Geomate

View full text Add to dashboard Cite

Wireless technology becomes a fast developed research field in order to respond to our needs. It has various applications such as health care, emergency situations, industrial applications and home automation. It has several challenges like security and quality of service. Sensor node has a limited energy related to its tiny battery. Hence, energy efficiency is considered as an important challenge in Wireless Sensor Networks (WSNs). This paper aims at describing the various routing categories and the different efficient routing protocols. Along with this, a new enhanced version of the VLEACH protocol based on selecting the routing path efficiently is also proposed in this paper. The efficient selection process is based on electing the Cluster Heads (CHs) and the Vice-CH according to the highest residual energy. In addition, it uses a cooperative routing between the CHs and Vice-CHs in order to reduce the network energy consumption. Implementation of Basic VLEACH and Proposed VLEACH is done using NS-2 Simulator. Simulation results show that the new scheme is more efficient than the original VLEACH protocol. This protocol will increase the lifetime of sensor networks. So the proposed work can be applied in various WSNs which are deployed in remote areas and recharging of sensor nodes is an issue.

show abstract

Section: Related Workmentioning

confidence: 99%

A New Enhanced Version of Vleach Protocol Using a Smart Path Selection

Aziz¹

2017

Geomate

View full text Add to dashboard Cite

show abstract

“…To select reliable routes and promote robustness against link failure, contemporary routing approaches consider optimising the packet delivery rate or the path failure probability [5]; see for example [23,24,25,26,27]. A common strategy is to send all messages via the most reliable path, switching to the next reliable path if the current path fails [7,26].…”

Section: Robustnessmentioning

confidence: 99%

“…Multi-path routing has become popular in the past few years (for recent surveys on multipath routing in wireless sensor networks see [23,5,4]). This is primarily because multiple paths for sending data are particularly useful for balancing load to achieve better network lifetime (as a proxy for energy efficiency) and improving reliability under uncertainty at links.…”

Section: Related Workmentioning

confidence: 99%

Evolutionary multi-path routing for network lifetime and robustness in wireless sensor networks

2016

View full text Add to dashboard Cite

Wireless sensor networks frequently use multi-path routing schemes between nodes and a base station. Multi-path routing confers additional robustness against link failure, but in batterypowered networks it is desirable to choose paths which maximise the overall network lifetime -the time at which a battery is first exhausted. We introduce multi-objective evolutionary algorithms to find the routings which approximate the optimal trade-off between network lifetime and robustness. A novel measure of network robustness, the fragility, is introduced. We show that the distribution of traffic between paths in a given multi-path scheme that optimises lifetime or fragility may be found by solving the appropriate linear program. A multi-objective evolutionary algorithm is used to solve the combinatorial optimisation problem of choosing routings and traffic distributions that give the optimal trade-off between network lifetime and robustness. Efficiency is achieved by pruning the search space using k-shortest paths, braided and edge disjoint paths. The method is demonstrated on synthetic networks and a real network deployed at the Victoria & Albert Museum, London. For these networks, using only two paths per node, we locate routings with lifetimes within 3% of those obtained with unlimited paths per node. In addition, routings which halve the network fragility are located. We also show that the evolutionary multi-path routing can achieve significant improvement in performance over a braided multi-path scheme.

show abstract

“…Many algorithms for failure detection in wireless sensor networks have been proposed and implemented with their share of pros and cons [10][11][12]. Fault management architecture and smart detection techniques tend to address failure detection in WSN [13,14].…”

Section: Related Workmentioning

confidence: 99%