You searched for subject:(Opportunistic routing)
.
Showing records 1 – 30 of
39 total matches.
◁ [1] [2] ▶
1.
林, 卓磨.
モバイルメッシュネットワーク環境における移動端末を追従可能なデータ配送方式の提案 : Efficient Data Delivery to a Moving Node in Mobile Mesh Networks; モバイル メッシュ ネットワーク カンキョウ ニ オケル イドウ タンマツ ニ ツイジュウ カノウナ データ ハイソウ ホウシキ ノ テイアン.
Degree: Nara Institute of Science and Technology / 奈良先端科学技術大学院大学
URL: http://hdl.handle.net/10061/5086
Subjects/Keywords: Opportunistic Routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
林, . (n.d.). モバイルメッシュネットワーク環境における移動端末を追従可能なデータ配送方式の提案 : Efficient Data Delivery to a Moving Node in Mobile Mesh Networks; モバイル メッシュ ネットワーク カンキョウ ニ オケル イドウ タンマツ ニ ツイジュウ カノウナ データ ハイソウ ホウシキ ノ テイアン. (Thesis). Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10061/5086
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
林, 卓磨. “モバイルメッシュネットワーク環境における移動端末を追従可能なデータ配送方式の提案 : Efficient Data Delivery to a Moving Node in Mobile Mesh Networks; モバイル メッシュ ネットワーク カンキョウ ニ オケル イドウ タンマツ ニ ツイジュウ カノウナ データ ハイソウ ホウシキ ノ テイアン.” Thesis, Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Accessed January 26, 2021.
http://hdl.handle.net/10061/5086.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
林, 卓磨. “モバイルメッシュネットワーク環境における移動端末を追従可能なデータ配送方式の提案 : Efficient Data Delivery to a Moving Node in Mobile Mesh Networks; モバイル メッシュ ネットワーク カンキョウ ニ オケル イドウ タンマツ ニ ツイジュウ カノウナ データ ハイソウ ホウシキ ノ テイアン.” Web. 26 Jan 2021.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Vancouver:
林 . モバイルメッシュネットワーク環境における移動端末を追従可能なデータ配送方式の提案 : Efficient Data Delivery to a Moving Node in Mobile Mesh Networks; モバイル メッシュ ネットワーク カンキョウ ニ オケル イドウ タンマツ ニ ツイジュウ カノウナ データ ハイソウ ホウシキ ノ テイアン. [Internet] [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; [cited 2021 Jan 26].
Available from: http://hdl.handle.net/10061/5086.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.
Council of Science Editors:
林 . モバイルメッシュネットワーク環境における移動端末を追従可能なデータ配送方式の提案 : Efficient Data Delivery to a Moving Node in Mobile Mesh Networks; モバイル メッシュ ネットワーク カンキョウ ニ オケル イドウ タンマツ ニ ツイジュウ カノウナ データ ハイソウ ホウシキ ノ テイアン. [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; Available from: http://hdl.handle.net/10061/5086
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Loughborough University
2.
Ali, Awos K.
Previous hop routing : exploiting opportunism in VANETs.
Degree: PhD, 2018, Loughborough University
URL: http://hdl.handle.net/2134/27991
► Routing in highly dynamic wireless networks such as Vehicular Ad-hoc Networks (VANETs) is a challenging task due to frequent topology changes. Sustaining a transmission path…
(more)
▼ Routing in highly dynamic wireless networks such as Vehicular Ad-hoc Networks (VANETs) is a challenging task due to frequent topology changes. Sustaining a transmission path between peers in such network environment is difficult. In this thesis, Previous Hop Routing (PHR) is poposed; an opportunistic forwarding protocol exploiting previous hop information and distance to destination to make the forwarding decision on a packet-by-packet basis. It is intended for use in highly dynamic network where the life time of a hop-by-hop path between source and destination nodes is short. Exploiting the broadcast nature of wireless communication avoids the need to copy packets, and enables redundant paths to be formed. To save network resources, especially under high network loads, PHR employs probabilistic forwarding. The forwarding probability is calculated based on the perceived network load as measured by the arrival rate at the network interface. We evaluate PHR in an urban VANET environment using NS2 (for network traffic) and SUMO (for vehicular movement) simulators, with scenarios configured to re ect real-world conditions. The simulation scenarios are configured to use two velocity profiles i.e. Low and high velocity. The results show that the PHR networks able to achieve best performance as measured by Packet Delivery Ratio (PDR) and Drop Burst Length (DBL) compared to conventional routing protocols in high velocity scenarios.
Subjects/Keywords: 004.6; PHR; VANETs; Routing; Opportunistic
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ali, A. K. (2018). Previous hop routing : exploiting opportunism in VANETs. (Doctoral Dissertation). Loughborough University. Retrieved from http://hdl.handle.net/2134/27991
Chicago Manual of Style (16th Edition):
Ali, Awos K. “Previous hop routing : exploiting opportunism in VANETs.” 2018. Doctoral Dissertation, Loughborough University. Accessed January 26, 2021.
http://hdl.handle.net/2134/27991.
MLA Handbook (7th Edition):
Ali, Awos K. “Previous hop routing : exploiting opportunism in VANETs.” 2018. Web. 26 Jan 2021.
Vancouver:
Ali AK. Previous hop routing : exploiting opportunism in VANETs. [Internet] [Doctoral dissertation]. Loughborough University; 2018. [cited 2021 Jan 26].
Available from: http://hdl.handle.net/2134/27991.
Council of Science Editors:
Ali AK. Previous hop routing : exploiting opportunism in VANETs. [Doctoral Dissertation]. Loughborough University; 2018. Available from: http://hdl.handle.net/2134/27991

University of New South Wales
3.
Mehmood, Tahir.
Optimal forwarding in wireless networks: opportunistic network coding.
Degree: Computer Science & Engineering, 2012, University of New South Wales
URL: http://handle.unsw.edu.au/1959.4/51957
;
https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10627/SOURCE01?view=true
► In wireless networks, unintended nodes in the vicinity of the sender and receiver, potentially causing interference to their own communications, can generally overhear transmissions. Much…
(more)
▼ In wireless networks, unintended nodes in the vicinity of the sender and receiver, potentially causing interference to their own communications, can generally overhear transmissions. Much of the related research has considered this as a nuisance and resulted in various proposals for overcoming the interference using scheduling, channel assignment, and many other mechanisms. In recent years, there has been growing attention to methods that aim to take advantage of the broadcast nature of the wireless medium and the ability of nodes to overhear their neighbors transmissions. Two of the most important such methods are
opportunistic routing (OR) and wireless network coding (NC), exemplified by the ExOR and COPE protocols, respectively. This thesis presents study of jointly optimizing packet delivery (in terms of reducing transmissions) of forwarding schemes in wireless network that combine elements from both the OR and NC approaches. The key problem is that OR and NC perform best at contrasting scenarios; while OR is beneficial when link delivery ratios are low, NC performs better where link delivery ratios are high. To find an optimal solution by combining both schemes, the problem is restricted to a 2-hop network, where multiple common neighbors relay traffic on a bidirectional unicast connection between two nodes. A dynamic programming algorithm has been presented to find the optimal forwarding scheme as a function of link error probabilities, and demonstrated that it can achieve significant reduction in the number of transmissions compared to either OR or NC employed alone, even in a simple scenario of two common neighbors between the connection endpoints. Numerical results and simulation results are used to analyze the benefits of proposed scheme.
Advisors/Committee Members: Jha, Sanjay, Computer Science & Engineering, Faculty of Engineering, UNSW.
Subjects/Keywords: Opportunistic network coding; Opportunistic routing; Network coding; Optimal forwarding
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Mehmood, T. (2012). Optimal forwarding in wireless networks: opportunistic network coding. (Masters Thesis). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/51957 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10627/SOURCE01?view=true
Chicago Manual of Style (16th Edition):
Mehmood, Tahir. “Optimal forwarding in wireless networks: opportunistic network coding.” 2012. Masters Thesis, University of New South Wales. Accessed January 26, 2021.
http://handle.unsw.edu.au/1959.4/51957 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10627/SOURCE01?view=true.
MLA Handbook (7th Edition):
Mehmood, Tahir. “Optimal forwarding in wireless networks: opportunistic network coding.” 2012. Web. 26 Jan 2021.
Vancouver:
Mehmood T. Optimal forwarding in wireless networks: opportunistic network coding. [Internet] [Masters thesis]. University of New South Wales; 2012. [cited 2021 Jan 26].
Available from: http://handle.unsw.edu.au/1959.4/51957 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10627/SOURCE01?view=true.
Council of Science Editors:
Mehmood T. Optimal forwarding in wireless networks: opportunistic network coding. [Masters Thesis]. University of New South Wales; 2012. Available from: http://handle.unsw.edu.au/1959.4/51957 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10627/SOURCE01?view=true

North-West University
4.
Engelbrecht, Mario Johann.
Development of an energy and geographic aware opportunistic network coding scheme / Mario Johann Engelbrecht
.
Degree: 2012, North-West University
URL: http://hdl.handle.net/10394/8689
► The evolution of communication networks has led us to an era where you cannot only perform surgery halfway across the world, but do so while…
(more)
▼ The evolution of communication networks has led us to an era where you cannot only
perform surgery halfway across the world, but do so while being in the comfort of
your own home. By eliminating the need for wires, wireless networks revolutionised
communication networks by enabling nodes to communicate while being in a mobile
state. The concept opened many doors to new applications and possibilities.
Network Coding is a technique that optimises the throughput of a network by coding
packets. Geo-Routing is a routing method that operates by using the geographical
distances between nodes as the routing metric. Opportunistic Routing is a routing
method that exploits the broadcast characteristics of wireless networks.
In this thesis, we developed a routing scheme that incorporates Network Coding, Geo-
Routing and energy aware conditions. It accomplishes this task by using one of the
key phases constituting Opportunistic Routing.
The developed routing scheme was implemented in OMNeT++. Various simulation
experiments were conducted in OMNeT++ pertaining to the implemented scheme.
The results indicate significant increase in performance metrics such as throughput
and survivability.
Subjects/Keywords: Energy awareness;
Geo-Routing;
Mobile ad hoc network;
Network coding;
Opportunistic routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Engelbrecht, M. J. (2012). Development of an energy and geographic aware opportunistic network coding scheme / Mario Johann Engelbrecht
. (Thesis). North-West University. Retrieved from http://hdl.handle.net/10394/8689
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Engelbrecht, Mario Johann. “Development of an energy and geographic aware opportunistic network coding scheme / Mario Johann Engelbrecht
.” 2012. Thesis, North-West University. Accessed January 26, 2021.
http://hdl.handle.net/10394/8689.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Engelbrecht, Mario Johann. “Development of an energy and geographic aware opportunistic network coding scheme / Mario Johann Engelbrecht
.” 2012. Web. 26 Jan 2021.
Vancouver:
Engelbrecht MJ. Development of an energy and geographic aware opportunistic network coding scheme / Mario Johann Engelbrecht
. [Internet] [Thesis]. North-West University; 2012. [cited 2021 Jan 26].
Available from: http://hdl.handle.net/10394/8689.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Engelbrecht MJ. Development of an energy and geographic aware opportunistic network coding scheme / Mario Johann Engelbrecht
. [Thesis]. North-West University; 2012. Available from: http://hdl.handle.net/10394/8689
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Massey University
5.
Rusli, Mohd Ezanee.
A cross layer opportunistic routing protocol for wireless sensor network : analysis, modelling and quality of service support.
Degree: PhD, Communication and Network Engineering, 2013, Massey University
URL: http://hdl.handle.net/10179/4273
► A wireless sensor network (WSN) provides a platform for embedded sensing and ubiquitous computing. For ad hoc WSNs, multi-hop routing has been adopted in order…
(more)
▼ A wireless sensor network (WSN) provides a platform for embedded sensing and
ubiquitous computing. For ad hoc WSNs, multi-hop routing has been adopted in order to
save communication power consumption. By acknowledging the lossy characteristics of
radio channels on low-power WSNs, the Opportunistic Routing (OR) protocol provides
an efficient method for exploiting the spatial and temporal characteristics of these wireless
networks by considering multiple forwarding relays for each transmission. The main
contribution of this thesis is to provide analysis and modelling for variants of the OR
protocol for WSNs.
Firstly, based on the basic concepts that underpin OR, we propose a new variant of OR
that can be used in WSNs. It is known that communication in WSN is the most power
consuming operation; hence, we propose a variant of OR that specifically reduces the total
number of transmissions required during the coordination step used in OR. We investigate
the effectiveness of this approach and compare it with OR that adopts existing and
common candidate coordination schemes. In addition, we also propose a retransmission
scheme based on provisional reliability constraints for local loss recovery that can be used
in this new variant of OR.
Secondly, we propose a comprehensive new analytical framework that is based on Markov
Chain and Queueing theories that takes into account the key component strategies of OR
(prioritization, selection and coordination) as well as the communication components of
WSN. The proposed framework can be used to model the end-to-end reliability and delay
performances of WSNs using OR.
Thirdly, taking into account the potential deficiencies of OR due to its static coordination
scheme, we introduce a variant of OR that is aware of the online quality of its selected
forwarding relays that we have named as the Adaptive Coordination Opportunistic
Routing (ACOR) protocol. We propose a new local metric to be known as the
Opportunistic Quality Score for ACOR to improve the performance of WSNs and, in
particular, to support Quality of Service delivery of messages in these networks. In
addition, we provide an analytical framework for ACOR that incorporates the adaptive
coordination scheme that has been developed.
Subjects/Keywords: Routing protocols (Computer network protocols);
Opportunistic routing protocol;
Wireless sensor networks;
Design and construction
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Rusli, M. E. (2013). A cross layer opportunistic routing protocol for wireless sensor network : analysis, modelling and quality of service support. (Doctoral Dissertation). Massey University. Retrieved from http://hdl.handle.net/10179/4273
Chicago Manual of Style (16th Edition):
Rusli, Mohd Ezanee. “A cross layer opportunistic routing protocol for wireless sensor network : analysis, modelling and quality of service support.” 2013. Doctoral Dissertation, Massey University. Accessed January 26, 2021.
http://hdl.handle.net/10179/4273.
MLA Handbook (7th Edition):
Rusli, Mohd Ezanee. “A cross layer opportunistic routing protocol for wireless sensor network : analysis, modelling and quality of service support.” 2013. Web. 26 Jan 2021.
Vancouver:
Rusli ME. A cross layer opportunistic routing protocol for wireless sensor network : analysis, modelling and quality of service support. [Internet] [Doctoral dissertation]. Massey University; 2013. [cited 2021 Jan 26].
Available from: http://hdl.handle.net/10179/4273.
Council of Science Editors:
Rusli ME. A cross layer opportunistic routing protocol for wireless sensor network : analysis, modelling and quality of service support. [Doctoral Dissertation]. Massey University; 2013. Available from: http://hdl.handle.net/10179/4273
6.
Abdel-kader, Tamer Ahmed Mostafa Mohammed.
Design and Performance Analysis of Opportunistic Routing Protocols for Delay Tolerant Networks.
Degree: 2012, University of Waterloo
URL: http://hdl.handle.net/10012/6864
► Delay Tolerant Networks (DTNs) are characterized by the lack of continuous end-to-end connections because of node mobility, constrained power sources, and limited data storage space…
(more)
▼ Delay Tolerant Networks (DTNs) are characterized by the lack of continuous end-to-end connections because of node mobility, constrained power
sources, and limited data storage space of some or all of its nodes. Applications of DTNs include vehicular networks and sensor networks
in suburban and rural areas. The intermittent connection in DTNs creates a new and challenging environment that has not been tackled before
in wireless and wired networks. Traditional routing protocols fail to deliver data packets because they assume the existence of continuous
end-to-end connections. To overcome the frequent disconnections, a DTN node is required to store data packets for long periods of time
until it becomes in the communication range of other nodes. In addition, to increase the delivery probability, a DTN node spreads multiple
copies of the same packet on the network so that one of the copies reaches the destination. Given the limited storage and energy resources
of DTN nodes, there is a trade off between maximizing delivery and minimizing storage and energy consumption.
DTN routing protocols can be classified as either blind routing, in which no information is provided to select the next node in the path,
or guided routing, in which some network information is used to guide data packets to their destinations. In addition they differ in the
amount of overhead they impose on the network and its nodes. The objective of DTN routing protocols is to deliver as many packets as possible.
Acquiring network information helps in maximizing packet delivery probability and minimizing the network overhead resulting from replicating
many packet copies. Network information could be node contact times and durations, node buffer capacities, packet lifetimes, and many
others. The more information acquired, the higher performance could be achieved. However, the cost of acquiring the network information
in terms of delay and storage could be high to the degree that render the protocol impractical. In designing a DTN routing protocol, the
trade-off between the benefits of acquiring information and its costs should be considered.
In this thesis, we study the routing problem in DTN with limited resources. Our objective is to design and implement routing protocols that effectively handles the intermittent connection in DTNs to achieve high packet delivery ratios with lower delivery cost. Delivery cost is represented in terms of number of transmissions per delivered packet. Decreasing the delivery cost means less network overhead and less energy consumption per node. In order to achieve that objective, we first target the optimal results that could be achieved in an ideal scenario. We formulate a mathematical model for optimal routing, assuming the presence of a global observer that can collect information about all the nodes
in the network. The optimal results provide us with bounds on the performance metrics, and show the room for improvement that should
be worked on. However, optimal routing with a global observer is just…
Subjects/Keywords: Delay Tolerant; Routing; Opportunistic
…State Routing Protocol
ONE Opportunistic Network Environment
PROPHET Probabilistic Routing… …2 Background and Literature Review
10
2.1
Routing Protocols with No-Knowledge about… …the Network (Blind Routing)
11
2.2
Routing Protocols with Partial Knowledge… …about the Network (Guided Routing)… …12
2.2.1
History-based (Social) Routing…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Abdel-kader, T. A. M. M. (2012). Design and Performance Analysis of Opportunistic Routing Protocols for Delay Tolerant Networks. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6864
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Abdel-kader, Tamer Ahmed Mostafa Mohammed. “Design and Performance Analysis of Opportunistic Routing Protocols for Delay Tolerant Networks.” 2012. Thesis, University of Waterloo. Accessed January 26, 2021.
http://hdl.handle.net/10012/6864.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Abdel-kader, Tamer Ahmed Mostafa Mohammed. “Design and Performance Analysis of Opportunistic Routing Protocols for Delay Tolerant Networks.” 2012. Web. 26 Jan 2021.
Vancouver:
Abdel-kader TAMM. Design and Performance Analysis of Opportunistic Routing Protocols for Delay Tolerant Networks. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2021 Jan 26].
Available from: http://hdl.handle.net/10012/6864.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Abdel-kader TAMM. Design and Performance Analysis of Opportunistic Routing Protocols for Delay Tolerant Networks. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6864
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University
7.
Yang, Chen.
A COMMUNICATION FRAMEWORK FOR OPPORTUNISTIC MOBILE NETWORKS WITH DIVERSE CONNECTIVITY.
Degree: PhD, Computer Engineering, 2018, Texas A&M University
URL: http://hdl.handle.net/1969.1/173495
► An Opportunistic Mobile Network (OMN) refers to the network paradigm where wireless devices communicate with each other through the opportunistically formed wireless links. Routing in…
(more)
▼ An
Opportunistic Mobile Network (OMN) refers to the network paradigm where
wireless devices communicate with each other through the opportunistically formed
wireless links.
Routing in OMN relies on node mobility and the store-and-forward
mechanism. It is paramount to have energy efficient, robust and cost effective
routing
protocols in such environments. Previous research usually assumes that the
connectivity in such networks is extremely sparse and that the network is purely
infrastructure-less. However, real world deployments of OMNs actually exhibit di-
verse connectivity, i.e., connectivity may range from sparsely connected to well connected
or the network may coexist with infrastructure. Consequently, the simplified
assumptions of previous solutions lead to suboptimal behaviors of
routing protocols,
which includes redundant transmissions, too much or insufficient data replications,
poor forwarding decisions, etc.
In this dissertation, in order to address the aforementioned problems, we propose
a communication framework for OMNs with diverse connectivity, which consists of
a series of algorithms and protocols that aim to provide energy efficient, robust and
cost-aware communication services to applications. In this framework, we propose:
a) algorithms that carefully schedule transmissions in an
opportunistic contact involving
multiple nodes; b)
routing protocols that consider simultaneously mobile
nodes' delivery capability and traffic load; c) mathematical tools that characterize
not only Inter-Contact Times but also their correlations; d) adaptive mechanisms to
realize dynamic data replication; and e) forwarding strategies that optimally trade-o_
energy consumption and delay in a cost-aware fashion when utilizing infrastructure.
We evaluate the proposed
routing protocols and algorithms through extensive simulations using both synthetic network models and real world mobility traces. We also
conduct real world experiments on a wireless testbed to demonstrate their practicability.
The evaluation results show that, with the assumption of diverse connectivity
in mind, the proposed algorithms and protocols greatly improve the networking performance
and efficiency. The consideration of delay correlations and a mechanism
for dynamic replication are critical for a
routing protocol to perform well with a wide
range of network connectivity. When infrastructure is present, our proposed forwarding
strategy helps improve the energy-delay trade-off when cost is a constraint.
Advisors/Committee Members: Stoleru, Radu (advisor), Bettati, Riccardo (committee member), Jiang, Anxiao (committee member), Sprintson, Alexander (committee member).
Subjects/Keywords: Opportunistic Mobile Networks; Routing Protocol; Wireless Networks; Mobile Data Offloading
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yang, C. (2018). A COMMUNICATION FRAMEWORK FOR OPPORTUNISTIC MOBILE NETWORKS WITH DIVERSE CONNECTIVITY. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/173495
Chicago Manual of Style (16th Edition):
Yang, Chen. “A COMMUNICATION FRAMEWORK FOR OPPORTUNISTIC MOBILE NETWORKS WITH DIVERSE CONNECTIVITY.” 2018. Doctoral Dissertation, Texas A&M University. Accessed January 26, 2021.
http://hdl.handle.net/1969.1/173495.
MLA Handbook (7th Edition):
Yang, Chen. “A COMMUNICATION FRAMEWORK FOR OPPORTUNISTIC MOBILE NETWORKS WITH DIVERSE CONNECTIVITY.” 2018. Web. 26 Jan 2021.
Vancouver:
Yang C. A COMMUNICATION FRAMEWORK FOR OPPORTUNISTIC MOBILE NETWORKS WITH DIVERSE CONNECTIVITY. [Internet] [Doctoral dissertation]. Texas A&M University; 2018. [cited 2021 Jan 26].
Available from: http://hdl.handle.net/1969.1/173495.
Council of Science Editors:
Yang C. A COMMUNICATION FRAMEWORK FOR OPPORTUNISTIC MOBILE NETWORKS WITH DIVERSE CONNECTIVITY. [Doctoral Dissertation]. Texas A&M University; 2018. Available from: http://hdl.handle.net/1969.1/173495

University of Toronto
8.
Shafieirad, Hossein.
Opportunistic Routing in Large-scale Energy Harvesting Wireless Sensor Networks.
Degree: 2016, University of Toronto
URL: http://hdl.handle.net/1807/75990
► Energy self-sufficiency is one of the main bottlenecks in the implementation of wireless sensor networks (WSNs). In this regard, energy harvesting (EH), the capture of…
(more)
▼ Energy self-sufficiency is one of the main bottlenecks in the implementation of wireless sensor networks (WSNs). In this regard, energy harvesting (EH), the capture of energy from ambient sources of renewable energies, is a promising solution to the energy problem. However, the resulting randomness in the energy available to nodes forces the redesign of the communications protocols. Of specific interest here is to enable the delivery of sensed data to a fusion center in the EH-WSN. In this thesis, we consider two open problems of practical importance to the implementation of large-scale WSNs. First, we propose the notion of energy outage rate for a single link in WSN as a tool for online consideration of EH in such networks. Second, we propose and mathematically analyze an energy-aware, opportunistic routing protocol for large-scale multi-hop EH-WSNs. Our routing protocol significantly increases the rate of data delivery as compared to the state-of-the-art technologies.
M.A.S.
Advisors/Committee Members: Adve, Raviraj, ShahbazPanahi, Shahram, Electrical and Computer Engineering.
Subjects/Keywords: Energy Causality; Energy Harvesting; Multi-hop; Opportunistic Routing; Sensor Network; 0544
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Shafieirad, H. (2016). Opportunistic Routing in Large-scale Energy Harvesting Wireless Sensor Networks. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/75990
Chicago Manual of Style (16th Edition):
Shafieirad, Hossein. “Opportunistic Routing in Large-scale Energy Harvesting Wireless Sensor Networks.” 2016. Masters Thesis, University of Toronto. Accessed January 26, 2021.
http://hdl.handle.net/1807/75990.
MLA Handbook (7th Edition):
Shafieirad, Hossein. “Opportunistic Routing in Large-scale Energy Harvesting Wireless Sensor Networks.” 2016. Web. 26 Jan 2021.
Vancouver:
Shafieirad H. Opportunistic Routing in Large-scale Energy Harvesting Wireless Sensor Networks. [Internet] [Masters thesis]. University of Toronto; 2016. [cited 2021 Jan 26].
Available from: http://hdl.handle.net/1807/75990.
Council of Science Editors:
Shafieirad H. Opportunistic Routing in Large-scale Energy Harvesting Wireless Sensor Networks. [Masters Thesis]. University of Toronto; 2016. Available from: http://hdl.handle.net/1807/75990

University of Ottawa
9.
Tahooni, Mohammad.
Mobility-based Candidate Selection and Coordination in Opportunistic Routing for Mobile Ad-Hoc Networks
.
Degree: 2014, University of Ottawa
URL: http://hdl.handle.net/10393/31604
► Opportunistic Routing (OR) is an effective and enhanced routing scheme for wireless multihop environment. OR is an approach that selects a certain number of best…
(more)
▼ Opportunistic Routing (OR) is an effective and enhanced routing scheme for wireless multihop environment. OR is an approach that selects a certain number of best forwarders (candidates) at each hop by taking the advantage of the broadcast nature of the wireless medium to reach the destination. When a set of candidates receive the packet, they coordinate with each other to figure out which one has to forward the packet toward the destination. Most of the research in this area has been done in mesh networks where nodes do not have mobility.
In this survey, we propose a new OR protocol for mobile ad hoc scenarios called as Enhanced Mobility-based Opportunistic Routing (EMOR) protocol. To deal with the node mobility, we have proposed a new metric which considers the following: geographical position of the candidates; the link delivery probability to reach them; the number of neighboring nodes of candidates; and the predicted position of nodes using the motion vector of the nodes. We have compared EMOR with five other well-known routing protocols in terms of delivery ratio, end-to-end delay, and expected number of transmissions from source to the destination. Our simulation results show that proposed protocol improves delivery ratio and number of expected transmission in terms of different type of mobility models.
Subjects/Keywords: Opportunistic routing;
Mobile ad hoc networks;
Candidate selection;
Candidate coordination
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Tahooni, M. (2014). Mobility-based Candidate Selection and Coordination in Opportunistic Routing for Mobile Ad-Hoc Networks
. (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/31604
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Tahooni, Mohammad. “Mobility-based Candidate Selection and Coordination in Opportunistic Routing for Mobile Ad-Hoc Networks
.” 2014. Thesis, University of Ottawa. Accessed January 26, 2021.
http://hdl.handle.net/10393/31604.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Tahooni, Mohammad. “Mobility-based Candidate Selection and Coordination in Opportunistic Routing for Mobile Ad-Hoc Networks
.” 2014. Web. 26 Jan 2021.
Vancouver:
Tahooni M. Mobility-based Candidate Selection and Coordination in Opportunistic Routing for Mobile Ad-Hoc Networks
. [Internet] [Thesis]. University of Ottawa; 2014. [cited 2021 Jan 26].
Available from: http://hdl.handle.net/10393/31604.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Tahooni M. Mobility-based Candidate Selection and Coordination in Opportunistic Routing for Mobile Ad-Hoc Networks
. [Thesis]. University of Ottawa; 2014. Available from: http://hdl.handle.net/10393/31604
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Toronto
10.
Spachos, Petros.
Opportunistic Routing for Enhanced Source-location Privacy in Wireless Sensor Networks.
Degree: 2010, University of Toronto
URL: http://hdl.handle.net/1807/25807
► Wireless sensor networks (WSN) are an attractive solution for a plethora of communication applications, such as unattended event monitoring and tracking. One of the looming…
(more)
▼ Wireless sensor networks (WSN) are an attractive solution for a plethora of communication applications, such as unattended event monitoring and tracking. One of the looming challenges that threaten the successful deployment of these sensor networks is source-location privacy, especially when they are used to monitor sensitive objects. In order to enhance source location privacy in sensor networks, we propose the use of an opportunistic routing scheme and we examine four different approaches. In opportunistic routing, each sensor transmits the packet over a dynamic path to the destination. Every packet from the source can therefore follow a different path toward the destination, making it difficult for an adversary to backtrack hop-by-hop to the origin of the sensor communication. Through theoretical analysis, we attempt to justify the use of opportunistic routing for the source-location problem. Moreover, simulations have been conducted in order to evaluate the performance of all the proposed schemes, in terms of source-location privacy.
MAST
Advisors/Committee Members: Hatzinakos, Dimitrios, Electrical and Computer Engineering.
Subjects/Keywords: opportunistic routing; source-location privacy; wireless sensor networks; 0544
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Spachos, P. (2010). Opportunistic Routing for Enhanced Source-location Privacy in Wireless Sensor Networks. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/25807
Chicago Manual of Style (16th Edition):
Spachos, Petros. “Opportunistic Routing for Enhanced Source-location Privacy in Wireless Sensor Networks.” 2010. Masters Thesis, University of Toronto. Accessed January 26, 2021.
http://hdl.handle.net/1807/25807.
MLA Handbook (7th Edition):
Spachos, Petros. “Opportunistic Routing for Enhanced Source-location Privacy in Wireless Sensor Networks.” 2010. Web. 26 Jan 2021.
Vancouver:
Spachos P. Opportunistic Routing for Enhanced Source-location Privacy in Wireless Sensor Networks. [Internet] [Masters thesis]. University of Toronto; 2010. [cited 2021 Jan 26].
Available from: http://hdl.handle.net/1807/25807.
Council of Science Editors:
Spachos P. Opportunistic Routing for Enhanced Source-location Privacy in Wireless Sensor Networks. [Masters Thesis]. University of Toronto; 2010. Available from: http://hdl.handle.net/1807/25807

University of Victoria
11.
Khosravi, Arian.
Opportunistic routing in intermittently connected wireless mobile social networks.
Degree: Dept. of Computer Science, 2012, University of Victoria
URL: http://hdl.handle.net/1828/3983
► Consumer electronics such as cellular phones and portable computers with short-range communication capabilities have enabled the large-scale information dissemination through user mobility and contact, without…
(more)
▼ Consumer electronics such as cellular phones and portable computers with short-range communication capabilities have enabled the large-scale information dissemination through user mobility and contact, without the assistance of communication infrastructures. In such a new communication paradigm, one challenge is to determine when and how to forward a message to the destination, possibly through a series of third parties. This problem has attracted a lot of attention in the literature lately, with proposals ranging from epidemic to single or multi-copy spray and wait or focus strategies. However most existing work assumed independent or identically distributed mobility. Observing most human mobility and interaction are interest-driven in the real world, in this research, we evaluate the performance of these schemes with an interest-driven mobility model. We further propose to take the user interest into account when determining
routing strategies to further improve the performance of these schemes for mobile social networks. Simulation results have demonstrated the efficacy of the interest-aware
routing strategies.
Advisors/Committee Members: Pan, Jianping (supervisor).
Subjects/Keywords: Mobile Social Networks; Delay Tolerant Networks; Opportunistic Routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Khosravi, A. (2012). Opportunistic routing in intermittently connected wireless mobile social networks. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/3983
Chicago Manual of Style (16th Edition):
Khosravi, Arian. “Opportunistic routing in intermittently connected wireless mobile social networks.” 2012. Masters Thesis, University of Victoria. Accessed January 26, 2021.
http://hdl.handle.net/1828/3983.
MLA Handbook (7th Edition):
Khosravi, Arian. “Opportunistic routing in intermittently connected wireless mobile social networks.” 2012. Web. 26 Jan 2021.
Vancouver:
Khosravi A. Opportunistic routing in intermittently connected wireless mobile social networks. [Internet] [Masters thesis]. University of Victoria; 2012. [cited 2021 Jan 26].
Available from: http://hdl.handle.net/1828/3983.
Council of Science Editors:
Khosravi A. Opportunistic routing in intermittently connected wireless mobile social networks. [Masters Thesis]. University of Victoria; 2012. Available from: http://hdl.handle.net/1828/3983

University of Minnesota
12.
Wang, Shuai.
Exploring Link Correlation for Performance Improvements in Wireless Networks.
Degree: PhD, Computer Science, 2017, University of Minnesota
URL: http://hdl.handle.net/11299/188837
► In wireless communication, many technologies, such as Wi-Fi, BlueTooth and ZigBee, operate in the same ISM band. With the exponential growth of wireless devices, the…
(more)
▼ In wireless communication, many technologies, such as Wi-Fi, BlueTooth and ZigBee, operate in the same ISM band. With the exponential growth of wireless devices, the ISM band becomes more and more crowded. These wireless devices compete with each other to access spectrum resources, generating cross-technology interference (CTI). Since cross-technology interference may destroy wireless communication, the field is facing an urgent and challenging need to investigate the packet reception quality of wireless links under CTI. In this dissertation, we propose an in-depth systematic study from empirical measurement, theoretical analysis, modeling, to design and implementation of protocols that exploit packet reception patterns of wireless links under cross-technology interference. Based on extensive measurements, we exploit link correlation phenomenon that packet receptions from a transmitter to multiple receivers are correlated. We then propose link correlation model which contradicts the widely made link independent assumption. The proposed model has a broad impact on network designs that utilize concurrent wireless links, which include (i) traditional network protocols such as broadcast, and (ii) diversity-based protocols such as network coding and opportunistic routing. In the study of the impact of link correlation model on traditional network protocols, we present the design and implementation of CorLayer, a general supporting layer for energy efficient reliable broadcast that carefully blacklists certain poorly correlated wireless links. We integrate CorLayer transparently with sixteen state-of-the-art broadcast protocols specified in thirteen publications on three physical testbeds running TelosB, MICAz, and GreenOrbs nodes, respectively. The experimental results show that CorLayer remarkably improves energy efficiency across a wide spectrum of broadcast protocols and that the total number of packet transmissions can be reduced consistently by 47% on average. In the study of the impact of link correlation model on diversity-based protocols, we propose link correlation aware network coding and link correlation aware opportunistic routing. In link correlation aware network coding, we introduce Correlated Coding which seeks to optimize the transmission efficiency by maximizing necessary coding opportunities. In link correlation aware opportunistic routing, we propose a novel candidate forwarder selection algorithm to help opportunistic routing fully exploit the diversity benefit of the wireless broadcast medium. Testbed evaluation and extensive simulation show that the traditional network coding and opportunistic routing protocols’ transmission efficiency is significantly improved with our link correlation model.
Subjects/Keywords: Broadcast; Link Correlation; Network Coding; Opportunistic Routing; Wireless Networks and Sensors
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wang, S. (2017). Exploring Link Correlation for Performance Improvements in Wireless Networks. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/188837
Chicago Manual of Style (16th Edition):
Wang, Shuai. “Exploring Link Correlation for Performance Improvements in Wireless Networks.” 2017. Doctoral Dissertation, University of Minnesota. Accessed January 26, 2021.
http://hdl.handle.net/11299/188837.
MLA Handbook (7th Edition):
Wang, Shuai. “Exploring Link Correlation for Performance Improvements in Wireless Networks.” 2017. Web. 26 Jan 2021.
Vancouver:
Wang S. Exploring Link Correlation for Performance Improvements in Wireless Networks. [Internet] [Doctoral dissertation]. University of Minnesota; 2017. [cited 2021 Jan 26].
Available from: http://hdl.handle.net/11299/188837.
Council of Science Editors:
Wang S. Exploring Link Correlation for Performance Improvements in Wireless Networks. [Doctoral Dissertation]. University of Minnesota; 2017. Available from: http://hdl.handle.net/11299/188837

Clemson University
13.
Chen, Kang.
Towards Efficient File Sharing and Packet Routing in Mobile Opportunistic Networks.
Degree: PhD, Computer Engineering, 2014, Clemson University
URL: https://tigerprints.clemson.edu/all_dissertations/1315
► With the increasing popularity of portable digital devices (e.g., smartphones, laptops, and tablets), mobile opportunistic networks (MONs) [40, 90] consisting of portable devices have…
(more)
▼ With the increasing popularity of portable digital devices (e.g., smartphones, laptops, and tablets), mobile
opportunistic networks (MONs) [40, 90] consisting of portable devices have attracted much attention recently. MONs are also known as pocket switched networks (PSNs) [52]. MONs can be regarded as a special form of mobile ad hoc networks (MANETs) [7] or delay tolerant networks (DTNs) [35, 56]. In such networks, mobile nodes (devices) move continuously and meet opportunistically. Two mobile nodes can communicate with each other only when they are within the communication range of each other in a peer-to-peer (P2P) manner (i.e., without the need of infrastructures). Therefore, such a network structure can potentially provide file sharing or packet
routing services among portable devices without the support of network infrastructures. On the other hand, mobile
opportunistic networks often experience frequent network partition, and no end-to-end contemporaneous path can be ensured in the network. These distinctive properties make traditional file sharing or packet
routing algorithms in Internet or mobile networks a formidable challenge in MONs. In summary, it is essential and important to achieve efficient file sharing and packet
routing algorithms in MONs, which are the key for providing practical and novel services and applications over such networks. In this Dissertation, we develop several methods to resolve the aforementioned challenges. Firstly, we propose two methods to enhance file sharing efficiency in MONs by creating replicas and by leveraging social network properties, respectively. In the first method, we investigate how to create file replicas to optimize file availability for file sharing in MONs. We introduce a new concept of resource for file replication, which considers both node storage and meeting frequency with other nodes. We theoretically study the influence of resource allocation on the average file access delay and derive a resource allocation rule to minimize the average file access delay. We also propose a distributed file replication protocol to realize the deduced optimal file replication rule. In the second method, we leverage social network properties to improve the file searching efficiency in MONs. This method groups common-interest nodes that frequently meet with each other into a community. It takes advantage of node mobility by designating stable nodes, which have the most frequent contact with community members, as community coordinators for intra-community file request forwarding, and highly-mobile nodes that visit other communities frequently as community ambassadors for inter-community file request forwarding. Based on such a community structure, an interest-oriented file searching scheme is proposed to first search local community and then search the community that is most likely to contain the requested file, leading to highly efficient file sharing in MONs. Secondly, we propose two methods to realize efficient packet
routing among mobile nodes and among different…
Advisors/Committee Members: Dr. Haiying Shen, Dr. Richard R. Brooks, Dr. Kuang-Ching (KC) Wang, Dr. James Martin.
Subjects/Keywords: File Sharing; Mobile Opportunistic Networks; Packet Routing; Computer Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chen, K. (2014). Towards Efficient File Sharing and Packet Routing in Mobile Opportunistic Networks. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/1315
Chicago Manual of Style (16th Edition):
Chen, Kang. “Towards Efficient File Sharing and Packet Routing in Mobile Opportunistic Networks.” 2014. Doctoral Dissertation, Clemson University. Accessed January 26, 2021.
https://tigerprints.clemson.edu/all_dissertations/1315.
MLA Handbook (7th Edition):
Chen, Kang. “Towards Efficient File Sharing and Packet Routing in Mobile Opportunistic Networks.” 2014. Web. 26 Jan 2021.
Vancouver:
Chen K. Towards Efficient File Sharing and Packet Routing in Mobile Opportunistic Networks. [Internet] [Doctoral dissertation]. Clemson University; 2014. [cited 2021 Jan 26].
Available from: https://tigerprints.clemson.edu/all_dissertations/1315.
Council of Science Editors:
Chen K. Towards Efficient File Sharing and Packet Routing in Mobile Opportunistic Networks. [Doctoral Dissertation]. Clemson University; 2014. Available from: https://tigerprints.clemson.edu/all_dissertations/1315

Temple University
14.
Wang, Yunsheng.
Designing Efficient Routing Protocols in Delay Tolerant Networks.
Degree: PhD, 2013, Temple University
URL: http://digital.library.temple.edu/u?/p245801coll10,224066
► Computer and Information Science
This thesis presents the design and evaluation of routing protocols for efficient content delivery and dissemination in delay tolerant networks. With…
(more)
▼ Computer and Information Science
This thesis presents the design and evaluation of routing protocols for efficient content delivery and dissemination in delay tolerant networks. With the advancement in technology, the communication devices with wireless interfaces become more and more universal. Delay tolerant networks (DTNs) are characterized by intermittent connectivity and limited network capacity. There exist several different application scenarios: connectivity of developing countries, vehicular DTN road communications, and social contact networks. In this thesis, we explore the characteristics in DTNs, such as mobility pattern, contact history information, and social feature information, to design efficient routing schemes. The research reported in this thesis investigates the technical challenges and their solutions of applying different DTN routing protocols. We design multicast schemes to forward the information to a group of destinations in DTN environment. We extend the delegation forwarding scheme in DTN multicasting. An non-replication multicast tree is also studied in this report. We also apply ticket-based and social-tie-based approaches in content distribution systems. We leverage the users' social feature information to study the hypercube-based routing schemes in social contact networks. We also study the resource management problem in DTNs. We design a joint replication-migration-based scheme to solve the storage congestion. These techniques are evaluated comprehensively in realistic simulation studies, by comparing the performance with state-of-the-art approaches in both synthetic and real traces.
Temple University – Theses
Advisors/Committee Members: Wu, Jie;, Shi, Justin Y., Tan, Chiu C., Bai, Li;.
Subjects/Keywords: Computer Science;
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wang, Y. (2013). Designing Efficient Routing Protocols in Delay Tolerant Networks. (Doctoral Dissertation). Temple University. Retrieved from http://digital.library.temple.edu/u?/p245801coll10,224066
Chicago Manual of Style (16th Edition):
Wang, Yunsheng. “Designing Efficient Routing Protocols in Delay Tolerant Networks.” 2013. Doctoral Dissertation, Temple University. Accessed January 26, 2021.
http://digital.library.temple.edu/u?/p245801coll10,224066.
MLA Handbook (7th Edition):
Wang, Yunsheng. “Designing Efficient Routing Protocols in Delay Tolerant Networks.” 2013. Web. 26 Jan 2021.
Vancouver:
Wang Y. Designing Efficient Routing Protocols in Delay Tolerant Networks. [Internet] [Doctoral dissertation]. Temple University; 2013. [cited 2021 Jan 26].
Available from: http://digital.library.temple.edu/u?/p245801coll10,224066.
Council of Science Editors:
Wang Y. Designing Efficient Routing Protocols in Delay Tolerant Networks. [Doctoral Dissertation]. Temple University; 2013. Available from: http://digital.library.temple.edu/u?/p245801coll10,224066
15.
HERRERA TAPIA, JORGE.
Improving Message Dissemination in Opportunistic Networks
.
Degree: 2017, Universitat Politècnica de València
URL: http://hdl.handle.net/10251/86129
► Data transmission has become a need in various fields, like in social networks with the diverse interaction applications, or in the scientific and engineering areas…
(more)
▼ Data transmission has become a need in various fields, like in social networks with the diverse interaction applications, or in the scientific and engineering areas where for example the use of sensors to capture data is growing, or in emergency situations where there is the imperative need to have a communication system to coordinate rescue operations. Wireless networks have been able to solve these issues to a great extent, but what can we do when a fixed supporting infrastructure is not available or becomes inoperative because of saturation?
Opportunistic wireless networks are an alternative to consider in these situations, since their operation does not depend on the existence of a telecommunications infrastructure but they provide connectivity through the organized cooperation of users.
This research thesis focuses on these types of networks and is aimed at improving the dissemination of information in
opportunistic networks analyzing the main causes that influence the performance of data transmission.
Opportunistic networks do not depend on a fixed topology but depend on the number and mobility of users, the type and quantity of information generated and sent, as well as the physical characteristics of the mobile devices that users have to transmit the data. The combination of these elements impacts on the duration of the contact time between mobile users, directly affecting the information delivery probability.
This thesis starts by presenting a thorough "state of the art" study where we present the most important contributions related to this area and the solutions offered for the evaluation of the
opportunistic networks, such as simulation models,
routing protocols, simulation tools, among others. After offering this broad background, we evaluate the consumption of the resources of the mobile devices that affect the performance of the the applications of
opportunistic networks, both from the energetic and the memory point of view.
Next, we analyze the performance of
opportunistic networks considering either pedestrian and vehicular environments. The studied approaches include the use of additional fixed nodes and different data transmission technologies, to improve the duration of the contact between mobile devices.
Finally, we propose a diffusion scheme to improve the performance of data transmission based on extending the duration of the contact time and the likelihood that users will collaborate in this process. This approach is complemented by the efficient management of the resources of the mobile devices.; La transmisión de datos se ha convertido en una necesidad en diversos ámbitos, como en las redes sociales con sus diversas aplicaciones, o en las áreas científicas y de ingeniería donde, por ejemplo, el uso de sensores para capturar datos está creciendo, o en situaciones de emergencia donde impera la necesidad de tener un sistema de comunicación para coordinar las operaciones de rescate. Las redes inalámbricas actuales han sido capaces de resolver estos problemas en gran medida, pero ¿qué podemos…
Advisors/Committee Members: Hernández Orallo, Enrique (advisor), Manzoni, Pietro (advisor).
Subjects/Keywords: Opportunistic Networks;
Ad-Hoc Networks, DTN, Wireless Networks, Evaluation od Wireless Networks;
Epidemic Routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
HERRERA TAPIA, J. (2017). Improving Message Dissemination in Opportunistic Networks
. (Doctoral Dissertation). Universitat Politècnica de València. Retrieved from http://hdl.handle.net/10251/86129
Chicago Manual of Style (16th Edition):
HERRERA TAPIA, JORGE. “Improving Message Dissemination in Opportunistic Networks
.” 2017. Doctoral Dissertation, Universitat Politècnica de València. Accessed January 26, 2021.
http://hdl.handle.net/10251/86129.
MLA Handbook (7th Edition):
HERRERA TAPIA, JORGE. “Improving Message Dissemination in Opportunistic Networks
.” 2017. Web. 26 Jan 2021.
Vancouver:
HERRERA TAPIA J. Improving Message Dissemination in Opportunistic Networks
. [Internet] [Doctoral dissertation]. Universitat Politècnica de València; 2017. [cited 2021 Jan 26].
Available from: http://hdl.handle.net/10251/86129.
Council of Science Editors:
HERRERA TAPIA J. Improving Message Dissemination in Opportunistic Networks
. [Doctoral Dissertation]. Universitat Politècnica de València; 2017. Available from: http://hdl.handle.net/10251/86129
16.
Dudukovich, Rachel.
Application of Machine Learning Techniques to Delay Tolerant
Network Routing.
Degree: PhD, EECS - Computer Engineering, 2019, Case Western Reserve University School of Graduate Studies
URL: http://rave.ohiolink.edu/etdc/view?acc_num=case1545036060190319
► This dissertation discusses several machine learning techniques to improve routing in delay tolerant networks (DTNs). These are networks in which there may be long one-way…
(more)
▼ This dissertation discusses several machine learning
techniques to improve
routing in delay tolerant networks (DTNs).
These are networks in which there may be long one-way trip times,
asymmetric links, high error rates, and deterministic as well as
non-deterministic loss of contact between network nodes, such as
interplanetary satellite networks, mobile ad hoc networks and
wireless sensor networks. This work uses historical network
statistics to train a multilabel classifier to predict reliable
paths through the network. In addition, a clustering technique is
used to predict future mobile node locations. Both of these
techniques are used to reduce the consumption of resources such as
network bandwidth, memory and data storage that is required by
replication
routing methods often used in
opportunistic DTN
environments. Thesis contributionsinclude: an emulation tool chain
developed to create a DTN test bed for machine learning, the
network and software architecture for a machine learning based
routing method, the development and implementation of
classification and clustering techniques and performance evaluation
in terms of machine learning and
routing metrics.
Advisors/Committee Members: Papachristou, Christos (Advisor).
Subjects/Keywords: Computer Engineering; Delay Tolerant Networking, Machine Learning, Opportunistic
Routing, Mobile Ad Hoc Networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Dudukovich, R. (2019). Application of Machine Learning Techniques to Delay Tolerant
Network Routing. (Doctoral Dissertation). Case Western Reserve University School of Graduate Studies. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=case1545036060190319
Chicago Manual of Style (16th Edition):
Dudukovich, Rachel. “Application of Machine Learning Techniques to Delay Tolerant
Network Routing.” 2019. Doctoral Dissertation, Case Western Reserve University School of Graduate Studies. Accessed January 26, 2021.
http://rave.ohiolink.edu/etdc/view?acc_num=case1545036060190319.
MLA Handbook (7th Edition):
Dudukovich, Rachel. “Application of Machine Learning Techniques to Delay Tolerant
Network Routing.” 2019. Web. 26 Jan 2021.
Vancouver:
Dudukovich R. Application of Machine Learning Techniques to Delay Tolerant
Network Routing. [Internet] [Doctoral dissertation]. Case Western Reserve University School of Graduate Studies; 2019. [cited 2021 Jan 26].
Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1545036060190319.
Council of Science Editors:
Dudukovich R. Application of Machine Learning Techniques to Delay Tolerant
Network Routing. [Doctoral Dissertation]. Case Western Reserve University School of Graduate Studies; 2019. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1545036060190319

University of New South Wales
17.
Bilh, Abdoulmenim Ahmed.
The design and evaluation of an opportunistic multicast routing protocol.
Degree: Computer Science & Engineering, 2010, University of New South Wales
URL: http://handle.unsw.edu.au/1959.4/51502
;
https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10189/SOURCE02?view=true
► This thesis aims to examine the efficiency of opportunistic multicast routing in Wireless Mesh Network (WMN). Specifically, an opportunistic multicast routing protocol has been developed…
(more)
▼ This thesis aims to examine the efficiency of
opportunistic multicast
routing in Wireless Mesh Network (WMN). Specifically, an
opportunistic multicast
routing protocol has been developed in this work in order to gain better performance in WMNs compared to traditional multicast
routing protocols. The number of transmissions in the network to deliver a packet from a source to group of destinations has been taken as measure for the performance of the protocol. Less number of transmissions in the network to deliver a packet to group of destinations is an indicator for a better performance.The work has been divided into two parts. In the first part, a proposal of the first version of
opportunistic multicast
routing protocol (OMRPv1) will be explained. By calculating the expected number of transmissions in the network, the efficiency of the protocol will be examined. OMRPv1 will be compared against a traditional protocol, non-
opportunistic protocol, to confirm its better performance in the network. Then, a second version of our protocol will be introduced, OMRPv2, as a solution for some problems encountered in the first version. The comparison between OMRPv1 and OMRPv2 will show the better performance achieved with the newer version.In the second part, QualNet simulator will be used to simulate the protocol OMRPv2. In this part, not only the number of transmissions in the network will be considered, but also other metrics like end to end delay and delivery rate will be taken into account. The overhead of the protocol will be examined as well. Observation of the results from the simulation will lead to the third version of the protocol (OMRPv3). OMRPv3 will be simulated as well to show the improvement in the performance over the previous version OMRPv2.Finally, OMRPv3 will be compared to the best
opportunistic multicast
routing protocol in the literature, Beacon-less Geographic
Routing for Multicast Applications (BRUMA). For that reason, BRUMA will be simulated in QualNet as well. For fair comparison, few modifications will be added to BRUMA. Then, the two protocols will be compared to each other using many metrics. Delivery rate, end to end delay, and number of transmissions in the network to serve the multicast groups are some of the metrics that will be used to compare the two protocols. Results show that our protocol, OMRPv3, outperforms BRUMA in many of these metrics.
Advisors/Committee Members: Chou, Chun Tung, Computer Science & Engineering, Faculty of Engineering, UNSW.
Subjects/Keywords: Routing; Opportunistic routing; Multicast in wireless networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Bilh, A. A. (2010). The design and evaluation of an opportunistic multicast routing protocol. (Masters Thesis). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/51502 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10189/SOURCE02?view=true
Chicago Manual of Style (16th Edition):
Bilh, Abdoulmenim Ahmed. “The design and evaluation of an opportunistic multicast routing protocol.” 2010. Masters Thesis, University of New South Wales. Accessed January 26, 2021.
http://handle.unsw.edu.au/1959.4/51502 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10189/SOURCE02?view=true.
MLA Handbook (7th Edition):
Bilh, Abdoulmenim Ahmed. “The design and evaluation of an opportunistic multicast routing protocol.” 2010. Web. 26 Jan 2021.
Vancouver:
Bilh AA. The design and evaluation of an opportunistic multicast routing protocol. [Internet] [Masters thesis]. University of New South Wales; 2010. [cited 2021 Jan 26].
Available from: http://handle.unsw.edu.au/1959.4/51502 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10189/SOURCE02?view=true.
Council of Science Editors:
Bilh AA. The design and evaluation of an opportunistic multicast routing protocol. [Masters Thesis]. University of New South Wales; 2010. Available from: http://handle.unsw.edu.au/1959.4/51502 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10189/SOURCE02?view=true
18.
Ramiro-Cid, Victor.
Caractérisation et applications de marches aléatoires temporelles dans les réseaux opportunistes : Characterization and applications of temporal random walks over opportunistic networks.
Degree: Docteur es, Réseaux, télécom, système et architecture, 2015, Toulouse, ISAE
URL: http://www.theses.fr/2015ESAE0023
► L’Internet a complètement révolutionné la façon dont nous communiquons. En parallèle, la croissance importante des réseaux mobiles s'est accompagnée d'une explosion du nombre d’usagers et…
(more)
▼ L’Internet a complètement révolutionné la façon dont nous communiquons. En parallèle, la croissance importante des réseaux mobiles s'est accompagnée d'une explosion du nombre d’usagers et d'une augmentation exponentielle de la demande. Cependant, l’Internet n'est pas encore, voire n'est pas toujours, universellement accessible. Par exemple, c'est le cas en ce qui concerne l’accès dans les économies émergentes ou dans les régions éloignées, les obstacles physiques empêchant le déploiement de réseaux mobiles et les désastres naturels. C'est dans ce contexte que les réseaux tolérants au délai ont été introduits pour faire face aux environnements caractérisés par des interruptions et des délais de transmission élevés. Ces réseaux, manquent souvent de routes pré-déterminées ou même de toute infrastructure pour permettre une communication de bout-en-bout. Dans ce contexte, tous les nœuds de ces réseaux peuvent interagir en utilisant leurs contacts comme une opportunité de communication. Le paradigme stockage/transport permet à ces nœuds d’exploiter des chemins spatio-temporels créés par ces possibilités de contact afin de livrer des messages au fil du temps. Dans ce travail, nous soulevons ici une question générique : pouvons-nous concevoir une infrastructure mobile et opportuniste qui pourrait aider à transmettre ces messages ? Afin de fournir une telle infrastructure, nous étudions l’application des marches aléatoires temporelles (TRWs) dans réseaux opportunistes. Nous explorons l’application et l’impact de la TRW pour fournir une infrastructure minimale et non-invasive à partir de deux points de vue : le stockage des données et leur transmission.
The Internet has entirely reshaped the way we communicate and interact with one another. The rapid development of the wireless infrastructure by network providers has being accompanied by an exponential growth in the number of mobile users. However, global Internet access and connectivity still face several challenges: scarce or poor quality connectivity in developing countries or places with limited accessibility, physical obstacles limiting the deployment of wireless networks and natural or man-made disasters. Delay tolerant networks (DTNs) were introduced to deal with environments where interruptions or disruptions of service were expected. Such networks usually lack of end-to-end paths or any infrastructure to help communications. In these networks, mobile nodes may interact using their contacts as a communication opportunity. The store-carry-forward paradigm allows nodes to exploit spatio-temporal paths created by contact opportunities in order to deliver messages over time. Instead we raise the question: can we design a mobile and opportunistic infrastructure that could help deliver messages? In the quest to provide such infrastructure, we study the application of temporal random walks (TRW) over the opportunistic networks. We explore the application and impact of TRW as a minimal and non invasive infrastructure from two points of view: data forwarding and data…
Advisors/Committee Members: Sénac, Patrick (thesis director), Lochin, Emmanuel (thesis director).
Subjects/Keywords: DTN; Réseaux opportuniste; Réseaux temporelles; Marches aléatoires; Routage; Monitoring; DTN; Opportunistic Networks; Temporal Networks; Random Walks; Routing; Monitoring; 621
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ramiro-Cid, V. (2015). Caractérisation et applications de marches aléatoires temporelles dans les réseaux opportunistes : Characterization and applications of temporal random walks over opportunistic networks. (Doctoral Dissertation). Toulouse, ISAE. Retrieved from http://www.theses.fr/2015ESAE0023
Chicago Manual of Style (16th Edition):
Ramiro-Cid, Victor. “Caractérisation et applications de marches aléatoires temporelles dans les réseaux opportunistes : Characterization and applications of temporal random walks over opportunistic networks.” 2015. Doctoral Dissertation, Toulouse, ISAE. Accessed January 26, 2021.
http://www.theses.fr/2015ESAE0023.
MLA Handbook (7th Edition):
Ramiro-Cid, Victor. “Caractérisation et applications de marches aléatoires temporelles dans les réseaux opportunistes : Characterization and applications of temporal random walks over opportunistic networks.” 2015. Web. 26 Jan 2021.
Vancouver:
Ramiro-Cid V. Caractérisation et applications de marches aléatoires temporelles dans les réseaux opportunistes : Characterization and applications of temporal random walks over opportunistic networks. [Internet] [Doctoral dissertation]. Toulouse, ISAE; 2015. [cited 2021 Jan 26].
Available from: http://www.theses.fr/2015ESAE0023.
Council of Science Editors:
Ramiro-Cid V. Caractérisation et applications de marches aléatoires temporelles dans les réseaux opportunistes : Characterization and applications of temporal random walks over opportunistic networks. [Doctoral Dissertation]. Toulouse, ISAE; 2015. Available from: http://www.theses.fr/2015ESAE0023
19.
Hasan, Affaf.
Adaptive Probabilistic Routing in Wireless Ad Hoc Networks.
Degree: The Institute of Technology, 2013, Linköping UniversityLinköping University
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-94547
The goal of this thesis work is to analyze how design elements and wireless attributes affect opportunistic routing, and in this context develop a new protocol. The algorithm developed aims to improve opportunistic elements in comparison to a well-known opportunistic protocol Simple Opportunistic Adaptive Routing (SOAR).
Subjects/Keywords: Opportunistic Routing; SOAR; Ad Hoc Networks
…23
3.11 Opportunistic Routing… …28
4.1 Extreme Opportunistic Routing (ExOR)… …28
4.2 Resilient Opportunistic Mesh Routing (ROMER)… …29
4.4 Simple Opportunistic Adaptive Routing (SOAR)… …26
Figure 3.11: Opportunistic routing combining multiple weak links into a strong one…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hasan, A. (2013). Adaptive Probabilistic Routing in Wireless Ad Hoc Networks. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-94547
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Hasan, Affaf. “Adaptive Probabilistic Routing in Wireless Ad Hoc Networks.” 2013. Thesis, Linköping UniversityLinköping University. Accessed January 26, 2021.
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-94547.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Hasan, Affaf. “Adaptive Probabilistic Routing in Wireless Ad Hoc Networks.” 2013. Web. 26 Jan 2021.
Vancouver:
Hasan A. Adaptive Probabilistic Routing in Wireless Ad Hoc Networks. [Internet] [Thesis]. Linköping UniversityLinköping University; 2013. [cited 2021 Jan 26].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-94547.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Hasan A. Adaptive Probabilistic Routing in Wireless Ad Hoc Networks. [Thesis]. Linköping UniversityLinköping University; 2013. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-94547
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
20.
HU ZHENGQING.
Opportunistic cooperation in wireless networks.
Degree: 2009, National University of Singapore
URL: http://scholarbank.nus.edu.sg/handle/10635/18806
Subjects/Keywords: Cooperation; Algorithm design; MAC protocol; Opportunistic Routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
ZHENGQING, H. (2009). Opportunistic cooperation in wireless networks. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/18806
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
ZHENGQING, HU. “Opportunistic cooperation in wireless networks.” 2009. Thesis, National University of Singapore. Accessed January 26, 2021.
http://scholarbank.nus.edu.sg/handle/10635/18806.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
ZHENGQING, HU. “Opportunistic cooperation in wireless networks.” 2009. Web. 26 Jan 2021.
Vancouver:
ZHENGQING H. Opportunistic cooperation in wireless networks. [Internet] [Thesis]. National University of Singapore; 2009. [cited 2021 Jan 26].
Available from: http://scholarbank.nus.edu.sg/handle/10635/18806.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
ZHENGQING H. Opportunistic cooperation in wireless networks. [Thesis]. National University of Singapore; 2009. Available from: http://scholarbank.nus.edu.sg/handle/10635/18806
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Universitat Politècnica de València
21.
Chancay Garcia, Leonardo Javier.
Evaluación y Modelado de Redes Oportunistas.
Degree: 2019, Universitat Politècnica de València
URL: http://hdl.handle.net/10251/124339
► [ES] La disponibilidad y el rendimiento de las actuales tecnologías inalámbricas como WiFi o 4G, pueden tener serios problemas de congestión y propagación, especialmente en…
(more)
▼ [ES] La disponibilidad y el rendimiento de las actuales tecnologías inalámbricas como WiFi o 4G, pueden tener serios problemas de congestión y propagación, especialmente en espacios muy concurridos, o bien ser inaccesibles en sitios remotos o con baja densidad de personas. La utilización de las Redes Oportunistas en este tipo de escenarios puede ser la solución a estos problemas. Estas redes se basan en la oportunidad de intercambiar mensajes utilizando algún tipo de tecnología de comunicación directa entre dispositivos móviles como son Bluetooth o WiFi.
El rendimiento de las Redes Oportunistas depende principalmente de la movilidad de los nodos y los protocolos de enrutamiento utilizados, siendo estos últimos los encargados de decidir como son intercambiados los mensajes cuando un contacto ocurre, intentando encontrar la mejor ruta para que un mensaje alcance su destino. Por otra parte, la eficiencia de la difusión en estas redes está ligada especialmente a la movilidad de los usuarios y al comportamiento humano. Entonces, para el análisis y la evaluación del rendimiento de las Redes Oportunistas es necesario considerar tanto los aspectos técnicos relacionados con los protocolos de encaminamiento, como los aspectos de la movilidad humana.
Esta tesis doctoral se centra principalmente en evaluar la diseminación de la información usando redes oportunistas en escenarios urbanos, en los que existen diferentes densidades y tasas de renovación de personas, es decir, con usuarios que puedan entrar y salir del escenario evaluado. Dado que la existencia de este tipo de trazas reales es muy limitada, en esta tesis se plantea la generación de este tipo de trazas de forma sintética. Para ello, mediante el uso de un simulador de movilidad peatonal, se han generado trazas realistas de movilidad con diferentes grados de densidad y tasas de renovación de usuarios con el objeto de evaluar diferentes aspectos de la difusión de mensajes en las Redes Oportunistas.
El análisis de las características temporales y espaciales de estas trazas generadas refleja el realismo de los escenarios que se han considerado. Además, los experimentos relativos a la difusión de mensajes realizados con estas trazas, confirman que la tasa de renovación tiene un gran impacto en el rendimiento de los protocolos, lo que es particularmente evidente cuando el tamaño de los mensajes es mayor.
Por otra parte, también se ha realizado el estudio, utilizando en este caso trazas reales, de la difusión de información a través de las Redes Oportunistas Vehiculares. Ya que de la misma manera la movilidad de estos vehículos está ligada al comportamiento humano, nos hemos centrado en la diseminación de la información en determinadas horas del día dependiendo del número de vehículos en circulación, debido a que este aspecto tiene un gran impacto en el reenvío de datos. Los resultados de estos experimentos confirman que los dos principales factores que afectan a la difusión de información son el grado de movilidad y el tamaño de mensaje.
Aunque es bien…
Advisors/Committee Members: Hernández Orallo, Enrique (advisor), Manzoni, Pietro (advisor).
Subjects/Keywords: Redes Oportunistas;
Opportunistic Networks;
OppNets;
Redes Tolerantes a Retardo;
Delay Tolerant Networks;
DTN;
Redes Ad-hoc;
Ad-hoc Networks;
Mobile Computing;
Network Performance Evaluation;
Protocolos de Enrutamiento;
Protocolos de Encaminamiento;
Routing Protocols;
Redes Oportunistas Vehiculares;
Vehicular Networks;
Vehicular Opportunistic Networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chancay Garcia, L. J. (2019). Evaluación y Modelado de Redes Oportunistas.
(Doctoral Dissertation). Universitat Politècnica de València. Retrieved from http://hdl.handle.net/10251/124339
Chicago Manual of Style (16th Edition):
Chancay Garcia, Leonardo Javier. “Evaluación y Modelado de Redes Oportunistas.
” 2019. Doctoral Dissertation, Universitat Politècnica de València. Accessed January 26, 2021.
http://hdl.handle.net/10251/124339.
MLA Handbook (7th Edition):
Chancay Garcia, Leonardo Javier. “Evaluación y Modelado de Redes Oportunistas.
” 2019. Web. 26 Jan 2021.
Vancouver:
Chancay Garcia LJ. Evaluación y Modelado de Redes Oportunistas.
[Internet] [Doctoral dissertation]. Universitat Politècnica de València; 2019. [cited 2021 Jan 26].
Available from: http://hdl.handle.net/10251/124339.
Council of Science Editors:
Chancay Garcia LJ. Evaluación y Modelado de Redes Oportunistas.
[Doctoral Dissertation]. Universitat Politècnica de València; 2019. Available from: http://hdl.handle.net/10251/124339

Université du Luxembourg
22.
Sandulescu, Gabriel.
Resource-Aware routing in delay and disruption tolerant networks.
Degree: 2011, Université du Luxembourg
URL: http://orbilu.uni.lu/handle/10993/15470
► In recent years a new class of networks, known as delay- and disruption-tolerant networks (DTNs), have emerged with applications in vehicular communications, emergency response and…
(more)
▼ In recent years a new class of networks, known as delay- and disruption-tolerant networks (DTNs), have emerged with applications in vehicular communications, emergency response and the military, to mention a few. This thesis studies the resource-aware
routing problem in DTNs along four lines.
First, the thesis presents the design and comparative evaluation of a delay-tolerant
routing protocol (ORWAR) which optimises message transmission and bandwidth usage during
opportunistic encounters. This is done through the estimation of contact duration between nodes, selection of the most suitable message to forward at any contact opportunity, and message differentiation.
Second, the thesis proposes a hybrid scheme whereby
opportunistic and infrastructure-based communication can be combined to overcome network partitions and packet losses. Collaboration between two networks characterised by different capacities, costs, and performance levels has been shown to be not only cost-effective, but also capable of increasing network survivability in the combined network.
Third, it proposes and evaluates a mathematical model that can be used to compute the optimal level of redundancy and replication of a
routing protocol as a function of message characteristics.
Fourth, a holistic approach to resources is proposed, where variations in the spatial and temporal distribution of various resources can feed strategies to reduce resource consumption. Using estimates of vicinity resources, a
routing protocol may not only use up fewer resources overall, but may also consume resources preferentially from nodes with higher resource levels, sparing whenever possible those with limited supplies.
Advisors/Committee Members: Nadjm Tehrani, Simin [superviser].
Subjects/Keywords: Delay-tolerant communication; Resource management; DTN Contact window; Opportunistic networks; Erasure coding; Routing Performance; Engineering, computing & technology :: Computer science [C05]; Ingénierie, informatique & technologie :: Sciences informatiques [C05]
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sandulescu, G. (2011). Resource-Aware routing in delay and disruption tolerant networks. (Doctoral Dissertation). Université du Luxembourg. Retrieved from http://orbilu.uni.lu/handle/10993/15470
Chicago Manual of Style (16th Edition):
Sandulescu, Gabriel. “Resource-Aware routing in delay and disruption tolerant networks.” 2011. Doctoral Dissertation, Université du Luxembourg. Accessed January 26, 2021.
http://orbilu.uni.lu/handle/10993/15470.
MLA Handbook (7th Edition):
Sandulescu, Gabriel. “Resource-Aware routing in delay and disruption tolerant networks.” 2011. Web. 26 Jan 2021.
Vancouver:
Sandulescu G. Resource-Aware routing in delay and disruption tolerant networks. [Internet] [Doctoral dissertation]. Université du Luxembourg; 2011. [cited 2021 Jan 26].
Available from: http://orbilu.uni.lu/handle/10993/15470.
Council of Science Editors:
Sandulescu G. Resource-Aware routing in delay and disruption tolerant networks. [Doctoral Dissertation]. Université du Luxembourg; 2011. Available from: http://orbilu.uni.lu/handle/10993/15470

University of Notre Dame
23.
Daniele Puccinelli.
Mitigation and Exploitation of Multipath Fading in Wireless
Sensor Networks</h1>.
Degree: Electrical Engineering, 2005, University of Notre Dame
URL: https://curate.nd.edu/show/k930bv75m1d
► The increasing interest in wireless sensor networks can be promptly understood simply by thinking about what they essentially are: a large number of small…
(more)
▼ The increasing interest in wireless sensor
networks can be promptly understood simply by thinking about what
they essentially are: a large number of small sensing self-powered
nodes which gather information or detect special events and commu-
nicate in a wireless fashion, with the end goal of handing their
processed data to a base station. Sensing, processing and
communication are three key elements whose combination in one tiny
device gives rise to a vast number of applications [5, 46]. Sensor
networks provide endless opportunities, but at the same time pose
formi- dable challenges, such as the fact that energy is a scarce
and usually non-renewable resource. The minimization of energy
expenditure in the sensing nodes is a natural direction for
wireless sensor network research. Reducing the computational load
and minimizing radio power consumption are necessary steps dictated
by common sense; on the radio side, the knowledge of the properties
of the wireless medium can help minimize packet loss. Wireless
analytical models are useful, but the oversimplifica- tions
introduced by many of them can lead to wrong considerations and
conclusions. For this reason, it is essential to analyze the
wireless medium with real hardware. Sensor network design should be
performed by considering the interactions between the physical
layer and the upper layers: physical layer phenomena should be
taken into account in the development of MAC and
routing schemes.
In the present work, we consider the impact of multipath fading on
sensor networks. Chapter 2 focuses on the analysis of the
properties of multipath fading, and the verification of the most
common models through software simulations and tests based on
hardware implementations. In Chapter 3, we use the properties of
multipath fading to pro- pose a novel, lightweight protocol for the
acquisition of data from the nodes in a wireless sensor network
based on the exploitation of mobility and the concept of
opportunistic transmissions. Our protocol aims at the avoidance of
packet loss by the nodes and the minimization of their energy
consumption. While Chapter 3 revolves around the mitigation of the
eå¨ects of multipath fading, chapter 4 describes a novel idea for
its constructive exploitation. We show how the footprint of
multipath fading on the received signal strength can be used for
purposes of motion detection. The present work is completed by an
appendix where extra details specific to our hardware
implementations are provided to the interested reader. In the rest
of the present chapter, we provide an overview of the research
efforts in the field of wireless sensor networks. We start by
listing some interesting applications and research projects
currently underway. We then indicate the main peculiarities of
sensor networks to give a feeling and basic understanding of what
makes them unique and to justify the enormous interest in the field
that is being displayed by the community. Finally, we present the
most interesting and commonly used hardware platforms that enable
wireless…
Advisors/Committee Members: Martin Haenggi, Committee Chair, J. Nicholas Laneman, Committee Member, Panos Antsaklis, Committee Member.
Subjects/Keywords: routing; opportunistic schemes; multipath fading; wireless sensor networks; Rayleigh fading
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Puccinelli, D. (2005). Mitigation and Exploitation of Multipath Fading in Wireless
Sensor Networks</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/k930bv75m1d
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Puccinelli, Daniele. “Mitigation and Exploitation of Multipath Fading in Wireless
Sensor Networks</h1>.” 2005. Thesis, University of Notre Dame. Accessed January 26, 2021.
https://curate.nd.edu/show/k930bv75m1d.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Puccinelli, Daniele. “Mitigation and Exploitation of Multipath Fading in Wireless
Sensor Networks</h1>.” 2005. Web. 26 Jan 2021.
Vancouver:
Puccinelli D. Mitigation and Exploitation of Multipath Fading in Wireless
Sensor Networks</h1>. [Internet] [Thesis]. University of Notre Dame; 2005. [cited 2021 Jan 26].
Available from: https://curate.nd.edu/show/k930bv75m1d.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Puccinelli D. Mitigation and Exploitation of Multipath Fading in Wireless
Sensor Networks</h1>. [Thesis]. University of Notre Dame; 2005. Available from: https://curate.nd.edu/show/k930bv75m1d
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Arizona
24.
Shu, Tao.
Efficient Radio Resource Management and Routing Mechanisms for Opportunistic Spectrum Access Networks
.
Degree: 2010, University of Arizona
URL: http://hdl.handle.net/10150/194747
► Opportunistic spectrum access (OSA) promises to significantly improve the utilization of the RF spectrum. Under OSA, an unlicensed secondary user (SU) is allowed to detect…
(more)
▼ Opportunistic spectrum access (OSA) promises to significantly improve the utilization of the RF spectrum. Under OSA, an unlicensed secondary user (SU) is allowed to detect and access under-utilized portions of the licensed spectrum, provided that such operation does not interfere with the communication of licensed primary users (PUs). Cognitive radio (CR) is a key enabling technology of OSA. In this dissertation, we propose several radio resource management and
routing mechanisms that optimize the discovery and utilization of spectrum opportunities in a cognitive radio network (CRN). First, we propose a sequential channel sensing and probing mechanism that enables a resource-constrained SU to efficiently identify the optimal transmission opportunity from a pool of potentially usable channels. This mechanism maximizes the SUs expected throughput by accounting for the tradeoff between the reward and overhead of scanning additional channels. The optimal channel sensing and probing process is modeled as a maximum-rate-of-return problem in optimal stopping theory. Operational parameters, such as sensing and probing times, are optimized by exploiting the problem's special structure. Second, we study the problem of coordinated spectrum access in CRNs to maximize the CRNs throughput. By exploiting the geographic relationship between an SU and its surrounding PUs, we propose the novel concept of microscopic spectrum opportunity, in which active SUs and PUs are allowed to operate in the same region,
subject to power constraints. Under this framework, we formulate the coordinated channel access problem as a joint power/rate control and channel assignment optimization problem. Centralized and distributed approximate algorithms are proposed to solve this problem efficiently. Compared with its macroscopic counterpart, we show that the microscopic-spectrum-opportunity framework offers significant throughput gains. Finally, at the network layer, we study the problem of truthful least-priced-path (LPP)
routing for profit-driven CRNs. We design a route selection and pricing mechanism that guarantees truthful spectrum cost reporting from profit-driven SUs and that finds the cheapest route for end users. The problem is investigated with and without capacity constraints at individual nodes. In both cases, polynomial-time algorithms are developed to solve the LPP problem. Extensive simulations are conducted to verify the validity of the proposed mechanisms.
Advisors/Committee Members: Krunz, Marwan (advisor), Krunz, Marwan (committeemember), Ramasubramanian, Srinivasan (committeemember), Lazos, Loukas (committeemember).
Subjects/Keywords: cognitive radio;
opportunistic spectrum access;
optimization;
radio resource management;
routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Shu, T. (2010). Efficient Radio Resource Management and Routing Mechanisms for Opportunistic Spectrum Access Networks
. (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/194747
Chicago Manual of Style (16th Edition):
Shu, Tao. “Efficient Radio Resource Management and Routing Mechanisms for Opportunistic Spectrum Access Networks
.” 2010. Doctoral Dissertation, University of Arizona. Accessed January 26, 2021.
http://hdl.handle.net/10150/194747.
MLA Handbook (7th Edition):
Shu, Tao. “Efficient Radio Resource Management and Routing Mechanisms for Opportunistic Spectrum Access Networks
.” 2010. Web. 26 Jan 2021.
Vancouver:
Shu T. Efficient Radio Resource Management and Routing Mechanisms for Opportunistic Spectrum Access Networks
. [Internet] [Doctoral dissertation]. University of Arizona; 2010. [cited 2021 Jan 26].
Available from: http://hdl.handle.net/10150/194747.
Council of Science Editors:
Shu T. Efficient Radio Resource Management and Routing Mechanisms for Opportunistic Spectrum Access Networks
. [Doctoral Dissertation]. University of Arizona; 2010. Available from: http://hdl.handle.net/10150/194747
25.
Xu, Mingsen.
Collaborative Communication And Storage In Energy-Synchronized Sensor Networks.
Degree: PhD, Computer Science, 2013, Georgia State University
URL: https://scholarworks.gsu.edu/cs_diss/74
► In a battery-less sensor network, all the operation of sensor nodes are strictly constrained by and synchronized with the fluctuations of harvested energy, causing…
(more)
▼ In a battery-less sensor network, all the operation of sensor nodes are strictly constrained by and synchronized with the fluctuations of harvested energy, causing nodes to be disruptive from network and hence unstable network connectivity. Such wireless sensor network is named as energy-synchronized sensor networks. The unpredictable network disruptions and challenging communication environments make the traditional communication protocols inefficient and require a new paradigm-shift in design. In this thesis, I propose a set of algorithms on collaborative data communication and storage for energy-synchronized sensor networks. The solutions are based on erasure codes and probabilistic network codings. The proposed set of algorithms significantly improve the data communication throughput and persistency, and they are inherently amenable to probabilistic nature of transmission in wireless networks.
The technical contributions explore collaborative communication with both no coding and network coding methods. First, I propose a collaborative data delivery protocol to exploit the optimal performance of multiple energy-synchronized paths without network coding, i.e. a new max-flow min-variance algorithm. In consort with this data delivery protocol, a localized TDMA MAC protocol is designed to synchronize nodes' duty-cycles and mitigate media access contentions. However, the energy supply can change dynamically over time, making determined duty cycles synchronization difficult in practice. A probabilistic approach is investigated. Therefore, I present
Opportunistic Network Erasure Coding protocol (ONEC), to collaboratively collect data. ONEC derives the probability distribution of coding degree in each node and enable
opportunistic in-network recoding, and guarantee the recovery of original sensor data can be achieved with high probability upon receiving any sufficient amount of encoded packets. Next, OnCode, an
opportunistic in-network data coding and delivery protocol is proposed to further improve data communication under the constraints of energy synchronization. It is resilient to packet loss and network disruptions, and does not require explicit end-to-end feedback message. Moreover, I present a network Erasure Coding with randomized Power Control (ECPC) mechanism for collaborative data storage in disruptive sensor networks. ECPC only requires each node to perform a single broadcast at each of its several randomly selected power levels. Thus it incurs very low communication overhead. Finally, I propose an integrated algorithm and middleware (Ravine Stream) to improve data delivery throughput as well as data persistency in energy-synchronized sensor network.
Advisors/Committee Members: WenZhan Song, Xiaolin Hu, Yingshu Li, Yichuan Zhao.
Subjects/Keywords: Collaborative network coding; Probability distribution; Opportunistic routing; Disruptive sensor networks
…Opportunistic Routing
• ONEC - Opportunistic Network Erasure Coding
• OnCode - Opportunistic in… …opportunistic routing
and joint energy-routing optimization were proposed to deliver data… …collaboratively. Opportunistic routing is adopted [3–5] to take advantage of multiple… …transmission opportunities
to improve data throughput. Opportunistic routing allows packet… …exploits opportunistic routing instead of a predetermined routing, which reduces the coding…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Xu, M. (2013). Collaborative Communication And Storage In Energy-Synchronized Sensor Networks. (Doctoral Dissertation). Georgia State University. Retrieved from https://scholarworks.gsu.edu/cs_diss/74
Chicago Manual of Style (16th Edition):
Xu, Mingsen. “Collaborative Communication And Storage In Energy-Synchronized Sensor Networks.” 2013. Doctoral Dissertation, Georgia State University. Accessed January 26, 2021.
https://scholarworks.gsu.edu/cs_diss/74.
MLA Handbook (7th Edition):
Xu, Mingsen. “Collaborative Communication And Storage In Energy-Synchronized Sensor Networks.” 2013. Web. 26 Jan 2021.
Vancouver:
Xu M. Collaborative Communication And Storage In Energy-Synchronized Sensor Networks. [Internet] [Doctoral dissertation]. Georgia State University; 2013. [cited 2021 Jan 26].
Available from: https://scholarworks.gsu.edu/cs_diss/74.
Council of Science Editors:
Xu M. Collaborative Communication And Storage In Energy-Synchronized Sensor Networks. [Doctoral Dissertation]. Georgia State University; 2013. Available from: https://scholarworks.gsu.edu/cs_diss/74
26.
Han, Mi Kyung.
Optimizing opportunistic communication in wireless networks.
Degree: PhD, Computer Science, 2011, University of Texas – Austin
URL: http://hdl.handle.net/2152/ETD-UT-2011-08-3876
► Opportunistic communication leverages communication opportunities arising by chance to provide significant performance benefit and even enable communication where it would be impossible otherwise. The goal…
(more)
▼ Opportunistic communication leverages communication opportunities arising
by chance to provide significant performance benefit and even enable communication
where it would be impossible otherwise. The goal of this dissertation is
to optimize
opportunistic communication to achieve good performance in wireless
networks. A key challenge in optimizing
opportunistic communication arises from
dynamic and incidental nature of communication. Complicated wireless interference
patterns, high mobility, and frequent fluctuations in wireless medium make
the optimization even harder.
This dissertation proposes a series of optimization frameworks that systematically
optimizes
opportunistic communication to achieve good performance in wireless mesh networks and vehicular networks. We make the following three major contributions:
First, we develop novel algorithms, techniques, and protocols that optimize
opportunistic communication of wireless mesh network to achieve good, predictable user performance. Our framework systematically optimizes end-to-end
performance (e.g., total throughput). It yields significant improvement over existing
routing schemes. We also show that it is robust against inaccuracy introduced by dynamic network conditions.
Second, we propose a novel overlay framework to exploit inter-flow network
coding in
opportunistic routing. In this framework, an overlay network performs
inter-flow coding to effectively reduce traffic imposed on the underlay network, and
an underlay network uses optimized
opportunistic routing to provide efficient and
reliable overlay links. We show that inter-flow coding together with
opportunistic
routing and rate-limiting brings significant performance benefit.
Finally, we develop a novel optimization framework in vehicular networks
to effectively leverage
opportunistic contacts between vehicles and access points
(APs). We develop a new mobility prediction algorithm and an optimization algorithm
to determine an efficient replication scheme that exploit the synergy among
Internet connectivity, local wireless connectivity, mesh network connectivity, and
vehicular relay connectivity. Based on our framework, we develop a practical system
that enables high-bandwidth content distribution and demonstrate the effectiveness
of our approach using simulation, emulation, and testbed experiments.
Advisors/Committee Members: Qiu, Lili, Ph. D. (advisor), Lam, Simon (committee member), Zhang, Yin (committee member), de Veciana, Gustavo (committee member), Lee, Kang-won (committee member).
Subjects/Keywords: Wireless mesh networks; Vehicular networks; Opportunistic routing; Network coding; Optimization
…in opportunistic routing. In this framework, an overlay network performs
inter-flow coding… …optimized opportunistic routing to provide efficient and
reliable overlay links. We show that… …inter-flow coding together with opportunistic
routing and rate-limiting brings significant… …1.2.1.1 Model-driven Optimization of Opportunistic Routing in IEEE 802.11 Mesh Networks… …1.2.1.2 Overlay-based Optimization of Opportunistic Routing in IEEE 802.11 Mesh Networks…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Han, M. K. (2011). Optimizing opportunistic communication in wireless networks. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2011-08-3876
Chicago Manual of Style (16th Edition):
Han, Mi Kyung. “Optimizing opportunistic communication in wireless networks.” 2011. Doctoral Dissertation, University of Texas – Austin. Accessed January 26, 2021.
http://hdl.handle.net/2152/ETD-UT-2011-08-3876.
MLA Handbook (7th Edition):
Han, Mi Kyung. “Optimizing opportunistic communication in wireless networks.” 2011. Web. 26 Jan 2021.
Vancouver:
Han MK. Optimizing opportunistic communication in wireless networks. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2011. [cited 2021 Jan 26].
Available from: http://hdl.handle.net/2152/ETD-UT-2011-08-3876.
Council of Science Editors:
Han MK. Optimizing opportunistic communication in wireless networks. [Doctoral Dissertation]. University of Texas – Austin; 2011. Available from: http://hdl.handle.net/2152/ETD-UT-2011-08-3876
27.
Türkes, Okan.
Opportunistic Beacon Networks.
Degree: 2016, Centre for Telematics and Information Technology (CTIT)
URL: https://research.utwente.nl/en/publications/opportunistic-beacon-networks(afcedcc8-b20a-4ec9-9fe4-7edf514d678b).html
;
urn:nbn:nl:ui:28-100459
;
afcedcc8-b20a-4ec9-9fe4-7edf514d678b
;
10.3990/1.9789036541343
;
urn:isbn:978-90-365-4134-3
;
urn:nbn:nl:ui:28-100459
;
https://research.utwente.nl/en/publications/opportunistic-beacon-networks(afcedcc8-b20a-4ec9-9fe4-7edf514d678b).html
► Modern society is surrounded by an ample spectrum of personal mobile devices with short-range wireless communication support. This ubiquity creates an immense potential of new…
(more)
▼ Modern society is surrounded by an ample spectrum of personal mobile devices with short-range wireless communication support. This ubiquity creates an immense potential of new concepts for people-centric ad hoc networks that can be applied to every personal and social dimension of life. The last decade introduced the concept of
Opportunistic Networks (OppNets) that facilitates delay-tolerant information sharing between mobile users anytime, anywhere, and every which way possible. OppNets constitute an appealing solution to provide connectivity in those situations where communication is desired, but situated network architectures fail to provide it effectively. Despite the mobile revolution that the world is relishing today, the support of modern wireless technology in smart mobile devices is quite limited to fulfill OppNet services. While having promising potentials, the current wireless standards (e.g. Wi-Fi, Bluetooth) have restricted or hidden support for ad hoc communications in mobile operating systems. So far, such limitations have stimulated little research efforts to devise an alternative solution for the realization of OppNets. Besides, these standards are designed to achieve ad hoc communications under stable connectivity, therefore cannot cope with the highly-dynamic characteristics of OppNets. Intrinsically, OppNets rely on mobility of users to extend the dimension of communications over large distances. By and large, the mobility assistance greatly needed by OppNets requires innovative design considerations for the networks of smart mobile devices. This thesis focuses on the design, implementation, and analysis of a novel OppNet architecture intended for smart mobile platforms. Named Cocoon (Community-oriented Context-aware
Opportunistic Networking), this architecture assists the practical development of a wide range of OppNet applications offered for general public use. Cocoon integrates versatile and lightweight
opportunistic communication methods with a new collection of applications which are freely accessible by any group of mobile users. The presented applications span a rich collection of applications, such as short message services in challenged environments, safety monitoring in vehicular environments, and data dissemination in several demanding scenarios. In order to carry out these applications, Cocoon introduces a versatile and lightweight connectivity scheme, called
opportunistic beacons, that expedites rapid and energy-efficient information sharing between smart mobile devices without requiring connections and sophisticated configurations. The design of
opportunistic beacons is generic, so that it is readily integrable on top of the commonly-used wireless interfaces such as Wi-Fi and Bluetooth. The Cocoon architecture employs
opportunistic beacons in the design and management of networking and application services. As a networking service,
Opportunistic Beacon Networking (OBN) is introduced. Within OBN, a forwarding protocol is proposed and validated with extensive real-world experiments.…
Advisors/Committee Members: Havinga, Paul J.M., Scholten, Johan.
Subjects/Keywords: EWI-27036; mobile network architecture; mobile networks; opportunistic beacon networks; smartphone ad hoc networks; cocoon; Opportunistic routing; IR-100459; Ad hoc networks; Mobile Ad hoc Networks; opportunistic beacons; Opportunistic Networks; METIS-316701
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Türkes, O. (2016). Opportunistic Beacon Networks. (Doctoral Dissertation). Centre for Telematics and Information Technology (CTIT). Retrieved from https://research.utwente.nl/en/publications/opportunistic-beacon-networks(afcedcc8-b20a-4ec9-9fe4-7edf514d678b).html ; urn:nbn:nl:ui:28-100459 ; afcedcc8-b20a-4ec9-9fe4-7edf514d678b ; 10.3990/1.9789036541343 ; urn:isbn:978-90-365-4134-3 ; urn:nbn:nl:ui:28-100459 ; https://research.utwente.nl/en/publications/opportunistic-beacon-networks(afcedcc8-b20a-4ec9-9fe4-7edf514d678b).html
Chicago Manual of Style (16th Edition):
Türkes, Okan. “Opportunistic Beacon Networks.” 2016. Doctoral Dissertation, Centre for Telematics and Information Technology (CTIT). Accessed January 26, 2021.
https://research.utwente.nl/en/publications/opportunistic-beacon-networks(afcedcc8-b20a-4ec9-9fe4-7edf514d678b).html ; urn:nbn:nl:ui:28-100459 ; afcedcc8-b20a-4ec9-9fe4-7edf514d678b ; 10.3990/1.9789036541343 ; urn:isbn:978-90-365-4134-3 ; urn:nbn:nl:ui:28-100459 ; https://research.utwente.nl/en/publications/opportunistic-beacon-networks(afcedcc8-b20a-4ec9-9fe4-7edf514d678b).html.
MLA Handbook (7th Edition):
Türkes, Okan. “Opportunistic Beacon Networks.” 2016. Web. 26 Jan 2021.
Vancouver:
Türkes O. Opportunistic Beacon Networks. [Internet] [Doctoral dissertation]. Centre for Telematics and Information Technology (CTIT); 2016. [cited 2021 Jan 26].
Available from: https://research.utwente.nl/en/publications/opportunistic-beacon-networks(afcedcc8-b20a-4ec9-9fe4-7edf514d678b).html ; urn:nbn:nl:ui:28-100459 ; afcedcc8-b20a-4ec9-9fe4-7edf514d678b ; 10.3990/1.9789036541343 ; urn:isbn:978-90-365-4134-3 ; urn:nbn:nl:ui:28-100459 ; https://research.utwente.nl/en/publications/opportunistic-beacon-networks(afcedcc8-b20a-4ec9-9fe4-7edf514d678b).html.
Council of Science Editors:
Türkes O. Opportunistic Beacon Networks. [Doctoral Dissertation]. Centre for Telematics and Information Technology (CTIT); 2016. Available from: https://research.utwente.nl/en/publications/opportunistic-beacon-networks(afcedcc8-b20a-4ec9-9fe4-7edf514d678b).html ; urn:nbn:nl:ui:28-100459 ; afcedcc8-b20a-4ec9-9fe4-7edf514d678b ; 10.3990/1.9789036541343 ; urn:isbn:978-90-365-4134-3 ; urn:nbn:nl:ui:28-100459 ; https://research.utwente.nl/en/publications/opportunistic-beacon-networks(afcedcc8-b20a-4ec9-9fe4-7edf514d678b).html
28.
Van Buhler, Eric Avery.
Opportunistic Routing in Wireless Networks.
Degree: Electrical Engineering (Communication Theory and Systems), 2015, University of California – San Diego
URL: http://www.escholarship.org/uc/item/7m93786x
► Wireless multi-hop networks have become an important part of many modern communication systems. Opportunistic routing aims to overcome the deficiencies of conventional routing on wireless…
(more)
▼ Wireless multi-hop networks have become an important part of many modern communication systems. Opportunistic routing aims to overcome the deficiencies of conventional routing on wireless multi-hop networks, specifically, taking advantage of wireless opportunities and receiver diversity. This thesis first provides an overview of the optimal opportunistic distance metric, then examines the performance of several routing algorithms from the literature, compared to the optimal opportunistic routing algorithm. The performance is examined first in analytical examples, then via simulation to identify the strengths of the optimal opportunist routing algorithm. The performance of a distributed implementation of the optimal opportunistic routing algorithm is also examined via simulation.
Subjects/Keywords: Electrical engineering; Ad Hoc Wireless Networks; Distance Vector Routing; Mesh Networks; Opportunistic Routing; Wireless Networks
…opportunistic routing protocols the receiver diversity
is achieved via a three-way handshake… …Figure 2.5: In Type-B opportunistic routing protocols the receiver diversity
is achieved via an… …to 4 are adapted from Javidi, T; Van Buhler, E. “Opportunistic
Routing in Wireless Networks… …THE THESIS
Opportunistic Routing in Wireless Networks
by
Eric Van Buhler
Master of… …an important part of many modern communication systems. Opportunistic routing aims to…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Van Buhler, E. A. (2015). Opportunistic Routing in Wireless Networks. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/7m93786x
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Van Buhler, Eric Avery. “Opportunistic Routing in Wireless Networks.” 2015. Thesis, University of California – San Diego. Accessed January 26, 2021.
http://www.escholarship.org/uc/item/7m93786x.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Van Buhler, Eric Avery. “Opportunistic Routing in Wireless Networks.” 2015. Web. 26 Jan 2021.
Vancouver:
Van Buhler EA. Opportunistic Routing in Wireless Networks. [Internet] [Thesis]. University of California – San Diego; 2015. [cited 2021 Jan 26].
Available from: http://www.escholarship.org/uc/item/7m93786x.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Van Buhler EA. Opportunistic Routing in Wireless Networks. [Thesis]. University of California – San Diego; 2015. Available from: http://www.escholarship.org/uc/item/7m93786x
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech
29.
Hamilton, Benjamin Russell.
Low-Overhead Opportunistic Routing for Wireless Ad Hoc and Sensor Networks in a Fading Environment.
Degree: MS, Electrical and Computer Engineering, 2007, Georgia Tech
URL: http://hdl.handle.net/1853/19749
► The development of miniaturized radio and sensing technologies have enabled the deployment of large quantities of wireless sensors capable of forming multi-hop networks. Emerging applications…
(more)
▼ The development of miniaturized radio and sensing technologies have
enabled the deployment of large quantities of wireless sensors
capable of forming multi-hop networks. Emerging applications of this
technology such as surveillance and disaster monitoring have
throughput and efficiency requirements not met by current
routing
algorithms. These requirements are also shared by ad-hoc networks.
Early
routing protocols for these wireless networks were based on
algorithms designed for wired networks. Geographic
routing (
routing
based on position), was proposed. These algorithms perform poorly
since they do not account for the fading and interference effects of
wireless channels. Recent protocols that have attempted to account
for the wireless channel focus on single-hop situations and are not
readily extensible to multi-hop networks.
In this thesis we present a framework for
routing based on a
distributed
routing decision and provide several example protocols.
This framework provides a cross-layer design where the
routing
decision is decided through silent negotiation between candidate
relays. We investigate the performance and parameters of this
framework. We then present an example protocol using this framework
which provides low-overhead
opportunistic routing using cooperative
diversity. This protocol uses the intrinsic characteristics of the
wireless channel to achieve diversity while still maintaining
relatively low overhead. An adaptation of the protocol for
heterogeneous networks equipped with multiple antennas has also been
discussed and evaluated through simulations. We also investigate
another protocol based on this framework using the product of the
instantaneous packet reception rate and the marginal progress
towards the destination as a
routing metric, offering enhanced
throughput.
Advisors/Committee Members: Ma, Xiaoli (Committee Chair), Zhou, Guotong (Committee Member), Anderson, David (Committee Member).
Subjects/Keywords: Sensor networks; Routing; Opportunistic; Sensor networks; Ad hoc networks (Computer networks); Wireless communication systems; Routing (Computer network management)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hamilton, B. R. (2007). Low-Overhead Opportunistic Routing for Wireless Ad Hoc and Sensor Networks in a Fading Environment. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/19749
Chicago Manual of Style (16th Edition):
Hamilton, Benjamin Russell. “Low-Overhead Opportunistic Routing for Wireless Ad Hoc and Sensor Networks in a Fading Environment.” 2007. Masters Thesis, Georgia Tech. Accessed January 26, 2021.
http://hdl.handle.net/1853/19749.
MLA Handbook (7th Edition):
Hamilton, Benjamin Russell. “Low-Overhead Opportunistic Routing for Wireless Ad Hoc and Sensor Networks in a Fading Environment.” 2007. Web. 26 Jan 2021.
Vancouver:
Hamilton BR. Low-Overhead Opportunistic Routing for Wireless Ad Hoc and Sensor Networks in a Fading Environment. [Internet] [Masters thesis]. Georgia Tech; 2007. [cited 2021 Jan 26].
Available from: http://hdl.handle.net/1853/19749.
Council of Science Editors:
Hamilton BR. Low-Overhead Opportunistic Routing for Wireless Ad Hoc and Sensor Networks in a Fading Environment. [Masters Thesis]. Georgia Tech; 2007. Available from: http://hdl.handle.net/1853/19749
30.
Papanikos, Nikolaos.
Energy - efficient networking in wireless ad hoc networks.
Degree: 2017, University of Ioannina; Πανεπιστήμιο Ιωαννίνων
URL: http://hdl.handle.net/10442/hedi/43260
► Wireless multi-hop ad hoc networks are self-organizing networks that can be spontaneously deployed without any need of fixed infrastructure. In order to enable communication, network…
(more)
▼ Wireless multi-hop ad hoc networks are self-organizing networks that can be spontaneously deployed without any need of fixed infrastructure. In order to enable communication, network nodes share their resources to store and forward other nodes' data packets. However, the current hardware technology significantly limits the battery power network nodes run on. As a result, designing energy-efficient networking algorithms is of paramount importance for the viability of this type of networks. In the present thesis, we study networking algorithms that rely on packet redundancy to provide fair communication. This approach can significantly increase the number of transmissions and have a severe impact on the energy efficiency. Our main goal is to devise novel algorithms that efficiently handle packet redundancy in order to reduce the related energy costs without compromising the overall performance. We focus on two well-known fields; broadcasting in mobile ad hoc networks (MANETs) and routing in opportunistic networks (OppNets). In the first part, we examine energy-efficient broadcasting in MANETs. The latest trend in this field combines traditional broadcast schemes with network coding. Besides enhancing the energy efficiency through the reduction of transmissions, this synergy also increases the resilience to loss and improves security. Initially, we focus on XOR-based broadcasting and reveal cases where the well-established approach suffers performance breakdowns. We attribute this behavior to an essential component of the underlying broadcast algorithm that is inherently incompatible with network coding. To tackle the problem, we introduce a novel coding-friendly broadcast algorithm. Furthermore, for the first time, we use XOR coding as a mechanism not only for enhancing energy efficiency but also for reducing the end-to-end-delay. Through extensive simulations, we demonstrate the effectiveness of the proposed algorithm on improving the energy efficiency, delivery delay and utilization of network resources. Then, we focus on RLNC-based broadcasting and introduce an analytical model that captures the performance of coding-based broadcast schemes. We observe that the traditional approach to combine RLNC and probabilistic forwarding significantly impacts the performance of RLNC. To this end, we design a novel RLNC-based broadcast algorithm that for the first time applies RLNC over CDS-based broadcasting. The proposed algorithm provides a more systematic pruning of redundant transmissions without compromising RLNC's efficiency. We also investigate the generation management that is a key issue in RLNC and introduce a new distributed scheme that is suitable for mobile environments. Finally, through extensive simulations, we show that the proposed algorithm outperforms XOR-based as well as RLNC-based schemes even when global knowledge is used for managing packet generations. In the second part of the thesis, we investigate energy-efficient routing in OppNets. The prominent routing strategy in coping with intermittent…
Subjects/Keywords: Δίκτυα Η/Υ; Ασύρματα αδόμητα δίκτυα; Οπορτουνιστικά δίκτυα; Δρομολόγηση; Ευρεία εκπομπή; Κωδικοποίηση δικτύου; Αλγόριθμοι δικτύωσης; Πρωτόκολλα δρομολόγησης; Εξοικονόμηση ενέργειας; Διακοπτόμενη συνδεσιμότητα; Δρομολόγηση πολλαπλών αντιτύπων; Networking; Wireless ad hoc networks; Mobile ad hoc networks; Opportunistic networks; Routing; Broadcasting; Energy efficiency; Network coding; XOR coding; Random linear network coding; Multi-copy routing; Replication-based routing; RLNC
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Papanikos, N. (2017). Energy - efficient networking in wireless ad hoc networks. (Thesis). University of Ioannina; Πανεπιστήμιο Ιωαννίνων. Retrieved from http://hdl.handle.net/10442/hedi/43260
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Papanikos, Nikolaos. “Energy - efficient networking in wireless ad hoc networks.” 2017. Thesis, University of Ioannina; Πανεπιστήμιο Ιωαννίνων. Accessed January 26, 2021.
http://hdl.handle.net/10442/hedi/43260.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Papanikos, Nikolaos. “Energy - efficient networking in wireless ad hoc networks.” 2017. Web. 26 Jan 2021.
Vancouver:
Papanikos N. Energy - efficient networking in wireless ad hoc networks. [Internet] [Thesis]. University of Ioannina; Πανεπιστήμιο Ιωαννίνων; 2017. [cited 2021 Jan 26].
Available from: http://hdl.handle.net/10442/hedi/43260.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Papanikos N. Energy - efficient networking in wireless ad hoc networks. [Thesis]. University of Ioannina; Πανεπιστήμιο Ιωαννίνων; 2017. Available from: http://hdl.handle.net/10442/hedi/43260
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
◁ [1] [2] ▶
.