Analysis of an ad hoc network with autonomously moving nodes

Göbel, Johannes; Krzesinski, A. E.; Mandjes, Michel

doi:10.1109/atnac.2007.4665230

Cited by 4 publications

(6 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mobile nodes which have a credit balance less than φ and which are therefore under-supplied with credits will be charged a monetary amount when they create credits through the application of Eqn. (3). The money raised this way is used to compensate those mobile nodes which have a credit balance greater than φ and which are therefore over-supplied with credits: these nodes destroy credits through the application of Eqn.…”

Section: A Manhattan Grid 100 Nodes Movingmentioning

confidence: 99%

“…(3) assumes that the prices that the nodes charge for forwarding a unit of flow are instantaneously known at all nodes. If the pricing information is not instantaneously available, then the nodes will base their cost calculations on different, slightly outdated congestion prices.…”

Section: The Credit Balancementioning

confidence: 99%

“…The fluid-level simulation models [2,3] that were used to explore the model presented in Section 2 update the prices and flows sufficiently frequently so that the bandwidth and power constraints are violated infrequently, and by small amounts. However, in reality the prices and flows cannot be updated arbitrarily frequently.…”

Section: A Signalling Protocolmentioning

confidence: 99%

“…The results presented in [2,3] assume that the congestion prices and the route costs are instantaneously available at all nodes. This is unrealistic: we therefore present a model of a signalling protocol to gather the route costs and make them locally available at the originating nodes where the route costs are needed to adjust the flow rates.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Modelling incentives and protocols for collaboration in mobile ad hoc networks

Göbel

Krzesinski

2008

Proceedings of the 11th International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems

View full text Add to dashboard Cite

Ad hoc networks are self-configuring networks of mobile nodes, connected by wireless links. If a destination node is beyond the transmission range of an origin node, then the nodes must cooperate to provide a multi-hop route. Any node can act as a sender, receiver or transit node. It is in a node's interest to be a sender or receiver, but it is less clear what the value is of forwarding traffic on behalf of other nodes. The nodes should therefore be given incentives to act as transit nodes, because otherwise the network would fail to function. A way to do so is by introducing for each node a credit balance, where nodes use credits to pay for the costs of sending their own traffic, and earn credits by forwarding traffic from other nodes.The incentive scheme requires that the information needed to compute the credit balance at each node must be locally available at the node. In this paper we present a model of a signalling protocol that obtains and distributes the prices that the nodes charge for processing flows so that the credit balances can be locally computed at each node. Simulation experiments show that the protocol can efficiently gather and distribute the control information such that effective flow allocation takes place for reasonable values of the signalling rate and signal processing delays.

show abstract

Section: A Manhattan Grid 100 Nodes Movingmentioning

confidence: 99%

Section: The Credit Balancementioning

confidence: 99%

Section: A Signalling Protocolmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Modelling incentives and protocols for collaboration in mobile ad hoc networks

Göbel

Krzesinski

2008

Proceedings of the 11th International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems

View full text Add to dashboard Cite

show abstract

“…Many movement models [1,5,6,7,8,10,12,13] have been developed in order to analyse and evaluate the efficiency of MANET protocols and services. In this paper we investigate a distributable scalable method based on local interactions with minimal sensing and low computational cost which enable nodes in an ad hoc network to spatially distribute themselves so as to maximise their area coverage.…”

Section: Introductionmentioning

confidence: 99%

A Model of Autonomous Motion in Ad Hoc Networks to Maximise Area Coverage

Göbel

Krzesinski

2008

2008 Australasian Telecommunication Networks and Applications Conference

Self Cite

View full text Add to dashboard Cite

Ad hoc networks are self-configuring networks of mobile nodes, connected by wireless links. Suppose each mobile node can make observations within a circular area of radius r obs centred on its own location. The area coverage of the network is defined as the total area observed by the mobile nodes. We investigate a distributed scalable method based on local interactions with minimal sensing and low computational cost whereby the nodes move autonomously (self-deployment) in order to maximise the coverage of the network, while at the same time ensuring that the mobile nodes do not move so far away from each other (thus trivially maximising the coverage) that they become disconnected. Certain nodes may be instructed to move to specified locations. These guide nodes induce a correlated movement of groups of nodes which follow the guide nodes and establish maximal coverage in the specified locations. Simulation results demonstrate the coverage achieved by a group of 100 nodes when moving on an unbounded plane (optional guide nodes induce a collective motion to areas of interest) and when moving on a bounded plane with barriers or hills.

show abstract