Algorithm for multicast opportunistic routing in wireless mesh networks
26 Feb 2017-pp 250-255
TL;DR: The proposed scheme of Multicast Opportunistic Routing (MOR) in WMNs is based on the broadcast transmissions and Learning Au-tomata (LA) to expand the potential candidate nodes that can aid in the process of retransmission of the data.
Abstract: Multi-hop Wireless Mesh Networks (WMNs) is a promising new technique for communication with routing protocol designs being critical to the effective and efficient of these WMNs. A common approach for routing traffic in these networks is to select a minimal distance from source to destination as in wire-line networks. Opportunistic Routing(OR) makes use of the broadcasting ability of wireless network and is especially very helpful for WMN because all nodes are static. Our proposed scheme of Multicast Opportunistic Routing(MOR) in WMNs is based on the broadcast transmissions and Learning Au-tomata (LA) to expand the potential candidate nodes that can aid in the process of retransmission of the data. The receivers are required to be in sync with one another in order to avoid duplicated broadcasting of data which is generally achieved by formulating the forwarding candidates according to some LA based metric. The most adorable aspect of this protocol is that it intelligently "learns" from the past experience and improves its performance. The results obtained via this approach of MOR, shows that the proposed scheme outperforms with some existing sachems and is an improved and more effective version of opportunistic routing in mesh network.
Citations
More filters
TL;DR: A dynamic rate aware classified key distributional secure routing (DRCKDS) is proposed, in which the sensor nodes maintain various factors related to the neighbor like energy, transmission involvement, rate of success and so on.
Abstract: To transmit information over the industrial network today, you need data in a secure way to make it a high security root. Routing security issues in the wireless web network have been well studied. The problem of security in routing in wireless mesh networks (WMN) has been well studied. There exist numerous techniques to resolve this issue but differ and suffer to achieve higher security performance in WMN. To resolve this issue, a dynamic rate aware classified key distributional secure routing (DRCKDS) is proposed. In this approach, the sensor nodes maintain various factors related to the neighbor like energy, transmission involvement, rate of success and so on. According to this, available routes are identified to reach the destination from the source. For each route identified, the method computes the secure route measure (SRM). According to the SRM value, an optimal route is selected for the transmission. Similarly, the method generates different secret keys and distributes them through the transmission route selected. The same key has been used to encrypt the data and forward the packet through the route selected. The method improves the security performance and improves the quality of service of WMN.
11 citations
References
More filters
Journal Article•
TL;DR: The paper presents the MORE on the basis of the principle of Network coding and evaluation of the performance of MORE, a MAC-independent Opportunistic Routing Protocol.
Abstract: This paper firstly introduces the detail of the Extremely opportunistic Routing (ExOR)protocol which is an integrated routing and MAC technique After the evaluation of the performance of ExOR,a MAC-independent Opportunistic Routing Protocol (MORE) is introduced The paper presents the MORE on the basis of the principle of Network coding and evaluation of the performance of MORE
52 citations
"Algorithm for multicast opportunist..." refers background in this paper
...The WMN [8] is typically used to provide connectivity to an infrastructure network, connected to the Internet....
[...]
...The routing protocols in Wireless Mesh Networks (WMN)[11-13] has been largely influenced by Ad-Hoc networks (e....
[...]
...The routing algorithm directly affects the WMN’s characteristics....
[...]
...Opportunistic Routing(OR) makes use of the broadcasting ability of wireless network and is especially very helpful for WMN because all nodes are static....
[...]
...technique for communication with routing protocol designs being critical to the effective and efficient of these WMNs....
[...]
Journal Article•
TL;DR: A survey of the most significant opportunistic routing protocols for multihop wireless networks, based on the use of broadcast transmissions to expand the potential forwarders that can assist in the retransmission of the data pack ets.
Abstract: Opportunistic routing is based on the use of broadcast transmissions to expand the potential forwarders that can assist in the retransmission of the data pack ets. The receptors need to be coordinated in order to avoid duplicated transmissions. This is usually achieved by ordering the forwarding nodes according to some criteria. The proposed opport unistic routing protocols differ in the criterion to order the receptors and the way the receptors coordinate. This paper presents a survey of the most significant opportunistic routing protocols for multihop wireless networks.
41 citations
"Algorithm for multicast opportunist..." refers background in this paper
...[11] R. Draves, J. Padhye, B. Zill, Routing in Multi-Radio, Multi- Hop Wireless Mesh Networks, ACM MobiCom’04, 2004, Philadelphia, Pennsylvania, USA....
[...]
...•node[…]: Total number of nodes in Wireless Mesh Networks....
[...]
...Then, we discuss LA concepts for Opportunistic Routing in Wireless Mesh Networks in Section 3....
[...]
...[6] E. Rozner, J. Seshadri, Y. Mehta, L. Qiu, SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks, IEEE Transactions on Mobile Computing, vol.8, no. 12, pp. 1622-1635, December 2009....
[...]
...Routing is an elementary factor of Wireless Mesh Networks [9, 10]....
[...]
TL;DR: This work proposes a coverage-tree heuristic based routing instead of face routing in geographic routing schemes when greedy forwarding fails, and shows that the coverage tree based routing problem is NP hard by reduction using minimum rooted spanning tree of depth 2 (RST 2).
Abstract: Geographic routing scheme (such as Greedy perimeter stateless routing) makes use of location information to forward packets greedily Nodes need to keep only this location information in stateless routing When the greedy forwarding fails, routing switches to perimeter forwarding based on either planar graph (GG and RNG) or cross link detection protocol approaches However, it has drawback in terms of cost and computational overheads We propose a coverage-tree heuristic based routing instead of face routing in geographic routing schemes when greedy forwarding fails We prove that the coverage tree based routing problem is NP hard by reduction using minimum rooted spanning tree of depth 2 (RST 2) We also show that coverage-tree based geographic routing problem is APX hard and not approximable with a factor of $$1/2(1-\in ) \ln n$$1/2(1-?)lnn for any fixed $$\in > 0$$?>0 unless $$NP\subseteq DTIME(n^{\log \log n})$$NP⊆DTIME(nloglogn) Our proposed scheme of coverage-tree heuristics based geographic routing is $$(1+\ln m)$$(1+lnm)-approximation algorithm, a polynomial time algorithm using minimum distance topology knowledge On performance comparison using simulation, our proposed scheme outperforms with the competitive schemes in term of success rate, network overhead and success rate against varying node density
29 citations
"Algorithm for multicast opportunist..." refers background in this paper
...Vehicular Ad Hoc Networks (VANETs) [17,18, 21] have emerged as a key technology to be used in next generation wireless networks[20,21]....
[...]
...A LA[19,20] is an abstract model that learns the optimal action out of a finite set of actions through continuous interactions with a random environment....
[...]
01 Feb 2015
TL;DR: The proposed approach which is called Dynamic Cooperative Routing (DCR) modifies MORE and equips it with an adaptive decision making mechanism that outperforms MORE when two or more flows are active simultaneously and in the presence of background unicast traffic.
Abstract: Opportunistic routing is a promising routing paradigm that achieves high throughput by utilizing the broadcast nature of wireless media. It is especially useful for wireless mesh networks due to their static topology. In the current opportunistic routing protocols, it is assumed that all nodes have enough incentive and resource to help the source regardless of their load and presence of other network flows. In addition, the effect of each active flow on other flows and network status is reflected latter by means of a link quality metric (e.g. ETX) which is updated periodically. The coarse-grained behavior of the metric is not in harmony with network flows dynamics. Therefore, some flows may undergo performance degradation between two consecutive periodic updates of the metric. Our proposed approach which is called Dynamic Cooperative Routing (DCR) modifies MORE and equips it with an adaptive decision making mechanism. We use learning automata to accommodate network dynamics when building an opportunistic path for a flow. The learning automata are activated whenever the source transmits a new data batch for the flow. We have shown through simulation that DCR outperforms MORE when two or more flows are active simultaneously and in the presence of background unicast traffic.
14 citations
17 Oct 2010
TL;DR: A simple framework under which the key elements of an adaptive probabilistic forwarding scheme are defined and it is shown that it outperforms the opportunistic elements of two well-known opportunistic routing protocols: SOAR and Directed Transmission, in terms of delay and resource utilization, under varying channel error and misinformation conditions.
Abstract: Opportunistic routing has recently been proposed to take advantage of the broadcast nature and spatial diversity of the wireless medium and cope with unreliable transmissions. Within this "opportunistic routing hype", complex routing schemes with opportunistic features have been proposed, but their performance gains can not be clearly attributed to their opportunistic character, since they also include other strong optimization features applicable to classical routing. A goal of this work is to study how purely wireless primitives and design characteristics affect a routing scheme with opportunistic features and thus design a new such scheme. To this end we introduced a simple framework under which, through simulation, we defined the key elements of an adaptive probabilistic forwarding scheme. We show that it outperforms the opportunistic elements of two well-known opportunistic routing protocols: SOAR and Directed Transmission, in terms of delay and resource utilization, under varying channel error and misinformation conditions and due to its simplicity, the gains can be clearly attributed to its core features.
14 citations
Additional excerpts
...technique for communication with routing protocol designs being critical to the effective and efficient of these WMNs....
[...]
...The features of WMNs that have strong effects on routing needs to be identified in order to have a clear picture of WMN routing....
[...]
...The WMN [8] is typically used to provide connectivity to an infrastructure network, connected to the Internet....
[...]
...The routing algorithm directly affects the WMN’s characteristics....
[...]
...Opportunistic Routing(OR) makes use of the broadcasting ability of wireless network and is especially very helpful for WMN because all nodes are static....
[...]