Toward self-organized mobile ad hoc networks: the terminodes project

Hubaux, Jean-Pierre; Gross, T.; Boudec, J.-Y. Le; Vetterli, Martin

doi:10.1109/35.894385

Cited by 230 publications

(109 citation statements)

References 11 publications

Supporting

Mentioning

103

Contrasting

Unclassified

Order By: Relevance

“…In recent years, all-wireless networks have attracted significant attention due to their potential applications in civil and military domains [17,18,11,4]. An all-wireless network consists of numerous devices 1 that are equipped with processing, memory and wireless communication capabilities, and are linked via short-range ad hoc radio connections.…”

Section: Introductionmentioning

confidence: 99%

Minimum-energy broadcast in all-wireless networks

Čagalj

Hubaux

Enz

2002

Proceedings of the 8th Annual International Conference on Mobile Computing and Networking

322

230

View full text Add to dashboard Cite

In all-wireless networks a crucial problem is to minimize energy consumption, as in most cases the nodes are batteryoperated. We focus on the problem of power-optimal broadcast, for which it is well known that the broadcast nature of the radio transmission can be exploited to optimize energy consumption. Several authors have conjectured that the problem of power-optimal broadcast is NP-complete. We provide here a formal proof, both for the general case and for the geometric one; in the former case, the network topology is represented by a generic graph with arbitrary weights, whereas in the latter a Euclidean distance is considered. We then describe a new heuristic, Embedded Wireless Multicast Advantage. We show that it compares well with other proposals and we explain how it can be distributed.

show abstract

Section: Introductionmentioning

confidence: 99%

Minimum-energy broadcast in all-wireless networks

Čagalj

Hubaux

Enz

2002

Proceedings of the 8th Annual International Conference on Mobile Computing and Networking

322

230

View full text Add to dashboard Cite

show abstract

“…A DHT structure is defined to distribute and locate information among the nodes in the addressing structure. Examples of proposals in the literature that implement this approach are: Terminodes [2,9,10], Grid [3,11], and DLM [4]. Most of them assume, however, that nodes know their geographic coordinates through some positioning system (e.g., GPS).…”

Section: Introductionmentioning

confidence: 99%

DHT-based Functionalities Using Hypercubes

Alvarez-Hamelin¹,

Viana²,

Amorim³

2006

Ad-Hoc Networking

View full text Add to dashboard Cite

Abstract. Decoupling the permanent identifier of a node from the node's topology-dependent address is a promising approach toward completely scalable self-organizing networks. Existing solutions use a logical tree-like structure that, although allowing for simple address assignment and management, lead to low route selection flexibility. This clearly results in low routing performance and poor resilience to failures. In this paper, we propose to increase the number of candidate paths by using incomplete hypercubes. We will see that this solution can cover a wide range of applications by adapting to the dynamics of the network.

show abstract

“…To maximize the overall system performance, nodes usually work in a fully cooperative way, and will unconditionally forward packets for each other. Recently, emerging applications of MANETs are also envisioned in civilian usage [3]- [9], where nodes typically do not belong to a single authority and may not pursue a common goal. Furthermore, such a network could be completely self-organizing, where the network would be run solely by the operation of the end-users.…”

mentioning

confidence: 99%

An optimal dynamic pricing framework for autonomous mobile ad hoc networks

Yu¹,

Liu²

2006

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications

View full text Add to dashboard Cite

Abstract-In autonomous mobile ad hoc networks (MANET)where each user is its own authority, fully cooperative behaviors, such as unconditionally forwarding packets for each other or, honestly revealing its private information, cannot be directly assumed. The pricing mechanism is one way to provide incentives for the users to act cooperatively by rewarding some payment for cooperative behaviors. In this paper, we model the pricing and routing as multi-stage dynamic games. By taking into consideration that the packet-forwarding will incur a cost to the relay user and the successful transmission brings benefits to the sender/receiver, we propose a dynamic pricing framework to maximize the sender/receiver's payoff by considering the dynamic nature of MANETs, meanwhile, keeping the forwarding incentives of the relay nodes by providing the optimal payments based on the auction rules. The contributions of this paper are multi-folds: Firstly, by modeling the pricing and routing as a dynamic game, the sender is able to exploit the time diversity in MANET to increase their payoffs by adaptively allocating the packets to be transmitted into different stages. Secondly, based on the auction structure and routing dynamics, a simple optimal dynamic programming algorithm is developed to implement efficient multi-stage pricing for autonomous MANETs. Thirdly, the path diversity of MANET is exploited using the optimal auction mechanism in each stage. The simulation results illustrate that the proposed dynamic pricing framework has significant performance gains over the existing static pricing algorithms.

show abstract

Toward self-organized mobile ad hoc networks: the terminodes project

Cited by 230 publications

References 11 publications

Minimum-energy broadcast in all-wireless networks

Minimum-energy broadcast in all-wireless networks

DHT-based Functionalities Using Hypercubes

An optimal dynamic pricing framework for autonomous mobile ad hoc networks

Contact Info

Product

Resources

About