Results 1 - 10
of
17
Toward reliable data delivery for highly dynamic mobile ad hoc networks
- S. Gopinath and N. Nagarajan Indian Journal of Science and Technology 9Vol 8(13) | July 2015 | www.indjst.org
"... Abstract-This paper addresses the problem of delivering data packets for highly dynamic mobile ad hoc networks in a reliable and timely manner. Most existing ad hoc routing protocols are susceptible to node mobility, especially for large-scale networks. Driven by this issue, we propose an efficient ..."
Abstract
-
Cited by 14 (0 self)
- Add to MetaCart
(Show Context)
Abstract-This paper addresses the problem of delivering data packets for highly dynamic mobile ad hoc networks in a reliable and timely manner. Most existing ad hoc routing protocols are susceptible to node mobility, especially for large-scale networks. Driven by this issue, we propose an efficient Position-based Opportunistic Routing (POR) protocol which takes advantage of the stateless property of geographic routing and the broadcast nature of wireless medium. When a data packet is sent out, some of the neighbor nodes that have overheard the transmission will serve as forwarding candidates, and take turn to forward the packet if it is not relayed by the specific best forwarder within a certain period of time. By utilizing such in-the-air backup, communication is maintained without being interrupted. The additional latency incurred by local route recovery is greatly reduced and the duplicate relaying caused by packet reroute is also decreased. In the case of communication hole, a Virtual Destination-based Void Handling (VDVH) scheme is further proposed to work together with POR. Both theoretical analysis and simulation results show that POR achieves excellent performance even under high node mobility with acceptable overhead and the new void handling scheme also works well.
Stimulating Cooperation in Vehicular Ad Hoc Networks: A Coalitional Game Theoretic Approach
, 2010
"... ... of the non-existence of end-to-end connections, it is essential that nodes take advantage of connection opportunities to forward messages, to make end-to-end messaging possible. Thus it is crucial to make sure that nodes have incentives to forward messages for others, despite that the routing pr ..."
Abstract
-
Cited by 10 (1 self)
- Add to MetaCart
(Show Context)
... of the non-existence of end-to-end connections, it is essential that nodes take advantage of connection opportunities to forward messages, to make end-to-end messaging possible. Thus it is crucial to make sure that nodes have incentives to forward messages for others, despite that the routing protocols in VANETs are different from traditional end-to-end routing protocols. In this paper, we study how to stimulate message forwarding in VANETs. Our approach is based on coalitional game theory. In particular, we propose an incentive scheme for VANETs and rigorously show that with our scheme faithfully following the routing protocol is to the best interests of each node. In addition, we extend our scheme to take the limited storage space of each node into consideration. Experiments on testbed trace data verify that our scheme is effective in stimulating cooperation of message forwarding in VANETs.
A Game-Theoretic Approach to Stimulate Cooperation for Probabilistic Routing in Opportunistic Networks
"... Abstract—Opportunistic networking is an important technique to enable users to communicate in an environment where contemporaneous end-to-end paths are unavailable or unstable. To support end-to-end messaging in opportunistic networks, a number of probabilistic routing protocols have been proposed. ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract—Opportunistic networking is an important technique to enable users to communicate in an environment where contemporaneous end-to-end paths are unavailable or unstable. To support end-to-end messaging in opportunistic networks, a number of probabilistic routing protocols have been proposed. However, when nodes are selfish, they may not have incentives to participate in probabilistic routing, and the system perfor-mance will degrade significantly. In this paper, we present novel incentive schemes for probabilistic routing that stimulates selfish nodes to participate. We not only rigorously prove the properties of our schemes, but also extensively evaluate our schemes using GloMoSim. Evaluation results show that there is an up to 75.8% gain in delivery ratio compared with a probabilistic routing protocol providing no incentive. Index Terms—Opportunistic network, routing, bargaining game. I.
Exchange of Services in Networks: Competition, Cooperation, and Fairness
"... Exchange of services and resources in, or over, networks is attracting nowadays renewed interest. However, despite the broad applicability and the extensive study of such mod-els, e.g., in the context of P2P networks, many fundamental questions regarding their properties and efficiency remain unansw ..."
Abstract
- Add to MetaCart
Exchange of services and resources in, or over, networks is attracting nowadays renewed interest. However, despite the broad applicability and the extensive study of such mod-els, e.g., in the context of P2P networks, many fundamental questions regarding their properties and efficiency remain unanswered. We consider such a service exchange model and analyze the users ’ interactions under three different ap-proaches. First, we study a centrally designed service al-location policy that yields the fair total service each user should receive based on the service it offers to the others. Accordingly, we consider a competitive market where each user determines selfishly its allocation policy so as to maxi-mize the service it receives in return, and a coalitional game model where users are allowed to coordinate their policies. We prove that there is a unique equilibrium exchange allo-cation for both game theoretic formulations, which also co-incides with the central fair service allocation. Furthermore, we characterize its properties in terms of the coalitions that emerge and the equilibrium allocations, and analyze its de-pendency on the underlying network graph. That servicing policy is the natural reference point to the various mecha-nisms that are currently proposed to incentivize user partic-ipation and improve the efficiency of such networked service (or, resource) exchange markets.
Experimenting with Commodity 802.11 Hardware: Overview and Future Directions
, 2015
"... The huge adoption of 802.11 technologies has triggered a vast amount of experimentally-driven research works. These works range from performance analysis to protocol enhancements, including the proposal of novel applications and services. Due to the affordability of the technology, this experimenta ..."
Abstract
- Add to MetaCart
The huge adoption of 802.11 technologies has triggered a vast amount of experimentally-driven research works. These works range from performance analysis to protocol enhancements, including the proposal of novel applications and services. Due to the affordability of the technology, this experimental research is typically based on commercial off-the-shelf (COTS) devices, and given the rate at which 802.11 releases new standards (which are adopted into new, affordable devices), the field is likely to continue to produce results. In this paper, we review and categorise the most prevalent works carried out with 802.11 COTS devices over the past fifteen years, to present a timely snapshot of the areas that have attracted to most attention so far, though a taxonomy that distinguishes between performance studies, enhancements, services and methodology. In this way, we provide a quick overview of the results achieved by the research community that enables prospective authors to identify potential areas of new research, some of which are discussed after the presentation of the survey.
Opportunistic and Cooperative Forwarding in Mobile Ad-hoc Networks with Light-Weight Proactive Source Routing
, 2011
"... The multi-hop wireless network has drawn a great deal of attention in the research community. Within the long period after it was proposed, the routing and forwarding operations in the multi-hop wireless network remain to be quite similar to those in the multi-hop wired network or the Internet. Howe ..."
Abstract
- Add to MetaCart
The multi-hop wireless network has drawn a great deal of attention in the research community. Within the long period after it was proposed, the routing and forwarding operations in the multi-hop wireless network remain to be quite similar to those in the multi-hop wired network or the Internet. However, all the data transmission over the wireless medium in the wireless networks is by broadcasting in nature, which is different from the Internet. Because of the broadcast nature, many opportunities based on overhearing can be used to enhance the data transmission ability in wireless network. ExOR is the first practical data forwarding scheme which tries to promote the data transmission ability by utilizing the broadcast nature in wireless mesh networks, and the opportunistic data forwarding becomes a well-known term given by ExOR to name this kind of new data forwarding scheme. The basic idea in ExOR has triggered a great deal of derivations. However, almost all these derivations are proposed for wireless mesh networks or require the positioning service to support opportunistic data forwarding in the Mobile Ad-hoc Networks (MANETs). In this thesis, we
MINIMIZATION OF DATA REPLICA IN MOBILE ADHOC NETWORK ROUTING
"... Abstract-Adhoc networks have characteristics such as flexibility ,easy deployment,robustness which makes them an intersresting technology for various applications.Adhocnetworks are considered as the most promising terminal networks in future mobile communications.A novel Position based Opportunisti ..."
Abstract
- Add to MetaCart
Abstract-Adhoc networks have characteristics such as flexibility ,easy deployment,robustness which makes them an intersresting technology for various applications.Adhocnetworks are considered as the most promising terminal networks in future mobile communications.A novel Position based Opportunistic Routing protocol, in which several forwarding candidates cache the packet that has been received using MAC interception. If the best forwarder does not forward the packet in certain time slots, suboptimal candidates will take turn to forward the packet according to a locally formed order. In this way, all candidates receives the packet, the data transmission will not be interrupted. Potential multi-paths are exploited on the-fly on a per-packet basis. We propose minimization of data replica at forwarding candidates in Mobile Adhoc network routing.The forwarding candidates will be ranking ,based on the location variance of candidate within the time factor has given to it. General Terms-This paper exposes the minimization of data replica in MANETS routing.
1 A Mathematical Framework for Analyzing Adaptive Incentive Protocols in P2P Networks
"... Abstract—In P2P networks, incentive protocol is used to encourage cooperation among end nodes so as to deliver a scalable and robust service. However, the design and analysis of incentive protocols have been ad hoc and heuristic at best. The objective of this paper is to provide a simple, yet genera ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—In P2P networks, incentive protocol is used to encourage cooperation among end nodes so as to deliver a scalable and robust service. However, the design and analysis of incentive protocols have been ad hoc and heuristic at best. The objective of this paper is to provide a simple, yet general framework to analyze and design incentive protocols. We consider a class of incentive protocols which can learn and adapt to other end nodes ’ strategies. Based on our analytical framework, one can evaluate the expected performance gain, and more importantly, the system robustness of a given incentive protocol. To illustrate the framework, we present two adaptive learning models and three incentive policies and show the conditions in which the P2P networks may collapse and the conditions in which the P2P networks can guarantee a high degree of cooperation. We also show the connection between evaluating incentive protocol and evolutionary game theory so one can easily identify robustness characteristics of a given policy. Using our framework, one can gain the understanding on the price of altruism and system stability, as well as the correctness of the adaptive incentive policy. I.
A Bargaining-Based Approach for Incentive-Compatible Message Forwarding in Opportunistic Networks
"... Abstract—Opportunistic networking is an important technique to enable users to communicate in an environment where contemporaneous end-to-end paths are unavailable or unstable. To support end-to-end messaging in opportunistic networks, a number of probabilistic routing protocols have been proposed. ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—Opportunistic networking is an important technique to enable users to communicate in an environment where contemporaneous end-to-end paths are unavailable or unstable. To support end-to-end messaging in opportunistic networks, a number of probabilistic routing protocols have been proposed. However, when nodes are selfish, they may not have incentives to participate in probabilistic routing, and the system performance will degrade significantly. In this paper, we present a novel incentive scheme for probabilistic routing that stimulates selfish nodes to participate. We not only rigorously prove the properties of our schemes, but also extensively evaluate our schemes using GloMoSim. Evaluation results show that there is an up to 75.8% gain in delivery ratio compared with a probabilistic routing protocol providing no incentive. I.
Incentive-Compatible Multirate Opportunistic Routing in Non-Cooperative Wireless Mesh Networks
"... Abstract—Wireless mesh networks have emerged as an efficient alternative to deploy broadband network infras-tructures in local communities at low cost. To overcome the problem caused by the lossy and dynamic wireless links, opportunistic routing was proposed to achieve high throughput by exploiting ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—Wireless mesh networks have emerged as an efficient alternative to deploy broadband network infras-tructures in local communities at low cost. To overcome the problem caused by the lossy and dynamic wireless links, opportunistic routing was proposed to achieve high throughput by exploiting multi-user diversity. Since wire-less channels exhibit different packet loss probabilities at different transmission bit rates, carefully selecting bit rate at each hop can significantly improve system performance. However, the performance of multirate opportunistic rout-ing still cannot be guaranteed when participating mesh nodes are contributed by different parties and thus have selfish behaviors. In this paper, we present the first incentive protocol for multirate opportunistic routing, under which it is to the best interest of each mesh node to faithfully follow the multirate opportunistic routing protocol. We not only rigorously prove the properties of our protocols but also thoroughly evaluate our incentive protocol on ORBIT wireless testbed. Experiment results show that our protocol can prevent participating nodes ’ selfish behaviors and guarantee high performance of the multirate opportunistic routing protocol. I.