This paper examines the optimal forwarding problem in mobile ad hoc networks (MANETs)
based on a generalized two-hop relay with limited packet redundancy f (f-cast) for packet …

In mobile ad hoc networks, network nodes accomplish a target task usually by cooperative
packet forwarding from the source to the destination. It is a challenge to enforce their mutual …

In wireless ad hoc networks such as mobile ad hoc networks and sensor networks, most of
the functions (routing, mobility management, and security) must rely on cooperation between …

In self-organized mobile ad hoc networks (MANETs), network functions rely on cooperation
of self-interested nodes, where a challenge is to enforce their mutual cooperation. In this …

Traditional purely greedy forwarding in wireless ad hoc networks is not optimal in most
practical settings where perfect-reception-within-range cannot be assumed. Although a few …

Every node in a wireless ad hoc network is both end host (it generates its own data and
routing traffic) and infrastructure (it forwards traffic for others), but rational nodes have no …

Routing traffic so as to maximize the lifetime of a transmission is a major problem in wireless
networks. We address a two-way multicast problem, where a root wishes to transmit data to …

Nodes in a multi-hop wireless network often have limited or constrained resources.
Therefore, to increase their lifetime, intermediate nodes are often unwilling to forward …

This paper proposes Forwarding Game Routing Protocol (FGRP), which can be applied to
any routing protocol in mobile ad hoc network (MANET) such as Ad Hoc On Demand …

In wireless ad hoc networks, nodes are both routers and terminals, and they have to
cooperate to communicate. Cooperation at the network layer means routing (finding a path …