Maximizing Transmission Opportunities in Wireless Multihop Networks

Lee, Jeong-Yoon; Yu, Chansu; Shin, Kang G.; Suh, Young-Joo

doi:10.1109/tmc.2012.159

Cited by 10 publications

(7 citation statements)

References 61 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here, the delay is proportional to and it is expressed as a function of ( 1 � log ). Therefore, the improved QoS for the proposed model is obtained than the traditional approach [18] as shown in Fig. 6.…”

Section: A Speedup Performancementioning

confidence: 93%

A New QUERY-REPLY Driven Routing Protocol with Reachability Analysis for Mobile Networks: DAG based Approach

Dey¹,

Thakurta²

2013

IJCNIS

View full text Add to dashboard Cite

An efficient Query-Reply based routing protocol for mobile networks is proposed in this paper. The alternative paths have been generated between source and destination nodes in the network. A Directed Acyclic Graph (DAG) is developed on the basis of selected right path among the alternatives. The reachability relationship is established on DAG and subsequently it introduces a proactive routing approach. As a result, the time complexity for the proposed routing method is reduced to a desired extent. The simulation studies confirm the improvements of the proposed model over the others.

show abstract

Section: A Speedup Performancementioning

confidence: 93%

A New QUERY-REPLY Driven Routing Protocol with Reachability Analysis for Mobile Networks: DAG based Approach

Dey¹,

Thakurta²

2013

IJCNIS

View full text Add to dashboard Cite

show abstract

“…Therefore, the metric choice has a large impact on the network performance. In the literature, the most commonly used metrics are: the hop count [21]- [25], the geographical distance [26]- [31], the expected transmission count (ETX) [18], [32]- [35], the expected transmission time (ETT) [36]- [38], and the coding gain [39]. Some of these metrics, like ETX and ETT, have also been used in traditional routing.…”

Section: ) Candidate Relays Prioritizationmentioning

confidence: 99%

“…Another variant of this technique uses packet pairs (a special case of probe packets). In ETT-based opportunistic routing [36]- [38], [44], for example, a node sends two unicast probe packets of different size. The receiver measures the difference between the reception times of these packets, and forwards this information to the sender in order to estimate the available bandwidth of the link.…”

Section: ) Candidate Relays Prioritizationmentioning

confidence: 99%

“…Finally, in the cooperative category, a node overhears data packets transmitted by each of its neighbors to estimate its direct links qualities. The second common measurement technique is based on estimation [23], [38], [63]- [66]. For instance, in [65] and [66], each relay listens to a pilot signal and estimates its own instantaneous SNR towards the destination using the method of distributed timers [67].…”

Section: ) Candidate Relays Prioritizationmentioning

confidence: 99%

“…For instance, in [65] and [66], each relay listens to a pilot signal and estimates its own instantaneous SNR towards the destination using the method of distributed timers [67]. On the other hand, the works in [63] and [38] use SNR and SINR measurements to capture inter-flow interference variations.…”

Section: ) Candidate Relays Prioritizationmentioning

confidence: 99%

See 2 more Smart Citations

A Survey on Opportunistic Routing in Wireless Communication Networks

Chakchouk

2015

IEEE Commun. Surv. Tutorials

230

170

View full text Add to dashboard Cite

The great advances made in the wireless technology have enabled the deployment of wireless communication networks in some of the harshest environments like volcanoes, hurricaneaffected regions, and underground mines. In such challenging environments suffering from the lack of infrastructure, traditional routing is not efficient, and sometimes not even feasible. Moreover, the exponential growth of the number of wireless connected devices has created the need for a new routing paradigm that could benefit from the potentials offered by these heterogeneous wireless devices. Hence, in order to overcome the traditional routing limitations, and to increase the capacity of current dynamic heterogeneous wireless networks, the opportunistic routing paradigm has been proposed and developed in recent research works. Motivated by the great interest that has been attributed to this new paradigm within the last decade, we provide a comprehensive survey of the existing literature related to opportunistic routing. We first study the main design building blocks of opportunistic routing. Then, we provide a taxonomy for opportunistic routing proposals, based on their routing objectives as well as the optimization tools and approaches used in the routing design. Hence, five opportunistic routing classes are defined and studied in this paper, namely geographic opportunistic routing, link-state-aware opportunistic routing, probabilistic opportunistic routing, optimization-based opportunistic routing, and cross-layer opportunistic routing. We also review the main protocols proposed in the literature for each class. Finally, we identify and discuss the main future research directions related to the opportunistic routing design, optimization and deployment.

show abstract

Opportunistic Networks: An Empirical Research of Routing Protocols and Mobility Models

Ahmad,

Fathima,

Hossen

et al. 2023

SN COMPUT. SCI.

View full text Add to dashboard Cite

Opportunistic Networks (OppNets) are a sub-part of DTN but are quite different from DTN. OppNets do not need any end to end path between the nodes, as they forward the message in the store-carry-forward method. Due to the absence of an end to end path, nodes forwarding messages may face a delay. The nodes have zero or partial information about its neighboring node due to which uncertainty arises. OppNets are infrastructure-less networks, so they can be implemented in such situation where human reach is not possible. Due to these features, they have gained much interest in researches. OppNets work well when designed in an e cient manner. The two parameters to design a good OppNet are Mobility Model and Routing Protocols. Mobility models de ne the pattern of movement of the nodes and the routing protocols de ne the best, shortest, and e cient path so that a node can reach its destination in the least time possible. Proper selection of the mobility model and routing protocol is crucial in designing an e cient routing protocol. There have been many mobility models and routing protocols de ned till date, and this paper has designed and identi ed the e cient models.DTN in the opportunistic network in Sec. 3. Next secs. 4 and 5 will discuss the taxonomy of mobility models and routing protocols, respectively in detail. Sec. 6 describes how to evaluate the performance of mobility models and routing protocols. Sec. 7 will nally provide the conclusion. Related WorksOppNets [4], a sub-part of DTN, use a store-carry and forward approach to continue the successful communication between two nodes. A continuous connection can be interrupted due to a variety of factors such as limited battery lifetime, lack of capacity, abrupt change of network topologies and routes, and lack of mobility pattern. In DTN, there are a lot of routing protocols [2] and mobility models [4] that will be discussed in this research paper more elaborately. This paper contains all the proposed and implemented strategies for mobility models discussed in Section 4 and for routing protocols in Section 5. The stochastic mobility models are random walk, random waypoint, and random direction. In the traditional random walk (RW) [6] model, the nodes use random speeds for random direction to move in. Random waypoint model [6] uses pause time for newly considered destination. In a random direction model [6], nodes travel randomly until gets an edge. Levy walk model uses power-law distribution to select the pause time used in the random waypoint. The synthetic models, called map-constrained mobility models use the random pattern within the map. Among these models, the most commonly used is the shortest path-based map mobility model [6] where Dijkstra's shortest path strategy is used. In map-based mobility, nodes move with random speed and directions depending on the map. Route-based map mobility uses prede ned paths on the map. Routing protocols can be classi ed based on different categories, geographic, link-state aware, context-aware, probabilistic, optimization,...

show abstract

Maximizing Transmission Opportunities in Wireless Multihop Networks

Cited by 10 publications

References 61 publications

A New QUERY-REPLY Driven Routing Protocol with Reachability Analysis for Mobile Networks: DAG based Approach

A New QUERY-REPLY Driven Routing Protocol with Reachability Analysis for Mobile Networks: DAG based Approach

A Survey on Opportunistic Routing in Wireless Communication Networks

Opportunistic Networks: An Empirical Research of Routing Protocols and Mobility Models

Contact Info

Product

Resources

About