Delay constraint multipath routing for wireless multimedia ad hoc networks

Sun, Yanjing; Sun, Jianguang; Zhao, Fangfang; Hu, Zhuoxian

doi:10.1002/dac.2814

Cited by 20 publications

(17 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Vasilakos et al 9 present a fuzzy method to predict load on different links. Sun et al 25 propose a multipath method called QoS multipath optimized link state routing (QoS MOLSR). While selecting a path, the probability of refusing future connections through this path is taken into consideration for cost calculation.…”

Section: Related Workmentioning

confidence: 99%

An efficient load balancing method for ad hoc networks

Singh

2018

Int J Communication

View full text Add to dashboard Cite

Routing is the most basic and essential operation of any ad hoc network. A mobile ad hoc network presents many challenges, because of the severe resource limitations such as dynamic and varying topology, lack of centralized control, insecure medium, and limited battery power, among others. Therefore, optimization and conservation is the key to success of any ad hoc network operation. In this paper, we propose and define 2 new metrics for ad hoc networks: bandwidth utilization ratio and load index. These metrics can be used as an indicator to measure and monitor the network usability and to improve its efficiency by efficient load distribution. They can be used to predict the additional load that can be accommodated in the network, without causing any congestion or overflows. We also propose a new load balancing routing scheme for ad hoc networks, called efficient load balancing method. This method tries to offset the load on different paths using load index as a metric. Load index is defined as a measure of a node's degree of involvement in the message routing process, which is indicative of its load. To make this algorithm efficient, we limit our routes to a few efficient ones only. This number of alternate routes used, out of the pool of all available routes, is defined as degree of distribution. Simulation results adequately prove the efficiency of proposed method, vis-à-vis 2 other load balancing approaches, and these are verified statistically at 99% confidence interval. A p × q factorial design is used to verify that simulation results are the actual measurements and not due to some unknown errors. little longer to establish routes, they help in reducing the overheads, as routes to all destinations may not be required at all times.• Proactive routing protocols: Also known as table-driven protocols, these methods maintain up to date routing information for all destinations, all the time. 2 Any changes in the network are continually updated by exchange of information. These methods are generally faster, as paths are readily available. • Hybrid routing protocols: These methods provide a trade-off between the above 2 approaches. This is done to obtain the goodies of both methods. The general way of working of these methods is dividing the network in small regions or clusters. The proactive approach is followed for routing within short distances, usually within the regions. For interregion communication, the reactive approach is usually preferred, to reduce the costs.Routing is required for almost any kind of operation to be performed in an ad hoc network. Traditionally, most routing methods rely on shortest path algorithms to build efficient paths. Shortest path methods do provide efficient network characteristics with very little overheads, but they fail to maintain this efficiency once the load is gradually increased. 3 With high traffic loads, some nodes take most of the load and become a bottleneck for efficient routing. In situations such as on-demand video, audio transmissions, applications involving geog...

show abstract

Section: Related Workmentioning

confidence: 99%

An efficient load balancing method for ad hoc networks

Singh

2018

Int J Communication

View full text Add to dashboard Cite

show abstract

“…The elevation angle in the HAP system is larger than or equal 20°. The most important factor in the simulation of mobile ad hoc network is the distance between nodes [42]. Platforms are positioned at the altitude of 17 km.…”

Section: Simulation Infrastructurementioning

confidence: 99%

“…Random direction mobility model, which has been applied in [41], is used to change the mobile nodes speed in addition to determining their movements. The most important factor in the simulation of mobile ad hoc network is the distance between nodes [42]. The Internet is simulated as a collection of nodes, each with its own parameters, protocols, and statistics.…”

Section: Simulation Infrastructurementioning

confidence: 99%

Analysis, design and simulation of Internet of Things routing algorithm based on ant colony optimization

Said

2016

Int J Communication

View full text Add to dashboard Cite

In this paper, a routing algorithm to optimize the selection of the best path for the transmitted data within the Internet of Things (IoT) system is proposed. The algorithm controls the use of ant colony ideas in the IoT system to obtain the best routing benefit. It divides the IoT environment into categorized areas depending on network types. Then, it applies the most suitable ant colony algorithm to the concerned network within each area. Furthermore, the algorithm considers routing problem in intersected areas that may arise in case of IoT system. Finally, Network Simulator 2 is used to evaluate the proposed algorithm performance. Simulation results demonstrate the effectiveness of the proposed routing algorithm in terms of end-to-end delay, packet loss ratio, bandwidth consumption, throughput, overhead of control bits, and energy consumption ratio. that the real IoT system consists of four different networks: WSN, HAP, Mobile Ad Hoc, and RFID. These networks are communicated with each other using the Internet. Each network has its own ACO algorithm. The equations describing different ACO algorithms, which are used in the simulation process, are stated as follows. Equations (1)-(4) represent the general form of the ACO algorithm, while the ACO algorithm for WSN is expressed by Equations (5)-(9). Equations (10)-(17) represent the ACO algorithm for the HAP network. The ACO algorithm equations for mobile ad hoc network are described in Equations (18)-(22). The ACO algorithm equations for RFID network are stated in [37][38][39], and the ACO algorithm equations for the Figure 2. The proposed IoT routing algorithm.

show abstract

“…Many multipath routing protocols have been proposed in the literary [5][6][7][8][9][14][15][16][17][18][19][20][21][22][23][24][25] of wireless sensor networks. Most multipath mechanisms are believed to improve the reliability of networks; some of them also are related to energy saving and latency.…”

Section: Related Workmentioning

confidence: 99%

“…In Figure 2(b), the vertices are links except source and destination node, and the edges are scheduling delays. Inspired by M-Dijkstra algorithm proposed in [25], we put forward an improved M-Dijkstra algorithm to search several minimum delay paths from source to the others with the routing metric of delay constraint.…”

Section: M-dijkstra Algorithmmentioning

confidence: 99%

Minimum Delay Multipath Routing Based on TDMA for Underwater Acoustic Sensor Network

Bai

Wang

Shen

et al. 2016

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Multipath routing is an alternative routing technique, which uses redundant paths to deliver data from source to destination. Compared to single path routing protocols, it can address reliability, delay, and energy consumption issues. Thus, multipath routing is a potential technique to overcome the long propagation delay and adverse link condition in underwater environment. However, there are still some problems in multipath routing. For example, the multiple paths may interfere with each other and arouse large end-to-end delay difference amongst multiple paths. This paper proposes a novel multipath routing structure and a conflict-free algorithm based on TDMA scheme. The forwarding nodes are selected based on the propagation delay and location information. This special multiple routing structure not only can ensure parallel multiple transmission without collision, but also can get a small end-to-end delay difference amongst multiple paths. Simulation results show that the multipath routing scheme proposed in this paper outperforms the traditional strategy.

show abstract

Delay constraint multipath routing for wireless multimedia ad hoc networks

Cited by 20 publications

References 26 publications

An efficient load balancing method for ad hoc networks

An efficient load balancing method for ad hoc networks

Analysis, design and simulation of Internet of Things routing algorithm based on ant colony optimization

Minimum Delay Multipath Routing Based on TDMA for Underwater Acoustic Sensor Network

Contact Info

Product

Resources

About