Results 1 - 10
of
35
Self-Organization in Mobile Ad-Hoc Networks: the Approach of Terminodes
, 2001
"... The Terminodes project is designing a wide area, mobile ad-hoc network, which is meant to be used in a public environment; in our approach, the network is run by users themselves. We give a global description of the building blocks used by the basic operation of the network; they all rely on various ..."
Abstract
-
Cited by 136 (11 self)
- Add to MetaCart
The Terminodes project is designing a wide area, mobile ad-hoc network, which is meant to be used in a public environment; in our approach, the network is run by users themselves. We give a global description of the building blocks used by the basic operation of the network; they all rely on various concepts of self-organization. Routing uses a combination of geography-based information and local, MANET-like protocols. Terminode positioning is obtained either by GPS, or by a relative positioning method. Mobility management uses self-organized virtual regions. Terminodes employ a form of virtual money called "nuglets" as an incentive to collaborate. Lastly, we discuss directions for providing some level of security.
Broadcasting in Ad Hoc Networks Based on Self-Pruning
, 2003
"... We propose a general framework for broadcasting in ad hoc networks through self-pruning. The approach is based on selecting a small subset of hosts (also called nodes) to form a forward node set to carry out a broadcast process. Each node, upon receiving a broadcast packet, determines whether to for ..."
Abstract
-
Cited by 109 (10 self)
- Add to MetaCart
We propose a general framework for broadcasting in ad hoc networks through self-pruning. The approach is based on selecting a small subset of hosts (also called nodes) to form a forward node set to carry out a broadcast process. Each node, upon receiving a broadcast packet, determines whether to forward the packet based on two neighborhood coverage conditions proposed in this paper. These coverage conditions depend on neighbor connectivity and history of visited nodes, and in general, resort to global network information. Using local information such as k-hop neighborhood information, the forward node set is selected through a distributed and local pruning process. The forward node set can be constructed and maintained through either a proactive process (i.e., “up-to-date”) or a reactive process (i.e., “on-the-fly”). Several existing broadcast algorithms can be viewed as special cases of the coverage conditions with k-hop neighborhood information. Simulation results show that new algorithms, which are more efficient than existing ones, can be derived from the coverage conditions, and self-pruning based on 2- or 3-hop neighborhood information is relatively cost-effective.
Modelling the Evolution of Cooperative Behavior in Ad Hoc Networks using a Game Based Model
"... Abstract — In this paper we address the problem of selfish behavior in ad hoc networks. We present a new game theory based model to study cooperation between nodes. This model has some similarities with the Iterated Prisoner’s Dilemma under the Random Pairing game. In such a game randomly chosen pla ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
(Show Context)
Abstract — In this paper we address the problem of selfish behavior in ad hoc networks. We present a new game theory based model to study cooperation between nodes. This model has some similarities with the Iterated Prisoner’s Dilemma under the Random Pairing game. In such a game randomly chosen players receive payoffs that depend on the way they behave. The network gaming model includes a simple reputation collection and trust evaluation mechanisms. In our proposition a decision whether to forward or to drop a packet is determined by a strategy based on the trust level in the source node of the packet and some general information about behavior of the network. A genetic algorithm is applied to evolve strategies for the participating nodes. These strategies are targeted to maximize the throughput of the network by enforcing cooperation. I.
Modeling energy constrained routing in selfish ad hoc networks,” International conference on Game Theory for networks(GameNets
, 2006
"... In static networks, game theory has long been used to model the routing decisions of network nodes. However, once we move to dynamic and resource constrained settings, such as ad hoc or sensor networks, traditional models are no longer sufficient. Instead, new models that capture the dynamic nature ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
(Show Context)
In static networks, game theory has long been used to model the routing decisions of network nodes. However, once we move to dynamic and resource constrained settings, such as ad hoc or sensor networks, traditional models are no longer sufficient. Instead, new models that capture the dynamic nature of the decisions and the resource constraints of the devices are needed. To date, several models that attempt to capture the dynamic nature of routing decisions have been proposed. However, the resource constraints of the devices and the uncertainty about the resources of other devices have been thus far ignored. To this end, we present a game theoretic model that formalizes the resources of the nodes and the beliefs the nodes have about the resources of other nodes. We also discuss the structure of strategies in the proposed model and make explicit the role the resources and beliefs of the nodes play in routing decisions. In addition to presenting a game theoretic model, we propose a method that allows the nodes to learn equilibrium strategies over time, and prove that the strategies suggested by the mechanism converge to a sequential equilibrium. Finally, we present simulations that give insights into the expected behavior of the devices under the proposed model.
Towards trust-based knowledge management in mobile communities
- IN: IAAA
, 2003
"... Agent-mediated Knowledge Management is a promising approach to handle and maintain knowledge, especially in a distributed and mobile environment. A natural example for such an environment is a community: individuals that group together because they share the same interests. Trust is an important iss ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
(Show Context)
Agent-mediated Knowledge Management is a promising approach to handle and maintain knowledge, especially in a distributed and mobile environment. A natural example for such an environment is a community: individuals that group together because they share the same interests. Trust is an important issue when building communities on sharing knowledge. This paper presents our conceptual framework for trust-based knowledge management with respect to the highly distributed and mobile environment of communities. We extend an existing knowledge management system by using mobile agents that serve as dynamic delegates of the mobile user in different locations. These agents may exchange knowledge with other agents. When the user returns to a location a previously delegated agent resides, this agent reconciles the newly found knowledge with the user’s knowledge base. Similar to sharing knowledge, trust plays a central role in this process since it controls the autonomous knowledge acquisition of a user’s agents.
Realistic Physical Layer Modelling for Georouting Protocols in Wireless Ad-Hoc and Sensor Networks
"... Existing routing and broadcasting protocols for ad-hoc networks assume an ideal physical layer. In reality, an accurate representation of physical layer is required for analysis and simulation of multi hop networking in sensor and ad-hoc networks. This paper describes the model for the lognormal cor ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Existing routing and broadcasting protocols for ad-hoc networks assume an ideal physical layer. In reality, an accurate representation of physical layer is required for analysis and simulation of multi hop networking in sensor and ad-hoc networks. This paper describes the model for the lognormal correlated shadow fading loss from the first principles of probability theory, and investigates the importance of correlation length while designing protocols for ad-hoc and sensor networks. Nodes that are geographically proximate often experience similar environmental shadowing effects and can have correlated fading. We consider the overall path loss (shadow fading & median path loss) based on antennas working at 2.4 GHz with heights ranging from 0.5 metres to 1.8 metres. Finally, we analyze and compare the performance of localized position based greedy algorithm used for Unit Disk Graph (UDG) and probabilistic progress based algorithm on the proposed shadowing model for different values of standard deviation (σ) of shadow fading to show the importance of both the shadow fading and correlation length. 1.
Design and Analysis of Fuzzy based Node Traversal Time AODV for Improving the QoS in
"... Routing is a challenging issue which should be handled in a timely manner without unnecessary time delays in MANETs. The choice of the constants affects timeliness of protocol. AODV suggests that the Node Traversal Time (NTT) should be a constant value but does not mention how this value to be adjus ..."
Abstract
- Add to MetaCart
(Show Context)
Routing is a challenging issue which should be handled in a timely manner without unnecessary time delays in MANETs. The choice of the constants affects timeliness of protocol. AODV suggests that the Node Traversal Time (NTT) should be a constant value but does not mention how this value to be adjusted with network size. The proposed method ” Fuzzy Based Node Traversal Time AODV (FBNTTAODV)” suggests that the Node Traversal Time should be a suitable value with the network size and the results shows that it performs better than AODV.
Survey of Different Routing Protocols for Mobile Ad Hoc Networks
, 2014
"... ABSTRACT Communication between nodes in Mobile Ad-hoc Networks (MANETs) is one of the challenging tasks because there are no fixed routes among different nodes in mobile ad-hoc network. Routes change continuously due to node mobility in MANET. Communication process is achieved through routing algor ..."
Abstract
- Add to MetaCart
(Show Context)
ABSTRACT Communication between nodes in Mobile Ad-hoc Networks (MANETs) is one of the challenging tasks because there are no fixed routes among different nodes in mobile ad-hoc network. Routes change continuously due to node mobility in MANET. Communication process is achieved through routing algorithms. Routing algorithms perform best path selection among the available paths in MANET. There are two routing algorithms used for communication which are called flooding and broadcasting. Flooding and broadcasting are the only options available for route discovery between unknown nodes in MANET which create network congestion, delay and reliability problems. Routing algorithms use different approaches to perform efficient communication in MANET which include Proactive Approach, Reactive Approach and Hybrid Approach. In this paper, all those Proactive, Reactive and Hybrid routing protocols that contribute towards the route discovery among different nodes of ad hoc network will be reviewed and critically analyzed to evaluate the performance of different routing protocols that could enable the researchers to keep them under consideration when conducting research.
Energy-Efficient Cluster Based Routing Protocol in Mobile Ad Hoc Networks Using Network Coding
"... In mobile ad hoc networks, all nodes are energy constrained. In such situations, it is important to reduce energy consumption. In this paper, we consider the issues of energy efficient communication in MANETs using network coding. Network coding is an effective method to improve the performance of ..."
Abstract
- Add to MetaCart
(Show Context)
In mobile ad hoc networks, all nodes are energy constrained. In such situations, it is important to reduce energy consumption. In this paper, we consider the issues of energy efficient communication in MANETs using network coding. Network coding is an effective method to improve the performance of wireless networks. COPE protocol implements network coding concept to reduce number of transmissions by mixing the packets at intermediate nodes. We incorporate COPE into cluster based routing protocol to further reduce the energy consumption. The proposed energy-efficient coding-aware cluster based routing protocol (ECCRP) scheme applies network coding at cluster heads to reduce number of transmissions. We also modify the queue management procedure of COPE protocol to further improve coding opportunities. We also use an energy efficient scheme while selecting the cluster head. It helps to increase the life time of the network. We evaluate the performance of proposed energy efficient cluster based protocol using simulation. Simulation results show that the proposed ECCRP algorithm reduces energy consumption and increases life time of the network.
