This paper presents a mechanism to stimulate cooperation in self-organizing mobile ad hoc networks, particularly for civilian applications. In such networks, nodes are not under a single authority and may not have a common goal, leading to a lack of motivation for cooperation. The proposed mechanism uses a tamper-resistant security module in each node to encourage packet forwarding. The security module maintains a counter, called the nuglet counter, which is decreased when a node sends its own packet and increased when it forwards a packet. The counter must remain positive, ensuring that nodes forward packets for others to maintain their own benefits. The mechanism also encourages nodes to keep their devices active and avoid sending excessive packets to distant destinations, which helps conserve resources. The paper describes the mechanism, analyzes its behavior using a simple model, and discusses how it can be protected against misuse. It also presents simulation results and discusses the limitations of the approach. The mechanism is generic and can be used with various routing algorithms. The paper concludes that the proposed approach is a viable solution for stimulating cooperation in mobile ad hoc networks where nodes are not under a single authority.This paper presents a mechanism to stimulate cooperation in self-organizing mobile ad hoc networks, particularly for civilian applications. In such networks, nodes are not under a single authority and may not have a common goal, leading to a lack of motivation for cooperation. The proposed mechanism uses a tamper-resistant security module in each node to encourage packet forwarding. The security module maintains a counter, called the nuglet counter, which is decreased when a node sends its own packet and increased when it forwards a packet. The counter must remain positive, ensuring that nodes forward packets for others to maintain their own benefits. The mechanism also encourages nodes to keep their devices active and avoid sending excessive packets to distant destinations, which helps conserve resources. The paper describes the mechanism, analyzes its behavior using a simple model, and discusses how it can be protected against misuse. It also presents simulation results and discusses the limitations of the approach. The mechanism is generic and can be used with various routing algorithms. The paper concludes that the proposed approach is a viable solution for stimulating cooperation in mobile ad hoc networks where nodes are not under a single authority.