Node-disjoint Routing Paths Research Articles

Geographic Node-Disjoint Path Routing for Wireless Sensor Networks

One of the challenging issue in wireless sensor networks (WSNs) is efficiently route the multimedia information. In this letter, we propose an efficient geographic routing algorithm for multimedia data transmission such as audio, video, etc., in WSNs. It finds one near to shortest path per iteration and can be performed repeatedly iteration to find more on-demand shortest node-disjoint routing paths. This algorithm achieves high-throughput with low delay that is required for multimedia data transmission over WSNs.

TPGF: geographic routing in wireless multimedia sensor networks

In this paper, we propose an efficient Two-Phase geographic Greedy Forwarding (TPGF) routing algorithm for WMSNs. TPGF takes into account both the requirements of real time multimedia transmission and the realistic characteristics of WMSNs. It finds one shortest (near-shortest) path per execution and can be executed repeatedly to find more on-demand shortest (near-shortest) node-disjoint routing paths. TPGF supports three features: (1) hole-bypassing, (2) the shortest path transmission, and (3) multipath transmission, at the same time. TPGF is a pure geographic greedy forwarding routing algorithm, which does not include the face routing, e.g., right/left hand rules, and does not use planarization algorithms, e.g., GG or RNG. This point allows more links to be available for TPGF to explore more routing paths, and enables TPGF to be different from many existing geographic routing algorithms. Both theoretical analysis and simulation comparison in this paper indicate that TPGF is highly suitable for multimedia transmission in WMSNs.

Context-aware cross-layer optimized video streaming in wireless multimedia sensor networks

The appearance of wireless multimedia sensor networks (WMSNs) requires a new generation transmission paradigm towards intelligent and ubiquitous communication. Video sensors are used in WMSNs to enhance the capability for event description. Multiple routing paths are often used for transmitting video streams. However, not every path found by multi-path routing algorithm is suitable for transmitting video, because a long routing path with a long end-to-end transmission delay may not satisfy the time constraint of the video. Furthermore, each video stream includes two kinds of information: image and audio streams. In different applications, image and audio streams play different roles, and the importance levels are different. Higher priority should be given to the more important stream (either the image stream or the audio stream) to guarantee the using of limited bandwidth and energy in WMSNs. In this paper, we propose a context-aware cross-layer optimized Multi-Path Multi-Priority (MPMP) transmission scheme, in which a Two-Phase geographic Greedy Forwarding (TPGF) multi-path routing protocol is used in network layer to explore the maximum number of node-disjoint routing paths, and a Context-Aware Multi-path Selection algorithm (CAMS) is used in transport layer to choose the maximum number of paths from all found node-disjoint routing paths for maximizing the gathering of the most valuable information to the base station. Simulation results show that the MPMP scheme can effectively maximize the gathering of the most valuable information and guarantee the end-to-end transmission delay.

Ant-based Energy-aware Disjoint Multipath Routing Algorithm for MANETs

Ant-based routing protocols for mobile ad hoc networks (MANETs) have been widely explored, but most of them are essentially single-path routing methods that tend to impose a heavy burden on the hosts along the shortest path from source to destination. In this paper, we combine swarm intelligence and node-disjoint multipath routing to alleviate these problems. A novel approach called ant-based energy-aware disjoint multipath routing algorithm (AEADMRA) is proposed. AEADMRA is based on swarm intelligence and especially on the ant colony-based meta heuristic. AEADMRA can discover multiple energy-aware node-disjoint routing paths with a low routing overhead. Simulation results indicate that the performance of AEADMRA outperforms other pertinent algorithms.

QoS in Node-Disjoint Routing for Ad Hoc Networks

Ad hoc network (MANET) is a collection of mobile nodes that can communicate with each other without using any fixed infrastructure. To support multimedia applications such as video and voice MANETs require an efficient routing protocol and quality of service (QoS) mechanism. Node-Disjoint Multipath Routing Protocol (NDMR) is a practical protocol in MANETs: it reduces routing overhead dramatically and achieves multiple node-disjoint routing paths. QoS support in MANETs is an important issue as best-effort routing is not efficient for supporting multimedia applications. This paper presents a novel adaptation of NDMR, QoS enabled NDMR, which introduces agent-based SLA management. This enhancement allows for the intelligent selection of node-disjoint routes based on network conditions, thus fulfilling the QoS requirements of Service Level Agreements (SLAs).